./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/weaver/popl20-more-dec-subseq.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 527bcce2 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_37004cbc-8420-4ff7-a302-61e012ab64f6/bin/uautomizer-verify-bycVGegfSx/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37004cbc-8420-4ff7-a302-61e012ab64f6/bin/uautomizer-verify-bycVGegfSx/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37004cbc-8420-4ff7-a302-61e012ab64f6/bin/uautomizer-verify-bycVGegfSx/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37004cbc-8420-4ff7-a302-61e012ab64f6/bin/uautomizer-verify-bycVGegfSx/config/AutomizerReach.xml -i ../../sv-benchmarks/c/weaver/popl20-more-dec-subseq.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37004cbc-8420-4ff7-a302-61e012ab64f6/bin/uautomizer-verify-bycVGegfSx/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37004cbc-8420-4ff7-a302-61e012ab64f6/bin/uautomizer-verify-bycVGegfSx --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 0f0e249de6560bdff430500b6d1ad159bf4a19253ccf183d061fafc41fe4114b --- Real Ultimate output --- This is Ultimate 0.2.3-dev-527bcce [2023-11-21 20:57:24,876 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-21 20:57:24,952 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37004cbc-8420-4ff7-a302-61e012ab64f6/bin/uautomizer-verify-bycVGegfSx/config/svcomp-DataRace-32bit-Automizer_Default.epf [2023-11-21 20:57:24,959 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-21 20:57:24,960 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-21 20:57:24,991 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-21 20:57:24,991 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-21 20:57:24,992 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-21 20:57:24,993 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-21 20:57:24,994 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-21 20:57:24,995 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-21 20:57:24,996 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-21 20:57:24,997 INFO L153 SettingsManager]: * Use SBE=true [2023-11-21 20:57:24,998 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-21 20:57:24,998 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-21 20:57:24,999 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-21 20:57:25,000 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-21 20:57:25,000 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-21 20:57:25,001 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-21 20:57:25,002 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-21 20:57:25,002 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-21 20:57:25,003 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-21 20:57:25,004 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2023-11-21 20:57:25,005 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-21 20:57:25,005 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-21 20:57:25,006 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-21 20:57:25,006 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-21 20:57:25,007 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-21 20:57:25,008 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-21 20:57:25,043 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-21 20:57:25,043 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-21 20:57:25,044 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-21 20:57:25,044 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-21 20:57:25,045 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-21 20:57:25,045 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-21 20:57:25,045 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-21 20:57:25,046 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-21 20:57:25,046 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-21 20:57:25,046 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-21 20:57:25,047 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-21 20:57:25,047 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-21 20:57:25,049 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_37004cbc-8420-4ff7-a302-61e012ab64f6/bin/uautomizer-verify-bycVGegfSx/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_37004cbc-8420-4ff7-a302-61e012ab64f6/bin/uautomizer-verify-bycVGegfSx 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 -> 0f0e249de6560bdff430500b6d1ad159bf4a19253ccf183d061fafc41fe4114b [2023-11-21 20:57:25,427 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-21 20:57:25,458 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-21 20:57:25,461 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-21 20:57:25,462 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-21 20:57:25,462 INFO L274 PluginConnector]: CDTParser initialized [2023-11-21 20:57:25,463 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37004cbc-8420-4ff7-a302-61e012ab64f6/bin/uautomizer-verify-bycVGegfSx/../../sv-benchmarks/c/weaver/popl20-more-dec-subseq.wvr.c [2023-11-21 20:57:28,473 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-21 20:57:28,728 INFO L384 CDTParser]: Found 1 translation units. [2023-11-21 20:57:28,729 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37004cbc-8420-4ff7-a302-61e012ab64f6/sv-benchmarks/c/weaver/popl20-more-dec-subseq.wvr.c [2023-11-21 20:57:28,738 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37004cbc-8420-4ff7-a302-61e012ab64f6/bin/uautomizer-verify-bycVGegfSx/data/c32d993bc/08856bcd256549d78e1ed6acf57d8de9/FLAG66cbfc975 [2023-11-21 20:57:28,753 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37004cbc-8420-4ff7-a302-61e012ab64f6/bin/uautomizer-verify-bycVGegfSx/data/c32d993bc/08856bcd256549d78e1ed6acf57d8de9 [2023-11-21 20:57:28,756 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-21 20:57:28,757 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-21 20:57:28,764 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-21 20:57:28,764 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-21 20:57:28,770 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-21 20:57:28,770 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 08:57:28" (1/1) ... [2023-11-21 20:57:28,772 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18929dc3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 08:57:28, skipping insertion in model container [2023-11-21 20:57:28,772 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 08:57:28" (1/1) ... [2023-11-21 20:57:28,810 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-21 20:57:29,015 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-21 20:57:29,025 INFO L202 MainTranslator]: Completed pre-run [2023-11-21 20:57:29,070 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-21 20:57:29,079 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-21 20:57:29,079 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-21 20:57:29,088 INFO L206 MainTranslator]: Completed translation [2023-11-21 20:57:29,088 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 08:57:29 WrapperNode [2023-11-21 20:57:29,088 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-21 20:57:29,089 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-21 20:57:29,090 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-21 20:57:29,090 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-21 20:57:29,098 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 08:57:29" (1/1) ... [2023-11-21 20:57:29,111 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 08:57:29" (1/1) ... [2023-11-21 20:57:29,176 INFO L138 Inliner]: procedures = 24, calls = 46, calls flagged for inlining = 12, calls inlined = 14, statements flattened = 429 [2023-11-21 20:57:29,177 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-21 20:57:29,178 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-21 20:57:29,178 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-21 20:57:29,178 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-21 20:57:29,188 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 08:57:29" (1/1) ... [2023-11-21 20:57:29,189 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 08:57:29" (1/1) ... [2023-11-21 20:57:29,196 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 08:57:29" (1/1) ... [2023-11-21 20:57:29,196 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 08:57:29" (1/1) ... [2023-11-21 20:57:29,219 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 08:57:29" (1/1) ... [2023-11-21 20:57:29,224 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 08:57:29" (1/1) ... [2023-11-21 20:57:29,228 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 08:57:29" (1/1) ... [2023-11-21 20:57:29,231 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 08:57:29" (1/1) ... [2023-11-21 20:57:29,237 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-21 20:57:29,238 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-21 20:57:29,238 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-21 20:57:29,238 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-21 20:57:29,240 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 08:57:29" (1/1) ... [2023-11-21 20:57:29,245 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-21 20:57:29,261 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37004cbc-8420-4ff7-a302-61e012ab64f6/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 20:57:29,285 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37004cbc-8420-4ff7-a302-61e012ab64f6/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-21 20:57:29,318 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37004cbc-8420-4ff7-a302-61e012ab64f6/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-21 20:57:29,331 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-21 20:57:29,332 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-11-21 20:57:29,332 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-11-21 20:57:29,332 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-11-21 20:57:29,332 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-11-21 20:57:29,332 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-21 20:57:29,333 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-21 20:57:29,333 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-21 20:57:29,333 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-21 20:57:29,333 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-21 20:57:29,334 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-21 20:57:29,334 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-21 20:57:29,334 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-21 20:57:29,334 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-21 20:57:29,334 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-21 20:57:29,336 WARN L212 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-21 20:57:29,572 INFO L240 CfgBuilder]: Building ICFG [2023-11-21 20:57:29,574 INFO L266 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-21 20:57:30,411 INFO L281 CfgBuilder]: Performing block encoding [2023-11-21 20:57:30,895 INFO L303 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-21 20:57:30,895 INFO L308 CfgBuilder]: Removed 4 assume(true) statements. [2023-11-21 20:57:30,897 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 08:57:30 BoogieIcfgContainer [2023-11-21 20:57:30,898 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-21 20:57:30,900 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-21 20:57:30,900 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-21 20:57:30,903 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-21 20:57:30,904 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 08:57:28" (1/3) ... [2023-11-21 20:57:30,904 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6048e33c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 08:57:30, skipping insertion in model container [2023-11-21 20:57:30,905 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 08:57:29" (2/3) ... [2023-11-21 20:57:30,905 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6048e33c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 08:57:30, skipping insertion in model container [2023-11-21 20:57:30,905 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 08:57:30" (3/3) ... [2023-11-21 20:57:30,907 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-dec-subseq.wvr.c [2023-11-21 20:57:30,916 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-21 20:57:30,927 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-21 20:57:30,927 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 69 error locations. [2023-11-21 20:57:30,928 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-21 20:57:31,044 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-11-21 20:57:31,087 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 384 places, 393 transitions, 800 flow [2023-11-21 20:57:31,228 INFO L124 PetriNetUnfolderBase]: 16/391 cut-off events. [2023-11-21 20:57:31,228 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-11-21 20:57:31,244 INFO L83 FinitePrefix]: Finished finitePrefix Result has 400 conditions, 391 events. 16/391 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 625 event pairs, 0 based on Foata normal form. 0/306 useless extension candidates. Maximal degree in co-relation 292. Up to 2 conditions per place. [2023-11-21 20:57:31,245 INFO L82 GeneralOperation]: Start removeDead. Operand has 384 places, 393 transitions, 800 flow [2023-11-21 20:57:31,258 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 362 places, 370 transitions, 752 flow [2023-11-21 20:57:31,272 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-21 20:57:31,283 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@25012834, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-21 20:57:31,283 INFO L358 AbstractCegarLoop]: Starting to check reachability of 119 error locations. [2023-11-21 20:57:31,290 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-21 20:57:31,290 INFO L124 PetriNetUnfolderBase]: 0/24 cut-off events. [2023-11-21 20:57:31,290 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-21 20:57:31,291 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 20:57:31,291 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 20:57:31,292 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 115 more)] === [2023-11-21 20:57:31,297 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 20:57:31,297 INFO L85 PathProgramCache]: Analyzing trace with hash 733562783, now seen corresponding path program 1 times [2023-11-21 20:57:31,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 20:57:31,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307374250] [2023-11-21 20:57:31,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 20:57:31,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 20:57:31,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:57:31,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 20:57:31,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 20:57:31,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307374250] [2023-11-21 20:57:31,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307374250] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 20:57:31,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 20:57:31,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-21 20:57:31,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880474834] [2023-11-21 20:57:31,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 20:57:31,567 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 20:57:31,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 20:57:31,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 20:57:31,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 20:57:31,635 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 331 out of 393 [2023-11-21 20:57:31,644 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 362 places, 370 transitions, 752 flow. Second operand has 3 states, 3 states have (on average 332.3333333333333) internal successors, (997), 3 states have internal predecessors, (997), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:57:31,644 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 20:57:31,644 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 331 of 393 [2023-11-21 20:57:31,645 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 20:57:31,905 INFO L124 PetriNetUnfolderBase]: 40/506 cut-off events. [2023-11-21 20:57:31,905 INFO L125 PetriNetUnfolderBase]: For 36/39 co-relation queries the response was YES. [2023-11-21 20:57:31,915 INFO L83 FinitePrefix]: Finished finitePrefix Result has 589 conditions, 506 events. 40/506 cut-off events. For 36/39 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1564 event pairs, 13 based on Foata normal form. 22/425 useless extension candidates. Maximal degree in co-relation 281. Up to 61 conditions per place. [2023-11-21 20:57:31,919 INFO L140 encePairwiseOnDemand]: 349/393 looper letters, 15 selfloop transitions, 2 changer transitions 5/328 dead transitions. [2023-11-21 20:57:31,919 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 331 places, 328 transitions, 702 flow [2023-11-21 20:57:31,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 20:57:31,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-21 20:57:31,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1052 transitions. [2023-11-21 20:57:31,946 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8922815945716709 [2023-11-21 20:57:31,947 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1052 transitions. [2023-11-21 20:57:31,948 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1052 transitions. [2023-11-21 20:57:31,953 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 20:57:31,955 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1052 transitions. [2023-11-21 20:57:31,965 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 350.6666666666667) internal successors, (1052), 3 states have internal predecessors, (1052), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:57:31,975 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 393.0) internal successors, (1572), 4 states have internal predecessors, (1572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:57:31,977 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 393.0) internal successors, (1572), 4 states have internal predecessors, (1572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:57:31,979 INFO L175 Difference]: Start difference. First operand has 362 places, 370 transitions, 752 flow. Second operand 3 states and 1052 transitions. [2023-11-21 20:57:31,981 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 331 places, 328 transitions, 702 flow [2023-11-21 20:57:31,990 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 327 places, 328 transitions, 694 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-21 20:57:32,000 INFO L231 Difference]: Finished difference. Result has 327 places, 323 transitions, 654 flow [2023-11-21 20:57:32,004 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=393, PETRI_DIFFERENCE_MINUEND_FLOW=660, PETRI_DIFFERENCE_MINUEND_PLACES=325, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=328, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=326, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=654, PETRI_PLACES=327, PETRI_TRANSITIONS=323} [2023-11-21 20:57:32,008 INFO L281 CegarLoopForPetriNet]: 362 programPoint places, -35 predicate places. [2023-11-21 20:57:32,009 INFO L495 AbstractCegarLoop]: Abstraction has has 327 places, 323 transitions, 654 flow [2023-11-21 20:57:32,010 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 332.3333333333333) internal successors, (997), 3 states have internal predecessors, (997), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:57:32,010 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 20:57:32,010 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 20:57:32,011 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-21 20:57:32,011 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 115 more)] === [2023-11-21 20:57:32,012 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 20:57:32,012 INFO L85 PathProgramCache]: Analyzing trace with hash 897322483, now seen corresponding path program 1 times [2023-11-21 20:57:32,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 20:57:32,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953848745] [2023-11-21 20:57:32,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 20:57:32,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 20:57:32,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:57:32,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 20:57:32,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 20:57:32,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953848745] [2023-11-21 20:57:32,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953848745] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 20:57:32,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 20:57:32,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-21 20:57:32,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152716704] [2023-11-21 20:57:32,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 20:57:32,108 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 20:57:32,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 20:57:32,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 20:57:32,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 20:57:32,139 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 331 out of 393 [2023-11-21 20:57:32,141 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 327 places, 323 transitions, 654 flow. Second operand has 3 states, 3 states have (on average 332.3333333333333) internal successors, (997), 3 states have internal predecessors, (997), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:57:32,141 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 20:57:32,142 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 331 of 393 [2023-11-21 20:57:32,142 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 20:57:32,287 INFO L124 PetriNetUnfolderBase]: 26/513 cut-off events. [2023-11-21 20:57:32,287 INFO L125 PetriNetUnfolderBase]: For 4/9 co-relation queries the response was YES. [2023-11-21 20:57:32,289 INFO L83 FinitePrefix]: Finished finitePrefix Result has 567 conditions, 513 events. 26/513 cut-off events. For 4/9 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1594 event pairs, 10 based on Foata normal form. 0/432 useless extension candidates. Maximal degree in co-relation 535. Up to 44 conditions per place. [2023-11-21 20:57:32,292 INFO L140 encePairwiseOnDemand]: 390/393 looper letters, 15 selfloop transitions, 2 changer transitions 0/322 dead transitions. [2023-11-21 20:57:32,293 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 323 places, 322 transitions, 686 flow [2023-11-21 20:57:32,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 20:57:32,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-21 20:57:32,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1011 transitions. [2023-11-21 20:57:32,297 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8575063613231552 [2023-11-21 20:57:32,297 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1011 transitions. [2023-11-21 20:57:32,297 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1011 transitions. [2023-11-21 20:57:32,298 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 20:57:32,299 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1011 transitions. [2023-11-21 20:57:32,302 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 337.0) internal successors, (1011), 3 states have internal predecessors, (1011), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:57:32,306 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 393.0) internal successors, (1572), 4 states have internal predecessors, (1572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:57:32,307 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 393.0) internal successors, (1572), 4 states have internal predecessors, (1572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:57:32,308 INFO L175 Difference]: Start difference. First operand has 327 places, 323 transitions, 654 flow. Second operand 3 states and 1011 transitions. [2023-11-21 20:57:32,308 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 323 places, 322 transitions, 686 flow [2023-11-21 20:57:32,312 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 321 places, 322 transitions, 682 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-21 20:57:32,318 INFO L231 Difference]: Finished difference. Result has 321 places, 322 transitions, 652 flow [2023-11-21 20:57:32,319 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=393, PETRI_DIFFERENCE_MINUEND_FLOW=648, PETRI_DIFFERENCE_MINUEND_PLACES=319, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=322, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=320, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=652, PETRI_PLACES=321, PETRI_TRANSITIONS=322} [2023-11-21 20:57:32,320 INFO L281 CegarLoopForPetriNet]: 362 programPoint places, -41 predicate places. [2023-11-21 20:57:32,320 INFO L495 AbstractCegarLoop]: Abstraction has has 321 places, 322 transitions, 652 flow [2023-11-21 20:57:32,321 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 332.3333333333333) internal successors, (997), 3 states have internal predecessors, (997), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:57:32,321 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 20:57:32,322 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 20:57:32,322 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-21 20:57:32,322 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 115 more)] === [2023-11-21 20:57:32,323 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 20:57:32,323 INFO L85 PathProgramCache]: Analyzing trace with hash 219213541, now seen corresponding path program 1 times [2023-11-21 20:57:32,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 20:57:32,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762995261] [2023-11-21 20:57:32,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 20:57:32,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 20:57:32,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:57:32,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 20:57:32,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 20:57:32,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762995261] [2023-11-21 20:57:32,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1762995261] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 20:57:32,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 20:57:32,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-21 20:57:32,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073650562] [2023-11-21 20:57:32,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 20:57:32,382 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 20:57:32,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 20:57:32,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 20:57:32,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 20:57:32,405 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 333 out of 393 [2023-11-21 20:57:32,407 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 321 places, 322 transitions, 652 flow. Second operand has 3 states, 3 states have (on average 334.3333333333333) internal successors, (1003), 3 states have internal predecessors, (1003), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:57:32,407 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 20:57:32,407 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 333 of 393 [2023-11-21 20:57:32,408 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 20:57:32,548 INFO L124 PetriNetUnfolderBase]: 28/487 cut-off events. [2023-11-21 20:57:32,548 INFO L125 PetriNetUnfolderBase]: For 7/9 co-relation queries the response was YES. [2023-11-21 20:57:32,550 INFO L83 FinitePrefix]: Finished finitePrefix Result has 537 conditions, 487 events. 28/487 cut-off events. For 7/9 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1364 event pairs, 7 based on Foata normal form. 0/401 useless extension candidates. Maximal degree in co-relation 497. Up to 41 conditions per place. [2023-11-21 20:57:32,554 INFO L140 encePairwiseOnDemand]: 390/393 looper letters, 13 selfloop transitions, 2 changer transitions 0/321 dead transitions. [2023-11-21 20:57:32,554 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 322 places, 321 transitions, 680 flow [2023-11-21 20:57:32,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 20:57:32,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-21 20:57:32,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1015 transitions. [2023-11-21 20:57:32,558 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8608990670059372 [2023-11-21 20:57:32,559 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1015 transitions. [2023-11-21 20:57:32,559 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1015 transitions. [2023-11-21 20:57:32,560 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 20:57:32,560 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1015 transitions. [2023-11-21 20:57:32,563 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 338.3333333333333) internal successors, (1015), 3 states have internal predecessors, (1015), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:57:32,566 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 393.0) internal successors, (1572), 4 states have internal predecessors, (1572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:57:32,568 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 393.0) internal successors, (1572), 4 states have internal predecessors, (1572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:57:32,568 INFO L175 Difference]: Start difference. First operand has 321 places, 322 transitions, 652 flow. Second operand 3 states and 1015 transitions. [2023-11-21 20:57:32,568 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 322 places, 321 transitions, 680 flow [2023-11-21 20:57:32,571 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 320 places, 321 transitions, 676 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-21 20:57:32,578 INFO L231 Difference]: Finished difference. Result has 320 places, 321 transitions, 650 flow [2023-11-21 20:57:32,579 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=393, PETRI_DIFFERENCE_MINUEND_FLOW=646, PETRI_DIFFERENCE_MINUEND_PLACES=318, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=321, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=319, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=650, PETRI_PLACES=320, PETRI_TRANSITIONS=321} [2023-11-21 20:57:32,580 INFO L281 CegarLoopForPetriNet]: 362 programPoint places, -42 predicate places. [2023-11-21 20:57:32,581 INFO L495 AbstractCegarLoop]: Abstraction has has 320 places, 321 transitions, 650 flow [2023-11-21 20:57:32,582 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 334.3333333333333) internal successors, (1003), 3 states have internal predecessors, (1003), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:57:32,582 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 20:57:32,582 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 20:57:32,583 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-21 20:57:32,583 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 115 more)] === [2023-11-21 20:57:32,584 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 20:57:32,584 INFO L85 PathProgramCache]: Analyzing trace with hash -1740945814, now seen corresponding path program 1 times [2023-11-21 20:57:32,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 20:57:32,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510779945] [2023-11-21 20:57:32,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 20:57:32,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 20:57:32,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:57:32,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 20:57:32,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 20:57:32,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510779945] [2023-11-21 20:57:32,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510779945] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 20:57:32,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 20:57:32,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-21 20:57:32,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864668646] [2023-11-21 20:57:32,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 20:57:32,683 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 20:57:32,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 20:57:32,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 20:57:32,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 20:57:32,714 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 333 out of 393 [2023-11-21 20:57:32,716 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 320 places, 321 transitions, 650 flow. Second operand has 3 states, 3 states have (on average 334.3333333333333) internal successors, (1003), 3 states have internal predecessors, (1003), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:57:32,716 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 20:57:32,716 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 333 of 393 [2023-11-21 20:57:32,716 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 20:57:32,885 INFO L124 PetriNetUnfolderBase]: 28/486 cut-off events. [2023-11-21 20:57:32,885 INFO L125 PetriNetUnfolderBase]: For 7/9 co-relation queries the response was YES. [2023-11-21 20:57:32,887 INFO L83 FinitePrefix]: Finished finitePrefix Result has 536 conditions, 486 events. 28/486 cut-off events. For 7/9 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1364 event pairs, 7 based on Foata normal form. 0/401 useless extension candidates. Maximal degree in co-relation 488. Up to 41 conditions per place. [2023-11-21 20:57:32,890 INFO L140 encePairwiseOnDemand]: 390/393 looper letters, 13 selfloop transitions, 2 changer transitions 0/320 dead transitions. [2023-11-21 20:57:32,890 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 321 places, 320 transitions, 678 flow [2023-11-21 20:57:32,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 20:57:32,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-21 20:57:32,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1015 transitions. [2023-11-21 20:57:32,894 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8608990670059372 [2023-11-21 20:57:32,894 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1015 transitions. [2023-11-21 20:57:32,895 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1015 transitions. [2023-11-21 20:57:32,896 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 20:57:32,896 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1015 transitions. [2023-11-21 20:57:32,900 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 338.3333333333333) internal successors, (1015), 3 states have internal predecessors, (1015), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:57:32,903 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 393.0) internal successors, (1572), 4 states have internal predecessors, (1572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:57:32,905 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 393.0) internal successors, (1572), 4 states have internal predecessors, (1572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:57:32,905 INFO L175 Difference]: Start difference. First operand has 320 places, 321 transitions, 650 flow. Second operand 3 states and 1015 transitions. [2023-11-21 20:57:32,906 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 321 places, 320 transitions, 678 flow [2023-11-21 20:57:32,909 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 319 places, 320 transitions, 674 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-21 20:57:32,914 INFO L231 Difference]: Finished difference. Result has 319 places, 320 transitions, 648 flow [2023-11-21 20:57:32,915 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=393, PETRI_DIFFERENCE_MINUEND_FLOW=644, PETRI_DIFFERENCE_MINUEND_PLACES=317, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=320, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=318, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=648, PETRI_PLACES=319, PETRI_TRANSITIONS=320} [2023-11-21 20:57:32,917 INFO L281 CegarLoopForPetriNet]: 362 programPoint places, -43 predicate places. [2023-11-21 20:57:32,917 INFO L495 AbstractCegarLoop]: Abstraction has has 319 places, 320 transitions, 648 flow [2023-11-21 20:57:32,919 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 334.3333333333333) internal successors, (1003), 3 states have internal predecessors, (1003), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:57:32,919 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 20:57:32,919 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 20:57:32,919 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-21 20:57:32,919 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 115 more)] === [2023-11-21 20:57:32,920 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 20:57:32,920 INFO L85 PathProgramCache]: Analyzing trace with hash -450696811, now seen corresponding path program 1 times [2023-11-21 20:57:32,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 20:57:32,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507169948] [2023-11-21 20:57:32,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 20:57:32,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 20:57:32,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:57:33,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 20:57:33,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 20:57:33,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507169948] [2023-11-21 20:57:33,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1507169948] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 20:57:33,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 20:57:33,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-21 20:57:33,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122868344] [2023-11-21 20:57:33,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 20:57:33,003 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 20:57:33,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 20:57:33,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 20:57:33,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 20:57:33,018 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 337 out of 393 [2023-11-21 20:57:33,020 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 319 places, 320 transitions, 648 flow. Second operand has 3 states, 3 states have (on average 338.0) internal successors, (1014), 3 states have internal predecessors, (1014), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:57:33,021 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 20:57:33,021 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 337 of 393 [2023-11-21 20:57:33,021 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 20:57:33,149 INFO L124 PetriNetUnfolderBase]: 34/515 cut-off events. [2023-11-21 20:57:33,149 INFO L125 PetriNetUnfolderBase]: For 11/13 co-relation queries the response was YES. [2023-11-21 20:57:33,151 INFO L83 FinitePrefix]: Finished finitePrefix Result has 573 conditions, 515 events. 34/515 cut-off events. For 11/13 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1630 event pairs, 4 based on Foata normal form. 1/434 useless extension candidates. Maximal degree in co-relation 517. Up to 27 conditions per place. [2023-11-21 20:57:33,155 INFO L140 encePairwiseOnDemand]: 390/393 looper letters, 15 selfloop transitions, 2 changer transitions 0/324 dead transitions. [2023-11-21 20:57:33,160 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 320 places, 324 transitions, 692 flow [2023-11-21 20:57:33,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 20:57:33,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-21 20:57:33,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1029 transitions. [2023-11-21 20:57:33,164 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8727735368956743 [2023-11-21 20:57:33,165 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1029 transitions. [2023-11-21 20:57:33,165 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1029 transitions. [2023-11-21 20:57:33,166 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 20:57:33,166 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1029 transitions. [2023-11-21 20:57:33,170 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 343.0) internal successors, (1029), 3 states have internal predecessors, (1029), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:57:33,173 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 393.0) internal successors, (1572), 4 states have internal predecessors, (1572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:57:33,175 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 393.0) internal successors, (1572), 4 states have internal predecessors, (1572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:57:33,175 INFO L175 Difference]: Start difference. First operand has 319 places, 320 transitions, 648 flow. Second operand 3 states and 1029 transitions. [2023-11-21 20:57:33,175 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 320 places, 324 transitions, 692 flow [2023-11-21 20:57:33,183 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 318 places, 324 transitions, 688 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-21 20:57:33,191 INFO L231 Difference]: Finished difference. Result has 319 places, 320 transitions, 652 flow [2023-11-21 20:57:33,192 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=393, PETRI_DIFFERENCE_MINUEND_FLOW=642, PETRI_DIFFERENCE_MINUEND_PLACES=316, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=319, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=317, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=652, PETRI_PLACES=319, PETRI_TRANSITIONS=320} [2023-11-21 20:57:33,193 INFO L281 CegarLoopForPetriNet]: 362 programPoint places, -43 predicate places. [2023-11-21 20:57:33,193 INFO L495 AbstractCegarLoop]: Abstraction has has 319 places, 320 transitions, 652 flow [2023-11-21 20:57:33,194 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 338.0) internal successors, (1014), 3 states have internal predecessors, (1014), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:57:33,194 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 20:57:33,195 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 20:57:33,195 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-21 20:57:33,195 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 115 more)] === [2023-11-21 20:57:33,196 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 20:57:33,196 INFO L85 PathProgramCache]: Analyzing trace with hash 1644457519, now seen corresponding path program 1 times [2023-11-21 20:57:33,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 20:57:33,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523709605] [2023-11-21 20:57:33,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 20:57:33,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 20:57:33,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:57:33,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 20:57:33,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 20:57:33,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523709605] [2023-11-21 20:57:33,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523709605] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 20:57:33,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 20:57:33,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-21 20:57:33,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279941644] [2023-11-21 20:57:33,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 20:57:33,240 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 20:57:33,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 20:57:33,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 20:57:33,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 20:57:33,252 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 334 out of 393 [2023-11-21 20:57:33,253 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 319 places, 320 transitions, 652 flow. Second operand has 3 states, 3 states have (on average 335.3333333333333) internal successors, (1006), 3 states have internal predecessors, (1006), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:57:33,254 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 20:57:33,254 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 334 of 393 [2023-11-21 20:57:33,254 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 20:57:33,369 INFO L124 PetriNetUnfolderBase]: 34/514 cut-off events. [2023-11-21 20:57:33,369 INFO L125 PetriNetUnfolderBase]: For 19/21 co-relation queries the response was YES. [2023-11-21 20:57:33,371 INFO L83 FinitePrefix]: Finished finitePrefix Result has 586 conditions, 514 events. 34/514 cut-off events. For 19/21 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1619 event pairs, 10 based on Foata normal form. 0/427 useless extension candidates. Maximal degree in co-relation 332. Up to 51 conditions per place. [2023-11-21 20:57:33,375 INFO L140 encePairwiseOnDemand]: 390/393 looper letters, 13 selfloop transitions, 2 changer transitions 0/319 dead transitions. [2023-11-21 20:57:33,375 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 320 places, 319 transitions, 680 flow [2023-11-21 20:57:33,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 20:57:33,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-21 20:57:33,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1017 transitions. [2023-11-21 20:57:33,379 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8625954198473282 [2023-11-21 20:57:33,379 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1017 transitions. [2023-11-21 20:57:33,379 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1017 transitions. [2023-11-21 20:57:33,380 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 20:57:33,380 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1017 transitions. [2023-11-21 20:57:33,383 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 339.0) internal successors, (1017), 3 states have internal predecessors, (1017), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:57:33,387 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 393.0) internal successors, (1572), 4 states have internal predecessors, (1572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:57:33,388 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 393.0) internal successors, (1572), 4 states have internal predecessors, (1572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:57:33,388 INFO L175 Difference]: Start difference. First operand has 319 places, 320 transitions, 652 flow. Second operand 3 states and 1017 transitions. [2023-11-21 20:57:33,389 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 320 places, 319 transitions, 680 flow [2023-11-21 20:57:33,392 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 319 places, 319 transitions, 678 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-21 20:57:33,397 INFO L231 Difference]: Finished difference. Result has 319 places, 319 transitions, 652 flow [2023-11-21 20:57:33,398 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=393, PETRI_DIFFERENCE_MINUEND_FLOW=648, PETRI_DIFFERENCE_MINUEND_PLACES=317, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=319, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=317, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=652, PETRI_PLACES=319, PETRI_TRANSITIONS=319} [2023-11-21 20:57:33,399 INFO L281 CegarLoopForPetriNet]: 362 programPoint places, -43 predicate places. [2023-11-21 20:57:33,399 INFO L495 AbstractCegarLoop]: Abstraction has has 319 places, 319 transitions, 652 flow [2023-11-21 20:57:33,400 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 335.3333333333333) internal successors, (1006), 3 states have internal predecessors, (1006), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:57:33,401 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 20:57:33,401 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 20:57:33,401 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-21 20:57:33,401 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 115 more)] === [2023-11-21 20:57:33,402 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 20:57:33,402 INFO L85 PathProgramCache]: Analyzing trace with hash 1638109976, now seen corresponding path program 1 times [2023-11-21 20:57:33,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 20:57:33,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874284799] [2023-11-21 20:57:33,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 20:57:33,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 20:57:33,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:57:33,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 20:57:33,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 20:57:33,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874284799] [2023-11-21 20:57:33,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874284799] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 20:57:33,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 20:57:33,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-21 20:57:33,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862735173] [2023-11-21 20:57:33,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 20:57:33,445 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 20:57:33,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 20:57:33,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 20:57:33,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 20:57:33,454 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 337 out of 393 [2023-11-21 20:57:33,455 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 319 places, 319 transitions, 652 flow. Second operand has 3 states, 3 states have (on average 338.0) internal successors, (1014), 3 states have internal predecessors, (1014), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:57:33,456 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 20:57:33,456 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 337 of 393 [2023-11-21 20:57:33,456 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 20:57:33,579 INFO L124 PetriNetUnfolderBase]: 34/513 cut-off events. [2023-11-21 20:57:33,580 INFO L125 PetriNetUnfolderBase]: For 18/20 co-relation queries the response was YES. [2023-11-21 20:57:33,582 INFO L83 FinitePrefix]: Finished finitePrefix Result has 581 conditions, 513 events. 34/513 cut-off events. For 18/20 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1617 event pairs, 10 based on Foata normal form. 0/427 useless extension candidates. Maximal degree in co-relation 516. Up to 49 conditions per place. [2023-11-21 20:57:33,585 INFO L140 encePairwiseOnDemand]: 391/393 looper letters, 12 selfloop transitions, 1 changer transitions 0/318 dead transitions. [2023-11-21 20:57:33,585 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 320 places, 318 transitions, 676 flow [2023-11-21 20:57:33,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 20:57:33,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-21 20:57:33,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1024 transitions. [2023-11-21 20:57:33,589 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8685326547921968 [2023-11-21 20:57:33,589 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1024 transitions. [2023-11-21 20:57:33,589 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1024 transitions. [2023-11-21 20:57:33,590 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 20:57:33,590 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1024 transitions. [2023-11-21 20:57:33,593 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 341.3333333333333) internal successors, (1024), 3 states have internal predecessors, (1024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:57:33,596 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 393.0) internal successors, (1572), 4 states have internal predecessors, (1572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:57:33,597 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 393.0) internal successors, (1572), 4 states have internal predecessors, (1572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:57:33,597 INFO L175 Difference]: Start difference. First operand has 319 places, 319 transitions, 652 flow. Second operand 3 states and 1024 transitions. [2023-11-21 20:57:33,597 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 320 places, 318 transitions, 676 flow [2023-11-21 20:57:33,600 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 318 places, 318 transitions, 672 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-21 20:57:33,606 INFO L231 Difference]: Finished difference. Result has 318 places, 318 transitions, 648 flow [2023-11-21 20:57:33,606 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=393, PETRI_DIFFERENCE_MINUEND_FLOW=646, PETRI_DIFFERENCE_MINUEND_PLACES=316, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=318, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=317, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=648, PETRI_PLACES=318, PETRI_TRANSITIONS=318} [2023-11-21 20:57:33,607 INFO L281 CegarLoopForPetriNet]: 362 programPoint places, -44 predicate places. [2023-11-21 20:57:33,607 INFO L495 AbstractCegarLoop]: Abstraction has has 318 places, 318 transitions, 648 flow [2023-11-21 20:57:33,608 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 338.0) internal successors, (1014), 3 states have internal predecessors, (1014), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:57:33,608 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 20:57:33,608 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 20:57:33,609 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-21 20:57:33,609 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 115 more)] === [2023-11-21 20:57:33,609 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 20:57:33,609 INFO L85 PathProgramCache]: Analyzing trace with hash 1637485399, now seen corresponding path program 1 times [2023-11-21 20:57:33,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 20:57:33,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165138018] [2023-11-21 20:57:33,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 20:57:33,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 20:57:33,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:57:34,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 20:57:34,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 20:57:34,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165138018] [2023-11-21 20:57:34,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165138018] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 20:57:34,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 20:57:34,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-21 20:57:34,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696719211] [2023-11-21 20:57:34,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 20:57:34,327 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-21 20:57:34,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 20:57:34,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-21 20:57:34,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-21 20:57:34,653 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 293 out of 393 [2023-11-21 20:57:34,655 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 318 places, 318 transitions, 648 flow. Second operand has 6 states, 6 states have (on average 294.5) internal successors, (1767), 6 states have internal predecessors, (1767), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:57:34,656 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 20:57:34,656 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 293 of 393 [2023-11-21 20:57:34,656 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 20:57:35,171 INFO L124 PetriNetUnfolderBase]: 458/1961 cut-off events. [2023-11-21 20:57:35,171 INFO L125 PetriNetUnfolderBase]: For 130/130 co-relation queries the response was YES. [2023-11-21 20:57:35,179 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2811 conditions, 1961 events. 458/1961 cut-off events. For 130/130 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 13995 event pairs, 346 based on Foata normal form. 0/1601 useless extension candidates. Maximal degree in co-relation 2747. Up to 704 conditions per place. [2023-11-21 20:57:35,193 INFO L140 encePairwiseOnDemand]: 381/393 looper letters, 46 selfloop transitions, 10 changer transitions 0/316 dead transitions. [2023-11-21 20:57:35,193 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 321 places, 316 transitions, 756 flow [2023-11-21 20:57:35,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 20:57:35,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-21 20:57:35,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1815 transitions. [2023-11-21 20:57:35,204 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7697201017811705 [2023-11-21 20:57:35,204 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1815 transitions. [2023-11-21 20:57:35,204 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1815 transitions. [2023-11-21 20:57:35,206 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 20:57:35,206 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1815 transitions. [2023-11-21 20:57:35,212 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 302.5) internal successors, (1815), 6 states have internal predecessors, (1815), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:57:35,221 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 393.0) internal successors, (2751), 7 states have internal predecessors, (2751), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:57:35,223 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 393.0) internal successors, (2751), 7 states have internal predecessors, (2751), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:57:35,223 INFO L175 Difference]: Start difference. First operand has 318 places, 318 transitions, 648 flow. Second operand 6 states and 1815 transitions. [2023-11-21 20:57:35,223 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 321 places, 316 transitions, 756 flow [2023-11-21 20:57:35,227 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 320 places, 316 transitions, 755 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-21 20:57:35,233 INFO L231 Difference]: Finished difference. Result has 320 places, 316 transitions, 663 flow [2023-11-21 20:57:35,234 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=393, PETRI_DIFFERENCE_MINUEND_FLOW=643, PETRI_DIFFERENCE_MINUEND_PLACES=315, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=316, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=306, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=663, PETRI_PLACES=320, PETRI_TRANSITIONS=316} [2023-11-21 20:57:35,237 INFO L281 CegarLoopForPetriNet]: 362 programPoint places, -42 predicate places. [2023-11-21 20:57:35,238 INFO L495 AbstractCegarLoop]: Abstraction has has 320 places, 316 transitions, 663 flow [2023-11-21 20:57:35,239 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 294.5) internal successors, (1767), 6 states have internal predecessors, (1767), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:57:35,239 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 20:57:35,240 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 20:57:35,240 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-21 20:57:35,240 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 115 more)] === [2023-11-21 20:57:35,241 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 20:57:35,241 INFO L85 PathProgramCache]: Analyzing trace with hash -1543975925, now seen corresponding path program 1 times [2023-11-21 20:57:35,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 20:57:35,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591809383] [2023-11-21 20:57:35,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 20:57:35,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 20:57:35,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:57:35,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 20:57:35,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 20:57:35,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591809383] [2023-11-21 20:57:35,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591809383] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 20:57:35,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 20:57:35,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-21 20:57:35,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98305657] [2023-11-21 20:57:35,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 20:57:35,309 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 20:57:35,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 20:57:35,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 20:57:35,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 20:57:35,323 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 334 out of 393 [2023-11-21 20:57:35,325 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 320 places, 316 transitions, 663 flow. Second operand has 3 states, 3 states have (on average 335.3333333333333) internal successors, (1006), 3 states have internal predecessors, (1006), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:57:35,325 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 20:57:35,325 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 334 of 393 [2023-11-21 20:57:35,325 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 20:57:35,441 INFO L124 PetriNetUnfolderBase]: 34/510 cut-off events. [2023-11-21 20:57:35,441 INFO L125 PetriNetUnfolderBase]: For 18/20 co-relation queries the response was YES. [2023-11-21 20:57:35,444 INFO L83 FinitePrefix]: Finished finitePrefix Result has 589 conditions, 510 events. 34/510 cut-off events. For 18/20 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1617 event pairs, 10 based on Foata normal form. 0/427 useless extension candidates. Maximal degree in co-relation 555. Up to 51 conditions per place. [2023-11-21 20:57:35,447 INFO L140 encePairwiseOnDemand]: 390/393 looper letters, 13 selfloop transitions, 2 changer transitions 0/315 dead transitions. [2023-11-21 20:57:35,447 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 321 places, 315 transitions, 691 flow [2023-11-21 20:57:35,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 20:57:35,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-21 20:57:35,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1017 transitions. [2023-11-21 20:57:35,452 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8625954198473282 [2023-11-21 20:57:35,452 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1017 transitions. [2023-11-21 20:57:35,452 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1017 transitions. [2023-11-21 20:57:35,453 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 20:57:35,453 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1017 transitions. [2023-11-21 20:57:35,456 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 339.0) internal successors, (1017), 3 states have internal predecessors, (1017), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:57:35,460 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 393.0) internal successors, (1572), 4 states have internal predecessors, (1572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:57:35,461 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 393.0) internal successors, (1572), 4 states have internal predecessors, (1572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:57:35,461 INFO L175 Difference]: Start difference. First operand has 320 places, 316 transitions, 663 flow. Second operand 3 states and 1017 transitions. [2023-11-21 20:57:35,461 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 321 places, 315 transitions, 691 flow [2023-11-21 20:57:35,465 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 316 places, 315 transitions, 671 flow, removed 0 selfloop flow, removed 5 redundant places. [2023-11-21 20:57:35,471 INFO L231 Difference]: Finished difference. Result has 316 places, 315 transitions, 645 flow [2023-11-21 20:57:35,472 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=393, PETRI_DIFFERENCE_MINUEND_FLOW=641, PETRI_DIFFERENCE_MINUEND_PLACES=314, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=315, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=313, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=645, PETRI_PLACES=316, PETRI_TRANSITIONS=315} [2023-11-21 20:57:35,473 INFO L281 CegarLoopForPetriNet]: 362 programPoint places, -46 predicate places. [2023-11-21 20:57:35,473 INFO L495 AbstractCegarLoop]: Abstraction has has 316 places, 315 transitions, 645 flow [2023-11-21 20:57:35,474 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 335.3333333333333) internal successors, (1006), 3 states have internal predecessors, (1006), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:57:35,474 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 20:57:35,475 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 20:57:35,475 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-21 20:57:35,475 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 115 more)] === [2023-11-21 20:57:35,475 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 20:57:35,476 INFO L85 PathProgramCache]: Analyzing trace with hash 623988239, now seen corresponding path program 1 times [2023-11-21 20:57:35,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 20:57:35,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786183436] [2023-11-21 20:57:35,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 20:57:35,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 20:57:35,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:57:35,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 20:57:35,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 20:57:35,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786183436] [2023-11-21 20:57:35,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1786183436] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 20:57:35,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 20:57:35,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-21 20:57:35,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887713356] [2023-11-21 20:57:35,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 20:57:35,532 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 20:57:35,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 20:57:35,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 20:57:35,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 20:57:35,552 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 331 out of 393 [2023-11-21 20:57:35,553 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 316 places, 315 transitions, 645 flow. Second operand has 3 states, 3 states have (on average 332.0) internal successors, (996), 3 states have internal predecessors, (996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:57:35,554 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 20:57:35,554 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 331 of 393 [2023-11-21 20:57:35,554 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 20:57:35,664 INFO L124 PetriNetUnfolderBase]: 37/578 cut-off events. [2023-11-21 20:57:35,665 INFO L125 PetriNetUnfolderBase]: For 18/25 co-relation queries the response was YES. [2023-11-21 20:57:35,667 INFO L83 FinitePrefix]: Finished finitePrefix Result has 667 conditions, 578 events. 37/578 cut-off events. For 18/25 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1999 event pairs, 18 based on Foata normal form. 0/497 useless extension candidates. Maximal degree in co-relation 602. Up to 63 conditions per place. [2023-11-21 20:57:35,670 INFO L140 encePairwiseOnDemand]: 389/393 looper letters, 16 selfloop transitions, 1 changer transitions 0/312 dead transitions. [2023-11-21 20:57:35,670 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 315 places, 312 transitions, 673 flow [2023-11-21 20:57:35,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 20:57:35,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-21 20:57:35,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1012 transitions. [2023-11-21 20:57:35,675 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8583545377438507 [2023-11-21 20:57:35,675 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1012 transitions. [2023-11-21 20:57:35,675 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1012 transitions. [2023-11-21 20:57:35,676 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 20:57:35,676 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1012 transitions. [2023-11-21 20:57:35,679 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 337.3333333333333) internal successors, (1012), 3 states have internal predecessors, (1012), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:57:35,682 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 393.0) internal successors, (1572), 4 states have internal predecessors, (1572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:57:35,692 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 393.0) internal successors, (1572), 4 states have internal predecessors, (1572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:57:35,700 INFO L175 Difference]: Start difference. First operand has 316 places, 315 transitions, 645 flow. Second operand 3 states and 1012 transitions. [2023-11-21 20:57:35,700 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 315 places, 312 transitions, 673 flow [2023-11-21 20:57:35,704 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 313 places, 312 transitions, 669 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-21 20:57:35,709 INFO L231 Difference]: Finished difference. Result has 313 places, 312 transitions, 637 flow [2023-11-21 20:57:35,711 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=393, PETRI_DIFFERENCE_MINUEND_FLOW=635, PETRI_DIFFERENCE_MINUEND_PLACES=311, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=312, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=311, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=637, PETRI_PLACES=313, PETRI_TRANSITIONS=312} [2023-11-21 20:57:35,711 INFO L281 CegarLoopForPetriNet]: 362 programPoint places, -49 predicate places. [2023-11-21 20:57:35,712 INFO L495 AbstractCegarLoop]: Abstraction has has 313 places, 312 transitions, 637 flow [2023-11-21 20:57:35,713 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 332.0) internal successors, (996), 3 states have internal predecessors, (996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:57:35,713 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 20:57:35,713 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 20:57:35,713 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-21 20:57:35,714 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 115 more)] === [2023-11-21 20:57:35,714 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 20:57:35,714 INFO L85 PathProgramCache]: Analyzing trace with hash -598772311, now seen corresponding path program 1 times [2023-11-21 20:57:35,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 20:57:35,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795486559] [2023-11-21 20:57:35,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 20:57:35,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 20:57:35,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:57:35,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 20:57:35,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 20:57:35,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795486559] [2023-11-21 20:57:35,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795486559] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 20:57:35,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 20:57:35,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-21 20:57:35,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328664271] [2023-11-21 20:57:35,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 20:57:35,776 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 20:57:35,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 20:57:35,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 20:57:35,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 20:57:35,801 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 331 out of 393 [2023-11-21 20:57:35,803 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 313 places, 312 transitions, 637 flow. Second operand has 3 states, 3 states have (on average 332.3333333333333) internal successors, (997), 3 states have internal predecessors, (997), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:57:35,803 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 20:57:35,803 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 331 of 393 [2023-11-21 20:57:35,803 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 20:57:35,946 INFO L124 PetriNetUnfolderBase]: 45/626 cut-off events. [2023-11-21 20:57:35,946 INFO L125 PetriNetUnfolderBase]: For 22/24 co-relation queries the response was YES. [2023-11-21 20:57:35,949 INFO L83 FinitePrefix]: Finished finitePrefix Result has 723 conditions, 626 events. 45/626 cut-off events. For 22/24 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 2443 event pairs, 18 based on Foata normal form. 0/527 useless extension candidates. Maximal degree in co-relation 658. Up to 72 conditions per place. [2023-11-21 20:57:35,952 INFO L140 encePairwiseOnDemand]: 390/393 looper letters, 16 selfloop transitions, 2 changer transitions 0/311 dead transitions. [2023-11-21 20:57:35,952 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 314 places, 311 transitions, 671 flow [2023-11-21 20:57:35,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 20:57:35,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-21 20:57:35,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1011 transitions. [2023-11-21 20:57:35,956 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8575063613231552 [2023-11-21 20:57:35,956 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1011 transitions. [2023-11-21 20:57:35,957 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1011 transitions. [2023-11-21 20:57:35,957 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 20:57:35,958 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1011 transitions. [2023-11-21 20:57:35,960 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 337.0) internal successors, (1011), 3 states have internal predecessors, (1011), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:57:35,963 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 393.0) internal successors, (1572), 4 states have internal predecessors, (1572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:57:35,964 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 393.0) internal successors, (1572), 4 states have internal predecessors, (1572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:57:35,964 INFO L175 Difference]: Start difference. First operand has 313 places, 312 transitions, 637 flow. Second operand 3 states and 1011 transitions. [2023-11-21 20:57:35,964 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 314 places, 311 transitions, 671 flow [2023-11-21 20:57:35,967 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 313 places, 311 transitions, 670 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-21 20:57:35,972 INFO L231 Difference]: Finished difference. Result has 313 places, 311 transitions, 638 flow [2023-11-21 20:57:35,973 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=393, PETRI_DIFFERENCE_MINUEND_FLOW=634, PETRI_DIFFERENCE_MINUEND_PLACES=311, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=311, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=309, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=638, PETRI_PLACES=313, PETRI_TRANSITIONS=311} [2023-11-21 20:57:35,973 INFO L281 CegarLoopForPetriNet]: 362 programPoint places, -49 predicate places. [2023-11-21 20:57:35,973 INFO L495 AbstractCegarLoop]: Abstraction has has 313 places, 311 transitions, 638 flow [2023-11-21 20:57:35,974 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 332.3333333333333) internal successors, (997), 3 states have internal predecessors, (997), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:57:35,974 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 20:57:35,974 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 20:57:35,975 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-21 20:57:35,975 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 115 more)] === [2023-11-21 20:57:35,976 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 20:57:35,976 INFO L85 PathProgramCache]: Analyzing trace with hash 1205778762, now seen corresponding path program 1 times [2023-11-21 20:57:35,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 20:57:35,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122211955] [2023-11-21 20:57:35,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 20:57:35,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 20:57:35,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:57:36,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 20:57:36,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 20:57:36,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122211955] [2023-11-21 20:57:36,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122211955] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 20:57:36,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 20:57:36,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-21 20:57:36,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025019799] [2023-11-21 20:57:36,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 20:57:36,035 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 20:57:36,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 20:57:36,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 20:57:36,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 20:57:36,049 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 331 out of 393 [2023-11-21 20:57:36,051 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 313 places, 311 transitions, 638 flow. Second operand has 3 states, 3 states have (on average 332.0) internal successors, (996), 3 states have internal predecessors, (996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:57:36,051 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 20:57:36,051 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 331 of 393 [2023-11-21 20:57:36,051 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 20:57:36,170 INFO L124 PetriNetUnfolderBase]: 53/640 cut-off events. [2023-11-21 20:57:36,171 INFO L125 PetriNetUnfolderBase]: For 27/29 co-relation queries the response was YES. [2023-11-21 20:57:36,173 INFO L83 FinitePrefix]: Finished finitePrefix Result has 758 conditions, 640 events. 53/640 cut-off events. For 27/29 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 2543 event pairs, 26 based on Foata normal form. 0/549 useless extension candidates. Maximal degree in co-relation 694. Up to 85 conditions per place. [2023-11-21 20:57:36,176 INFO L140 encePairwiseOnDemand]: 389/393 looper letters, 16 selfloop transitions, 1 changer transitions 0/308 dead transitions. [2023-11-21 20:57:36,177 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 312 places, 308 transitions, 666 flow [2023-11-21 20:57:36,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 20:57:36,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-21 20:57:36,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1012 transitions. [2023-11-21 20:57:36,181 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8583545377438507 [2023-11-21 20:57:36,181 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1012 transitions. [2023-11-21 20:57:36,181 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1012 transitions. [2023-11-21 20:57:36,182 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 20:57:36,182 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1012 transitions. [2023-11-21 20:57:36,185 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 337.3333333333333) internal successors, (1012), 3 states have internal predecessors, (1012), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:57:36,188 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 393.0) internal successors, (1572), 4 states have internal predecessors, (1572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:57:36,189 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 393.0) internal successors, (1572), 4 states have internal predecessors, (1572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:57:36,189 INFO L175 Difference]: Start difference. First operand has 313 places, 311 transitions, 638 flow. Second operand 3 states and 1012 transitions. [2023-11-21 20:57:36,189 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 312 places, 308 transitions, 666 flow [2023-11-21 20:57:36,192 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 310 places, 308 transitions, 662 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-21 20:57:36,197 INFO L231 Difference]: Finished difference. Result has 310 places, 308 transitions, 630 flow [2023-11-21 20:57:36,198 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=393, PETRI_DIFFERENCE_MINUEND_FLOW=628, PETRI_DIFFERENCE_MINUEND_PLACES=308, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=308, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=307, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=630, PETRI_PLACES=310, PETRI_TRANSITIONS=308} [2023-11-21 20:57:36,199 INFO L281 CegarLoopForPetriNet]: 362 programPoint places, -52 predicate places. [2023-11-21 20:57:36,200 INFO L495 AbstractCegarLoop]: Abstraction has has 310 places, 308 transitions, 630 flow [2023-11-21 20:57:36,200 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 332.0) internal successors, (996), 3 states have internal predecessors, (996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:57:36,200 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 20:57:36,201 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 20:57:36,201 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-21 20:57:36,201 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 115 more)] === [2023-11-21 20:57:36,201 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 20:57:36,202 INFO L85 PathProgramCache]: Analyzing trace with hash 317709038, now seen corresponding path program 1 times [2023-11-21 20:57:36,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 20:57:36,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537605795] [2023-11-21 20:57:36,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 20:57:36,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 20:57:36,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:57:36,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 20:57:36,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 20:57:36,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537605795] [2023-11-21 20:57:36,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537605795] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 20:57:36,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 20:57:36,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-21 20:57:36,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939901520] [2023-11-21 20:57:36,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 20:57:36,719 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-21 20:57:36,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 20:57:36,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-21 20:57:36,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-21 20:57:37,059 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 325 out of 393 [2023-11-21 20:57:37,062 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 310 places, 308 transitions, 630 flow. Second operand has 6 states, 6 states have (on average 326.1666666666667) internal successors, (1957), 6 states have internal predecessors, (1957), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:57:37,062 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 20:57:37,062 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 325 of 393 [2023-11-21 20:57:37,062 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 20:57:37,199 INFO L124 PetriNetUnfolderBase]: 34/500 cut-off events. [2023-11-21 20:57:37,200 INFO L125 PetriNetUnfolderBase]: For 18/20 co-relation queries the response was YES. [2023-11-21 20:57:37,202 INFO L83 FinitePrefix]: Finished finitePrefix Result has 581 conditions, 500 events. 34/500 cut-off events. For 18/20 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1585 event pairs, 10 based on Foata normal form. 0/427 useless extension candidates. Maximal degree in co-relation 516. Up to 49 conditions per place. [2023-11-21 20:57:37,205 INFO L140 encePairwiseOnDemand]: 388/393 looper letters, 21 selfloop transitions, 4 changer transitions 0/307 dead transitions. [2023-11-21 20:57:37,205 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 314 places, 307 transitions, 678 flow [2023-11-21 20:57:37,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 20:57:37,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-21 20:57:37,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1975 transitions. [2023-11-21 20:57:37,212 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8375742154368109 [2023-11-21 20:57:37,212 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1975 transitions. [2023-11-21 20:57:37,212 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1975 transitions. [2023-11-21 20:57:37,214 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 20:57:37,214 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1975 transitions. [2023-11-21 20:57:37,220 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 329.1666666666667) internal successors, (1975), 6 states have internal predecessors, (1975), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:57:37,226 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 393.0) internal successors, (2751), 7 states have internal predecessors, (2751), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:57:37,227 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 393.0) internal successors, (2751), 7 states have internal predecessors, (2751), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:57:37,227 INFO L175 Difference]: Start difference. First operand has 310 places, 308 transitions, 630 flow. Second operand 6 states and 1975 transitions. [2023-11-21 20:57:37,227 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 314 places, 307 transitions, 678 flow [2023-11-21 20:57:37,230 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 313 places, 307 transitions, 677 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-21 20:57:37,235 INFO L231 Difference]: Finished difference. Result has 313 places, 307 transitions, 635 flow [2023-11-21 20:57:37,236 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=393, PETRI_DIFFERENCE_MINUEND_FLOW=627, PETRI_DIFFERENCE_MINUEND_PLACES=308, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=307, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=303, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=635, PETRI_PLACES=313, PETRI_TRANSITIONS=307} [2023-11-21 20:57:37,237 INFO L281 CegarLoopForPetriNet]: 362 programPoint places, -49 predicate places. [2023-11-21 20:57:37,237 INFO L495 AbstractCegarLoop]: Abstraction has has 313 places, 307 transitions, 635 flow [2023-11-21 20:57:37,238 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 326.1666666666667) internal successors, (1957), 6 states have internal predecessors, (1957), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:57:37,238 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 20:57:37,239 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 20:57:37,239 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-21 20:57:37,239 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 115 more)] === [2023-11-21 20:57:37,239 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 20:57:37,240 INFO L85 PathProgramCache]: Analyzing trace with hash 313049798, now seen corresponding path program 1 times [2023-11-21 20:57:37,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 20:57:37,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449502945] [2023-11-21 20:57:37,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 20:57:37,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 20:57:37,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:57:37,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 20:57:37,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 20:57:37,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449502945] [2023-11-21 20:57:37,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449502945] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 20:57:37,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 20:57:37,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-21 20:57:37,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646365481] [2023-11-21 20:57:37,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 20:57:37,303 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 20:57:37,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 20:57:37,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 20:57:37,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 20:57:37,322 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 331 out of 393 [2023-11-21 20:57:37,323 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 313 places, 307 transitions, 635 flow. Second operand has 3 states, 3 states have (on average 332.3333333333333) internal successors, (997), 3 states have internal predecessors, (997), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:57:37,324 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 20:57:37,324 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 331 of 393 [2023-11-21 20:57:37,324 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 20:57:37,450 INFO L124 PetriNetUnfolderBase]: 46/511 cut-off events. [2023-11-21 20:57:37,451 INFO L125 PetriNetUnfolderBase]: For 22/24 co-relation queries the response was YES. [2023-11-21 20:57:37,453 INFO L83 FinitePrefix]: Finished finitePrefix Result has 607 conditions, 511 events. 46/511 cut-off events. For 22/24 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1778 event pairs, 16 based on Foata normal form. 0/435 useless extension candidates. Maximal degree in co-relation 542. Up to 72 conditions per place. [2023-11-21 20:57:37,455 INFO L140 encePairwiseOnDemand]: 390/393 looper letters, 16 selfloop transitions, 2 changer transitions 0/306 dead transitions. [2023-11-21 20:57:37,456 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 314 places, 306 transitions, 669 flow [2023-11-21 20:57:37,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 20:57:37,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-21 20:57:37,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1011 transitions. [2023-11-21 20:57:37,459 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8575063613231552 [2023-11-21 20:57:37,460 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1011 transitions. [2023-11-21 20:57:37,460 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1011 transitions. [2023-11-21 20:57:37,461 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 20:57:37,461 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1011 transitions. [2023-11-21 20:57:37,464 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 337.0) internal successors, (1011), 3 states have internal predecessors, (1011), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:57:37,467 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 393.0) internal successors, (1572), 4 states have internal predecessors, (1572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:57:37,467 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 393.0) internal successors, (1572), 4 states have internal predecessors, (1572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:57:37,468 INFO L175 Difference]: Start difference. First operand has 313 places, 307 transitions, 635 flow. Second operand 3 states and 1011 transitions. [2023-11-21 20:57:37,468 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 314 places, 306 transitions, 669 flow [2023-11-21 20:57:37,471 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 310 places, 306 transitions, 662 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-21 20:57:37,476 INFO L231 Difference]: Finished difference. Result has 310 places, 306 transitions, 630 flow [2023-11-21 20:57:37,476 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=393, PETRI_DIFFERENCE_MINUEND_FLOW=626, PETRI_DIFFERENCE_MINUEND_PLACES=308, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=306, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=304, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=630, PETRI_PLACES=310, PETRI_TRANSITIONS=306} [2023-11-21 20:57:37,477 INFO L281 CegarLoopForPetriNet]: 362 programPoint places, -52 predicate places. [2023-11-21 20:57:37,477 INFO L495 AbstractCegarLoop]: Abstraction has has 310 places, 306 transitions, 630 flow [2023-11-21 20:57:37,478 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 332.3333333333333) internal successors, (997), 3 states have internal predecessors, (997), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:57:37,478 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 20:57:37,478 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 20:57:37,478 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-21 20:57:37,479 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 115 more)] === [2023-11-21 20:57:37,479 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 20:57:37,479 INFO L85 PathProgramCache]: Analyzing trace with hash 967155259, now seen corresponding path program 1 times [2023-11-21 20:57:37,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 20:57:37,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186734177] [2023-11-21 20:57:37,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 20:57:37,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 20:57:37,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:57:37,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 20:57:37,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 20:57:37,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186734177] [2023-11-21 20:57:37,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186734177] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 20:57:37,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 20:57:37,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-21 20:57:37,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038821495] [2023-11-21 20:57:37,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 20:57:37,542 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 20:57:37,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 20:57:37,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 20:57:37,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 20:57:37,559 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 333 out of 393 [2023-11-21 20:57:37,561 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 310 places, 306 transitions, 630 flow. Second operand has 3 states, 3 states have (on average 334.0) internal successors, (1002), 3 states have internal predecessors, (1002), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:57:37,561 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 20:57:37,561 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 333 of 393 [2023-11-21 20:57:37,561 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 20:57:37,695 INFO L124 PetriNetUnfolderBase]: 62/598 cut-off events. [2023-11-21 20:57:37,696 INFO L125 PetriNetUnfolderBase]: For 27/29 co-relation queries the response was YES. [2023-11-21 20:57:37,699 INFO L83 FinitePrefix]: Finished finitePrefix Result has 714 conditions, 598 events. 62/598 cut-off events. For 27/29 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 2295 event pairs, 13 based on Foata normal form. 0/507 useless extension candidates. Maximal degree in co-relation 650. Up to 58 conditions per place. [2023-11-21 20:57:37,702 INFO L140 encePairwiseOnDemand]: 388/393 looper letters, 19 selfloop transitions, 3 changer transitions 0/310 dead transitions. [2023-11-21 20:57:37,702 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 310 places, 310 transitions, 684 flow [2023-11-21 20:57:37,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 20:57:37,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-21 20:57:37,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1023 transitions. [2023-11-21 20:57:37,706 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8676844783715013 [2023-11-21 20:57:37,707 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1023 transitions. [2023-11-21 20:57:37,707 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1023 transitions. [2023-11-21 20:57:37,708 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 20:57:37,708 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1023 transitions. [2023-11-21 20:57:37,711 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 341.0) internal successors, (1023), 3 states have internal predecessors, (1023), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:57:37,713 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 393.0) internal successors, (1572), 4 states have internal predecessors, (1572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:57:37,714 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 393.0) internal successors, (1572), 4 states have internal predecessors, (1572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:57:37,714 INFO L175 Difference]: Start difference. First operand has 310 places, 306 transitions, 630 flow. Second operand 3 states and 1023 transitions. [2023-11-21 20:57:37,715 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 310 places, 310 transitions, 684 flow [2023-11-21 20:57:37,718 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 308 places, 310 transitions, 680 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-21 20:57:37,723 INFO L231 Difference]: Finished difference. Result has 310 places, 306 transitions, 642 flow [2023-11-21 20:57:37,724 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=393, PETRI_DIFFERENCE_MINUEND_FLOW=622, PETRI_DIFFERENCE_MINUEND_PLACES=306, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=304, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=301, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=642, PETRI_PLACES=310, PETRI_TRANSITIONS=306} [2023-11-21 20:57:37,724 INFO L281 CegarLoopForPetriNet]: 362 programPoint places, -52 predicate places. [2023-11-21 20:57:37,724 INFO L495 AbstractCegarLoop]: Abstraction has has 310 places, 306 transitions, 642 flow [2023-11-21 20:57:37,725 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 334.0) internal successors, (1002), 3 states have internal predecessors, (1002), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:57:37,725 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 20:57:37,725 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 20:57:37,726 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-21 20:57:37,726 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 115 more)] === [2023-11-21 20:57:37,726 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 20:57:37,726 INFO L85 PathProgramCache]: Analyzing trace with hash -1757487143, now seen corresponding path program 1 times [2023-11-21 20:57:37,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 20:57:37,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355370461] [2023-11-21 20:57:37,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 20:57:37,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 20:57:37,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:57:37,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 20:57:37,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 20:57:37,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355370461] [2023-11-21 20:57:37,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355370461] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 20:57:37,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 20:57:37,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-21 20:57:37,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119713226] [2023-11-21 20:57:37,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 20:57:37,787 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 20:57:37,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 20:57:37,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 20:57:37,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 20:57:37,804 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 332 out of 393 [2023-11-21 20:57:37,806 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 310 places, 306 transitions, 642 flow. Second operand has 3 states, 3 states have (on average 333.3333333333333) internal successors, (1000), 3 states have internal predecessors, (1000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:57:37,806 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 20:57:37,806 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 332 of 393 [2023-11-21 20:57:37,806 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 20:57:37,939 INFO L124 PetriNetUnfolderBase]: 55/719 cut-off events. [2023-11-21 20:57:37,939 INFO L125 PetriNetUnfolderBase]: For 37/39 co-relation queries the response was YES. [2023-11-21 20:57:37,943 INFO L83 FinitePrefix]: Finished finitePrefix Result has 859 conditions, 719 events. 55/719 cut-off events. For 37/39 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 3045 event pairs, 23 based on Foata normal form. 0/615 useless extension candidates. Maximal degree in co-relation 793. Up to 74 conditions per place. [2023-11-21 20:57:37,947 INFO L140 encePairwiseOnDemand]: 390/393 looper letters, 15 selfloop transitions, 2 changer transitions 0/305 dead transitions. [2023-11-21 20:57:37,947 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 311 places, 305 transitions, 674 flow [2023-11-21 20:57:37,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 20:57:37,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-21 20:57:37,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1013 transitions. [2023-11-21 20:57:37,951 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8592027141645462 [2023-11-21 20:57:37,952 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1013 transitions. [2023-11-21 20:57:37,952 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1013 transitions. [2023-11-21 20:57:37,953 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 20:57:37,953 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1013 transitions. [2023-11-21 20:57:37,955 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 337.6666666666667) internal successors, (1013), 3 states have internal predecessors, (1013), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:57:37,958 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 393.0) internal successors, (1572), 4 states have internal predecessors, (1572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:57:37,959 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 393.0) internal successors, (1572), 4 states have internal predecessors, (1572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:57:37,959 INFO L175 Difference]: Start difference. First operand has 310 places, 306 transitions, 642 flow. Second operand 3 states and 1013 transitions. [2023-11-21 20:57:37,959 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 311 places, 305 transitions, 674 flow [2023-11-21 20:57:37,962 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 309 places, 305 transitions, 668 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-21 20:57:37,967 INFO L231 Difference]: Finished difference. Result has 309 places, 305 transitions, 638 flow [2023-11-21 20:57:37,968 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=393, PETRI_DIFFERENCE_MINUEND_FLOW=634, PETRI_DIFFERENCE_MINUEND_PLACES=307, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=305, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=303, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=638, PETRI_PLACES=309, PETRI_TRANSITIONS=305} [2023-11-21 20:57:37,968 INFO L281 CegarLoopForPetriNet]: 362 programPoint places, -53 predicate places. [2023-11-21 20:57:37,969 INFO L495 AbstractCegarLoop]: Abstraction has has 309 places, 305 transitions, 638 flow [2023-11-21 20:57:37,969 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 333.3333333333333) internal successors, (1000), 3 states have internal predecessors, (1000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:57:37,969 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 20:57:37,970 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 20:57:37,970 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-21 20:57:37,970 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 115 more)] === [2023-11-21 20:57:37,970 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 20:57:37,970 INFO L85 PathProgramCache]: Analyzing trace with hash -749669112, now seen corresponding path program 1 times [2023-11-21 20:57:37,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 20:57:37,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303002260] [2023-11-21 20:57:37,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 20:57:37,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 20:57:37,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:57:38,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 20:57:38,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 20:57:38,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303002260] [2023-11-21 20:57:38,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303002260] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 20:57:38,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 20:57:38,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-21 20:57:38,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107494060] [2023-11-21 20:57:38,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 20:57:38,031 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 20:57:38,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 20:57:38,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 20:57:38,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 20:57:38,041 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 332 out of 393 [2023-11-21 20:57:38,043 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 309 places, 305 transitions, 638 flow. Second operand has 3 states, 3 states have (on average 333.0) internal successors, (999), 3 states have internal predecessors, (999), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:57:38,043 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 20:57:38,043 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 332 of 393 [2023-11-21 20:57:38,043 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 20:57:38,256 INFO L124 PetriNetUnfolderBase]: 78/865 cut-off events. [2023-11-21 20:57:38,256 INFO L125 PetriNetUnfolderBase]: For 29/37 co-relation queries the response was YES. [2023-11-21 20:57:38,260 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1049 conditions, 865 events. 78/865 cut-off events. For 29/37 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 4191 event pairs, 28 based on Foata normal form. 1/749 useless extension candidates. Maximal degree in co-relation 984. Up to 106 conditions per place. [2023-11-21 20:57:38,265 INFO L140 encePairwiseOnDemand]: 386/393 looper letters, 18 selfloop transitions, 4 changer transitions 0/308 dead transitions. [2023-11-21 20:57:38,266 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 308 places, 308 transitions, 693 flow [2023-11-21 20:57:38,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 20:57:38,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-21 20:57:38,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1019 transitions. [2023-11-21 20:57:38,270 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8642917726887193 [2023-11-21 20:57:38,271 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1019 transitions. [2023-11-21 20:57:38,271 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1019 transitions. [2023-11-21 20:57:38,272 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 20:57:38,272 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1019 transitions. [2023-11-21 20:57:38,275 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 339.6666666666667) internal successors, (1019), 3 states have internal predecessors, (1019), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:57:38,279 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 393.0) internal successors, (1572), 4 states have internal predecessors, (1572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:57:38,279 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 393.0) internal successors, (1572), 4 states have internal predecessors, (1572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:57:38,280 INFO L175 Difference]: Start difference. First operand has 309 places, 305 transitions, 638 flow. Second operand 3 states and 1019 transitions. [2023-11-21 20:57:38,280 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 308 places, 308 transitions, 693 flow [2023-11-21 20:57:38,283 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 306 places, 308 transitions, 689 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-21 20:57:38,289 INFO L231 Difference]: Finished difference. Result has 307 places, 305 transitions, 652 flow [2023-11-21 20:57:38,290 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=393, PETRI_DIFFERENCE_MINUEND_FLOW=628, PETRI_DIFFERENCE_MINUEND_PLACES=304, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=302, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=298, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=652, PETRI_PLACES=307, PETRI_TRANSITIONS=305} [2023-11-21 20:57:38,291 INFO L281 CegarLoopForPetriNet]: 362 programPoint places, -55 predicate places. [2023-11-21 20:57:38,291 INFO L495 AbstractCegarLoop]: Abstraction has has 307 places, 305 transitions, 652 flow [2023-11-21 20:57:38,291 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 333.0) internal successors, (999), 3 states have internal predecessors, (999), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:57:38,291 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 20:57:38,292 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 20:57:38,292 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-21 20:57:38,292 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting thread2Err15ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 115 more)] === [2023-11-21 20:57:38,293 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 20:57:38,293 INFO L85 PathProgramCache]: Analyzing trace with hash 1302441450, now seen corresponding path program 1 times [2023-11-21 20:57:38,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 20:57:38,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168196481] [2023-11-21 20:57:38,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 20:57:38,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 20:57:38,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:57:38,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 20:57:38,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 20:57:38,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168196481] [2023-11-21 20:57:38,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1168196481] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 20:57:38,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 20:57:38,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-21 20:57:38,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346432036] [2023-11-21 20:57:38,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 20:57:38,380 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 20:57:38,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 20:57:38,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 20:57:38,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 20:57:38,396 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 333 out of 393 [2023-11-21 20:57:38,397 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 307 places, 305 transitions, 652 flow. Second operand has 3 states, 3 states have (on average 335.3333333333333) internal successors, (1006), 3 states have internal predecessors, (1006), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:57:38,398 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 20:57:38,398 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 333 of 393 [2023-11-21 20:57:38,398 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 20:57:38,550 INFO L124 PetriNetUnfolderBase]: 63/676 cut-off events. [2023-11-21 20:57:38,550 INFO L125 PetriNetUnfolderBase]: For 74/89 co-relation queries the response was YES. [2023-11-21 20:57:38,554 INFO L83 FinitePrefix]: Finished finitePrefix Result has 875 conditions, 676 events. 63/676 cut-off events. For 74/89 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 3111 event pairs, 17 based on Foata normal form. 3/595 useless extension candidates. Maximal degree in co-relation 809. Up to 69 conditions per place. [2023-11-21 20:57:38,558 INFO L140 encePairwiseOnDemand]: 388/393 looper letters, 16 selfloop transitions, 2 changer transitions 3/306 dead transitions. [2023-11-21 20:57:38,558 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 307 places, 306 transitions, 698 flow [2023-11-21 20:57:38,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 20:57:38,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-21 20:57:38,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1018 transitions. [2023-11-21 20:57:38,562 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8634435962680237 [2023-11-21 20:57:38,563 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1018 transitions. [2023-11-21 20:57:38,563 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1018 transitions. [2023-11-21 20:57:38,564 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 20:57:38,564 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1018 transitions. [2023-11-21 20:57:38,567 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 339.3333333333333) internal successors, (1018), 3 states have internal predecessors, (1018), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:57:38,570 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 393.0) internal successors, (1572), 4 states have internal predecessors, (1572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:57:38,570 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 393.0) internal successors, (1572), 4 states have internal predecessors, (1572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:57:38,571 INFO L175 Difference]: Start difference. First operand has 307 places, 305 transitions, 652 flow. Second operand 3 states and 1018 transitions. [2023-11-21 20:57:38,571 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 307 places, 306 transitions, 698 flow [2023-11-21 20:57:38,574 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 306 places, 306 transitions, 693 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-21 20:57:38,579 INFO L231 Difference]: Finished difference. Result has 306 places, 300 transitions, 641 flow [2023-11-21 20:57:38,580 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=393, PETRI_DIFFERENCE_MINUEND_FLOW=644, PETRI_DIFFERENCE_MINUEND_PLACES=304, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=303, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=301, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=641, PETRI_PLACES=306, PETRI_TRANSITIONS=300} [2023-11-21 20:57:38,580 INFO L281 CegarLoopForPetriNet]: 362 programPoint places, -56 predicate places. [2023-11-21 20:57:38,581 INFO L495 AbstractCegarLoop]: Abstraction has has 306 places, 300 transitions, 641 flow [2023-11-21 20:57:38,581 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 335.3333333333333) internal successors, (1006), 3 states have internal predecessors, (1006), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:57:38,581 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 20:57:38,582 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 20:57:38,582 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-21 20:57:38,582 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 115 more)] === [2023-11-21 20:57:38,582 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 20:57:38,583 INFO L85 PathProgramCache]: Analyzing trace with hash -411573279, now seen corresponding path program 1 times [2023-11-21 20:57:38,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 20:57:38,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567024915] [2023-11-21 20:57:38,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 20:57:38,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 20:57:38,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:57:39,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 20:57:39,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 20:57:39,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567024915] [2023-11-21 20:57:39,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567024915] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 20:57:39,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 20:57:39,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-21 20:57:39,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895100031] [2023-11-21 20:57:39,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 20:57:39,292 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-21 20:57:39,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 20:57:39,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-21 20:57:39,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-21 20:57:39,645 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 323 out of 393 [2023-11-21 20:57:39,647 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 306 places, 300 transitions, 641 flow. Second operand has 6 states, 6 states have (on average 324.5) internal successors, (1947), 6 states have internal predecessors, (1947), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:57:39,647 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 20:57:39,647 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 323 of 393 [2023-11-21 20:57:39,647 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 20:57:40,229 INFO L124 PetriNetUnfolderBase]: 278/1729 cut-off events. [2023-11-21 20:57:40,229 INFO L125 PetriNetUnfolderBase]: For 193/213 co-relation queries the response was YES. [2023-11-21 20:57:40,239 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2451 conditions, 1729 events. 278/1729 cut-off events. For 193/213 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 12365 event pairs, 37 based on Foata normal form. 0/1507 useless extension candidates. Maximal degree in co-relation 2383. Up to 139 conditions per place. [2023-11-21 20:57:40,252 INFO L140 encePairwiseOnDemand]: 388/393 looper letters, 54 selfloop transitions, 4 changer transitions 0/331 dead transitions. [2023-11-21 20:57:40,252 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 307 places, 331 transitions, 875 flow [2023-11-21 20:57:40,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 20:57:40,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-21 20:57:40,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1982 transitions. [2023-11-21 20:57:40,259 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8405428329092451 [2023-11-21 20:57:40,259 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1982 transitions. [2023-11-21 20:57:40,259 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1982 transitions. [2023-11-21 20:57:40,261 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 20:57:40,261 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1982 transitions. [2023-11-21 20:57:40,266 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 330.3333333333333) internal successors, (1982), 6 states have internal predecessors, (1982), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:57:40,272 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 393.0) internal successors, (2751), 7 states have internal predecessors, (2751), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:57:40,273 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 393.0) internal successors, (2751), 7 states have internal predecessors, (2751), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:57:40,273 INFO L175 Difference]: Start difference. First operand has 306 places, 300 transitions, 641 flow. Second operand 6 states and 1982 transitions. [2023-11-21 20:57:40,273 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 307 places, 331 transitions, 875 flow [2023-11-21 20:57:40,278 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 305 places, 331 transitions, 871 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-21 20:57:40,283 INFO L231 Difference]: Finished difference. Result has 305 places, 299 transitions, 643 flow [2023-11-21 20:57:40,284 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=393, PETRI_DIFFERENCE_MINUEND_FLOW=635, PETRI_DIFFERENCE_MINUEND_PLACES=300, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=299, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=295, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=643, PETRI_PLACES=305, PETRI_TRANSITIONS=299} [2023-11-21 20:57:40,284 INFO L281 CegarLoopForPetriNet]: 362 programPoint places, -57 predicate places. [2023-11-21 20:57:40,284 INFO L495 AbstractCegarLoop]: Abstraction has has 305 places, 299 transitions, 643 flow [2023-11-21 20:57:40,285 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 324.5) internal successors, (1947), 6 states have internal predecessors, (1947), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:57:40,285 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 20:57:40,285 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 20:57:40,286 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-21 20:57:40,286 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 115 more)] === [2023-11-21 20:57:40,286 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 20:57:40,286 INFO L85 PathProgramCache]: Analyzing trace with hash 1348333647, now seen corresponding path program 1 times [2023-11-21 20:57:40,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 20:57:40,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114636387] [2023-11-21 20:57:40,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 20:57:40,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 20:57:40,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:57:40,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 20:57:40,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 20:57:40,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114636387] [2023-11-21 20:57:40,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114636387] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 20:57:40,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 20:57:40,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-21 20:57:40,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458942423] [2023-11-21 20:57:40,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 20:57:40,543 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-21 20:57:40,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 20:57:40,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-21 20:57:40,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2023-11-21 20:57:40,913 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 318 out of 393 [2023-11-21 20:57:40,915 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 305 places, 299 transitions, 643 flow. Second operand has 7 states, 7 states have (on average 321.0) internal successors, (2247), 7 states have internal predecessors, (2247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:57:40,916 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 20:57:40,916 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 318 of 393 [2023-11-21 20:57:40,916 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 20:57:41,364 INFO L124 PetriNetUnfolderBase]: 91/1251 cut-off events. [2023-11-21 20:57:41,364 INFO L125 PetriNetUnfolderBase]: For 77/83 co-relation queries the response was YES. [2023-11-21 20:57:41,372 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1546 conditions, 1251 events. 91/1251 cut-off events. For 77/83 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 6628 event pairs, 19 based on Foata normal form. 0/1116 useless extension candidates. Maximal degree in co-relation 1477. Up to 65 conditions per place. [2023-11-21 20:57:41,378 INFO L140 encePairwiseOnDemand]: 379/393 looper letters, 43 selfloop transitions, 15 changer transitions 0/323 dead transitions. [2023-11-21 20:57:41,378 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 314 places, 323 transitions, 833 flow [2023-11-21 20:57:41,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-21 20:57:41,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-21 20:57:41,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 3232 transitions. [2023-11-21 20:57:41,390 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8223918575063613 [2023-11-21 20:57:41,390 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 3232 transitions. [2023-11-21 20:57:41,390 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 3232 transitions. [2023-11-21 20:57:41,393 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 20:57:41,393 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 3232 transitions. [2023-11-21 20:57:41,402 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 323.2) internal successors, (3232), 10 states have internal predecessors, (3232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:57:41,412 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 393.0) internal successors, (4323), 11 states have internal predecessors, (4323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:57:41,414 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 393.0) internal successors, (4323), 11 states have internal predecessors, (4323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:57:41,414 INFO L175 Difference]: Start difference. First operand has 305 places, 299 transitions, 643 flow. Second operand 10 states and 3232 transitions. [2023-11-21 20:57:41,414 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 314 places, 323 transitions, 833 flow [2023-11-21 20:57:41,417 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 310 places, 323 transitions, 826 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-21 20:57:41,424 INFO L231 Difference]: Finished difference. Result has 314 places, 306 transitions, 710 flow [2023-11-21 20:57:41,425 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=393, PETRI_DIFFERENCE_MINUEND_FLOW=636, PETRI_DIFFERENCE_MINUEND_PLACES=301, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=299, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=286, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=710, PETRI_PLACES=314, PETRI_TRANSITIONS=306} [2023-11-21 20:57:41,425 INFO L281 CegarLoopForPetriNet]: 362 programPoint places, -48 predicate places. [2023-11-21 20:57:41,425 INFO L495 AbstractCegarLoop]: Abstraction has has 314 places, 306 transitions, 710 flow [2023-11-21 20:57:41,426 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 321.0) internal successors, (2247), 7 states have internal predecessors, (2247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:57:41,427 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 20:57:41,427 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 20:57:41,427 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-11-21 20:57:41,427 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting thread2Err17ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 115 more)] === [2023-11-21 20:57:41,428 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 20:57:41,428 INFO L85 PathProgramCache]: Analyzing trace with hash -1280942063, now seen corresponding path program 1 times [2023-11-21 20:57:41,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 20:57:41,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658365059] [2023-11-21 20:57:41,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 20:57:41,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 20:57:41,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:57:41,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 20:57:41,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 20:57:41,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658365059] [2023-11-21 20:57:41,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658365059] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 20:57:41,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 20:57:41,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-21 20:57:41,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553881935] [2023-11-21 20:57:41,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 20:57:41,512 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 20:57:41,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 20:57:41,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 20:57:41,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 20:57:41,520 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 335 out of 393 [2023-11-21 20:57:41,521 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 314 places, 306 transitions, 710 flow. Second operand has 3 states, 3 states have (on average 337.0) internal successors, (1011), 3 states have internal predecessors, (1011), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:57:41,522 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 20:57:41,522 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 335 of 393 [2023-11-21 20:57:41,522 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 20:57:41,864 INFO L124 PetriNetUnfolderBase]: 119/1479 cut-off events. [2023-11-21 20:57:41,864 INFO L125 PetriNetUnfolderBase]: For 161/175 co-relation queries the response was YES. [2023-11-21 20:57:41,874 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1925 conditions, 1479 events. 119/1479 cut-off events. For 161/175 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 8603 event pairs, 29 based on Foata normal form. 0/1327 useless extension candidates. Maximal degree in co-relation 1850. Up to 132 conditions per place. [2023-11-21 20:57:41,881 INFO L140 encePairwiseOnDemand]: 388/393 looper letters, 18 selfloop transitions, 3 changer transitions 0/309 dead transitions. [2023-11-21 20:57:41,882 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 314 places, 309 transitions, 768 flow [2023-11-21 20:57:41,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 20:57:41,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-21 20:57:41,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1024 transitions. [2023-11-21 20:57:41,886 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8685326547921968 [2023-11-21 20:57:41,887 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1024 transitions. [2023-11-21 20:57:41,887 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1024 transitions. [2023-11-21 20:57:41,888 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 20:57:41,888 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1024 transitions. [2023-11-21 20:57:41,891 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 341.3333333333333) internal successors, (1024), 3 states have internal predecessors, (1024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:57:41,894 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 393.0) internal successors, (1572), 4 states have internal predecessors, (1572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:57:41,894 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 393.0) internal successors, (1572), 4 states have internal predecessors, (1572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:57:41,895 INFO L175 Difference]: Start difference. First operand has 314 places, 306 transitions, 710 flow. Second operand 3 states and 1024 transitions. [2023-11-21 20:57:41,895 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 314 places, 309 transitions, 768 flow [2023-11-21 20:57:41,899 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 312 places, 309 transitions, 761 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-21 20:57:41,904 INFO L231 Difference]: Finished difference. Result has 313 places, 305 transitions, 713 flow [2023-11-21 20:57:41,905 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=393, PETRI_DIFFERENCE_MINUEND_FLOW=700, PETRI_DIFFERENCE_MINUEND_PLACES=310, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=304, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=301, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=713, PETRI_PLACES=313, PETRI_TRANSITIONS=305} [2023-11-21 20:57:41,906 INFO L281 CegarLoopForPetriNet]: 362 programPoint places, -49 predicate places. [2023-11-21 20:57:41,906 INFO L495 AbstractCegarLoop]: Abstraction has has 313 places, 305 transitions, 713 flow [2023-11-21 20:57:41,906 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 337.0) internal successors, (1011), 3 states have internal predecessors, (1011), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:57:41,906 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 20:57:41,907 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 20:57:41,907 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-11-21 20:57:41,907 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting thread2Err18ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 115 more)] === [2023-11-21 20:57:41,908 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 20:57:41,908 INFO L85 PathProgramCache]: Analyzing trace with hash -1279987757, now seen corresponding path program 1 times [2023-11-21 20:57:41,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 20:57:41,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617444002] [2023-11-21 20:57:41,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 20:57:41,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 20:57:41,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:57:41,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 20:57:41,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 20:57:41,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617444002] [2023-11-21 20:57:41,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617444002] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 20:57:41,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 20:57:41,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-21 20:57:41,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622267096] [2023-11-21 20:57:41,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 20:57:41,991 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 20:57:41,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 20:57:41,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 20:57:41,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 20:57:42,012 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 333 out of 393 [2023-11-21 20:57:42,013 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 313 places, 305 transitions, 713 flow. Second operand has 3 states, 3 states have (on average 336.0) internal successors, (1008), 3 states have internal predecessors, (1008), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:57:42,014 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 20:57:42,014 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 333 of 393 [2023-11-21 20:57:42,014 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 20:57:42,341 INFO L124 PetriNetUnfolderBase]: 160/1188 cut-off events. [2023-11-21 20:57:42,341 INFO L125 PetriNetUnfolderBase]: For 254/288 co-relation queries the response was YES. [2023-11-21 20:57:42,348 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1833 conditions, 1188 events. 160/1188 cut-off events. For 254/288 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 7245 event pairs, 67 based on Foata normal form. 0/1093 useless extension candidates. Maximal degree in co-relation 1758. Up to 222 conditions per place. [2023-11-21 20:57:42,354 INFO L140 encePairwiseOnDemand]: 390/393 looper letters, 20 selfloop transitions, 2 changer transitions 0/308 dead transitions. [2023-11-21 20:57:42,354 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 314 places, 308 transitions, 772 flow [2023-11-21 20:57:42,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 20:57:42,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-21 20:57:42,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1017 transitions. [2023-11-21 20:57:42,359 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8625954198473282 [2023-11-21 20:57:42,359 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1017 transitions. [2023-11-21 20:57:42,359 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1017 transitions. [2023-11-21 20:57:42,360 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 20:57:42,360 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1017 transitions. [2023-11-21 20:57:42,363 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 339.0) internal successors, (1017), 3 states have internal predecessors, (1017), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:57:42,367 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 393.0) internal successors, (1572), 4 states have internal predecessors, (1572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:57:42,367 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 393.0) internal successors, (1572), 4 states have internal predecessors, (1572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:57:42,368 INFO L175 Difference]: Start difference. First operand has 313 places, 305 transitions, 713 flow. Second operand 3 states and 1017 transitions. [2023-11-21 20:57:42,368 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 314 places, 308 transitions, 772 flow [2023-11-21 20:57:42,372 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 312 places, 308 transitions, 765 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-11-21 20:57:42,378 INFO L231 Difference]: Finished difference. Result has 312 places, 304 transitions, 708 flow [2023-11-21 20:57:42,379 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=393, PETRI_DIFFERENCE_MINUEND_FLOW=704, PETRI_DIFFERENCE_MINUEND_PLACES=310, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=304, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=302, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=708, PETRI_PLACES=312, PETRI_TRANSITIONS=304} [2023-11-21 20:57:42,379 INFO L281 CegarLoopForPetriNet]: 362 programPoint places, -50 predicate places. [2023-11-21 20:57:42,379 INFO L495 AbstractCegarLoop]: Abstraction has has 312 places, 304 transitions, 708 flow [2023-11-21 20:57:42,380 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 336.0) internal successors, (1008), 3 states have internal predecessors, (1008), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:57:42,380 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 20:57:42,380 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 20:57:42,381 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-11-21 20:57:42,381 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting thread2Err20ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 115 more)] === [2023-11-21 20:57:42,381 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 20:57:42,381 INFO L85 PathProgramCache]: Analyzing trace with hash -1586864615, now seen corresponding path program 1 times [2023-11-21 20:57:42,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 20:57:42,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649086002] [2023-11-21 20:57:42,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 20:57:42,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 20:57:42,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:57:42,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 20:57:42,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 20:57:42,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649086002] [2023-11-21 20:57:42,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [649086002] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 20:57:42,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 20:57:42,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-21 20:57:42,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257909616] [2023-11-21 20:57:42,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 20:57:42,476 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 20:57:42,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 20:57:42,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 20:57:42,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 20:57:42,498 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 333 out of 393 [2023-11-21 20:57:42,499 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 312 places, 304 transitions, 708 flow. Second operand has 3 states, 3 states have (on average 336.0) internal successors, (1008), 3 states have internal predecessors, (1008), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:57:42,500 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 20:57:42,500 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 333 of 393 [2023-11-21 20:57:42,500 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 20:57:42,750 INFO L124 PetriNetUnfolderBase]: 112/1124 cut-off events. [2023-11-21 20:57:42,750 INFO L125 PetriNetUnfolderBase]: For 149/170 co-relation queries the response was YES. [2023-11-21 20:57:42,755 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1636 conditions, 1124 events. 112/1124 cut-off events. For 149/170 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 6165 event pairs, 45 based on Foata normal form. 0/1050 useless extension candidates. Maximal degree in co-relation 1562. Up to 168 conditions per place. [2023-11-21 20:57:42,759 INFO L140 encePairwiseOnDemand]: 390/393 looper letters, 22 selfloop transitions, 3 changer transitions 0/307 dead transitions. [2023-11-21 20:57:42,759 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 313 places, 307 transitions, 773 flow [2023-11-21 20:57:42,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 20:57:42,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-21 20:57:42,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1018 transitions. [2023-11-21 20:57:42,762 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8634435962680237 [2023-11-21 20:57:42,762 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1018 transitions. [2023-11-21 20:57:42,762 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1018 transitions. [2023-11-21 20:57:42,767 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 20:57:42,768 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1018 transitions. [2023-11-21 20:57:42,771 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 339.3333333333333) internal successors, (1018), 3 states have internal predecessors, (1018), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:57:42,774 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 393.0) internal successors, (1572), 4 states have internal predecessors, (1572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:57:42,774 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 393.0) internal successors, (1572), 4 states have internal predecessors, (1572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:57:42,775 INFO L175 Difference]: Start difference. First operand has 312 places, 304 transitions, 708 flow. Second operand 3 states and 1018 transitions. [2023-11-21 20:57:42,775 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 313 places, 307 transitions, 773 flow [2023-11-21 20:57:42,780 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 311 places, 307 transitions, 769 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-21 20:57:42,785 INFO L231 Difference]: Finished difference. Result has 311 places, 303 transitions, 708 flow [2023-11-21 20:57:42,786 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=393, PETRI_DIFFERENCE_MINUEND_FLOW=702, PETRI_DIFFERENCE_MINUEND_PLACES=309, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=303, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=300, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=708, PETRI_PLACES=311, PETRI_TRANSITIONS=303} [2023-11-21 20:57:42,786 INFO L281 CegarLoopForPetriNet]: 362 programPoint places, -51 predicate places. [2023-11-21 20:57:42,786 INFO L495 AbstractCegarLoop]: Abstraction has has 311 places, 303 transitions, 708 flow [2023-11-21 20:57:42,787 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 336.0) internal successors, (1008), 3 states have internal predecessors, (1008), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:57:42,787 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 20:57:42,787 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 20:57:42,788 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-11-21 20:57:42,788 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 115 more)] === [2023-11-21 20:57:42,788 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 20:57:42,788 INFO L85 PathProgramCache]: Analyzing trace with hash 403335043, now seen corresponding path program 1 times [2023-11-21 20:57:42,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 20:57:42,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549086405] [2023-11-21 20:57:42,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 20:57:42,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 20:57:42,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:57:43,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 20:57:43,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 20:57:43,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549086405] [2023-11-21 20:57:43,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549086405] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 20:57:43,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 20:57:43,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-21 20:57:43,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841177485] [2023-11-21 20:57:43,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 20:57:43,501 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-21 20:57:43,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 20:57:43,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-21 20:57:43,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-21 20:57:43,903 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 323 out of 393 [2023-11-21 20:57:43,905 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 311 places, 303 transitions, 708 flow. Second operand has 6 states, 6 states have (on average 324.6666666666667) internal successors, (1948), 6 states have internal predecessors, (1948), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:57:43,905 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 20:57:43,905 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 323 of 393 [2023-11-21 20:57:43,905 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 20:57:44,276 INFO L124 PetriNetUnfolderBase]: 113/1162 cut-off events. [2023-11-21 20:57:44,276 INFO L125 PetriNetUnfolderBase]: For 148/162 co-relation queries the response was YES. [2023-11-21 20:57:44,283 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1621 conditions, 1162 events. 113/1162 cut-off events. For 148/162 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 5932 event pairs, 24 based on Foata normal form. 0/1090 useless extension candidates. Maximal degree in co-relation 1545. Up to 99 conditions per place. [2023-11-21 20:57:44,286 INFO L140 encePairwiseOnDemand]: 388/393 looper letters, 22 selfloop transitions, 0 changer transitions 27/318 dead transitions. [2023-11-21 20:57:44,286 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 315 places, 318 transitions, 852 flow [2023-11-21 20:57:44,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 20:57:44,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-21 20:57:44,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1974 transitions. [2023-11-21 20:57:44,293 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8371501272264631 [2023-11-21 20:57:44,293 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1974 transitions. [2023-11-21 20:57:44,293 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1974 transitions. [2023-11-21 20:57:44,295 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 20:57:44,295 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1974 transitions. [2023-11-21 20:57:44,300 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 329.0) internal successors, (1974), 6 states have internal predecessors, (1974), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:57:44,306 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 393.0) internal successors, (2751), 7 states have internal predecessors, (2751), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:57:44,307 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 393.0) internal successors, (2751), 7 states have internal predecessors, (2751), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:57:44,307 INFO L175 Difference]: Start difference. First operand has 311 places, 303 transitions, 708 flow. Second operand 6 states and 1974 transitions. [2023-11-21 20:57:44,308 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 315 places, 318 transitions, 852 flow [2023-11-21 20:57:44,311 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 313 places, 318 transitions, 846 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-21 20:57:44,316 INFO L231 Difference]: Finished difference. Result has 313 places, 291 transitions, 667 flow [2023-11-21 20:57:44,317 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=393, PETRI_DIFFERENCE_MINUEND_FLOW=700, PETRI_DIFFERENCE_MINUEND_PLACES=308, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=302, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=302, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=667, PETRI_PLACES=313, PETRI_TRANSITIONS=291} [2023-11-21 20:57:44,317 INFO L281 CegarLoopForPetriNet]: 362 programPoint places, -49 predicate places. [2023-11-21 20:57:44,318 INFO L495 AbstractCegarLoop]: Abstraction has has 313 places, 291 transitions, 667 flow [2023-11-21 20:57:44,318 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 324.6666666666667) internal successors, (1948), 6 states have internal predecessors, (1948), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:57:44,319 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 20:57:44,319 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 20:57:44,319 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-11-21 20:57:44,319 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 115 more)] === [2023-11-21 20:57:44,320 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 20:57:44,320 INFO L85 PathProgramCache]: Analyzing trace with hash 1026092892, now seen corresponding path program 1 times [2023-11-21 20:57:44,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 20:57:44,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641620086] [2023-11-21 20:57:44,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 20:57:44,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 20:57:44,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:57:44,949 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-21 20:57:44,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 20:57:44,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641620086] [2023-11-21 20:57:44,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641620086] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 20:57:44,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 20:57:44,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-21 20:57:44,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406567426] [2023-11-21 20:57:44,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 20:57:44,951 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-21 20:57:44,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 20:57:44,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-21 20:57:44,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-21 20:57:45,314 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 318 out of 393 [2023-11-21 20:57:45,317 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 313 places, 291 transitions, 667 flow. Second operand has 6 states, 6 states have (on average 320.1666666666667) internal successors, (1921), 6 states have internal predecessors, (1921), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:57:45,317 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 20:57:45,317 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 318 of 393 [2023-11-21 20:57:45,317 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 20:57:45,739 INFO L124 PetriNetUnfolderBase]: 168/1140 cut-off events. [2023-11-21 20:57:45,739 INFO L125 PetriNetUnfolderBase]: For 163/167 co-relation queries the response was YES. [2023-11-21 20:57:45,744 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1683 conditions, 1140 events. 168/1140 cut-off events. For 163/167 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 6402 event pairs, 14 based on Foata normal form. 0/1068 useless extension candidates. Maximal degree in co-relation 1673. Up to 176 conditions per place. [2023-11-21 20:57:45,747 INFO L140 encePairwiseOnDemand]: 386/393 looper letters, 47 selfloop transitions, 6 changer transitions 0/309 dead transitions. [2023-11-21 20:57:45,748 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 302 places, 309 transitions, 841 flow [2023-11-21 20:57:45,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 20:57:45,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-21 20:57:45,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1955 transitions. [2023-11-21 20:57:45,755 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8290924512298559 [2023-11-21 20:57:45,755 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1955 transitions. [2023-11-21 20:57:45,755 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1955 transitions. [2023-11-21 20:57:45,757 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 20:57:45,757 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1955 transitions. [2023-11-21 20:57:45,764 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 325.8333333333333) internal successors, (1955), 6 states have internal predecessors, (1955), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:57:45,769 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 393.0) internal successors, (2751), 7 states have internal predecessors, (2751), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:57:45,770 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 393.0) internal successors, (2751), 7 states have internal predecessors, (2751), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:57:45,771 INFO L175 Difference]: Start difference. First operand has 313 places, 291 transitions, 667 flow. Second operand 6 states and 1955 transitions. [2023-11-21 20:57:45,771 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 302 places, 309 transitions, 841 flow [2023-11-21 20:57:45,774 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 298 places, 309 transitions, 826 flow, removed 2 selfloop flow, removed 4 redundant places. [2023-11-21 20:57:45,779 INFO L231 Difference]: Finished difference. Result has 298 places, 289 transitions, 660 flow [2023-11-21 20:57:45,780 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=393, PETRI_DIFFERENCE_MINUEND_FLOW=648, PETRI_DIFFERENCE_MINUEND_PLACES=293, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=289, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=283, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=660, PETRI_PLACES=298, PETRI_TRANSITIONS=289} [2023-11-21 20:57:45,780 INFO L281 CegarLoopForPetriNet]: 362 programPoint places, -64 predicate places. [2023-11-21 20:57:45,780 INFO L495 AbstractCegarLoop]: Abstraction has has 298 places, 289 transitions, 660 flow [2023-11-21 20:57:45,781 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 320.1666666666667) internal successors, (1921), 6 states have internal predecessors, (1921), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:57:45,781 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 20:57:45,782 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 20:57:45,782 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-11-21 20:57:45,782 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting thread1Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 115 more)] === [2023-11-21 20:57:45,783 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 20:57:45,783 INFO L85 PathProgramCache]: Analyzing trace with hash -1767164834, now seen corresponding path program 1 times [2023-11-21 20:57:45,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 20:57:45,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952247827] [2023-11-21 20:57:45,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 20:57:45,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 20:57:45,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:57:45,860 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-21 20:57:45,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 20:57:45,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952247827] [2023-11-21 20:57:45,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [952247827] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 20:57:45,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 20:57:45,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-21 20:57:45,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704395414] [2023-11-21 20:57:45,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 20:57:45,862 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 20:57:45,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 20:57:45,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 20:57:45,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 20:57:45,876 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 336 out of 393 [2023-11-21 20:57:45,877 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 298 places, 289 transitions, 660 flow. Second operand has 3 states, 3 states have (on average 337.3333333333333) internal successors, (1012), 3 states have internal predecessors, (1012), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:57:45,877 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 20:57:45,877 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 336 of 393 [2023-11-21 20:57:45,878 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 20:57:46,153 INFO L124 PetriNetUnfolderBase]: 113/1203 cut-off events. [2023-11-21 20:57:46,154 INFO L125 PetriNetUnfolderBase]: For 208/212 co-relation queries the response was YES. [2023-11-21 20:57:46,162 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1657 conditions, 1203 events. 113/1203 cut-off events. For 208/212 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 6551 event pairs, 21 based on Foata normal form. 0/1147 useless extension candidates. Maximal degree in co-relation 1648. Up to 103 conditions per place. [2023-11-21 20:57:46,167 INFO L140 encePairwiseOnDemand]: 390/393 looper letters, 25 selfloop transitions, 2 changer transitions 0/299 dead transitions. [2023-11-21 20:57:46,167 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 299 places, 299 transitions, 759 flow [2023-11-21 20:57:46,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 20:57:46,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-21 20:57:46,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1028 transitions. [2023-11-21 20:57:46,172 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8719253604749788 [2023-11-21 20:57:46,172 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1028 transitions. [2023-11-21 20:57:46,172 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1028 transitions. [2023-11-21 20:57:46,173 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 20:57:46,173 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1028 transitions. [2023-11-21 20:57:46,175 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 342.6666666666667) internal successors, (1028), 3 states have internal predecessors, (1028), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:57:46,179 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 393.0) internal successors, (1572), 4 states have internal predecessors, (1572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:57:46,179 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 393.0) internal successors, (1572), 4 states have internal predecessors, (1572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:57:46,180 INFO L175 Difference]: Start difference. First operand has 298 places, 289 transitions, 660 flow. Second operand 3 states and 1028 transitions. [2023-11-21 20:57:46,180 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 299 places, 299 transitions, 759 flow [2023-11-21 20:57:46,184 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 294 places, 299 transitions, 743 flow, removed 0 selfloop flow, removed 5 redundant places. [2023-11-21 20:57:46,189 INFO L231 Difference]: Finished difference. Result has 295 places, 289 transitions, 656 flow [2023-11-21 20:57:46,189 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=393, PETRI_DIFFERENCE_MINUEND_FLOW=646, PETRI_DIFFERENCE_MINUEND_PLACES=292, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=288, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=286, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=656, PETRI_PLACES=295, PETRI_TRANSITIONS=289} [2023-11-21 20:57:46,190 INFO L281 CegarLoopForPetriNet]: 362 programPoint places, -67 predicate places. [2023-11-21 20:57:46,190 INFO L495 AbstractCegarLoop]: Abstraction has has 295 places, 289 transitions, 656 flow [2023-11-21 20:57:46,191 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 337.3333333333333) internal successors, (1012), 3 states have internal predecessors, (1012), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:57:46,191 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 20:57:46,191 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 20:57:46,191 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2023-11-21 20:57:46,192 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting thread1Err20ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 115 more)] === [2023-11-21 20:57:46,192 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 20:57:46,192 INFO L85 PathProgramCache]: Analyzing trace with hash 192633437, now seen corresponding path program 1 times [2023-11-21 20:57:46,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 20:57:46,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281256054] [2023-11-21 20:57:46,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 20:57:46,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 20:57:46,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:57:46,294 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-21 20:57:46,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 20:57:46,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281256054] [2023-11-21 20:57:46,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [281256054] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 20:57:46,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 20:57:46,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-21 20:57:46,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785770422] [2023-11-21 20:57:46,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 20:57:46,296 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 20:57:46,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 20:57:46,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 20:57:46,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 20:57:46,313 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 334 out of 393 [2023-11-21 20:57:46,314 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 295 places, 289 transitions, 656 flow. Second operand has 3 states, 3 states have (on average 336.3333333333333) internal successors, (1009), 3 states have internal predecessors, (1009), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:57:46,314 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 20:57:46,314 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 334 of 393 [2023-11-21 20:57:46,314 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 20:57:46,671 INFO L124 PetriNetUnfolderBase]: 153/1407 cut-off events. [2023-11-21 20:57:46,672 INFO L125 PetriNetUnfolderBase]: For 188/203 co-relation queries the response was YES. [2023-11-21 20:57:46,680 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1956 conditions, 1407 events. 153/1407 cut-off events. For 188/203 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 8409 event pairs, 60 based on Foata normal form. 1/1332 useless extension candidates. Maximal degree in co-relation 1947. Up to 175 conditions per place. [2023-11-21 20:57:46,682 INFO L140 encePairwiseOnDemand]: 390/393 looper letters, 0 selfloop transitions, 0 changer transitions 293/293 dead transitions. [2023-11-21 20:57:46,682 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 296 places, 293 transitions, 720 flow [2023-11-21 20:57:46,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 20:57:46,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-21 20:57:46,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1021 transitions. [2023-11-21 20:57:46,687 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8659881255301103 [2023-11-21 20:57:46,688 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1021 transitions. [2023-11-21 20:57:46,688 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1021 transitions. [2023-11-21 20:57:46,689 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 20:57:46,689 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1021 transitions. [2023-11-21 20:57:46,692 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 340.3333333333333) internal successors, (1021), 3 states have internal predecessors, (1021), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:57:46,695 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 393.0) internal successors, (1572), 4 states have internal predecessors, (1572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:57:46,696 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 393.0) internal successors, (1572), 4 states have internal predecessors, (1572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:57:46,696 INFO L175 Difference]: Start difference. First operand has 295 places, 289 transitions, 656 flow. Second operand 3 states and 1021 transitions. [2023-11-21 20:57:46,696 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 296 places, 293 transitions, 720 flow [2023-11-21 20:57:46,700 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 295 places, 293 transitions, 718 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-21 20:57:46,703 INFO L231 Difference]: Finished difference. Result has 295 places, 0 transitions, 0 flow [2023-11-21 20:57:46,704 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=393, PETRI_DIFFERENCE_MINUEND_FLOW=652, PETRI_DIFFERENCE_MINUEND_PLACES=293, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=288, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=288, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=295, PETRI_TRANSITIONS=0} [2023-11-21 20:57:46,705 INFO L281 CegarLoopForPetriNet]: 362 programPoint places, -67 predicate places. [2023-11-21 20:57:46,705 INFO L495 AbstractCegarLoop]: Abstraction has has 295 places, 0 transitions, 0 flow [2023-11-21 20:57:46,705 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 336.3333333333333) internal successors, (1009), 3 states have internal predecessors, (1009), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:57:46,708 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (118 of 119 remaining) [2023-11-21 20:57:46,709 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (117 of 119 remaining) [2023-11-21 20:57:46,709 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (116 of 119 remaining) [2023-11-21 20:57:46,709 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (115 of 119 remaining) [2023-11-21 20:57:46,710 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (114 of 119 remaining) [2023-11-21 20:57:46,710 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (113 of 119 remaining) [2023-11-21 20:57:46,710 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (112 of 119 remaining) [2023-11-21 20:57:46,710 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (111 of 119 remaining) [2023-11-21 20:57:46,711 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (110 of 119 remaining) [2023-11-21 20:57:46,711 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (109 of 119 remaining) [2023-11-21 20:57:46,711 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (108 of 119 remaining) [2023-11-21 20:57:46,711 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (107 of 119 remaining) [2023-11-21 20:57:46,712 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (106 of 119 remaining) [2023-11-21 20:57:46,712 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (105 of 119 remaining) [2023-11-21 20:57:46,714 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (104 of 119 remaining) [2023-11-21 20:57:46,715 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (103 of 119 remaining) [2023-11-21 20:57:46,715 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (102 of 119 remaining) [2023-11-21 20:57:46,715 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err21ASSERT_VIOLATIONDATA_RACE (101 of 119 remaining) [2023-11-21 20:57:46,715 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err22ASSERT_VIOLATIONDATA_RACE (100 of 119 remaining) [2023-11-21 20:57:46,716 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONDATA_RACE (99 of 119 remaining) [2023-11-21 20:57:46,716 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err18ASSERT_VIOLATIONDATA_RACE (98 of 119 remaining) [2023-11-21 20:57:46,716 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err19ASSERT_VIOLATIONDATA_RACE (97 of 119 remaining) [2023-11-21 20:57:46,716 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err20ASSERT_VIOLATIONDATA_RACE (96 of 119 remaining) [2023-11-21 20:57:46,717 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (95 of 119 remaining) [2023-11-21 20:57:46,717 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (94 of 119 remaining) [2023-11-21 20:57:46,717 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (93 of 119 remaining) [2023-11-21 20:57:46,717 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (92 of 119 remaining) [2023-11-21 20:57:46,718 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (91 of 119 remaining) [2023-11-21 20:57:46,718 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (90 of 119 remaining) [2023-11-21 20:57:46,718 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (89 of 119 remaining) [2023-11-21 20:57:46,719 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (88 of 119 remaining) [2023-11-21 20:57:46,719 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (87 of 119 remaining) [2023-11-21 20:57:46,719 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (86 of 119 remaining) [2023-11-21 20:57:46,719 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (85 of 119 remaining) [2023-11-21 20:57:46,720 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (84 of 119 remaining) [2023-11-21 20:57:46,720 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (83 of 119 remaining) [2023-11-21 20:57:46,720 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (82 of 119 remaining) [2023-11-21 20:57:46,720 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (81 of 119 remaining) [2023-11-21 20:57:46,720 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (80 of 119 remaining) [2023-11-21 20:57:46,721 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (79 of 119 remaining) [2023-11-21 20:57:46,721 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (78 of 119 remaining) [2023-11-21 20:57:46,721 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONDATA_RACE (77 of 119 remaining) [2023-11-21 20:57:46,721 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err19ASSERT_VIOLATIONDATA_RACE (76 of 119 remaining) [2023-11-21 20:57:46,722 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err20ASSERT_VIOLATIONDATA_RACE (75 of 119 remaining) [2023-11-21 20:57:46,722 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err21ASSERT_VIOLATIONDATA_RACE (74 of 119 remaining) [2023-11-21 20:57:46,722 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err22ASSERT_VIOLATIONDATA_RACE (73 of 119 remaining) [2023-11-21 20:57:46,722 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err23ASSERT_VIOLATIONDATA_RACE (72 of 119 remaining) [2023-11-21 20:57:46,723 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err24ASSERT_VIOLATIONDATA_RACE (71 of 119 remaining) [2023-11-21 20:57:46,723 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (70 of 119 remaining) [2023-11-21 20:57:46,723 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (69 of 119 remaining) [2023-11-21 20:57:46,723 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (68 of 119 remaining) [2023-11-21 20:57:46,724 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (67 of 119 remaining) [2023-11-21 20:57:46,724 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (66 of 119 remaining) [2023-11-21 20:57:46,724 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (65 of 119 remaining) [2023-11-21 20:57:46,724 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (64 of 119 remaining) [2023-11-21 20:57:46,725 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (63 of 119 remaining) [2023-11-21 20:57:46,725 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (62 of 119 remaining) [2023-11-21 20:57:46,725 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (61 of 119 remaining) [2023-11-21 20:57:46,726 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (60 of 119 remaining) [2023-11-21 20:57:46,726 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (59 of 119 remaining) [2023-11-21 20:57:46,726 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (58 of 119 remaining) [2023-11-21 20:57:46,726 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (57 of 119 remaining) [2023-11-21 20:57:46,727 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (56 of 119 remaining) [2023-11-21 20:57:46,727 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (55 of 119 remaining) [2023-11-21 20:57:46,727 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (54 of 119 remaining) [2023-11-21 20:57:46,727 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (53 of 119 remaining) [2023-11-21 20:57:46,728 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE (52 of 119 remaining) [2023-11-21 20:57:46,728 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE (51 of 119 remaining) [2023-11-21 20:57:46,728 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE (50 of 119 remaining) [2023-11-21 20:57:46,728 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (49 of 119 remaining) [2023-11-21 20:57:46,729 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (48 of 119 remaining) [2023-11-21 20:57:46,729 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (47 of 119 remaining) [2023-11-21 20:57:46,729 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (46 of 119 remaining) [2023-11-21 20:57:46,729 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (45 of 119 remaining) [2023-11-21 20:57:46,730 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (44 of 119 remaining) [2023-11-21 20:57:46,730 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (43 of 119 remaining) [2023-11-21 20:57:46,730 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (42 of 119 remaining) [2023-11-21 20:57:46,730 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (41 of 119 remaining) [2023-11-21 20:57:46,730 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (40 of 119 remaining) [2023-11-21 20:57:46,731 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (39 of 119 remaining) [2023-11-21 20:57:46,731 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (38 of 119 remaining) [2023-11-21 20:57:46,731 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (37 of 119 remaining) [2023-11-21 20:57:46,731 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (36 of 119 remaining) [2023-11-21 20:57:46,732 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (35 of 119 remaining) [2023-11-21 20:57:46,732 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (34 of 119 remaining) [2023-11-21 20:57:46,732 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (33 of 119 remaining) [2023-11-21 20:57:46,732 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (32 of 119 remaining) [2023-11-21 20:57:46,733 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (31 of 119 remaining) [2023-11-21 20:57:46,733 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err21ASSERT_VIOLATIONDATA_RACE (30 of 119 remaining) [2023-11-21 20:57:46,733 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err22ASSERT_VIOLATIONDATA_RACE (29 of 119 remaining) [2023-11-21 20:57:46,733 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONDATA_RACE (28 of 119 remaining) [2023-11-21 20:57:46,734 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err18ASSERT_VIOLATIONDATA_RACE (27 of 119 remaining) [2023-11-21 20:57:46,734 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err19ASSERT_VIOLATIONDATA_RACE (26 of 119 remaining) [2023-11-21 20:57:46,734 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err20ASSERT_VIOLATIONDATA_RACE (25 of 119 remaining) [2023-11-21 20:57:46,734 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (24 of 119 remaining) [2023-11-21 20:57:46,735 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (23 of 119 remaining) [2023-11-21 20:57:46,735 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (22 of 119 remaining) [2023-11-21 20:57:46,735 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (21 of 119 remaining) [2023-11-21 20:57:46,735 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (20 of 119 remaining) [2023-11-21 20:57:46,736 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (19 of 119 remaining) [2023-11-21 20:57:46,736 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (18 of 119 remaining) [2023-11-21 20:57:46,736 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (17 of 119 remaining) [2023-11-21 20:57:46,736 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (16 of 119 remaining) [2023-11-21 20:57:46,737 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (15 of 119 remaining) [2023-11-21 20:57:46,737 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (14 of 119 remaining) [2023-11-21 20:57:46,737 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (13 of 119 remaining) [2023-11-21 20:57:46,737 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (12 of 119 remaining) [2023-11-21 20:57:46,738 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (11 of 119 remaining) [2023-11-21 20:57:46,738 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (10 of 119 remaining) [2023-11-21 20:57:46,738 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (9 of 119 remaining) [2023-11-21 20:57:46,738 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (8 of 119 remaining) [2023-11-21 20:57:46,738 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (7 of 119 remaining) [2023-11-21 20:57:46,739 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONDATA_RACE (6 of 119 remaining) [2023-11-21 20:57:46,739 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err19ASSERT_VIOLATIONDATA_RACE (5 of 119 remaining) [2023-11-21 20:57:46,739 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err20ASSERT_VIOLATIONDATA_RACE (4 of 119 remaining) [2023-11-21 20:57:46,739 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err21ASSERT_VIOLATIONDATA_RACE (3 of 119 remaining) [2023-11-21 20:57:46,740 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err22ASSERT_VIOLATIONDATA_RACE (2 of 119 remaining) [2023-11-21 20:57:46,740 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err23ASSERT_VIOLATIONDATA_RACE (1 of 119 remaining) [2023-11-21 20:57:46,740 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err24ASSERT_VIOLATIONDATA_RACE (0 of 119 remaining) [2023-11-21 20:57:46,740 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2023-11-21 20:57:46,741 INFO L445 BasicCegarLoop]: Path program 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] [2023-11-21 20:57:46,749 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-21 20:57:46,749 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-21 20:57:46,759 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.11 08:57:46 BasicIcfg [2023-11-21 20:57:46,759 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-21 20:57:46,760 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-21 20:57:46,760 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-21 20:57:46,760 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-21 20:57:46,761 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 08:57:30" (3/4) ... [2023-11-21 20:57:46,764 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-11-21 20:57:46,767 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2023-11-21 20:57:46,767 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2023-11-21 20:57:46,784 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 22 nodes and edges [2023-11-21 20:57:46,785 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2023-11-21 20:57:46,786 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2023-11-21 20:57:46,787 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-11-21 20:57:46,926 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37004cbc-8420-4ff7-a302-61e012ab64f6/bin/uautomizer-verify-bycVGegfSx/witness.graphml [2023-11-21 20:57:46,927 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37004cbc-8420-4ff7-a302-61e012ab64f6/bin/uautomizer-verify-bycVGegfSx/witness.yml [2023-11-21 20:57:46,927 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-21 20:57:46,927 INFO L158 Benchmark]: Toolchain (without parser) took 18170.13ms. Allocated memory was 213.9MB in the beginning and 553.6MB in the end (delta: 339.7MB). Free memory was 179.9MB in the beginning and 431.2MB in the end (delta: -251.3MB). Peak memory consumption was 87.5MB. Max. memory is 16.1GB. [2023-11-21 20:57:46,928 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 121.6MB. Free memory is still 93.2MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-21 20:57:46,928 INFO L158 Benchmark]: CACSL2BoogieTranslator took 324.44ms. Allocated memory is still 213.9MB. Free memory was 179.7MB in the beginning and 171.0MB in the end (delta: 8.7MB). Peak memory consumption was 9.0MB. Max. memory is 16.1GB. [2023-11-21 20:57:46,929 INFO L158 Benchmark]: Boogie Procedure Inliner took 87.70ms. Allocated memory is still 213.9MB. Free memory was 171.0MB in the beginning and 167.9MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-21 20:57:46,929 INFO L158 Benchmark]: Boogie Preprocessor took 59.46ms. Allocated memory is still 213.9MB. Free memory was 167.9MB in the beginning and 164.8MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-21 20:57:46,930 INFO L158 Benchmark]: RCFGBuilder took 1659.87ms. Allocated memory is still 213.9MB. Free memory was 164.8MB in the beginning and 173.0MB in the end (delta: -8.2MB). Peak memory consumption was 74.6MB. Max. memory is 16.1GB. [2023-11-21 20:57:46,930 INFO L158 Benchmark]: TraceAbstraction took 15859.25ms. Allocated memory was 213.9MB in the beginning and 553.6MB in the end (delta: 339.7MB). Free memory was 173.0MB in the beginning and 438.5MB in the end (delta: -265.5MB). Peak memory consumption was 278.7MB. Max. memory is 16.1GB. [2023-11-21 20:57:46,930 INFO L158 Benchmark]: Witness Printer took 167.13ms. Allocated memory is still 553.6MB. Free memory was 438.5MB in the beginning and 431.2MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2023-11-21 20:57:46,933 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 121.6MB. Free memory is still 93.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 324.44ms. Allocated memory is still 213.9MB. Free memory was 179.7MB in the beginning and 171.0MB in the end (delta: 8.7MB). Peak memory consumption was 9.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 87.70ms. Allocated memory is still 213.9MB. Free memory was 171.0MB in the beginning and 167.9MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 59.46ms. Allocated memory is still 213.9MB. Free memory was 167.9MB in the beginning and 164.8MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1659.87ms. Allocated memory is still 213.9MB. Free memory was 164.8MB in the beginning and 173.0MB in the end (delta: -8.2MB). Peak memory consumption was 74.6MB. Max. memory is 16.1GB. * TraceAbstraction took 15859.25ms. Allocated memory was 213.9MB in the beginning and 553.6MB in the end (delta: 339.7MB). Free memory was 173.0MB in the beginning and 438.5MB in the end (delta: -265.5MB). Peak memory consumption was 278.7MB. Max. memory is 16.1GB. * Witness Printer took 167.13ms. Allocated memory is still 553.6MB. Free memory was 438.5MB in the beginning and 431.2MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 75]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 75]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 75]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 75]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 76]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 76]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 78]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 78]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 78]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 78]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 88]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 89]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 90]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 92]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 92]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 93]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 118]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 93]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 94]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 118]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 94]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 96]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 97]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 97]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 97]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 98]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 98]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 103]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 104]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 106]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 500 locations, 119 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 15.7s, OverallIterations: 27, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 10.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1476 SdHoareTripleChecker+Valid, 3.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 788 mSDsluCounter, 543 SdHoareTripleChecker+Invalid, 3.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 296 mSDsCounter, 399 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2767 IncrementalHoareTripleChecker+Invalid, 3166 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 399 mSolverCounterUnsat, 247 mSDtfsCounter, 2767 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 84 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=752occurred in iteration=0, InterpolantAutomatonStates: 103, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 4.3s InterpolantComputationTime, 3418 NumberOfCodeBlocks, 3418 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 3391 ConstructedInterpolants, 0 QuantifiedInterpolants, 4499 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 27 InterpolantComputations, 27 PerfectInterpolantSequences, 3/3 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 69 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2023-11-21 20:57:46,981 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37004cbc-8420-4ff7-a302-61e012ab64f6/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE