./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_41-trylock_racefree.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_41-trylock_racefree.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 af00d5f4cc6a18cb9fd8a5151467217fe3ddb5ee0fa30b2cfbd9dd374105ee15 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 14:33:31,771 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 14:33:31,857 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:31,861 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 14:33:31,861 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 14:33:31,887 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 14:33:31,888 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 14:33:31,888 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 14:33:31,889 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 14:33:31,893 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 14:33:31,894 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 14:33:31,894 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 14:33:31,894 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 14:33:31,895 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 14:33:31,895 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 14:33:31,895 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 14:33:31,895 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 14:33:31,896 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 14:33:31,896 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 14:33:31,896 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 14:33:31,896 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 14:33:31,899 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 14:33:31,900 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-10 14:33:31,900 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 14:33:31,900 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 14:33:31,900 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 14:33:31,901 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 14:33:31,901 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 14:33:31,901 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 14:33:31,902 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 14:33:31,902 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 14:33:31,902 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 14:33:31,902 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 14:33:31,903 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 14:33:31,903 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 14:33:31,903 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 14:33:31,903 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 14:33:31,904 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 14:33:31,904 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 14:33:31,904 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 14:33:31,904 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 14:33:31,906 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 -> af00d5f4cc6a18cb9fd8a5151467217fe3ddb5ee0fa30b2cfbd9dd374105ee15 [2024-11-10 14:33:32,164 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 14:33:32,196 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 14:33:32,199 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 14:33:32,200 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 14:33:32,201 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 14:33:32,202 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/28-race_reach_41-trylock_racefree.i [2024-11-10 14:33:33,706 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 14:33:33,967 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 14:33:33,967 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_41-trylock_racefree.i [2024-11-10 14:33:33,982 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b9a07011c/8ec9885b3a16439bb24095160290d6d5/FLAGaeadd58ec [2024-11-10 14:33:34,280 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b9a07011c/8ec9885b3a16439bb24095160290d6d5 [2024-11-10 14:33:34,282 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 14:33:34,284 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 14:33:34,286 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 14:33:34,286 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 14:33:34,292 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 14:33:34,293 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 02:33:34" (1/1) ... [2024-11-10 14:33:34,294 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d74f337 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:33:34, skipping insertion in model container [2024-11-10 14:33:34,294 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 02:33:34" (1/1) ... [2024-11-10 14:33:34,338 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 14:33:34,701 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 14:33:34,730 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 14:33:34,799 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 14:33:34,849 INFO L204 MainTranslator]: Completed translation [2024-11-10 14:33:34,850 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:33:34 WrapperNode [2024-11-10 14:33:34,850 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 14:33:34,851 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 14:33:34,851 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 14:33:34,851 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 14:33:34,858 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:34" (1/1) ... [2024-11-10 14:33:34,881 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:34" (1/1) ... [2024-11-10 14:33:34,910 INFO L138 Inliner]: procedures = 172, calls = 36, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 92 [2024-11-10 14:33:34,910 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 14:33:34,911 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 14:33:34,911 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 14:33:34,911 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 14:33:34,919 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:34" (1/1) ... [2024-11-10 14:33:34,920 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:34" (1/1) ... [2024-11-10 14:33:34,927 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:34" (1/1) ... [2024-11-10 14:33:34,928 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:34" (1/1) ... [2024-11-10 14:33:34,939 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:34" (1/1) ... [2024-11-10 14:33:34,944 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:34" (1/1) ... [2024-11-10 14:33:34,945 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:34" (1/1) ... [2024-11-10 14:33:34,950 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:34" (1/1) ... [2024-11-10 14:33:34,953 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 14:33:34,958 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 14:33:34,958 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 14:33:34,958 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 14:33:34,959 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:33:34" (1/1) ... [2024-11-10 14:33:34,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 14:33:34,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 14:33:35,009 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:35,013 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:35,057 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-10 14:33:35,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-10 14:33:35,057 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-10 14:33:35,058 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 14:33:35,058 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-10 14:33:35,058 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2024-11-10 14:33:35,058 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2024-11-10 14:33:35,058 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-10 14:33:35,058 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexTryLock [2024-11-10 14:33:35,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-10 14:33:35,058 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-10 14:33:35,058 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 14:33:35,058 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 14:33:35,060 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:35,177 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 14:33:35,179 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 14:33:35,355 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L706: havoc main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset; [2024-11-10 14:33:35,355 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L706-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:35,436 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-10 14:33:35,437 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 14:33:35,510 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 14:33:35,510 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 14:33:35,511 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 02:33:35 BoogieIcfgContainer [2024-11-10 14:33:35,512 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 14:33:35,514 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 14:33:35,514 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 14:33:35,519 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 14:33:35,519 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 02:33:34" (1/3) ... [2024-11-10 14:33:35,520 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3446f394 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 02:33:35, skipping insertion in model container [2024-11-10 14:33:35,520 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:33:34" (2/3) ... [2024-11-10 14:33:35,521 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3446f394 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 02:33:35, skipping insertion in model container [2024-11-10 14:33:35,521 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 02:33:35" (3/3) ... [2024-11-10 14:33:35,523 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_41-trylock_racefree.i [2024-11-10 14:33:35,541 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 14:33:35,542 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2024-11-10 14:33:35,542 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-10 14:33:35,615 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-11-10 14:33:35,657 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 138 places, 150 transitions, 307 flow [2024-11-10 14:33:35,726 INFO L124 PetriNetUnfolderBase]: 23/217 cut-off events. [2024-11-10 14:33:35,727 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-10 14:33:35,738 INFO L83 FinitePrefix]: Finished finitePrefix Result has 222 conditions, 217 events. 23/217 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 705 event pairs, 0 based on Foata normal form. 0/181 useless extension candidates. Maximal degree in co-relation 119. Up to 6 conditions per place. [2024-11-10 14:33:35,739 INFO L82 GeneralOperation]: Start removeDead. Operand has 138 places, 150 transitions, 307 flow [2024-11-10 14:33:35,744 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 138 places, 150 transitions, 307 flow [2024-11-10 14:33:35,753 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 14:33:35,760 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;@218c7091, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 14:33:35,760 INFO L334 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2024-11-10 14:33:35,772 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-10 14:33:35,772 INFO L124 PetriNetUnfolderBase]: 3/52 cut-off events. [2024-11-10 14:33:35,772 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-10 14:33:35,772 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:33:35,773 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:35,774 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2024-11-10 14:33:35,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:33:35,785 INFO L85 PathProgramCache]: Analyzing trace with hash 964173909, now seen corresponding path program 1 times [2024-11-10 14:33:35,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:33:35,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744923528] [2024-11-10 14:33:35,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:33:35,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:33:35,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:33:36,043 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:36,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:33:36,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744923528] [2024-11-10 14:33:36,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744923528] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:33:36,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:33:36,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:33:36,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251515817] [2024-11-10 14:33:36,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:33:36,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 14:33:36,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:33:36,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 14:33:36,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 14:33:36,093 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 150 [2024-11-10 14:33:36,096 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 150 transitions, 307 flow. Second operand has 2 states, 2 states have (on average 125.5) internal successors, (251), 2 states have internal predecessors, (251), 0 states have call successors, (0), 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:36,097 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:33:36,097 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 150 [2024-11-10 14:33:36,098 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:33:36,244 INFO L124 PetriNetUnfolderBase]: 27/385 cut-off events. [2024-11-10 14:33:36,244 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-10 14:33:36,247 INFO L83 FinitePrefix]: Finished finitePrefix Result has 455 conditions, 385 events. 27/385 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1571 event pairs, 24 based on Foata normal form. 79/424 useless extension candidates. Maximal degree in co-relation 354. Up to 65 conditions per place. [2024-11-10 14:33:36,251 INFO L140 encePairwiseOnDemand]: 137/150 looper letters, 12 selfloop transitions, 0 changer transitions 0/135 dead transitions. [2024-11-10 14:33:36,251 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 135 transitions, 301 flow [2024-11-10 14:33:36,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 14:33:36,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-11-10 14:33:36,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 273 transitions. [2024-11-10 14:33:36,266 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.91 [2024-11-10 14:33:36,269 INFO L175 Difference]: Start difference. First operand has 138 places, 150 transitions, 307 flow. Second operand 2 states and 273 transitions. [2024-11-10 14:33:36,270 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 135 transitions, 301 flow [2024-11-10 14:33:36,273 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 135 transitions, 301 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-10 14:33:36,279 INFO L231 Difference]: Finished difference. Result has 137 places, 135 transitions, 277 flow [2024-11-10 14:33:36,282 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=150, PETRI_DIFFERENCE_MINUEND_FLOW=277, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=135, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=277, PETRI_PLACES=137, PETRI_TRANSITIONS=135} [2024-11-10 14:33:36,288 INFO L277 CegarLoopForPetriNet]: 138 programPoint places, -1 predicate places. [2024-11-10 14:33:36,289 INFO L471 AbstractCegarLoop]: Abstraction has has 137 places, 135 transitions, 277 flow [2024-11-10 14:33:36,289 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 125.5) internal successors, (251), 2 states have internal predecessors, (251), 0 states have call successors, (0), 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:36,290 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:33:36,291 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] [2024-11-10 14:33:36,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 14:33:36,291 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2024-11-10 14:33:36,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:33:36,292 INFO L85 PathProgramCache]: Analyzing trace with hash -365770327, now seen corresponding path program 1 times [2024-11-10 14:33:36,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:33:36,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355621723] [2024-11-10 14:33:36,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:33:36,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:33:36,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:33:36,938 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:36,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:33:36,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355621723] [2024-11-10 14:33:36,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355621723] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:33:36,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:33:36,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 14:33:36,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994956264] [2024-11-10 14:33:36,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:33:36,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 14:33:36,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:33:36,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 14:33:36,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-10 14:33:37,093 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 150 [2024-11-10 14:33:37,095 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 135 transitions, 277 flow. Second operand has 6 states, 6 states have (on average 107.5) internal successors, (645), 6 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:37,096 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:33:37,096 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 150 [2024-11-10 14:33:37,097 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:33:37,319 INFO L124 PetriNetUnfolderBase]: 112/815 cut-off events. [2024-11-10 14:33:37,319 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-10 14:33:37,323 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1084 conditions, 815 events. 112/815 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 4781 event pairs, 66 based on Foata normal form. 0/726 useless extension candidates. Maximal degree in co-relation 1080. Up to 186 conditions per place. [2024-11-10 14:33:37,326 INFO L140 encePairwiseOnDemand]: 144/150 looper letters, 48 selfloop transitions, 5 changer transitions 0/158 dead transitions. [2024-11-10 14:33:37,327 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 158 transitions, 429 flow [2024-11-10 14:33:37,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 14:33:37,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-10 14:33:37,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 690 transitions. [2024-11-10 14:33:37,333 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7666666666666667 [2024-11-10 14:33:37,333 INFO L175 Difference]: Start difference. First operand has 137 places, 135 transitions, 277 flow. Second operand 6 states and 690 transitions. [2024-11-10 14:33:37,333 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 158 transitions, 429 flow [2024-11-10 14:33:37,335 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 158 transitions, 429 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-10 14:33:37,338 INFO L231 Difference]: Finished difference. Result has 141 places, 134 transitions, 285 flow [2024-11-10 14:33:37,339 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=150, PETRI_DIFFERENCE_MINUEND_FLOW=275, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=285, PETRI_PLACES=141, PETRI_TRANSITIONS=134} [2024-11-10 14:33:37,340 INFO L277 CegarLoopForPetriNet]: 138 programPoint places, 3 predicate places. [2024-11-10 14:33:37,340 INFO L471 AbstractCegarLoop]: Abstraction has has 141 places, 134 transitions, 285 flow [2024-11-10 14:33:37,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 107.5) internal successors, (645), 6 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:37,341 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:33:37,341 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:37,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 14:33:37,342 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2024-11-10 14:33:37,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:33:37,344 INFO L85 PathProgramCache]: Analyzing trace with hash 1941625861, now seen corresponding path program 1 times [2024-11-10 14:33:37,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:33:37,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857703708] [2024-11-10 14:33:37,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:33:37,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:33:37,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:33:37,416 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:37,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:33:37,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857703708] [2024-11-10 14:33:37,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857703708] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:33:37,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:33:37,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 14:33:37,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963577576] [2024-11-10 14:33:37,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:33:37,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:33:37,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:33:37,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:33:37,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:33:37,462 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 150 [2024-11-10 14:33:37,463 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 134 transitions, 285 flow. Second operand has 3 states, 3 states have (on average 120.0) internal successors, (360), 3 states have internal predecessors, (360), 0 states have call successors, (0), 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:37,464 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:33:37,464 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 150 [2024-11-10 14:33:37,464 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:33:37,556 INFO L124 PetriNetUnfolderBase]: 55/539 cut-off events. [2024-11-10 14:33:37,556 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2024-11-10 14:33:37,558 INFO L83 FinitePrefix]: Finished finitePrefix Result has 685 conditions, 539 events. 55/539 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 2560 event pairs, 28 based on Foata normal form. 1/488 useless extension candidates. Maximal degree in co-relation 680. Up to 108 conditions per place. [2024-11-10 14:33:37,561 INFO L140 encePairwiseOnDemand]: 147/150 looper letters, 22 selfloop transitions, 2 changer transitions 0/140 dead transitions. [2024-11-10 14:33:37,561 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 140 transitions, 345 flow [2024-11-10 14:33:37,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:33:37,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:33:37,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 379 transitions. [2024-11-10 14:33:37,564 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8422222222222222 [2024-11-10 14:33:37,564 INFO L175 Difference]: Start difference. First operand has 141 places, 134 transitions, 285 flow. Second operand 3 states and 379 transitions. [2024-11-10 14:33:37,564 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 140 transitions, 345 flow [2024-11-10 14:33:37,568 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 140 transitions, 335 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-10 14:33:37,570 INFO L231 Difference]: Finished difference. Result has 139 places, 134 transitions, 283 flow [2024-11-10 14:33:37,573 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=150, PETRI_DIFFERENCE_MINUEND_FLOW=275, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=283, PETRI_PLACES=139, PETRI_TRANSITIONS=134} [2024-11-10 14:33:37,574 INFO L277 CegarLoopForPetriNet]: 138 programPoint places, 1 predicate places. [2024-11-10 14:33:37,575 INFO L471 AbstractCegarLoop]: Abstraction has has 139 places, 134 transitions, 283 flow [2024-11-10 14:33:37,575 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 120.0) internal successors, (360), 3 states have internal predecessors, (360), 0 states have call successors, (0), 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:37,575 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:33:37,576 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:33:37,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 14:33:37,576 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2024-11-10 14:33:37,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:33:37,577 INFO L85 PathProgramCache]: Analyzing trace with hash 997370305, now seen corresponding path program 1 times [2024-11-10 14:33:37,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:33:37,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348671863] [2024-11-10 14:33:37,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:33:37,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:33:37,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:33:37,637 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:37,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:33:37,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348671863] [2024-11-10 14:33:37,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [348671863] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:33:37,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:33:37,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:33:37,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20094926] [2024-11-10 14:33:37,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:33:37,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:33:37,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:33:37,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:33:37,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:33:37,663 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 150 [2024-11-10 14:33:37,664 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 134 transitions, 283 flow. Second operand has 3 states, 3 states have (on average 114.66666666666667) internal successors, (344), 3 states have internal predecessors, (344), 0 states have call successors, (0), 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:37,664 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:33:37,664 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 150 [2024-11-10 14:33:37,664 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:33:37,803 INFO L124 PetriNetUnfolderBase]: 92/818 cut-off events. [2024-11-10 14:33:37,803 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2024-11-10 14:33:37,806 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1048 conditions, 818 events. 92/818 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 4869 event pairs, 30 based on Foata normal form. 0/745 useless extension candidates. Maximal degree in co-relation 1042. Up to 125 conditions per place. [2024-11-10 14:33:37,810 INFO L140 encePairwiseOnDemand]: 141/150 looper letters, 30 selfloop transitions, 6 changer transitions 0/147 dead transitions. [2024-11-10 14:33:37,811 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 147 transitions, 384 flow [2024-11-10 14:33:37,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:33:37,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:33:37,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 378 transitions. [2024-11-10 14:33:37,812 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.84 [2024-11-10 14:33:37,812 INFO L175 Difference]: Start difference. First operand has 139 places, 134 transitions, 283 flow. Second operand 3 states and 378 transitions. [2024-11-10 14:33:37,812 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 147 transitions, 384 flow [2024-11-10 14:33:37,814 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 147 transitions, 380 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:33:37,818 INFO L231 Difference]: Finished difference. Result has 139 places, 136 transitions, 317 flow [2024-11-10 14:33:37,819 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=150, PETRI_DIFFERENCE_MINUEND_FLOW=275, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=317, PETRI_PLACES=139, PETRI_TRANSITIONS=136} [2024-11-10 14:33:37,820 INFO L277 CegarLoopForPetriNet]: 138 programPoint places, 1 predicate places. [2024-11-10 14:33:37,821 INFO L471 AbstractCegarLoop]: Abstraction has has 139 places, 136 transitions, 317 flow [2024-11-10 14:33:37,822 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 114.66666666666667) internal successors, (344), 3 states have internal predecessors, (344), 0 states have call successors, (0), 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:37,823 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:33:37,823 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] [2024-11-10 14:33:37,823 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 14:33:37,823 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2024-11-10 14:33:37,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:33:37,824 INFO L85 PathProgramCache]: Analyzing trace with hash -618183311, now seen corresponding path program 1 times [2024-11-10 14:33:37,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:33:37,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459984125] [2024-11-10 14:33:37,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:33:37,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:33:37,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:33:37,872 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:37,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:33:37,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459984125] [2024-11-10 14:33:37,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [459984125] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:33:37,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:33:37,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:33:37,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591154202] [2024-11-10 14:33:37,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:33:37,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:33:37,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:33:37,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:33:37,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:33:37,897 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 150 [2024-11-10 14:33:37,898 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 136 transitions, 317 flow. Second operand has 3 states, 3 states have (on average 117.33333333333333) internal successors, (352), 3 states have internal predecessors, (352), 0 states have call successors, (0), 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:37,899 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:33:37,899 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 150 [2024-11-10 14:33:37,899 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:33:38,025 INFO L124 PetriNetUnfolderBase]: 95/825 cut-off events. [2024-11-10 14:33:38,025 INFO L125 PetriNetUnfolderBase]: For 113/113 co-relation queries the response was YES. [2024-11-10 14:33:38,027 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1160 conditions, 825 events. 95/825 cut-off events. For 113/113 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 5014 event pairs, 62 based on Foata normal form. 0/753 useless extension candidates. Maximal degree in co-relation 1153. Up to 189 conditions per place. [2024-11-10 14:33:38,030 INFO L140 encePairwiseOnDemand]: 145/150 looper letters, 27 selfloop transitions, 4 changer transitions 0/143 dead transitions. [2024-11-10 14:33:38,030 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 143 transitions, 397 flow [2024-11-10 14:33:38,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:33:38,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:33:38,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 374 transitions. [2024-11-10 14:33:38,032 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8311111111111111 [2024-11-10 14:33:38,032 INFO L175 Difference]: Start difference. First operand has 139 places, 136 transitions, 317 flow. Second operand 3 states and 374 transitions. [2024-11-10 14:33:38,032 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 143 transitions, 397 flow [2024-11-10 14:33:38,034 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 143 transitions, 383 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:33:38,036 INFO L231 Difference]: Finished difference. Result has 141 places, 139 transitions, 337 flow [2024-11-10 14:33:38,036 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=150, PETRI_DIFFERENCE_MINUEND_FLOW=305, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=337, PETRI_PLACES=141, PETRI_TRANSITIONS=139} [2024-11-10 14:33:38,037 INFO L277 CegarLoopForPetriNet]: 138 programPoint places, 3 predicate places. [2024-11-10 14:33:38,037 INFO L471 AbstractCegarLoop]: Abstraction has has 141 places, 139 transitions, 337 flow [2024-11-10 14:33:38,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 117.33333333333333) internal successors, (352), 3 states have internal predecessors, (352), 0 states have call successors, (0), 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:38,038 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:33:38,038 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] [2024-11-10 14:33:38,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 14:33:38,038 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2024-11-10 14:33:38,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:33:38,039 INFO L85 PathProgramCache]: Analyzing trace with hash 250103180, now seen corresponding path program 1 times [2024-11-10 14:33:38,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:33:38,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647994937] [2024-11-10 14:33:38,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:33:38,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:33:38,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 14:33:38,068 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 14:33:38,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 14:33:38,112 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 14:33:38,113 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 14:33:38,114 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (11 of 12 remaining) [2024-11-10 14:33:38,116 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (10 of 12 remaining) [2024-11-10 14:33:38,116 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (9 of 12 remaining) [2024-11-10 14:33:38,116 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (8 of 12 remaining) [2024-11-10 14:33:38,117 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (7 of 12 remaining) [2024-11-10 14:33:38,117 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (6 of 12 remaining) [2024-11-10 14:33:38,117 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (5 of 12 remaining) [2024-11-10 14:33:38,117 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (4 of 12 remaining) [2024-11-10 14:33:38,117 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (3 of 12 remaining) [2024-11-10 14:33:38,117 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (2 of 12 remaining) [2024-11-10 14:33:38,118 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (1 of 12 remaining) [2024-11-10 14:33:38,118 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (0 of 12 remaining) [2024-11-10 14:33:38,118 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 14:33:38,118 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-11-10 14:33:38,125 WARN L244 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-10 14:33:38,125 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-11-10 14:33:38,156 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-10 14:33:38,161 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 184 places, 201 transitions, 418 flow [2024-11-10 14:33:38,214 INFO L124 PetriNetUnfolderBase]: 40/364 cut-off events. [2024-11-10 14:33:38,214 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-11-10 14:33:38,218 INFO L83 FinitePrefix]: Finished finitePrefix Result has 376 conditions, 364 events. 40/364 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1301 event pairs, 0 based on Foata normal form. 0/302 useless extension candidates. Maximal degree in co-relation 219. Up to 9 conditions per place. [2024-11-10 14:33:38,218 INFO L82 GeneralOperation]: Start removeDead. Operand has 184 places, 201 transitions, 418 flow [2024-11-10 14:33:38,221 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 184 places, 201 transitions, 418 flow [2024-11-10 14:33:38,222 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 14:33:38,223 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;@218c7091, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 14:33:38,223 INFO L334 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2024-11-10 14:33:38,227 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-10 14:33:38,228 INFO L124 PetriNetUnfolderBase]: 3/52 cut-off events. [2024-11-10 14:33:38,228 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-10 14:33:38,228 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:33:38,228 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:38,228 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-10 14:33:38,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:33:38,229 INFO L85 PathProgramCache]: Analyzing trace with hash 963022622, now seen corresponding path program 1 times [2024-11-10 14:33:38,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:33:38,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604312335] [2024-11-10 14:33:38,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:33:38,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:33:38,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:33:38,246 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:38,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:33:38,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604312335] [2024-11-10 14:33:38,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604312335] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:33:38,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:33:38,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:33:38,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389314099] [2024-11-10 14:33:38,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:33:38,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 14:33:38,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:33:38,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 14:33:38,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 14:33:38,249 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 161 out of 201 [2024-11-10 14:33:38,250 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 201 transitions, 418 flow. Second operand has 2 states, 2 states have (on average 162.5) internal successors, (325), 2 states have internal predecessors, (325), 0 states have call successors, (0), 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:38,250 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:33:38,250 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 201 [2024-11-10 14:33:38,250 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:33:38,679 INFO L124 PetriNetUnfolderBase]: 421/2713 cut-off events. [2024-11-10 14:33:38,679 INFO L125 PetriNetUnfolderBase]: For 74/74 co-relation queries the response was YES. [2024-11-10 14:33:38,690 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3472 conditions, 2713 events. 421/2713 cut-off events. For 74/74 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 22234 event pairs, 414 based on Foata normal form. 837/3272 useless extension candidates. Maximal degree in co-relation 2887. Up to 716 conditions per place. [2024-11-10 14:33:38,703 INFO L140 encePairwiseOnDemand]: 182/201 looper letters, 20 selfloop transitions, 0 changer transitions 0/180 dead transitions. [2024-11-10 14:33:38,703 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 180 transitions, 416 flow [2024-11-10 14:33:38,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 14:33:38,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-11-10 14:33:38,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 361 transitions. [2024-11-10 14:33:38,705 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8980099502487562 [2024-11-10 14:33:38,705 INFO L175 Difference]: Start difference. First operand has 184 places, 201 transitions, 418 flow. Second operand 2 states and 361 transitions. [2024-11-10 14:33:38,705 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 180 transitions, 416 flow [2024-11-10 14:33:38,707 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 180 transitions, 416 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-10 14:33:38,709 INFO L231 Difference]: Finished difference. Result has 183 places, 180 transitions, 376 flow [2024-11-10 14:33:38,710 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=376, PETRI_DIFFERENCE_MINUEND_PLACES=182, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=180, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=180, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=376, PETRI_PLACES=183, PETRI_TRANSITIONS=180} [2024-11-10 14:33:38,711 INFO L277 CegarLoopForPetriNet]: 184 programPoint places, -1 predicate places. [2024-11-10 14:33:38,711 INFO L471 AbstractCegarLoop]: Abstraction has has 183 places, 180 transitions, 376 flow [2024-11-10 14:33:38,711 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 162.5) internal successors, (325), 2 states have internal predecessors, (325), 0 states have call successors, (0), 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:38,712 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:33:38,712 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] [2024-11-10 14:33:38,712 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 14:33:38,712 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-10 14:33:38,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:33:38,713 INFO L85 PathProgramCache]: Analyzing trace with hash -303823383, now seen corresponding path program 1 times [2024-11-10 14:33:38,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:33:38,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686060780] [2024-11-10 14:33:38,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:33:38,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:33:38,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:33:39,009 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:39,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:33:39,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686060780] [2024-11-10 14:33:39,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686060780] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:33:39,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:33:39,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 14:33:39,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086312977] [2024-11-10 14:33:39,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:33:39,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 14:33:39,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:33:39,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 14:33:39,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-10 14:33:39,155 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 143 out of 201 [2024-11-10 14:33:39,157 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 180 transitions, 376 flow. Second operand has 6 states, 6 states have (on average 144.5) internal successors, (867), 6 states have internal predecessors, (867), 0 states have call successors, (0), 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:39,157 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:33:39,157 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 143 of 201 [2024-11-10 14:33:39,157 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:33:40,237 INFO L124 PetriNetUnfolderBase]: 1739/8102 cut-off events. [2024-11-10 14:33:40,237 INFO L125 PetriNetUnfolderBase]: For 83/83 co-relation queries the response was YES. [2024-11-10 14:33:40,254 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11008 conditions, 8102 events. 1739/8102 cut-off events. For 83/83 co-relation queries the response was YES. Maximal size of possible extension queue 193. Compared 83155 event pairs, 760 based on Foata normal form. 0/7339 useless extension candidates. Maximal degree in co-relation 11003. Up to 2030 conditions per place. [2024-11-10 14:33:40,290 INFO L140 encePairwiseOnDemand]: 195/201 looper letters, 80 selfloop transitions, 5 changer transitions 0/227 dead transitions. [2024-11-10 14:33:40,291 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 227 transitions, 640 flow [2024-11-10 14:33:40,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 14:33:40,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-10 14:33:40,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 944 transitions. [2024-11-10 14:33:40,294 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7827529021558872 [2024-11-10 14:33:40,294 INFO L175 Difference]: Start difference. First operand has 183 places, 180 transitions, 376 flow. Second operand 6 states and 944 transitions. [2024-11-10 14:33:40,294 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 227 transitions, 640 flow [2024-11-10 14:33:40,298 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 227 transitions, 640 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-10 14:33:40,300 INFO L231 Difference]: Finished difference. Result has 187 places, 179 transitions, 384 flow [2024-11-10 14:33:40,300 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=374, PETRI_DIFFERENCE_MINUEND_PLACES=182, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=179, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=174, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=384, PETRI_PLACES=187, PETRI_TRANSITIONS=179} [2024-11-10 14:33:40,301 INFO L277 CegarLoopForPetriNet]: 184 programPoint places, 3 predicate places. [2024-11-10 14:33:40,301 INFO L471 AbstractCegarLoop]: Abstraction has has 187 places, 179 transitions, 384 flow [2024-11-10 14:33:40,302 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 144.5) internal successors, (867), 6 states have internal predecessors, (867), 0 states have call successors, (0), 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:40,302 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:33:40,302 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:40,302 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 14:33:40,303 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-10 14:33:40,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:33:40,303 INFO L85 PathProgramCache]: Analyzing trace with hash -432985970, now seen corresponding path program 1 times [2024-11-10 14:33:40,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:33:40,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673616406] [2024-11-10 14:33:40,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:33:40,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:33:40,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:33:40,345 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:40,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:33:40,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673616406] [2024-11-10 14:33:40,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [673616406] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:33:40,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:33:40,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 14:33:40,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535813986] [2024-11-10 14:33:40,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:33:40,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:33:40,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:33:40,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:33:40,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:33:40,377 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 201 [2024-11-10 14:33:40,378 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 179 transitions, 384 flow. Second operand has 3 states, 3 states have (on average 157.0) internal successors, (471), 3 states have internal predecessors, (471), 0 states have call successors, (0), 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:40,378 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:33:40,378 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 201 [2024-11-10 14:33:40,378 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:33:41,098 INFO L124 PetriNetUnfolderBase]: 793/4651 cut-off events. [2024-11-10 14:33:41,099 INFO L125 PetriNetUnfolderBase]: For 131/131 co-relation queries the response was YES. [2024-11-10 14:33:41,109 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6089 conditions, 4651 events. 793/4651 cut-off events. For 131/131 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 43843 event pairs, 703 based on Foata normal form. 1/4210 useless extension candidates. Maximal degree in co-relation 6083. Up to 1309 conditions per place. [2024-11-10 14:33:41,122 INFO L140 encePairwiseOnDemand]: 198/201 looper letters, 31 selfloop transitions, 2 changer transitions 0/186 dead transitions. [2024-11-10 14:33:41,123 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 186 transitions, 466 flow [2024-11-10 14:33:41,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:33:41,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:33:41,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 499 transitions. [2024-11-10 14:33:41,126 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8275290215588723 [2024-11-10 14:33:41,126 INFO L175 Difference]: Start difference. First operand has 187 places, 179 transitions, 384 flow. Second operand 3 states and 499 transitions. [2024-11-10 14:33:41,126 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 186 transitions, 466 flow [2024-11-10 14:33:41,128 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 184 places, 186 transitions, 454 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-10 14:33:41,130 INFO L231 Difference]: Finished difference. Result has 185 places, 180 transitions, 386 flow [2024-11-10 14:33:41,131 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=374, PETRI_DIFFERENCE_MINUEND_PLACES=182, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=179, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=177, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=386, PETRI_PLACES=185, PETRI_TRANSITIONS=180} [2024-11-10 14:33:41,132 INFO L277 CegarLoopForPetriNet]: 184 programPoint places, 1 predicate places. [2024-11-10 14:33:41,133 INFO L471 AbstractCegarLoop]: Abstraction has has 185 places, 180 transitions, 386 flow [2024-11-10 14:33:41,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 157.0) internal successors, (471), 3 states have internal predecessors, (471), 0 states have call successors, (0), 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:41,134 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:33:41,134 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] [2024-11-10 14:33:41,134 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 14:33:41,134 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-10 14:33:41,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:33:41,135 INFO L85 PathProgramCache]: Analyzing trace with hash 1567025808, now seen corresponding path program 1 times [2024-11-10 14:33:41,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:33:41,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495710512] [2024-11-10 14:33:41,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:33:41,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:33:41,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:33:41,173 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:41,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:33:41,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495710512] [2024-11-10 14:33:41,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495710512] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:33:41,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:33:41,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:33:41,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23904019] [2024-11-10 14:33:41,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:33:41,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:33:41,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:33:41,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:33:41,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:33:41,209 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 201 [2024-11-10 14:33:41,210 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 180 transitions, 386 flow. Second operand has 3 states, 3 states have (on average 143.66666666666666) internal successors, (431), 3 states have internal predecessors, (431), 0 states have call successors, (0), 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:41,211 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:33:41,211 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 201 [2024-11-10 14:33:41,211 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:33:42,979 INFO L124 PetriNetUnfolderBase]: 4085/15180 cut-off events. [2024-11-10 14:33:42,979 INFO L125 PetriNetUnfolderBase]: For 238/238 co-relation queries the response was YES. [2024-11-10 14:33:43,029 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21909 conditions, 15180 events. 4085/15180 cut-off events. For 238/238 co-relation queries the response was YES. Maximal size of possible extension queue 388. Compared 170365 event pairs, 1409 based on Foata normal form. 0/13578 useless extension candidates. Maximal degree in co-relation 21902. Up to 3578 conditions per place. [2024-11-10 14:33:43,102 INFO L140 encePairwiseOnDemand]: 182/201 looper letters, 58 selfloop transitions, 14 changer transitions 0/213 dead transitions. [2024-11-10 14:33:43,102 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 213 transitions, 607 flow [2024-11-10 14:33:43,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:33:43,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:33:43,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 503 transitions. [2024-11-10 14:33:43,107 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8341625207296849 [2024-11-10 14:33:43,107 INFO L175 Difference]: Start difference. First operand has 185 places, 180 transitions, 386 flow. Second operand 3 states and 503 transitions. [2024-11-10 14:33:43,107 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 213 transitions, 607 flow [2024-11-10 14:33:43,109 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 186 places, 213 transitions, 605 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-10 14:33:43,112 INFO L231 Difference]: Finished difference. Result has 188 places, 194 transitions, 506 flow [2024-11-10 14:33:43,113 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=384, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=180, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=166, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=506, PETRI_PLACES=188, PETRI_TRANSITIONS=194} [2024-11-10 14:33:43,114 INFO L277 CegarLoopForPetriNet]: 184 programPoint places, 4 predicate places. [2024-11-10 14:33:43,115 INFO L471 AbstractCegarLoop]: Abstraction has has 188 places, 194 transitions, 506 flow [2024-11-10 14:33:43,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 143.66666666666666) internal successors, (431), 3 states have internal predecessors, (431), 0 states have call successors, (0), 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,115 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:33:43,116 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] [2024-11-10 14:33:43,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-10 14:33:43,116 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-10 14:33:43,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:33:43,117 INFO L85 PathProgramCache]: Analyzing trace with hash 1954876555, now seen corresponding path program 1 times [2024-11-10 14:33:43,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:33:43,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932367929] [2024-11-10 14:33:43,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:33:43,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:33:43,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:33:43,179 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,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:33:43,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932367929] [2024-11-10 14:33:43,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [932367929] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:33:43,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:33:43,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:33:43,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029778415] [2024-11-10 14:33:43,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:33:43,180 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:33:43,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:33:43,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:33:43,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:33:43,229 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 201 [2024-11-10 14:33:43,230 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 194 transitions, 506 flow. Second operand has 3 states, 3 states have (on average 150.33333333333334) internal successors, (451), 3 states have internal predecessors, (451), 0 states have call successors, (0), 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,231 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:33:43,231 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 201 [2024-11-10 14:33:43,231 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:33:45,143 INFO L124 PetriNetUnfolderBase]: 4161/17194 cut-off events. [2024-11-10 14:33:45,143 INFO L125 PetriNetUnfolderBase]: For 4382/4567 co-relation queries the response was YES. [2024-11-10 14:33:45,184 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28034 conditions, 17194 events. 4161/17194 cut-off events. For 4382/4567 co-relation queries the response was YES. Maximal size of possible extension queue 430. Compared 203905 event pairs, 2440 based on Foata normal form. 45/15622 useless extension candidates. Maximal degree in co-relation 28026. Up to 5638 conditions per place. [2024-11-10 14:33:45,250 INFO L140 encePairwiseOnDemand]: 192/201 looper letters, 52 selfloop transitions, 14 changer transitions 0/218 dead transitions. [2024-11-10 14:33:45,250 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 218 transitions, 724 flow [2024-11-10 14:33:45,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:33:45,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:33:45,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 497 transitions. [2024-11-10 14:33:45,252 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.824212271973466 [2024-11-10 14:33:45,252 INFO L175 Difference]: Start difference. First operand has 188 places, 194 transitions, 506 flow. Second operand 3 states and 497 transitions. [2024-11-10 14:33:45,252 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 218 transitions, 724 flow [2024-11-10 14:33:45,262 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 188 places, 218 transitions, 686 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:33:45,265 INFO L231 Difference]: Finished difference. Result has 190 places, 206 transitions, 604 flow [2024-11-10 14:33:45,266 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=478, PETRI_DIFFERENCE_MINUEND_PLACES=186, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=194, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=180, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=604, PETRI_PLACES=190, PETRI_TRANSITIONS=206} [2024-11-10 14:33:45,266 INFO L277 CegarLoopForPetriNet]: 184 programPoint places, 6 predicate places. [2024-11-10 14:33:45,266 INFO L471 AbstractCegarLoop]: Abstraction has has 190 places, 206 transitions, 604 flow [2024-11-10 14:33:45,267 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 150.33333333333334) internal successors, (451), 3 states have internal predecessors, (451), 0 states have call successors, (0), 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:45,267 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:33:45,267 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] [2024-11-10 14:33:45,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-10 14:33:45,268 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-10 14:33:45,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:33:45,268 INFO L85 PathProgramCache]: Analyzing trace with hash -1160624701, now seen corresponding path program 1 times [2024-11-10 14:33:45,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:33:45,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761309364] [2024-11-10 14:33:45,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:33:45,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:33:45,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:33:45,502 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:33:45,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:33:45,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761309364] [2024-11-10 14:33:45,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761309364] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 14:33:45,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [672723115] [2024-11-10 14:33:45,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:33:45,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 14:33:45,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 14:33:45,506 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:33:45,508 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:33:45,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:33:45,609 INFO L255 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 14:33:45,612 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 14:33:45,715 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:33:45,718 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 14:33:45,794 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:33:45,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [672723115] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 14:33:45,795 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 14:33:45,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2024-11-10 14:33:45,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787281556] [2024-11-10 14:33:45,796 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 14:33:45,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 14:33:45,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:33:45,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 14:33:45,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-10 14:33:45,885 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 201 [2024-11-10 14:33:45,888 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 206 transitions, 604 flow. Second operand has 10 states, 10 states have (on average 154.5) internal successors, (1545), 10 states have internal predecessors, (1545), 0 states have call successors, (0), 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:45,888 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:33:45,888 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 201 [2024-11-10 14:33:45,888 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:33:46,470 INFO L124 PetriNetUnfolderBase]: 762/3730 cut-off events. [2024-11-10 14:33:46,471 INFO L125 PetriNetUnfolderBase]: For 580/602 co-relation queries the response was YES. [2024-11-10 14:33:46,486 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5691 conditions, 3730 events. 762/3730 cut-off events. For 580/602 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 34443 event pairs, 28 based on Foata normal form. 108/3629 useless extension candidates. Maximal degree in co-relation 5682. Up to 478 conditions per place. [2024-11-10 14:33:46,503 INFO L140 encePairwiseOnDemand]: 196/201 looper letters, 72 selfloop transitions, 7 changer transitions 0/207 dead transitions. [2024-11-10 14:33:46,504 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 207 transitions, 718 flow [2024-11-10 14:33:46,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 14:33:46,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-10 14:33:46,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1449 transitions. [2024-11-10 14:33:46,508 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8009950248756219 [2024-11-10 14:33:46,509 INFO L175 Difference]: Start difference. First operand has 190 places, 206 transitions, 604 flow. Second operand 9 states and 1449 transitions. [2024-11-10 14:33:46,509 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 207 transitions, 718 flow [2024-11-10 14:33:46,513 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 207 transitions, 698 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:33:46,515 INFO L231 Difference]: Finished difference. Result has 148 places, 151 transitions, 442 flow [2024-11-10 14:33:46,516 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=424, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=144, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=442, PETRI_PLACES=148, PETRI_TRANSITIONS=151} [2024-11-10 14:33:46,516 INFO L277 CegarLoopForPetriNet]: 184 programPoint places, -36 predicate places. [2024-11-10 14:33:46,517 INFO L471 AbstractCegarLoop]: Abstraction has has 148 places, 151 transitions, 442 flow [2024-11-10 14:33:46,518 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 154.5) internal successors, (1545), 10 states have internal predecessors, (1545), 0 states have call successors, (0), 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:46,518 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:33:46,518 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] [2024-11-10 14:33:46,537 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:33:46,719 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,SelfDestructingSolverStorable11 [2024-11-10 14:33:46,719 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-10 14:33:46,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:33:46,720 INFO L85 PathProgramCache]: Analyzing trace with hash 1004023744, now seen corresponding path program 1 times [2024-11-10 14:33:46,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:33:46,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970530159] [2024-11-10 14:33:46,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:33:46,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:33:46,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:33:46,788 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-10 14:33:46,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:33:46,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970530159] [2024-11-10 14:33:46,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970530159] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:33:46,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:33:46,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:33:46,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169641931] [2024-11-10 14:33:46,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:33:46,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:33:46,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:33:46,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:33:46,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:33:46,836 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 201 [2024-11-10 14:33:46,837 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 151 transitions, 442 flow. Second operand has 3 states, 3 states have (on average 150.66666666666666) internal successors, (452), 3 states have internal predecessors, (452), 0 states have call successors, (0), 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:46,837 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:33:46,837 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 201 [2024-11-10 14:33:46,837 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:33:47,025 INFO L124 PetriNetUnfolderBase]: 260/1326 cut-off events. [2024-11-10 14:33:47,025 INFO L125 PetriNetUnfolderBase]: For 456/477 co-relation queries the response was YES. [2024-11-10 14:33:47,029 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2372 conditions, 1326 events. 260/1326 cut-off events. For 456/477 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 8960 event pairs, 132 based on Foata normal form. 7/1239 useless extension candidates. Maximal degree in co-relation 2363. Up to 459 conditions per place. [2024-11-10 14:33:47,034 INFO L140 encePairwiseOnDemand]: 193/201 looper letters, 42 selfloop transitions, 12 changer transitions 0/165 dead transitions. [2024-11-10 14:33:47,035 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 165 transitions, 594 flow [2024-11-10 14:33:47,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:33:47,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:33:47,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 483 transitions. [2024-11-10 14:33:47,037 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8009950248756219 [2024-11-10 14:33:47,037 INFO L175 Difference]: Start difference. First operand has 148 places, 151 transitions, 442 flow. Second operand 3 states and 483 transitions. [2024-11-10 14:33:47,037 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 165 transitions, 594 flow [2024-11-10 14:33:47,039 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 165 transitions, 579 flow, removed 1 selfloop flow, removed 5 redundant places. [2024-11-10 14:33:47,042 INFO L231 Difference]: Finished difference. Result has 147 places, 159 transitions, 525 flow [2024-11-10 14:33:47,042 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=427, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=139, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=525, PETRI_PLACES=147, PETRI_TRANSITIONS=159} [2024-11-10 14:33:47,043 INFO L277 CegarLoopForPetriNet]: 184 programPoint places, -37 predicate places. [2024-11-10 14:33:47,043 INFO L471 AbstractCegarLoop]: Abstraction has has 147 places, 159 transitions, 525 flow [2024-11-10 14:33:47,044 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 150.66666666666666) internal successors, (452), 3 states have internal predecessors, (452), 0 states have call successors, (0), 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,044 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:33:47,044 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] [2024-11-10 14:33:47,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-10 14:33:47,045 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-10 14:33:47,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:33:47,045 INFO L85 PathProgramCache]: Analyzing trace with hash -1996566837, now seen corresponding path program 1 times [2024-11-10 14:33:47,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:33:47,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635006268] [2024-11-10 14:33:47,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:33:47,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:33:47,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:33:47,129 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,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:33:47,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635006268] [2024-11-10 14:33:47,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635006268] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:33:47,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:33:47,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:33:47,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989091582] [2024-11-10 14:33:47,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:33:47,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:33:47,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:33:47,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:33:47,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:33:47,172 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 201 [2024-11-10 14:33:47,173 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 159 transitions, 525 flow. Second operand has 3 states, 3 states have (on average 151.66666666666666) internal successors, (455), 3 states have internal predecessors, (455), 0 states have call successors, (0), 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,173 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:33:47,173 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 201 [2024-11-10 14:33:47,174 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:33:47,387 INFO L124 PetriNetUnfolderBase]: 291/1401 cut-off events. [2024-11-10 14:33:47,387 INFO L125 PetriNetUnfolderBase]: For 1155/1190 co-relation queries the response was YES. [2024-11-10 14:33:47,394 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2829 conditions, 1401 events. 291/1401 cut-off events. For 1155/1190 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 9660 event pairs, 134 based on Foata normal form. 9/1332 useless extension candidates. Maximal degree in co-relation 2820. Up to 501 conditions per place. [2024-11-10 14:33:47,399 INFO L140 encePairwiseOnDemand]: 193/201 looper letters, 49 selfloop transitions, 12 changer transitions 0/174 dead transitions. [2024-11-10 14:33:47,400 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 174 transitions, 714 flow [2024-11-10 14:33:47,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:33:47,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:33:47,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 484 transitions. [2024-11-10 14:33:47,402 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.802653399668325 [2024-11-10 14:33:47,402 INFO L175 Difference]: Start difference. First operand has 147 places, 159 transitions, 525 flow. Second operand 3 states and 484 transitions. [2024-11-10 14:33:47,402 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 174 transitions, 714 flow [2024-11-10 14:33:47,405 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 174 transitions, 686 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:33:47,408 INFO L231 Difference]: Finished difference. Result has 149 places, 167 transitions, 611 flow [2024-11-10 14:33:47,408 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=501, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=159, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=611, PETRI_PLACES=149, PETRI_TRANSITIONS=167} [2024-11-10 14:33:47,409 INFO L277 CegarLoopForPetriNet]: 184 programPoint places, -35 predicate places. [2024-11-10 14:33:47,409 INFO L471 AbstractCegarLoop]: Abstraction has has 149 places, 167 transitions, 611 flow [2024-11-10 14:33:47,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 151.66666666666666) internal successors, (455), 3 states have internal predecessors, (455), 0 states have call successors, (0), 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,410 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:33:47,410 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:33:47,410 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-10 14:33:47,410 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-10 14:33:47,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:33:47,411 INFO L85 PathProgramCache]: Analyzing trace with hash 978111735, now seen corresponding path program 1 times [2024-11-10 14:33:47,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:33:47,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785058689] [2024-11-10 14:33:47,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:33:47,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:33:47,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 14:33:47,430 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 14:33:47,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 14:33:47,448 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 14:33:47,448 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 14:33:47,449 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (15 of 16 remaining) [2024-11-10 14:33:47,449 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (14 of 16 remaining) [2024-11-10 14:33:47,449 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (13 of 16 remaining) [2024-11-10 14:33:47,449 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (12 of 16 remaining) [2024-11-10 14:33:47,449 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (11 of 16 remaining) [2024-11-10 14:33:47,449 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (10 of 16 remaining) [2024-11-10 14:33:47,450 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (9 of 16 remaining) [2024-11-10 14:33:47,450 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (8 of 16 remaining) [2024-11-10 14:33:47,450 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (7 of 16 remaining) [2024-11-10 14:33:47,450 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (6 of 16 remaining) [2024-11-10 14:33:47,450 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (5 of 16 remaining) [2024-11-10 14:33:47,450 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (4 of 16 remaining) [2024-11-10 14:33:47,450 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (3 of 16 remaining) [2024-11-10 14:33:47,451 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (2 of 16 remaining) [2024-11-10 14:33:47,451 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (1 of 16 remaining) [2024-11-10 14:33:47,451 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (0 of 16 remaining) [2024-11-10 14:33:47,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-10 14:33:47,451 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:33:47,452 WARN L244 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-10 14:33:47,452 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-11-10 14:33:47,475 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-11-10 14:33:47,479 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 230 places, 252 transitions, 531 flow [2024-11-10 14:33:47,545 INFO L124 PetriNetUnfolderBase]: 62/558 cut-off events. [2024-11-10 14:33:47,545 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2024-11-10 14:33:47,550 INFO L83 FinitePrefix]: Finished finitePrefix Result has 583 conditions, 558 events. 62/558 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2151 event pairs, 1 based on Foata normal form. 0/464 useless extension candidates. Maximal degree in co-relation 372. Up to 16 conditions per place. [2024-11-10 14:33:47,550 INFO L82 GeneralOperation]: Start removeDead. Operand has 230 places, 252 transitions, 531 flow [2024-11-10 14:33:47,555 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 230 places, 252 transitions, 531 flow [2024-11-10 14:33:47,557 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 14:33:47,557 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;@218c7091, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 14:33:47,557 INFO L334 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2024-11-10 14:33:47,562 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-10 14:33:47,562 INFO L124 PetriNetUnfolderBase]: 3/52 cut-off events. [2024-11-10 14:33:47,562 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-10 14:33:47,562 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:33:47,562 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:47,562 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2024-11-10 14:33:47,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:33:47,563 INFO L85 PathProgramCache]: Analyzing trace with hash 128227354, now seen corresponding path program 1 times [2024-11-10 14:33:47,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:33:47,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313244338] [2024-11-10 14:33:47,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:33:47,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:33:47,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:33:47,576 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,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:33:47,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313244338] [2024-11-10 14:33:47,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313244338] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:33:47,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:33:47,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:33:47,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691477166] [2024-11-10 14:33:47,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:33:47,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 14:33:47,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:33:47,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 14:33:47,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 14:33:47,579 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 198 out of 252 [2024-11-10 14:33:47,579 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 230 places, 252 transitions, 531 flow. Second operand has 2 states, 2 states have (on average 199.5) internal successors, (399), 2 states have internal predecessors, (399), 0 states have call successors, (0), 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,580 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:33:47,580 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 198 of 252 [2024-11-10 14:33:47,580 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:33:50,496 INFO L124 PetriNetUnfolderBase]: 4833/21029 cut-off events. [2024-11-10 14:33:50,496 INFO L125 PetriNetUnfolderBase]: For 940/940 co-relation queries the response was YES. [2024-11-10 14:33:50,639 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28454 conditions, 21029 events. 4833/21029 cut-off events. For 940/940 co-relation queries the response was YES. Maximal size of possible extension queue 464. Compared 254271 event pairs, 4795 based on Foata normal form. 7923/26947 useless extension candidates. Maximal degree in co-relation 23911. Up to 6995 conditions per place. [2024-11-10 14:33:50,722 INFO L140 encePairwiseOnDemand]: 227/252 looper letters, 28 selfloop transitions, 0 changer transitions 0/225 dead transitions. [2024-11-10 14:33:50,722 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 229 places, 225 transitions, 533 flow [2024-11-10 14:33:50,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 14:33:50,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-11-10 14:33:50,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 449 transitions. [2024-11-10 14:33:50,724 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8908730158730159 [2024-11-10 14:33:50,724 INFO L175 Difference]: Start difference. First operand has 230 places, 252 transitions, 531 flow. Second operand 2 states and 449 transitions. [2024-11-10 14:33:50,724 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 229 places, 225 transitions, 533 flow [2024-11-10 14:33:50,727 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 229 places, 225 transitions, 533 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-10 14:33:50,729 INFO L231 Difference]: Finished difference. Result has 229 places, 225 transitions, 477 flow [2024-11-10 14:33:50,730 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=252, PETRI_DIFFERENCE_MINUEND_FLOW=477, PETRI_DIFFERENCE_MINUEND_PLACES=228, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=225, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=225, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=477, PETRI_PLACES=229, PETRI_TRANSITIONS=225} [2024-11-10 14:33:50,730 INFO L277 CegarLoopForPetriNet]: 230 programPoint places, -1 predicate places. [2024-11-10 14:33:50,730 INFO L471 AbstractCegarLoop]: Abstraction has has 229 places, 225 transitions, 477 flow [2024-11-10 14:33:50,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 199.5) internal successors, (399), 2 states have internal predecessors, (399), 0 states have call successors, (0), 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:50,731 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:33:50,731 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] [2024-11-10 14:33:50,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-10 14:33:50,731 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2024-11-10 14:33:50,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:33:50,732 INFO L85 PathProgramCache]: Analyzing trace with hash -1828758295, now seen corresponding path program 1 times [2024-11-10 14:33:50,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:33:50,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673858639] [2024-11-10 14:33:50,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:33:50,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:33:50,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:33:50,950 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:50,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:33:50,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673858639] [2024-11-10 14:33:50,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673858639] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:33:50,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:33:50,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 14:33:50,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818157748] [2024-11-10 14:33:50,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:33:50,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 14:33:50,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:33:50,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 14:33:50,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-10 14:33:51,078 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 252 [2024-11-10 14:33:51,080 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 229 places, 225 transitions, 477 flow. Second operand has 6 states, 6 states have (on average 181.5) internal successors, (1089), 6 states have internal predecessors, (1089), 0 states have call successors, (0), 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,080 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:33:51,080 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 252 [2024-11-10 14:33:51,080 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:33:59,177 INFO L124 PetriNetUnfolderBase]: 19693/69601 cut-off events. [2024-11-10 14:33:59,178 INFO L125 PetriNetUnfolderBase]: For 1107/1107 co-relation queries the response was YES. [2024-11-10 14:33:59,455 INFO L83 FinitePrefix]: Finished finitePrefix Result has 98043 conditions, 69601 events. 19693/69601 cut-off events. For 1107/1107 co-relation queries the response was YES. Maximal size of possible extension queue 1378. Compared 956573 event pairs, 7382 based on Foata normal form. 0/63577 useless extension candidates. Maximal degree in co-relation 98037. Up to 20137 conditions per place. [2024-11-10 14:33:59,688 INFO L140 encePairwiseOnDemand]: 246/252 looper letters, 112 selfloop transitions, 5 changer transitions 0/296 dead transitions. [2024-11-10 14:33:59,688 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 233 places, 296 transitions, 853 flow [2024-11-10 14:33:59,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 14:33:59,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-10 14:33:59,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1198 transitions. [2024-11-10 14:33:59,693 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7923280423280423 [2024-11-10 14:33:59,693 INFO L175 Difference]: Start difference. First operand has 229 places, 225 transitions, 477 flow. Second operand 6 states and 1198 transitions. [2024-11-10 14:33:59,693 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 233 places, 296 transitions, 853 flow [2024-11-10 14:33:59,696 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 233 places, 296 transitions, 853 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-10 14:33:59,699 INFO L231 Difference]: Finished difference. Result has 233 places, 224 transitions, 485 flow [2024-11-10 14:33:59,699 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=252, PETRI_DIFFERENCE_MINUEND_FLOW=475, PETRI_DIFFERENCE_MINUEND_PLACES=228, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=224, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=219, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=485, PETRI_PLACES=233, PETRI_TRANSITIONS=224} [2024-11-10 14:33:59,700 INFO L277 CegarLoopForPetriNet]: 230 programPoint places, 3 predicate places. [2024-11-10 14:33:59,700 INFO L471 AbstractCegarLoop]: Abstraction has has 233 places, 224 transitions, 485 flow [2024-11-10 14:33:59,701 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 181.5) internal successors, (1089), 6 states have internal predecessors, (1089), 0 states have call successors, (0), 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:59,701 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:33:59,701 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:59,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-10 14:33:59,701 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2024-11-10 14:33:59,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:33:59,702 INFO L85 PathProgramCache]: Analyzing trace with hash -461327734, now seen corresponding path program 1 times [2024-11-10 14:33:59,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:33:59,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770408599] [2024-11-10 14:33:59,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:33:59,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:33:59,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:33:59,730 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:59,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:33:59,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770408599] [2024-11-10 14:33:59,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [770408599] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:33:59,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:33:59,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 14:33:59,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74445229] [2024-11-10 14:33:59,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:33:59,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:33:59,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:33:59,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:33:59,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:33:59,756 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 192 out of 252 [2024-11-10 14:33:59,757 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 233 places, 224 transitions, 485 flow. Second operand has 3 states, 3 states have (on average 194.0) internal successors, (582), 3 states have internal predecessors, (582), 0 states have call successors, (0), 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:59,757 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:33:59,757 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 192 of 252 [2024-11-10 14:33:59,757 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:34:03,890 INFO L124 PetriNetUnfolderBase]: 8956/36896 cut-off events. [2024-11-10 14:34:03,890 INFO L125 PetriNetUnfolderBase]: For 1342/1342 co-relation queries the response was YES. [2024-11-10 14:34:04,002 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50577 conditions, 36896 events. 8956/36896 cut-off events. For 1342/1342 co-relation queries the response was YES. Maximal size of possible extension queue 771. Compared 481656 event pairs, 8324 based on Foata normal form. 1/33453 useless extension candidates. Maximal degree in co-relation 50570. Up to 12814 conditions per place. [2024-11-10 14:34:04,116 INFO L140 encePairwiseOnDemand]: 249/252 looper letters, 39 selfloop transitions, 2 changer transitions 0/231 dead transitions. [2024-11-10 14:34:04,117 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 235 places, 231 transitions, 583 flow [2024-11-10 14:34:04,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:34:04,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:34:04,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 618 transitions. [2024-11-10 14:34:04,119 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8174603174603174 [2024-11-10 14:34:04,119 INFO L175 Difference]: Start difference. First operand has 233 places, 224 transitions, 485 flow. Second operand 3 states and 618 transitions. [2024-11-10 14:34:04,119 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 235 places, 231 transitions, 583 flow [2024-11-10 14:34:04,122 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 230 places, 231 transitions, 571 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-10 14:34:04,124 INFO L231 Difference]: Finished difference. Result has 231 places, 225 transitions, 487 flow [2024-11-10 14:34:04,124 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=252, PETRI_DIFFERENCE_MINUEND_FLOW=475, PETRI_DIFFERENCE_MINUEND_PLACES=228, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=224, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=222, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=487, PETRI_PLACES=231, PETRI_TRANSITIONS=225} [2024-11-10 14:34:04,125 INFO L277 CegarLoopForPetriNet]: 230 programPoint places, 1 predicate places. [2024-11-10 14:34:04,125 INFO L471 AbstractCegarLoop]: Abstraction has has 231 places, 225 transitions, 487 flow [2024-11-10 14:34:04,125 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 194.0) internal successors, (582), 3 states have internal predecessors, (582), 0 states have call successors, (0), 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:04,126 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:34:04,126 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] [2024-11-10 14:34:04,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-10 14:34:04,126 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2024-11-10 14:34:04,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:34:04,126 INFO L85 PathProgramCache]: Analyzing trace with hash 120870241, now seen corresponding path program 1 times [2024-11-10 14:34:04,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:34:04,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128997658] [2024-11-10 14:34:04,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:34:04,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:34:04,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:34:04,154 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:04,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:34:04,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128997658] [2024-11-10 14:34:04,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2128997658] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:34:04,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:34:04,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:34:04,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618705562] [2024-11-10 14:34:04,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:34:04,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:34:04,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:34:04,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:34:04,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:34:04,200 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 171 out of 252 [2024-11-10 14:34:04,201 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 231 places, 225 transitions, 487 flow. Second operand has 3 states, 3 states have (on average 172.66666666666666) internal successors, (518), 3 states have internal predecessors, (518), 0 states have call successors, (0), 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:04,201 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:34:04,201 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 171 of 252 [2024-11-10 14:34:04,201 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand