./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_37-indirect_racing.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/goblint-regression/28-race_reach_37-indirect_racing.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 78ae3f0dde82ce244d0cacebded5945a3f759d1f5aeba1d4553a1f59ef165385 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 14:33:25,859 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 14:33:25,937 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-11-10 14:33:25,944 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 14:33:25,944 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 14:33:25,990 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 14:33:25,990 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 14:33:25,991 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 14:33:25,992 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 14:33:25,995 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 14:33:25,996 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 14:33:25,996 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 14:33:25,996 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 14:33:25,996 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 14:33:25,996 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 14:33:25,997 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 14:33:25,997 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 14:33:25,997 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 14:33:25,997 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 14:33:25,997 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 14:33:25,998 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 14:33:25,999 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 14:33:26,000 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-10 14:33:26,000 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 14:33:26,000 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 14:33:26,000 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 14:33:26,000 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 14:33:26,001 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 14:33:26,001 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 14:33:26,001 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 14:33:26,001 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 14:33:26,001 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 14:33:26,002 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 14:33:26,002 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 14:33:26,002 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 14:33:26,002 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 14:33:26,002 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 14:33:26,002 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 14:33:26,003 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 14:33:26,003 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 14:33:26,003 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 14:33:26,005 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:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> 78ae3f0dde82ce244d0cacebded5945a3f759d1f5aeba1d4553a1f59ef165385 [2024-11-10 14:33:26,235 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 14:33:26,258 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 14:33:26,262 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 14:33:26,263 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 14:33:26,264 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 14:33:26,265 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/28-race_reach_37-indirect_racing.i [2024-11-10 14:33:27,675 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 14:33:27,948 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 14:33:27,949 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_37-indirect_racing.i [2024-11-10 14:33:27,969 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/93873c3a9/0f3aa4e8da874343b74dff1ff29a6b4e/FLAGae868c48a [2024-11-10 14:33:28,246 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/93873c3a9/0f3aa4e8da874343b74dff1ff29a6b4e [2024-11-10 14:33:28,248 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 14:33:28,249 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 14:33:28,251 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 14:33:28,251 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 14:33:28,255 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 14:33:28,255 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 02:33:28" (1/1) ... [2024-11-10 14:33:28,256 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40febe67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:33:28, skipping insertion in model container [2024-11-10 14:33:28,256 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 02:33:28" (1/1) ... [2024-11-10 14:33:28,302 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 14:33:28,679 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 14:33:28,699 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 14:33:28,768 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 14:33:28,804 INFO L204 MainTranslator]: Completed translation [2024-11-10 14:33:28,805 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:33:28 WrapperNode [2024-11-10 14:33:28,805 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 14:33:28,806 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 14:33:28,806 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 14:33:28,806 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 14:33:28,813 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:33:28" (1/1) ... [2024-11-10 14:33:28,828 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:33:28" (1/1) ... [2024-11-10 14:33:28,858 INFO L138 Inliner]: procedures = 171, calls = 41, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 105 [2024-11-10 14:33:28,859 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 14:33:28,859 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 14:33:28,859 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 14:33:28,860 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 14:33:28,868 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:33:28" (1/1) ... [2024-11-10 14:33:28,869 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:33:28" (1/1) ... [2024-11-10 14:33:28,873 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:33:28" (1/1) ... [2024-11-10 14:33:28,874 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:33:28" (1/1) ... [2024-11-10 14:33:28,884 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:33:28" (1/1) ... [2024-11-10 14:33:28,885 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:33:28" (1/1) ... [2024-11-10 14:33:28,888 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:33:28" (1/1) ... [2024-11-10 14:33:28,889 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:33:28" (1/1) ... [2024-11-10 14:33:28,896 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 14:33:28,897 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 14:33:28,897 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 14:33:28,897 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 14:33:28,898 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:33:28" (1/1) ... [2024-11-10 14:33:28,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 14:33:28,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 14:33:28,927 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 14:33:28,929 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 14:33:28,971 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-10 14:33:28,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-10 14:33:28,971 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-10 14:33:28,971 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 14:33:28,971 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-10 14:33:28,971 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2024-11-10 14:33:28,972 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2024-11-10 14:33:28,972 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-10 14:33:28,972 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-10 14:33:28,972 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-10 14:33:28,973 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 14:33:28,973 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 14:33:28,975 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-10 14:33:29,100 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 14:33:29,102 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 14:33:29,302 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L709: havoc main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset; [2024-11-10 14:33:29,302 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L709-1: SUMMARY for call ULTIMATE.dealloc(main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset); srcloc: null [2024-11-10 14:33:29,411 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-10 14:33:29,411 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 14:33:29,450 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 14:33:29,451 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 14:33:29,451 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 02:33:29 BoogieIcfgContainer [2024-11-10 14:33:29,451 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 14:33:29,454 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 14:33:29,454 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 14:33:29,457 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 14:33:29,458 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 02:33:28" (1/3) ... [2024-11-10 14:33:29,459 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e779e4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 02:33:29, skipping insertion in model container [2024-11-10 14:33:29,459 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:33:28" (2/3) ... [2024-11-10 14:33:29,460 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e779e4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 02:33:29, skipping insertion in model container [2024-11-10 14:33:29,461 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 02:33:29" (3/3) ... [2024-11-10 14:33:29,462 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_37-indirect_racing.i [2024-11-10 14:33:29,476 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 14:33:29,476 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 13 error locations. [2024-11-10 14:33:29,476 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-10 14:33:29,549 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-11-10 14:33:29,592 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 180 places, 190 transitions, 387 flow [2024-11-10 14:33:29,743 INFO L124 PetriNetUnfolderBase]: 19/256 cut-off events. [2024-11-10 14:33:29,745 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-10 14:33:29,755 INFO L83 FinitePrefix]: Finished finitePrefix Result has 261 conditions, 256 events. 19/256 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 774 event pairs, 0 based on Foata normal form. 0/217 useless extension candidates. Maximal degree in co-relation 140. Up to 4 conditions per place. [2024-11-10 14:33:29,757 INFO L82 GeneralOperation]: Start removeDead. Operand has 180 places, 190 transitions, 387 flow [2024-11-10 14:33:29,766 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 180 places, 190 transitions, 387 flow [2024-11-10 14:33:29,780 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 14:33:29,790 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@7c8f4b5f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 14:33:29,791 INFO L334 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2024-11-10 14:33:29,802 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-10 14:33:29,802 INFO L124 PetriNetUnfolderBase]: 0/31 cut-off events. [2024-11-10 14:33:29,802 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-10 14:33:29,803 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:33:29,804 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:33:29,805 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2024-11-10 14:33:29,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:33:29,811 INFO L85 PathProgramCache]: Analyzing trace with hash -2005194567, now seen corresponding path program 1 times [2024-11-10 14:33:29,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:33:29,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297595957] [2024-11-10 14:33:29,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:33:29,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:33:29,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:33:30,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:33:30,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:33:30,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297595957] [2024-11-10 14:33:30,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297595957] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:33:30,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:33:30,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:33:30,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561707796] [2024-11-10 14:33:30,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:33:30,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:33:30,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:33:30,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:33:30,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:33:30,135 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 190 [2024-11-10 14:33:30,142 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 190 transitions, 387 flow. Second operand has 3 states, 3 states have (on average 159.33333333333334) internal successors, (478), 3 states have internal predecessors, (478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:33:30,143 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:33:30,143 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 190 [2024-11-10 14:33:30,145 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:33:30,309 INFO L124 PetriNetUnfolderBase]: 25/513 cut-off events. [2024-11-10 14:33:30,310 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-10 14:33:30,314 INFO L83 FinitePrefix]: Finished finitePrefix Result has 589 conditions, 513 events. 25/513 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 2034 event pairs, 24 based on Foata normal form. 71/532 useless extension candidates. Maximal degree in co-relation 464. Up to 69 conditions per place. [2024-11-10 14:33:30,318 INFO L140 encePairwiseOnDemand]: 175/190 looper letters, 16 selfloop transitions, 2 changer transitions 0/175 dead transitions. [2024-11-10 14:33:30,319 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 175 transitions, 393 flow [2024-11-10 14:33:30,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:33:30,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:33:30,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 505 transitions. [2024-11-10 14:33:30,336 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8859649122807017 [2024-11-10 14:33:30,338 INFO L175 Difference]: Start difference. First operand has 180 places, 190 transitions, 387 flow. Second operand 3 states and 505 transitions. [2024-11-10 14:33:30,338 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 175 transitions, 393 flow [2024-11-10 14:33:30,342 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 175 transitions, 393 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-10 14:33:30,347 INFO L231 Difference]: Finished difference. Result has 179 places, 175 transitions, 361 flow [2024-11-10 14:33:30,349 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=190, PETRI_DIFFERENCE_MINUEND_FLOW=357, PETRI_DIFFERENCE_MINUEND_PLACES=177, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=175, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=173, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=361, PETRI_PLACES=179, PETRI_TRANSITIONS=175} [2024-11-10 14:33:30,355 INFO L277 CegarLoopForPetriNet]: 180 programPoint places, -1 predicate places. [2024-11-10 14:33:30,356 INFO L471 AbstractCegarLoop]: Abstraction has has 179 places, 175 transitions, 361 flow [2024-11-10 14:33:30,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 159.33333333333334) internal successors, (478), 3 states have internal predecessors, (478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:33:30,358 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:33:30,358 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:33:30,359 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 14:33:30,359 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2024-11-10 14:33:30,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:33:30,360 INFO L85 PathProgramCache]: Analyzing trace with hash 1448343512, now seen corresponding path program 1 times [2024-11-10 14:33:30,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:33:30,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43563793] [2024-11-10 14:33:30,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:33:30,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:33:30,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:33:30,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:33:30,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:33:30,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43563793] [2024-11-10 14:33:30,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43563793] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:33:30,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:33:30,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:33:30,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415902311] [2024-11-10 14:33:30,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:33:30,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:33:30,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:33:30,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:33:30,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:33:30,480 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 190 [2024-11-10 14:33:30,481 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 175 transitions, 361 flow. Second operand has 3 states, 3 states have (on average 161.0) internal successors, (483), 3 states have internal predecessors, (483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:33:30,481 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:33:30,481 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 190 [2024-11-10 14:33:30,482 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:33:30,585 INFO L124 PetriNetUnfolderBase]: 25/510 cut-off events. [2024-11-10 14:33:30,586 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-11-10 14:33:30,587 INFO L83 FinitePrefix]: Finished finitePrefix Result has 586 conditions, 510 events. 25/510 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 2007 event pairs, 24 based on Foata normal form. 0/463 useless extension candidates. Maximal degree in co-relation 546. Up to 66 conditions per place. [2024-11-10 14:33:30,590 INFO L140 encePairwiseOnDemand]: 187/190 looper letters, 14 selfloop transitions, 1 changer transitions 0/173 dead transitions. [2024-11-10 14:33:30,590 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 173 transitions, 387 flow [2024-11-10 14:33:30,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:33:30,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:33:30,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 497 transitions. [2024-11-10 14:33:30,595 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8719298245614036 [2024-11-10 14:33:30,596 INFO L175 Difference]: Start difference. First operand has 179 places, 175 transitions, 361 flow. Second operand 3 states and 497 transitions. [2024-11-10 14:33:30,596 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 173 transitions, 387 flow [2024-11-10 14:33:30,597 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 173 transitions, 383 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:33:30,601 INFO L231 Difference]: Finished difference. Result has 177 places, 173 transitions, 355 flow [2024-11-10 14:33:30,602 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=190, PETRI_DIFFERENCE_MINUEND_FLOW=353, PETRI_DIFFERENCE_MINUEND_PLACES=175, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=173, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=172, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=355, PETRI_PLACES=177, PETRI_TRANSITIONS=173} [2024-11-10 14:33:30,602 INFO L277 CegarLoopForPetriNet]: 180 programPoint places, -3 predicate places. [2024-11-10 14:33:30,603 INFO L471 AbstractCegarLoop]: Abstraction has has 177 places, 173 transitions, 355 flow [2024-11-10 14:33:30,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 161.0) internal successors, (483), 3 states have internal predecessors, (483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:33:30,604 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:33:30,604 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:33:30,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 14:33:30,604 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2024-11-10 14:33:30,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:33:30,606 INFO L85 PathProgramCache]: Analyzing trace with hash -1714640710, now seen corresponding path program 1 times [2024-11-10 14:33:30,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:33:30,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852772669] [2024-11-10 14:33:30,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:33:30,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:33:30,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:33:30,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:33:30,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:33:30,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852772669] [2024-11-10 14:33:30,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1852772669] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:33:30,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:33:30,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:33:30,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291357973] [2024-11-10 14:33:30,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:33:30,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:33:30,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:33:30,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:33:30,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:33:30,723 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 190 [2024-11-10 14:33:30,724 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 173 transitions, 355 flow. Second operand has 3 states, 3 states have (on average 159.33333333333334) internal successors, (478), 3 states have internal predecessors, (478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:33:30,724 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:33:30,724 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 190 [2024-11-10 14:33:30,724 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:33:30,805 INFO L124 PetriNetUnfolderBase]: 25/445 cut-off events. [2024-11-10 14:33:30,806 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-10 14:33:30,807 INFO L83 FinitePrefix]: Finished finitePrefix Result has 522 conditions, 445 events. 25/445 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1698 event pairs, 24 based on Foata normal form. 0/401 useless extension candidates. Maximal degree in co-relation 484. Up to 68 conditions per place. [2024-11-10 14:33:30,809 INFO L140 encePairwiseOnDemand]: 187/190 looper letters, 16 selfloop transitions, 2 changer transitions 0/172 dead transitions. [2024-11-10 14:33:30,809 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 172 transitions, 389 flow [2024-11-10 14:33:30,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:33:30,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:33:30,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 493 transitions. [2024-11-10 14:33:30,812 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8649122807017544 [2024-11-10 14:33:30,812 INFO L175 Difference]: Start difference. First operand has 177 places, 173 transitions, 355 flow. Second operand 3 states and 493 transitions. [2024-11-10 14:33:30,812 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 172 transitions, 389 flow [2024-11-10 14:33:30,815 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 172 transitions, 388 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-10 14:33:30,818 INFO L231 Difference]: Finished difference. Result has 177 places, 172 transitions, 356 flow [2024-11-10 14:33:30,820 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=190, PETRI_DIFFERENCE_MINUEND_FLOW=352, PETRI_DIFFERENCE_MINUEND_PLACES=175, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=172, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=170, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=356, PETRI_PLACES=177, PETRI_TRANSITIONS=172} [2024-11-10 14:33:30,821 INFO L277 CegarLoopForPetriNet]: 180 programPoint places, -3 predicate places. [2024-11-10 14:33:30,824 INFO L471 AbstractCegarLoop]: Abstraction has has 177 places, 172 transitions, 356 flow [2024-11-10 14:33:30,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 159.33333333333334) internal successors, (478), 3 states have internal predecessors, (478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:33:30,825 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:33:30,825 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:33:30,825 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 14:33:30,826 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2024-11-10 14:33:30,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:33:30,826 INFO L85 PathProgramCache]: Analyzing trace with hash -622437038, now seen corresponding path program 1 times [2024-11-10 14:33:30,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:33:30,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180817154] [2024-11-10 14:33:30,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:33:30,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:33:30,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:33:31,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:33:31,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:33:31,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180817154] [2024-11-10 14:33:31,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [180817154] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:33:31,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:33:31,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 14:33:31,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109221244] [2024-11-10 14:33:31,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:33:31,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 14:33:31,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:33:31,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 14:33:31,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-10 14:33:31,698 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 190 [2024-11-10 14:33:31,700 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 172 transitions, 356 flow. Second operand has 6 states, 6 states have (on average 130.5) internal successors, (783), 6 states have internal predecessors, (783), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:33:31,700 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:33:31,700 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 190 [2024-11-10 14:33:31,700 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:33:32,138 INFO L124 PetriNetUnfolderBase]: 535/2141 cut-off events. [2024-11-10 14:33:32,139 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-10 14:33:32,142 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3311 conditions, 2141 events. 535/2141 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 15016 event pairs, 315 based on Foata normal form. 0/1968 useless extension candidates. Maximal degree in co-relation 3273. Up to 988 conditions per place. [2024-11-10 14:33:32,150 INFO L140 encePairwiseOnDemand]: 167/190 looper letters, 71 selfloop transitions, 70 changer transitions 0/265 dead transitions. [2024-11-10 14:33:32,150 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 265 transitions, 824 flow [2024-11-10 14:33:32,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 14:33:32,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-10 14:33:32,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 916 transitions. [2024-11-10 14:33:32,153 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8035087719298246 [2024-11-10 14:33:32,153 INFO L175 Difference]: Start difference. First operand has 177 places, 172 transitions, 356 flow. Second operand 6 states and 916 transitions. [2024-11-10 14:33:32,153 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 265 transitions, 824 flow [2024-11-10 14:33:32,156 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 265 transitions, 820 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:33:32,161 INFO L231 Difference]: Finished difference. Result has 185 places, 241 transitions, 814 flow [2024-11-10 14:33:32,162 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=190, PETRI_DIFFERENCE_MINUEND_FLOW=352, PETRI_DIFFERENCE_MINUEND_PLACES=175, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=172, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=150, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=814, PETRI_PLACES=185, PETRI_TRANSITIONS=241} [2024-11-10 14:33:32,163 INFO L277 CegarLoopForPetriNet]: 180 programPoint places, 5 predicate places. [2024-11-10 14:33:32,163 INFO L471 AbstractCegarLoop]: Abstraction has has 185 places, 241 transitions, 814 flow [2024-11-10 14:33:32,164 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 130.5) internal successors, (783), 6 states have internal predecessors, (783), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:33:32,164 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:33:32,164 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:33:32,164 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 14:33:32,164 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2024-11-10 14:33:32,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:33:32,165 INFO L85 PathProgramCache]: Analyzing trace with hash -979130134, now seen corresponding path program 1 times [2024-11-10 14:33:32,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:33:32,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76694854] [2024-11-10 14:33:32,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:33:32,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:33:32,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:33:32,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:33:32,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:33:32,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76694854] [2024-11-10 14:33:32,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [76694854] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:33:32,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:33:32,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 14:33:32,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156112184] [2024-11-10 14:33:32,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:33:32,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:33:32,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:33:32,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:33:32,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:33:32,242 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 161 out of 190 [2024-11-10 14:33:32,243 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 241 transitions, 814 flow. Second operand has 3 states, 3 states have (on average 162.66666666666666) internal successors, (488), 3 states have internal predecessors, (488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:33:32,243 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:33:32,243 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 190 [2024-11-10 14:33:32,243 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:33:32,376 INFO L124 PetriNetUnfolderBase]: 176/1109 cut-off events. [2024-11-10 14:33:32,377 INFO L125 PetriNetUnfolderBase]: For 104/107 co-relation queries the response was YES. [2024-11-10 14:33:32,380 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1786 conditions, 1109 events. 176/1109 cut-off events. For 104/107 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 6340 event pairs, 20 based on Foata normal form. 1/1033 useless extension candidates. Maximal degree in co-relation 1744. Up to 191 conditions per place. [2024-11-10 14:33:32,385 INFO L140 encePairwiseOnDemand]: 187/190 looper letters, 20 selfloop transitions, 3 changer transitions 0/247 dead transitions. [2024-11-10 14:33:32,385 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 247 transitions, 872 flow [2024-11-10 14:33:32,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:33:32,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:33:32,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 506 transitions. [2024-11-10 14:33:32,387 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.887719298245614 [2024-11-10 14:33:32,387 INFO L175 Difference]: Start difference. First operand has 185 places, 241 transitions, 814 flow. Second operand 3 states and 506 transitions. [2024-11-10 14:33:32,387 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 247 transitions, 872 flow [2024-11-10 14:33:32,392 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 247 transitions, 872 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-10 14:33:32,395 INFO L231 Difference]: Finished difference. Result has 188 places, 241 transitions, 825 flow [2024-11-10 14:33:32,395 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=190, PETRI_DIFFERENCE_MINUEND_FLOW=814, PETRI_DIFFERENCE_MINUEND_PLACES=185, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=241, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=238, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=825, PETRI_PLACES=188, PETRI_TRANSITIONS=241} [2024-11-10 14:33:32,396 INFO L277 CegarLoopForPetriNet]: 180 programPoint places, 8 predicate places. [2024-11-10 14:33:32,396 INFO L471 AbstractCegarLoop]: Abstraction has has 188 places, 241 transitions, 825 flow [2024-11-10 14:33:32,397 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 162.66666666666666) internal successors, (488), 3 states have internal predecessors, (488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:33:32,397 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:33:32,397 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:33:32,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 14:33:32,398 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2024-11-10 14:33:32,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:33:32,398 INFO L85 PathProgramCache]: Analyzing trace with hash -1018829868, now seen corresponding path program 1 times [2024-11-10 14:33:32,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:33:32,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359375496] [2024-11-10 14:33:32,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:33:32,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:33:32,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:33:32,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:33:32,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:33:32,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359375496] [2024-11-10 14:33:32,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359375496] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:33:32,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:33:32,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:33:32,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546891116] [2024-11-10 14:33:32,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:33:32,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:33:32,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:33:32,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:33:32,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:33:32,461 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 190 [2024-11-10 14:33:32,462 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 241 transitions, 825 flow. Second operand has 3 states, 3 states have (on average 162.0) internal successors, (486), 3 states have internal predecessors, (486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:33:32,462 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:33:32,462 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 190 [2024-11-10 14:33:32,462 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:33:32,573 INFO L124 PetriNetUnfolderBase]: 160/911 cut-off events. [2024-11-10 14:33:32,573 INFO L125 PetriNetUnfolderBase]: For 94/99 co-relation queries the response was YES. [2024-11-10 14:33:32,576 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1583 conditions, 911 events. 160/911 cut-off events. For 94/99 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 4957 event pairs, 4 based on Foata normal form. 0/863 useless extension candidates. Maximal degree in co-relation 1540. Up to 221 conditions per place. [2024-11-10 14:33:32,579 INFO L140 encePairwiseOnDemand]: 187/190 looper letters, 16 selfloop transitions, 1 changer transitions 0/241 dead transitions. [2024-11-10 14:33:32,579 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 241 transitions, 859 flow [2024-11-10 14:33:32,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:33:32,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:33:32,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 499 transitions. [2024-11-10 14:33:32,581 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.875438596491228 [2024-11-10 14:33:32,581 INFO L175 Difference]: Start difference. First operand has 188 places, 241 transitions, 825 flow. Second operand 3 states and 499 transitions. [2024-11-10 14:33:32,581 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 241 transitions, 859 flow [2024-11-10 14:33:32,585 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 186 places, 241 transitions, 853 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:33:32,588 INFO L231 Difference]: Finished difference. Result has 186 places, 239 transitions, 817 flow [2024-11-10 14:33:32,588 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=190, PETRI_DIFFERENCE_MINUEND_FLOW=815, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=239, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=238, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=817, PETRI_PLACES=186, PETRI_TRANSITIONS=239} [2024-11-10 14:33:32,589 INFO L277 CegarLoopForPetriNet]: 180 programPoint places, 6 predicate places. [2024-11-10 14:33:32,589 INFO L471 AbstractCegarLoop]: Abstraction has has 186 places, 239 transitions, 817 flow [2024-11-10 14:33:32,590 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 162.0) internal successors, (486), 3 states have internal predecessors, (486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:33:32,590 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:33:32,590 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:33:32,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 14:33:32,591 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2024-11-10 14:33:32,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:33:32,591 INFO L85 PathProgramCache]: Analyzing trace with hash 771199722, now seen corresponding path program 1 times [2024-11-10 14:33:32,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:33:32,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858270973] [2024-11-10 14:33:32,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:33:32,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:33:32,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 14:33:32,618 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 14:33:32,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 14:33:32,669 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 14:33:32,670 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 14:33:32,671 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (19 of 20 remaining) [2024-11-10 14:33:32,672 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (18 of 20 remaining) [2024-11-10 14:33:32,673 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (17 of 20 remaining) [2024-11-10 14:33:32,673 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (16 of 20 remaining) [2024-11-10 14:33:32,675 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (15 of 20 remaining) [2024-11-10 14:33:32,678 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (14 of 20 remaining) [2024-11-10 14:33:32,678 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (13 of 20 remaining) [2024-11-10 14:33:32,678 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (12 of 20 remaining) [2024-11-10 14:33:32,678 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5ASSERT_VIOLATIONDATA_RACE (11 of 20 remaining) [2024-11-10 14:33:32,678 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (10 of 20 remaining) [2024-11-10 14:33:32,679 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONDATA_RACE (9 of 20 remaining) [2024-11-10 14:33:32,679 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (8 of 20 remaining) [2024-11-10 14:33:32,679 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (7 of 20 remaining) [2024-11-10 14:33:32,679 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (6 of 20 remaining) [2024-11-10 14:33:32,679 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5ASSERT_VIOLATIONDATA_RACE (5 of 20 remaining) [2024-11-10 14:33:32,679 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (4 of 20 remaining) [2024-11-10 14:33:32,679 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONDATA_RACE (3 of 20 remaining) [2024-11-10 14:33:32,679 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (2 of 20 remaining) [2024-11-10 14:33:32,679 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (1 of 20 remaining) [2024-11-10 14:33:32,680 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (0 of 20 remaining) [2024-11-10 14:33:32,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 14:33:32,681 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:33:32,684 WARN L244 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-10 14:33:32,685 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-11-10 14:33:32,733 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-10 14:33:32,739 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 248 places, 263 transitions, 542 flow [2024-11-10 14:33:32,785 INFO L124 PetriNetUnfolderBase]: 34/424 cut-off events. [2024-11-10 14:33:32,786 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-11-10 14:33:32,789 INFO L83 FinitePrefix]: Finished finitePrefix Result has 436 conditions, 424 events. 34/424 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1618 event pairs, 0 based on Foata normal form. 0/358 useless extension candidates. Maximal degree in co-relation 258. Up to 8 conditions per place. [2024-11-10 14:33:32,789 INFO L82 GeneralOperation]: Start removeDead. Operand has 248 places, 263 transitions, 542 flow [2024-11-10 14:33:32,793 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 248 places, 263 transitions, 542 flow [2024-11-10 14:33:32,795 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 14:33:32,795 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@7c8f4b5f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 14:33:32,795 INFO L334 AbstractCegarLoop]: Starting to check reachability of 26 error locations. [2024-11-10 14:33:32,797 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-10 14:33:32,798 INFO L124 PetriNetUnfolderBase]: 0/31 cut-off events. [2024-11-10 14:33:32,798 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-10 14:33:32,798 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:33:32,798 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:33:32,798 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2024-11-10 14:33:32,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:33:32,798 INFO L85 PathProgramCache]: Analyzing trace with hash -1588242272, now seen corresponding path program 1 times [2024-11-10 14:33:32,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:33:32,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260722266] [2024-11-10 14:33:32,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:33:32,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:33:32,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:33:32,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:33:32,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:33:32,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260722266] [2024-11-10 14:33:32,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260722266] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:33:32,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:33:32,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:33:32,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123389881] [2024-11-10 14:33:32,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:33:32,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:33:32,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:33:32,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:33:32,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:33:32,835 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 217 out of 263 [2024-11-10 14:33:32,836 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 248 places, 263 transitions, 542 flow. Second operand has 3 states, 3 states have (on average 218.33333333333334) internal successors, (655), 3 states have internal predecessors, (655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:33:32,836 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:33:32,836 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 217 of 263 [2024-11-10 14:33:32,837 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:33:33,459 INFO L124 PetriNetUnfolderBase]: 430/3807 cut-off events. [2024-11-10 14:33:33,459 INFO L125 PetriNetUnfolderBase]: For 74/74 co-relation queries the response was YES. [2024-11-10 14:33:33,470 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4591 conditions, 3807 events. 430/3807 cut-off events. For 74/74 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 33108 event pairs, 420 based on Foata normal form. 782/4204 useless extension candidates. Maximal degree in co-relation 3805. Up to 739 conditions per place. [2024-11-10 14:33:33,485 INFO L140 encePairwiseOnDemand]: 242/263 looper letters, 24 selfloop transitions, 2 changer transitions 0/242 dead transitions. [2024-11-10 14:33:33,486 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 247 places, 242 transitions, 552 flow [2024-11-10 14:33:33,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:33:33,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:33:33,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 696 transitions. [2024-11-10 14:33:33,489 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8821292775665399 [2024-11-10 14:33:33,489 INFO L175 Difference]: Start difference. First operand has 248 places, 263 transitions, 542 flow. Second operand 3 states and 696 transitions. [2024-11-10 14:33:33,489 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 247 places, 242 transitions, 552 flow [2024-11-10 14:33:33,491 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 247 places, 242 transitions, 552 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-10 14:33:33,494 INFO L231 Difference]: Finished difference. Result has 247 places, 242 transitions, 504 flow [2024-11-10 14:33:33,494 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=500, PETRI_DIFFERENCE_MINUEND_PLACES=245, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=242, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=240, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=504, PETRI_PLACES=247, PETRI_TRANSITIONS=242} [2024-11-10 14:33:33,495 INFO L277 CegarLoopForPetriNet]: 248 programPoint places, -1 predicate places. [2024-11-10 14:33:33,495 INFO L471 AbstractCegarLoop]: Abstraction has has 247 places, 242 transitions, 504 flow [2024-11-10 14:33:33,496 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 218.33333333333334) internal successors, (655), 3 states have internal predecessors, (655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:33:33,496 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:33:33,496 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:33:33,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 14:33:33,497 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2024-11-10 14:33:33,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:33:33,498 INFO L85 PathProgramCache]: Analyzing trace with hash -1587418401, now seen corresponding path program 1 times [2024-11-10 14:33:33,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:33:33,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348811933] [2024-11-10 14:33:33,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:33:33,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:33:33,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:33:33,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:33:33,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:33:33,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348811933] [2024-11-10 14:33:33,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348811933] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:33:33,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:33:33,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:33:33,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613661376] [2024-11-10 14:33:33,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:33:33,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:33:33,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:33:33,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:33:33,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:33:33,537 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 219 out of 263 [2024-11-10 14:33:33,539 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 247 places, 242 transitions, 504 flow. Second operand has 3 states, 3 states have (on average 220.0) internal successors, (660), 3 states have internal predecessors, (660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:33:33,539 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:33:33,539 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 219 of 263 [2024-11-10 14:33:33,539 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:33:34,095 INFO L124 PetriNetUnfolderBase]: 418/3739 cut-off events. [2024-11-10 14:33:34,095 INFO L125 PetriNetUnfolderBase]: For 76/76 co-relation queries the response was YES. [2024-11-10 14:33:34,107 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4504 conditions, 3739 events. 418/3739 cut-off events. For 76/76 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 32234 event pairs, 414 based on Foata normal form. 0/3375 useless extension candidates. Maximal degree in co-relation 4463. Up to 717 conditions per place. [2024-11-10 14:33:34,123 INFO L140 encePairwiseOnDemand]: 260/263 looper letters, 22 selfloop transitions, 1 changer transitions 0/240 dead transitions. [2024-11-10 14:33:34,123 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 247 places, 240 transitions, 546 flow [2024-11-10 14:33:34,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:33:34,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:33:34,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 682 transitions. [2024-11-10 14:33:34,128 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8643852978453739 [2024-11-10 14:33:34,128 INFO L175 Difference]: Start difference. First operand has 247 places, 242 transitions, 504 flow. Second operand 3 states and 682 transitions. [2024-11-10 14:33:34,128 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 247 places, 240 transitions, 546 flow [2024-11-10 14:33:34,130 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 245 places, 240 transitions, 542 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:33:34,132 INFO L231 Difference]: Finished difference. Result has 245 places, 240 transitions, 498 flow [2024-11-10 14:33:34,133 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=496, PETRI_DIFFERENCE_MINUEND_PLACES=243, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=240, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=239, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=498, PETRI_PLACES=245, PETRI_TRANSITIONS=240} [2024-11-10 14:33:34,134 INFO L277 CegarLoopForPetriNet]: 248 programPoint places, -3 predicate places. [2024-11-10 14:33:34,134 INFO L471 AbstractCegarLoop]: Abstraction has has 245 places, 240 transitions, 498 flow [2024-11-10 14:33:34,135 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 220.0) internal successors, (660), 3 states have internal predecessors, (660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:33:34,135 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:33:34,136 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:33:34,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 14:33:34,136 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2024-11-10 14:33:34,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:33:34,136 INFO L85 PathProgramCache]: Analyzing trace with hash -142128639, now seen corresponding path program 1 times [2024-11-10 14:33:34,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:33:34,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060988132] [2024-11-10 14:33:34,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:33:34,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:33:34,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:33:34,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:33:34,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:33:34,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060988132] [2024-11-10 14:33:34,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2060988132] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:33:34,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:33:34,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:33:34,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638576789] [2024-11-10 14:33:34,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:33:34,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:33:34,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:33:34,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:33:34,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:33:34,191 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 215 out of 263 [2024-11-10 14:33:34,193 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 245 places, 240 transitions, 498 flow. Second operand has 3 states, 3 states have (on average 216.33333333333334) internal successors, (649), 3 states have internal predecessors, (649), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:33:34,193 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:33:34,193 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 215 of 263 [2024-11-10 14:33:34,193 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:33:34,700 INFO L124 PetriNetUnfolderBase]: 564/3910 cut-off events. [2024-11-10 14:33:34,700 INFO L125 PetriNetUnfolderBase]: For 92/92 co-relation queries the response was YES. [2024-11-10 14:33:34,715 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4924 conditions, 3910 events. 564/3910 cut-off events. For 92/92 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 35200 event pairs, 552 based on Foata normal form. 0/3517 useless extension candidates. Maximal degree in co-relation 4885. Up to 957 conditions per place. [2024-11-10 14:33:34,734 INFO L140 encePairwiseOnDemand]: 260/263 looper letters, 26 selfloop transitions, 2 changer transitions 0/239 dead transitions. [2024-11-10 14:33:34,734 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 246 places, 239 transitions, 552 flow [2024-11-10 14:33:34,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:33:34,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:33:34,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 674 transitions. [2024-11-10 14:33:34,736 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8542458808618505 [2024-11-10 14:33:34,736 INFO L175 Difference]: Start difference. First operand has 245 places, 240 transitions, 498 flow. Second operand 3 states and 674 transitions. [2024-11-10 14:33:34,737 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 246 places, 239 transitions, 552 flow [2024-11-10 14:33:34,738 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 245 places, 239 transitions, 551 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-10 14:33:34,741 INFO L231 Difference]: Finished difference. Result has 245 places, 239 transitions, 499 flow [2024-11-10 14:33:34,741 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=495, PETRI_DIFFERENCE_MINUEND_PLACES=243, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=239, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=237, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=499, PETRI_PLACES=245, PETRI_TRANSITIONS=239} [2024-11-10 14:33:34,742 INFO L277 CegarLoopForPetriNet]: 248 programPoint places, -3 predicate places. [2024-11-10 14:33:34,743 INFO L471 AbstractCegarLoop]: Abstraction has has 245 places, 239 transitions, 499 flow [2024-11-10 14:33:34,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 216.33333333333334) internal successors, (649), 3 states have internal predecessors, (649), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:33:34,744 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:33:34,744 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:33:34,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-10 14:33:34,745 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2024-11-10 14:33:34,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:33:34,745 INFO L85 PathProgramCache]: Analyzing trace with hash -895738862, now seen corresponding path program 1 times [2024-11-10 14:33:34,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:33:34,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804033554] [2024-11-10 14:33:34,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:33:34,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:33:34,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:33:35,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:33:35,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:33:35,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804033554] [2024-11-10 14:33:35,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804033554] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:33:35,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:33:35,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 14:33:35,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556843960] [2024-11-10 14:33:35,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:33:35,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 14:33:35,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:33:35,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 14:33:35,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-10 14:33:35,416 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 172 out of 263 [2024-11-10 14:33:35,418 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 245 places, 239 transitions, 499 flow. Second operand has 6 states, 6 states have (on average 173.5) internal successors, (1041), 6 states have internal predecessors, (1041), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:33:35,418 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:33:35,418 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 172 of 263 [2024-11-10 14:33:35,418 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:33:42,699 INFO L124 PetriNetUnfolderBase]: 27082/64911 cut-off events. [2024-11-10 14:33:42,700 INFO L125 PetriNetUnfolderBase]: For 714/714 co-relation queries the response was YES. [2024-11-10 14:33:42,860 INFO L83 FinitePrefix]: Finished finitePrefix Result has 107275 conditions, 64911 events. 27082/64911 cut-off events. For 714/714 co-relation queries the response was YES. Maximal size of possible extension queue 1107. Compared 728005 event pairs, 17233 based on Foata normal form. 0/60635 useless extension candidates. Maximal degree in co-relation 107236. Up to 37373 conditions per place. [2024-11-10 14:33:43,319 INFO L140 encePairwiseOnDemand]: 224/263 looper letters, 120 selfloop transitions, 134 changer transitions 0/421 dead transitions. [2024-11-10 14:33:43,320 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 250 places, 421 transitions, 1376 flow [2024-11-10 14:33:43,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 14:33:43,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-10 14:33:43,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1287 transitions. [2024-11-10 14:33:43,323 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8155893536121673 [2024-11-10 14:33:43,323 INFO L175 Difference]: Start difference. First operand has 245 places, 239 transitions, 499 flow. Second operand 6 states and 1287 transitions. [2024-11-10 14:33:43,323 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 250 places, 421 transitions, 1376 flow [2024-11-10 14:33:43,340 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 248 places, 421 transitions, 1372 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:33:43,345 INFO L231 Difference]: Finished difference. Result has 253 places, 372 transitions, 1373 flow [2024-11-10 14:33:43,346 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=495, PETRI_DIFFERENCE_MINUEND_PLACES=243, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=239, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=201, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1373, PETRI_PLACES=253, PETRI_TRANSITIONS=372} [2024-11-10 14:33:43,348 INFO L277 CegarLoopForPetriNet]: 248 programPoint places, 5 predicate places. [2024-11-10 14:33:43,348 INFO L471 AbstractCegarLoop]: Abstraction has has 253 places, 372 transitions, 1373 flow [2024-11-10 14:33:43,349 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 173.5) internal successors, (1041), 6 states have internal predecessors, (1041), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:33:43,349 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:33:43,349 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:33:43,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-10 14:33:43,349 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2024-11-10 14:33:43,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:33:43,350 INFO L85 PathProgramCache]: Analyzing trace with hash 344485457, now seen corresponding path program 1 times [2024-11-10 14:33:43,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:33:43,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957586810] [2024-11-10 14:33:43,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:33:43,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:33:43,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:33:43,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:33:43,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:33:43,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957586810] [2024-11-10 14:33:43,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957586810] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:33:43,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:33:43,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 14:33:43,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667688064] [2024-11-10 14:33:43,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:33:43,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:33:43,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:33:43,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:33:43,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:33:43,436 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 220 out of 263 [2024-11-10 14:33:43,437 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 253 places, 372 transitions, 1373 flow. Second operand has 3 states, 3 states have (on average 221.66666666666666) internal successors, (665), 3 states have internal predecessors, (665), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:33:43,437 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:33:43,437 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 220 of 263 [2024-11-10 14:33:43,437 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:33:47,005 INFO L124 PetriNetUnfolderBase]: 10243/34020 cut-off events. [2024-11-10 14:33:47,005 INFO L125 PetriNetUnfolderBase]: For 5188/5618 co-relation queries the response was YES. [2024-11-10 14:33:47,086 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59722 conditions, 34020 events. 10243/34020 cut-off events. For 5188/5618 co-relation queries the response was YES. Maximal size of possible extension queue 642. Compared 394970 event pairs, 4313 based on Foata normal form. 1/31157 useless extension candidates. Maximal degree in co-relation 59679. Up to 11336 conditions per place. [2024-11-10 14:33:47,220 INFO L140 encePairwiseOnDemand]: 260/263 looper letters, 30 selfloop transitions, 3 changer transitions 0/380 dead transitions. [2024-11-10 14:33:47,221 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 255 places, 380 transitions, 1461 flow [2024-11-10 14:33:47,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:33:47,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:33:47,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 692 transitions. [2024-11-10 14:33:47,223 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8770595690747782 [2024-11-10 14:33:47,223 INFO L175 Difference]: Start difference. First operand has 253 places, 372 transitions, 1373 flow. Second operand 3 states and 692 transitions. [2024-11-10 14:33:47,224 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 255 places, 380 transitions, 1461 flow [2024-11-10 14:33:47,336 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 255 places, 380 transitions, 1461 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-10 14:33:47,340 INFO L231 Difference]: Finished difference. Result has 256 places, 374 transitions, 1398 flow [2024-11-10 14:33:47,341 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=1373, PETRI_DIFFERENCE_MINUEND_PLACES=253, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=372, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=369, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1398, PETRI_PLACES=256, PETRI_TRANSITIONS=374} [2024-11-10 14:33:47,342 INFO L277 CegarLoopForPetriNet]: 248 programPoint places, 8 predicate places. [2024-11-10 14:33:47,342 INFO L471 AbstractCegarLoop]: Abstraction has has 256 places, 374 transitions, 1398 flow [2024-11-10 14:33:47,343 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 221.66666666666666) internal successors, (665), 3 states have internal predecessors, (665), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:33:47,343 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:33:47,343 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:33:47,343 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-10 14:33:47,343 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2024-11-10 14:33:47,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:33:47,344 INFO L85 PathProgramCache]: Analyzing trace with hash -1482160499, now seen corresponding path program 1 times [2024-11-10 14:33:47,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:33:47,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917527375] [2024-11-10 14:33:47,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:33:47,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:33:47,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:33:47,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:33:47,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:33:47,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917527375] [2024-11-10 14:33:47,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917527375] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:33:47,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:33:47,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:33:47,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593230327] [2024-11-10 14:33:47,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:33:47,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:33:47,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:33:47,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:33:47,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:33:47,400 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 213 out of 263 [2024-11-10 14:33:47,401 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 256 places, 374 transitions, 1398 flow. Second operand has 3 states, 3 states have (on average 215.0) internal successors, (645), 3 states have internal predecessors, (645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:33:47,401 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:33:47,401 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 213 of 263 [2024-11-10 14:33:47,401 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:33:50,714 INFO L124 PetriNetUnfolderBase]: 9646/30439 cut-off events. [2024-11-10 14:33:50,714 INFO L125 PetriNetUnfolderBase]: For 5284/5760 co-relation queries the response was YES. [2024-11-10 14:33:50,797 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56371 conditions, 30439 events. 9646/30439 cut-off events. For 5284/5760 co-relation queries the response was YES. Maximal size of possible extension queue 582. Compared 343629 event pairs, 3169 based on Foata normal form. 0/28720 useless extension candidates. Maximal degree in co-relation 56327. Up to 10798 conditions per place. [2024-11-10 14:33:50,907 INFO L140 encePairwiseOnDemand]: 257/263 looper letters, 34 selfloop transitions, 2 changer transitions 0/379 dead transitions. [2024-11-10 14:33:50,907 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 254 places, 379 transitions, 1485 flow [2024-11-10 14:33:50,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:33:50,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:33:50,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 679 transitions. [2024-11-10 14:33:50,909 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8605830164765526 [2024-11-10 14:33:50,909 INFO L175 Difference]: Start difference. First operand has 256 places, 374 transitions, 1398 flow. Second operand 3 states and 679 transitions. [2024-11-10 14:33:50,909 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 254 places, 379 transitions, 1485 flow [2024-11-10 14:33:51,006 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 253 places, 379 transitions, 1482 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-10 14:33:51,011 INFO L231 Difference]: Finished difference. Result has 254 places, 372 transitions, 1401 flow [2024-11-10 14:33:51,011 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=1387, PETRI_DIFFERENCE_MINUEND_PLACES=251, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=370, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=368, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1401, PETRI_PLACES=254, PETRI_TRANSITIONS=372} [2024-11-10 14:33:51,012 INFO L277 CegarLoopForPetriNet]: 248 programPoint places, 6 predicate places. [2024-11-10 14:33:51,012 INFO L471 AbstractCegarLoop]: Abstraction has has 254 places, 372 transitions, 1401 flow [2024-11-10 14:33:51,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 215.0) internal successors, (645), 3 states have internal predecessors, (645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:33:51,012 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:33:51,012 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:33:51,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-10 14:33:51,013 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2024-11-10 14:33:51,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:33:51,013 INFO L85 PathProgramCache]: Analyzing trace with hash 1840157556, now seen corresponding path program 1 times [2024-11-10 14:33:51,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:33:51,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029914695] [2024-11-10 14:33:51,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:33:51,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:33:51,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:33:51,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:33:51,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:33:51,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029914695] [2024-11-10 14:33:51,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029914695] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:33:51,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:33:51,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 14:33:51,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089363994] [2024-11-10 14:33:51,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:33:51,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 14:33:51,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:33:51,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 14:33:51,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-10 14:33:51,562 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 176 out of 263 [2024-11-10 14:33:51,563 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 254 places, 372 transitions, 1401 flow. Second operand has 6 states, 6 states have (on average 178.33333333333334) internal successors, (1070), 6 states have internal predecessors, (1070), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:33:51,564 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:33:51,564 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 176 of 263 [2024-11-10 14:33:51,564 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:34:00,961 INFO L124 PetriNetUnfolderBase]: 35577/80013 cut-off events. [2024-11-10 14:34:00,961 INFO L125 PetriNetUnfolderBase]: For 33880/37634 co-relation queries the response was YES. [2024-11-10 14:34:01,215 INFO L83 FinitePrefix]: Finished finitePrefix Result has 186624 conditions, 80013 events. 35577/80013 cut-off events. For 33880/37634 co-relation queries the response was YES. Maximal size of possible extension queue 1842. Compared 893809 event pairs, 7589 based on Foata normal form. 84/76456 useless extension candidates. Maximal degree in co-relation 186579. Up to 33919 conditions per place. [2024-11-10 14:34:01,509 INFO L140 encePairwiseOnDemand]: 215/263 looper letters, 463 selfloop transitions, 219 changer transitions 0/855 dead transitions. [2024-11-10 14:34:01,509 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 259 places, 855 transitions, 4979 flow [2024-11-10 14:34:01,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 14:34:01,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-10 14:34:01,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1384 transitions. [2024-11-10 14:34:01,513 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8770595690747782 [2024-11-10 14:34:01,513 INFO L175 Difference]: Start difference. First operand has 254 places, 372 transitions, 1401 flow. Second operand 6 states and 1384 transitions. [2024-11-10 14:34:01,513 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 259 places, 855 transitions, 4979 flow [2024-11-10 14:34:01,807 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 259 places, 855 transitions, 4979 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-10 14:34:01,816 INFO L231 Difference]: Finished difference. Result has 264 places, 603 transitions, 3717 flow [2024-11-10 14:34:01,817 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=1401, PETRI_DIFFERENCE_MINUEND_PLACES=254, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=372, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=233, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3717, PETRI_PLACES=264, PETRI_TRANSITIONS=603} [2024-11-10 14:34:01,817 INFO L277 CegarLoopForPetriNet]: 248 programPoint places, 16 predicate places. [2024-11-10 14:34:01,817 INFO L471 AbstractCegarLoop]: Abstraction has has 264 places, 603 transitions, 3717 flow [2024-11-10 14:34:01,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 178.33333333333334) internal successors, (1070), 6 states have internal predecessors, (1070), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:34:01,818 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:34:01,818 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:34:01,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-10 14:34:01,819 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2024-11-10 14:34:01,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:34:01,820 INFO L85 PathProgramCache]: Analyzing trace with hash 895895706, now seen corresponding path program 1 times [2024-11-10 14:34:01,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:34:01,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157294834] [2024-11-10 14:34:01,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:34:01,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:34:01,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:34:01,901 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:34:01,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:34:01,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157294834] [2024-11-10 14:34:01,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1157294834] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 14:34:01,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1814530670] [2024-11-10 14:34:01,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:34:01,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 14:34:01,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 14:34:01,905 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 14:34:01,906 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-10 14:34:02,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:34:02,011 INFO L255 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 14:34:02,014 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 14:34:02,095 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:34:02,098 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 14:34:02,153 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:34:02,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1814530670] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 14:34:02,154 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 14:34:02,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2024-11-10 14:34:02,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152841704] [2024-11-10 14:34:02,155 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 14:34:02,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 14:34:02,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:34:02,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 14:34:02,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-10 14:34:02,245 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 217 out of 263 [2024-11-10 14:34:02,247 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 264 places, 603 transitions, 3717 flow. Second operand has 10 states, 10 states have (on average 219.2) internal successors, (2192), 10 states have internal predecessors, (2192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:34:02,248 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:34:02,248 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 217 of 263 [2024-11-10 14:34:02,248 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:34:09,651 INFO L124 PetriNetUnfolderBase]: 21841/57170 cut-off events. [2024-11-10 14:34:09,651 INFO L125 PetriNetUnfolderBase]: For 54216/58431 co-relation queries the response was YES. [2024-11-10 14:34:09,853 INFO L83 FinitePrefix]: Finished finitePrefix Result has 154381 conditions, 57170 events. 21841/57170 cut-off events. For 54216/58431 co-relation queries the response was YES. Maximal size of possible extension queue 1055. Compared 639912 event pairs, 2752 based on Foata normal form. 595/56309 useless extension candidates. Maximal degree in co-relation 154331. Up to 20307 conditions per place. [2024-11-10 14:34:10,055 INFO L140 encePairwiseOnDemand]: 258/263 looper letters, 72 selfloop transitions, 9 changer transitions 0/611 dead transitions. [2024-11-10 14:34:10,055 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 611 transitions, 3887 flow [2024-11-10 14:34:10,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 14:34:10,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-10 14:34:10,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2034 transitions. [2024-11-10 14:34:10,058 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8593155893536122 [2024-11-10 14:34:10,059 INFO L175 Difference]: Start difference. First operand has 264 places, 603 transitions, 3717 flow. Second operand 9 states and 2034 transitions. [2024-11-10 14:34:10,059 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 224 places, 611 transitions, 3887 flow [2024-11-10 14:34:10,908 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 224 places, 611 transitions, 3869 flow, removed 9 selfloop flow, removed 0 redundant places. [2024-11-10 14:34:10,916 INFO L231 Difference]: Finished difference. Result has 224 places, 555 transitions, 3613 flow [2024-11-10 14:34:10,917 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=3591, PETRI_DIFFERENCE_MINUEND_PLACES=216, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=553, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=546, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3613, PETRI_PLACES=224, PETRI_TRANSITIONS=555} [2024-11-10 14:34:10,917 INFO L277 CegarLoopForPetriNet]: 248 programPoint places, -24 predicate places. [2024-11-10 14:34:10,917 INFO L471 AbstractCegarLoop]: Abstraction has has 224 places, 555 transitions, 3613 flow [2024-11-10 14:34:10,918 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 219.2) internal successors, (2192), 10 states have internal predecessors, (2192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:34:10,919 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:34:10,919 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:34:10,938 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-10 14:34:11,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-10 14:34:11,120 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2024-11-10 14:34:11,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:34:11,121 INFO L85 PathProgramCache]: Analyzing trace with hash -26609507, now seen corresponding path program 1 times [2024-11-10 14:34:11,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:34:11,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372635649] [2024-11-10 14:34:11,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:34:11,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:34:11,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:34:11,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:34:11,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:34:11,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372635649] [2024-11-10 14:34:11,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372635649] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:34:11,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:34:11,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 14:34:11,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247615325] [2024-11-10 14:34:11,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:34:11,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 14:34:11,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:34:11,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 14:34:11,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-10 14:34:11,915 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 169 out of 263 [2024-11-10 14:34:11,916 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 224 places, 555 transitions, 3613 flow. Second operand has 6 states, 6 states have (on average 172.33333333333334) internal successors, (1034), 6 states have internal predecessors, (1034), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:34:11,917 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:34:11,917 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 263 [2024-11-10 14:34:11,917 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:34:21,372 INFO L124 PetriNetUnfolderBase]: 33630/74915 cut-off events. [2024-11-10 14:34:21,372 INFO L125 PetriNetUnfolderBase]: For 105683/113154 co-relation queries the response was YES. [2024-11-10 14:34:21,971 INFO L83 FinitePrefix]: Finished finitePrefix Result has 242810 conditions, 74915 events. 33630/74915 cut-off events. For 105683/113154 co-relation queries the response was YES. Maximal size of possible extension queue 1319. Compared 788266 event pairs, 7086 based on Foata normal form. 467/74047 useless extension candidates. Maximal degree in co-relation 242759. Up to 46282 conditions per place. [2024-11-10 14:34:22,251 INFO L140 encePairwiseOnDemand]: 232/263 looper letters, 512 selfloop transitions, 252 changer transitions 0/894 dead transitions. [2024-11-10 14:34:22,252 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 229 places, 894 transitions, 7475 flow [2024-11-10 14:34:22,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 14:34:22,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-10 14:34:22,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1222 transitions. [2024-11-10 14:34:22,254 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7743979721166033 [2024-11-10 14:34:22,254 INFO L175 Difference]: Start difference. First operand has 224 places, 555 transitions, 3613 flow. Second operand 6 states and 1222 transitions. [2024-11-10 14:34:22,254 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 229 places, 894 transitions, 7475 flow [2024-11-10 14:34:22,994 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 224 places, 894 transitions, 7452 flow, removed 2 selfloop flow, removed 5 redundant places. [2024-11-10 14:34:23,003 INFO L231 Difference]: Finished difference. Result has 229 places, 805 transitions, 6746 flow [2024-11-10 14:34:23,004 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=3590, PETRI_DIFFERENCE_MINUEND_PLACES=219, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=555, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=393, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=6746, PETRI_PLACES=229, PETRI_TRANSITIONS=805} [2024-11-10 14:34:23,004 INFO L277 CegarLoopForPetriNet]: 248 programPoint places, -19 predicate places. [2024-11-10 14:34:23,004 INFO L471 AbstractCegarLoop]: Abstraction has has 229 places, 805 transitions, 6746 flow [2024-11-10 14:34:23,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 172.33333333333334) internal successors, (1034), 6 states have internal predecessors, (1034), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:34:23,005 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:34:23,005 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:34:23,005 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-10 14:34:23,005 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2024-11-10 14:34:23,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:34:23,005 INFO L85 PathProgramCache]: Analyzing trace with hash 570051172, now seen corresponding path program 1 times [2024-11-10 14:34:23,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:34:23,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820076121] [2024-11-10 14:34:23,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:34:23,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:34:23,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:34:23,469 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-10 14:34:23,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:34:23,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820076121] [2024-11-10 14:34:23,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820076121] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 14:34:23,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [501843015] [2024-11-10 14:34:23,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:34:23,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 14:34:23,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 14:34:23,473 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 14:34:23,474 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process