./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-data-race.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/parallel-parallel-sum-1.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/parallel-parallel-sum-1.wvr.c -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 b1e99af7c76570461a4b0ac70d664412f250ec04f47fd9ca8c0f85236f1348c6 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 17:13:47,897 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 17:13:47,965 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-10-14 17:13:47,973 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 17:13:47,974 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 17:13:47,998 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 17:13:47,999 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 17:13:47,999 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 17:13:48,000 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 17:13:48,004 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 17:13:48,005 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 17:13:48,005 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 17:13:48,006 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 17:13:48,006 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 17:13:48,007 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 17:13:48,007 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 17:13:48,008 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 17:13:48,008 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 17:13:48,008 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 17:13:48,009 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 17:13:48,009 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 17:13:48,009 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 17:13:48,010 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-10-14 17:13:48,010 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 17:13:48,010 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-14 17:13:48,010 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 17:13:48,011 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 17:13:48,011 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 17:13:48,011 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 17:13:48,011 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 17:13:48,012 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 17:13:48,012 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 17:13:48,013 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 17:13:48,013 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 17:13:48,013 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 17:13:48,013 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 17:13:48,013 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 17:13:48,014 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 17:13:48,014 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 17:13:48,014 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 17:13:48,014 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 17:13:48,015 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 -> b1e99af7c76570461a4b0ac70d664412f250ec04f47fd9ca8c0f85236f1348c6 [2024-10-14 17:13:48,289 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 17:13:48,314 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 17:13:48,317 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 17:13:48,318 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 17:13:48,319 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 17:13:48,320 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/parallel-parallel-sum-1.wvr.c [2024-10-14 17:13:49,725 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 17:13:49,952 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 17:13:49,953 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/parallel-parallel-sum-1.wvr.c [2024-10-14 17:13:49,972 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e911fae0/136ce0fc8d124be5b21804e223556900/FLAGf56b6588a [2024-10-14 17:13:50,301 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e911fae0/136ce0fc8d124be5b21804e223556900 [2024-10-14 17:13:50,304 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 17:13:50,306 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 17:13:50,308 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 17:13:50,308 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 17:13:50,315 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 17:13:50,315 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 05:13:50" (1/1) ... [2024-10-14 17:13:50,318 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38967055 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:13:50, skipping insertion in model container [2024-10-14 17:13:50,318 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 05:13:50" (1/1) ... [2024-10-14 17:13:50,347 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 17:13:50,548 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 17:13:50,564 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 17:13:50,620 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 17:13:50,651 INFO L204 MainTranslator]: Completed translation [2024-10-14 17:13:50,651 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:13:50 WrapperNode [2024-10-14 17:13:50,651 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 17:13:50,652 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 17:13:50,652 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 17:13:50,652 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 17:13:50,660 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:13:50" (1/1) ... [2024-10-14 17:13:50,677 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:13:50" (1/1) ... [2024-10-14 17:13:50,725 INFO L138 Inliner]: procedures = 26, calls = 49, calls flagged for inlining = 19, calls inlined = 25, statements flattened = 518 [2024-10-14 17:13:50,731 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 17:13:50,732 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 17:13:50,732 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 17:13:50,732 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 17:13:50,741 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:13:50" (1/1) ... [2024-10-14 17:13:50,742 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:13:50" (1/1) ... [2024-10-14 17:13:50,752 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:13:50" (1/1) ... [2024-10-14 17:13:50,752 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:13:50" (1/1) ... [2024-10-14 17:13:50,772 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:13:50" (1/1) ... [2024-10-14 17:13:50,780 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:13:50" (1/1) ... [2024-10-14 17:13:50,786 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:13:50" (1/1) ... [2024-10-14 17:13:50,788 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:13:50" (1/1) ... [2024-10-14 17:13:50,801 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 17:13:50,802 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 17:13:50,802 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 17:13:50,802 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 17:13:50,803 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:13:50" (1/1) ... [2024-10-14 17:13:50,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 17:13:50,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 17:13:50,843 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-10-14 17:13:50,850 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-10-14 17:13:50,896 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 17:13:50,896 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-10-14 17:13:50,897 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-10-14 17:13:50,897 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-10-14 17:13:50,897 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-10-14 17:13:50,897 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-10-14 17:13:50,898 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-10-14 17:13:50,898 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-10-14 17:13:50,898 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-10-14 17:13:50,898 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2024-10-14 17:13:50,899 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2024-10-14 17:13:50,899 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-10-14 17:13:50,899 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-10-14 17:13:50,899 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-10-14 17:13:50,900 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-14 17:13:50,901 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 17:13:50,901 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 17:13:50,902 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-14 17:13:51,013 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 17:13:51,015 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 17:13:51,651 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-14 17:13:51,651 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 17:13:52,080 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 17:13:52,081 INFO L314 CfgBuilder]: Removed 5 assume(true) statements. [2024-10-14 17:13:52,082 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 05:13:52 BoogieIcfgContainer [2024-10-14 17:13:52,082 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 17:13:52,085 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 17:13:52,085 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 17:13:52,088 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 17:13:52,089 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 05:13:50" (1/3) ... [2024-10-14 17:13:52,089 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52af801c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 05:13:52, skipping insertion in model container [2024-10-14 17:13:52,089 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:13:50" (2/3) ... [2024-10-14 17:13:52,089 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52af801c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 05:13:52, skipping insertion in model container [2024-10-14 17:13:52,090 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 05:13:52" (3/3) ... [2024-10-14 17:13:52,091 INFO L112 eAbstractionObserver]: Analyzing ICFG parallel-parallel-sum-1.wvr.c [2024-10-14 17:13:52,108 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 17:13:52,108 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 70 error locations. [2024-10-14 17:13:52,108 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-14 17:13:52,222 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-10-14 17:13:52,264 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 376 places, 383 transitions, 794 flow [2024-10-14 17:13:52,385 INFO L124 PetriNetUnfolderBase]: 20/379 cut-off events. [2024-10-14 17:13:52,386 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-10-14 17:13:52,396 INFO L83 FinitePrefix]: Finished finitePrefix Result has 396 conditions, 379 events. 20/379 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 484 event pairs, 0 based on Foata normal form. 0/289 useless extension candidates. Maximal degree in co-relation 311. Up to 2 conditions per place. [2024-10-14 17:13:52,396 INFO L82 GeneralOperation]: Start removeDead. Operand has 376 places, 383 transitions, 794 flow [2024-10-14 17:13:52,405 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 353 places, 358 transitions, 740 flow [2024-10-14 17:13:52,417 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 17:13:52,424 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;@380b8216, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 17:13:52,425 INFO L334 AbstractCegarLoop]: Starting to check reachability of 118 error locations. [2024-10-14 17:13:52,434 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-14 17:13:52,434 INFO L124 PetriNetUnfolderBase]: 0/27 cut-off events. [2024-10-14 17:13:52,434 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-14 17:13:52,434 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:13:52,435 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] [2024-10-14 17:13:52,436 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 114 more)] === [2024-10-14 17:13:52,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:13:52,442 INFO L85 PathProgramCache]: Analyzing trace with hash -942124618, now seen corresponding path program 1 times [2024-10-14 17:13:52,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:13:52,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789849753] [2024-10-14 17:13:52,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:13:52,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:13:52,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:13:52,636 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:13:52,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:13:52,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789849753] [2024-10-14 17:13:52,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789849753] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:13:52,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:13:52,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:13:52,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087052338] [2024-10-14 17:13:52,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:13:52,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:13:52,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:13:52,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:13:52,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:13:52,717 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 302 out of 383 [2024-10-14 17:13:52,722 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 353 places, 358 transitions, 740 flow. Second operand has 3 states, 3 states have (on average 303.3333333333333) internal successors, (910), 3 states have internal predecessors, (910), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:13:52,722 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:13:52,722 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 302 of 383 [2024-10-14 17:13:52,723 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:13:53,210 INFO L124 PetriNetUnfolderBase]: 450/1587 cut-off events. [2024-10-14 17:13:53,211 INFO L125 PetriNetUnfolderBase]: For 222/222 co-relation queries the response was YES. [2024-10-14 17:13:53,222 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2340 conditions, 1587 events. 450/1587 cut-off events. For 222/222 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 9806 event pairs, 230 based on Foata normal form. 317/1748 useless extension candidates. Maximal degree in co-relation 1950. Up to 599 conditions per place. [2024-10-14 17:13:53,233 INFO L140 encePairwiseOnDemand]: 327/383 looper letters, 22 selfloop transitions, 2 changer transitions 4/304 dead transitions. [2024-10-14 17:13:53,234 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 310 places, 304 transitions, 680 flow [2024-10-14 17:13:53,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:13:53,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:13:53,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 984 transitions. [2024-10-14 17:13:53,255 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.856396866840731 [2024-10-14 17:13:53,259 INFO L175 Difference]: Start difference. First operand has 353 places, 358 transitions, 740 flow. Second operand 3 states and 984 transitions. [2024-10-14 17:13:53,260 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 310 places, 304 transitions, 680 flow [2024-10-14 17:13:53,268 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 302 places, 304 transitions, 664 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-10-14 17:13:53,275 INFO L231 Difference]: Finished difference. Result has 302 places, 300 transitions, 612 flow [2024-10-14 17:13:53,278 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=383, PETRI_DIFFERENCE_MINUEND_FLOW=616, PETRI_DIFFERENCE_MINUEND_PLACES=300, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=304, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=302, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=612, PETRI_PLACES=302, PETRI_TRANSITIONS=300} [2024-10-14 17:13:53,283 INFO L277 CegarLoopForPetriNet]: 353 programPoint places, -51 predicate places. [2024-10-14 17:13:53,284 INFO L471 AbstractCegarLoop]: Abstraction has has 302 places, 300 transitions, 612 flow [2024-10-14 17:13:53,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 303.3333333333333) internal successors, (910), 3 states have internal predecessors, (910), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:13:53,285 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:13:53,285 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-10-14 17:13:53,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 17:13:53,286 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 114 more)] === [2024-10-14 17:13:53,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:13:53,287 INFO L85 PathProgramCache]: Analyzing trace with hash 1496031880, now seen corresponding path program 1 times [2024-10-14 17:13:53,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:13:53,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727802784] [2024-10-14 17:13:53,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:13:53,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:13:53,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:13:53,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:13:53,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:13:53,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727802784] [2024-10-14 17:13:53,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1727802784] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:13:53,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:13:53,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:13:53,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394980287] [2024-10-14 17:13:53,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:13:53,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:13:53,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:13:53,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:13:53,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:13:53,416 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 303 out of 383 [2024-10-14 17:13:53,417 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 302 places, 300 transitions, 612 flow. Second operand has 3 states, 3 states have (on average 304.3333333333333) internal successors, (913), 3 states have internal predecessors, (913), 0 states have call successors, (0), 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-10-14 17:13:53,417 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:13:53,417 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 303 of 383 [2024-10-14 17:13:53,417 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:13:53,763 INFO L124 PetriNetUnfolderBase]: 450/1582 cut-off events. [2024-10-14 17:13:53,763 INFO L125 PetriNetUnfolderBase]: For 56/56 co-relation queries the response was YES. [2024-10-14 17:13:53,769 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2223 conditions, 1582 events. 450/1582 cut-off events. For 56/56 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 9795 event pairs, 230 based on Foata normal form. 0/1431 useless extension candidates. Maximal degree in co-relation 2187. Up to 598 conditions per place. [2024-10-14 17:13:53,777 INFO L140 encePairwiseOnDemand]: 380/383 looper letters, 21 selfloop transitions, 2 changer transitions 0/299 dead transitions. [2024-10-14 17:13:53,778 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 299 places, 299 transitions, 656 flow [2024-10-14 17:13:53,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:13:53,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:13:53,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 933 transitions. [2024-10-14 17:13:53,781 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8120104438642297 [2024-10-14 17:13:53,781 INFO L175 Difference]: Start difference. First operand has 302 places, 300 transitions, 612 flow. Second operand 3 states and 933 transitions. [2024-10-14 17:13:53,781 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 299 places, 299 transitions, 656 flow [2024-10-14 17:13:53,785 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 297 places, 299 transitions, 652 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 17:13:53,789 INFO L231 Difference]: Finished difference. Result has 297 places, 299 transitions, 610 flow [2024-10-14 17:13:53,792 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=383, PETRI_DIFFERENCE_MINUEND_FLOW=606, PETRI_DIFFERENCE_MINUEND_PLACES=295, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=299, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=297, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=610, PETRI_PLACES=297, PETRI_TRANSITIONS=299} [2024-10-14 17:13:53,793 INFO L277 CegarLoopForPetriNet]: 353 programPoint places, -56 predicate places. [2024-10-14 17:13:53,793 INFO L471 AbstractCegarLoop]: Abstraction has has 297 places, 299 transitions, 610 flow [2024-10-14 17:13:53,794 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 304.3333333333333) internal successors, (913), 3 states have internal predecessors, (913), 0 states have call successors, (0), 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-10-14 17:13:53,794 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:13:53,794 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] [2024-10-14 17:13:53,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 17:13:53,795 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 114 more)] === [2024-10-14 17:13:53,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:13:53,797 INFO L85 PathProgramCache]: Analyzing trace with hash -1356282253, now seen corresponding path program 1 times [2024-10-14 17:13:53,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:13:53,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312815996] [2024-10-14 17:13:53,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:13:53,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:13:53,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:13:53,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:13:53,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:13:53,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312815996] [2024-10-14 17:13:53,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [312815996] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:13:53,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:13:53,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:13:53,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221954407] [2024-10-14 17:13:53,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:13:53,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:13:53,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:13:53,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:13:53,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:13:53,871 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 305 out of 383 [2024-10-14 17:13:53,872 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 297 places, 299 transitions, 610 flow. Second operand has 3 states, 3 states have (on average 306.3333333333333) internal successors, (919), 3 states have internal predecessors, (919), 0 states have call successors, (0), 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-10-14 17:13:53,872 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:13:53,873 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 305 of 383 [2024-10-14 17:13:53,873 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:13:54,212 INFO L124 PetriNetUnfolderBase]: 450/1581 cut-off events. [2024-10-14 17:13:54,212 INFO L125 PetriNetUnfolderBase]: For 56/56 co-relation queries the response was YES. [2024-10-14 17:13:54,217 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2220 conditions, 1581 events. 450/1581 cut-off events. For 56/56 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 9816 event pairs, 230 based on Foata normal form. 0/1431 useless extension candidates. Maximal degree in co-relation 2176. Up to 596 conditions per place. [2024-10-14 17:13:54,226 INFO L140 encePairwiseOnDemand]: 380/383 looper letters, 19 selfloop transitions, 2 changer transitions 0/298 dead transitions. [2024-10-14 17:13:54,226 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 298 places, 298 transitions, 650 flow [2024-10-14 17:13:54,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:13:54,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:13:54,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 937 transitions. [2024-10-14 17:13:54,229 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8154917319408181 [2024-10-14 17:13:54,229 INFO L175 Difference]: Start difference. First operand has 297 places, 299 transitions, 610 flow. Second operand 3 states and 937 transitions. [2024-10-14 17:13:54,229 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 298 places, 298 transitions, 650 flow [2024-10-14 17:13:54,231 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 296 places, 298 transitions, 646 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 17:13:54,234 INFO L231 Difference]: Finished difference. Result has 296 places, 298 transitions, 608 flow [2024-10-14 17:13:54,235 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=383, PETRI_DIFFERENCE_MINUEND_FLOW=604, PETRI_DIFFERENCE_MINUEND_PLACES=294, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=298, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=296, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=608, PETRI_PLACES=296, PETRI_TRANSITIONS=298} [2024-10-14 17:13:54,236 INFO L277 CegarLoopForPetriNet]: 353 programPoint places, -57 predicate places. [2024-10-14 17:13:54,236 INFO L471 AbstractCegarLoop]: Abstraction has has 296 places, 298 transitions, 608 flow [2024-10-14 17:13:54,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 306.3333333333333) internal successors, (919), 3 states have internal predecessors, (919), 0 states have call successors, (0), 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-10-14 17:13:54,237 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:13:54,237 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:13:54,237 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 17:13:54,237 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 114 more)] === [2024-10-14 17:13:54,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:13:54,238 INFO L85 PathProgramCache]: Analyzing trace with hash -613659787, now seen corresponding path program 1 times [2024-10-14 17:13:54,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:13:54,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909127792] [2024-10-14 17:13:54,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:13:54,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:13:54,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:13:54,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:13:54,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:13:54,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909127792] [2024-10-14 17:13:54,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909127792] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:13:54,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:13:54,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:13:54,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051158520] [2024-10-14 17:13:54,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:13:54,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:13:54,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:13:54,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:13:54,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:13:54,315 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 305 out of 383 [2024-10-14 17:13:54,317 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 296 places, 298 transitions, 608 flow. Second operand has 3 states, 3 states have (on average 306.3333333333333) internal successors, (919), 3 states have internal predecessors, (919), 0 states have call successors, (0), 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-10-14 17:13:54,317 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:13:54,317 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 305 of 383 [2024-10-14 17:13:54,318 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:13:54,591 INFO L124 PetriNetUnfolderBase]: 450/1580 cut-off events. [2024-10-14 17:13:54,591 INFO L125 PetriNetUnfolderBase]: For 56/56 co-relation queries the response was YES. [2024-10-14 17:13:54,596 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2219 conditions, 1580 events. 450/1580 cut-off events. For 56/56 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 9820 event pairs, 230 based on Foata normal form. 0/1431 useless extension candidates. Maximal degree in co-relation 2167. Up to 596 conditions per place. [2024-10-14 17:13:54,604 INFO L140 encePairwiseOnDemand]: 380/383 looper letters, 19 selfloop transitions, 2 changer transitions 0/297 dead transitions. [2024-10-14 17:13:54,605 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 297 places, 297 transitions, 648 flow [2024-10-14 17:13:54,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:13:54,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:13:54,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 937 transitions. [2024-10-14 17:13:54,608 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8154917319408181 [2024-10-14 17:13:54,608 INFO L175 Difference]: Start difference. First operand has 296 places, 298 transitions, 608 flow. Second operand 3 states and 937 transitions. [2024-10-14 17:13:54,608 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 297 places, 297 transitions, 648 flow [2024-10-14 17:13:54,610 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 295 places, 297 transitions, 644 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 17:13:54,613 INFO L231 Difference]: Finished difference. Result has 295 places, 297 transitions, 606 flow [2024-10-14 17:13:54,614 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=383, PETRI_DIFFERENCE_MINUEND_FLOW=602, PETRI_DIFFERENCE_MINUEND_PLACES=293, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=297, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=295, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=606, PETRI_PLACES=295, PETRI_TRANSITIONS=297} [2024-10-14 17:13:54,614 INFO L277 CegarLoopForPetriNet]: 353 programPoint places, -58 predicate places. [2024-10-14 17:13:54,615 INFO L471 AbstractCegarLoop]: Abstraction has has 295 places, 297 transitions, 606 flow [2024-10-14 17:13:54,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 306.3333333333333) internal successors, (919), 3 states have internal predecessors, (919), 0 states have call successors, (0), 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-10-14 17:13:54,615 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:13:54,616 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] [2024-10-14 17:13:54,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 17:13:54,616 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 114 more)] === [2024-10-14 17:13:54,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:13:54,617 INFO L85 PathProgramCache]: Analyzing trace with hash 1492457994, now seen corresponding path program 1 times [2024-10-14 17:13:54,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:13:54,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899097548] [2024-10-14 17:13:54,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:13:54,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:13:54,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:13:54,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:13:54,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:13:54,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899097548] [2024-10-14 17:13:54,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899097548] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:13:54,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:13:54,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:13:54,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550112003] [2024-10-14 17:13:54,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:13:54,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:13:54,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:13:54,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:13:54,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:13:54,672 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 305 out of 383 [2024-10-14 17:13:54,673 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 295 places, 297 transitions, 606 flow. Second operand has 3 states, 3 states have (on average 306.3333333333333) internal successors, (919), 3 states have internal predecessors, (919), 0 states have call successors, (0), 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-10-14 17:13:54,673 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:13:54,673 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 305 of 383 [2024-10-14 17:13:54,674 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:13:54,941 INFO L124 PetriNetUnfolderBase]: 450/1579 cut-off events. [2024-10-14 17:13:54,941 INFO L125 PetriNetUnfolderBase]: For 56/56 co-relation queries the response was YES. [2024-10-14 17:13:54,946 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2218 conditions, 1579 events. 450/1579 cut-off events. For 56/56 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 9830 event pairs, 230 based on Foata normal form. 0/1431 useless extension candidates. Maximal degree in co-relation 2158. Up to 596 conditions per place. [2024-10-14 17:13:54,953 INFO L140 encePairwiseOnDemand]: 380/383 looper letters, 19 selfloop transitions, 2 changer transitions 0/296 dead transitions. [2024-10-14 17:13:54,953 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 296 places, 296 transitions, 646 flow [2024-10-14 17:13:54,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:13:54,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:13:54,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 937 transitions. [2024-10-14 17:13:54,956 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8154917319408181 [2024-10-14 17:13:54,956 INFO L175 Difference]: Start difference. First operand has 295 places, 297 transitions, 606 flow. Second operand 3 states and 937 transitions. [2024-10-14 17:13:54,956 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 296 places, 296 transitions, 646 flow [2024-10-14 17:13:54,958 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 294 places, 296 transitions, 642 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 17:13:54,961 INFO L231 Difference]: Finished difference. Result has 294 places, 296 transitions, 604 flow [2024-10-14 17:13:54,962 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=383, PETRI_DIFFERENCE_MINUEND_FLOW=600, PETRI_DIFFERENCE_MINUEND_PLACES=292, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=296, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=294, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=604, PETRI_PLACES=294, PETRI_TRANSITIONS=296} [2024-10-14 17:13:54,962 INFO L277 CegarLoopForPetriNet]: 353 programPoint places, -59 predicate places. [2024-10-14 17:13:54,963 INFO L471 AbstractCegarLoop]: Abstraction has has 294 places, 296 transitions, 604 flow [2024-10-14 17:13:54,963 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 306.3333333333333) internal successors, (919), 3 states have internal predecessors, (919), 0 states have call successors, (0), 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-10-14 17:13:54,963 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:13:54,964 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:13:54,964 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 17:13:54,964 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 114 more)] === [2024-10-14 17:13:54,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:13:54,965 INFO L85 PathProgramCache]: Analyzing trace with hash -296169694, now seen corresponding path program 1 times [2024-10-14 17:13:54,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:13:54,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758680141] [2024-10-14 17:13:54,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:13:54,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:13:54,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:13:55,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:13:55,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:13:55,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758680141] [2024-10-14 17:13:55,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1758680141] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:13:55,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:13:55,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:13:55,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547518747] [2024-10-14 17:13:55,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:13:55,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:13:55,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:13:55,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:13:55,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:13:55,048 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 305 out of 383 [2024-10-14 17:13:55,050 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 294 places, 296 transitions, 604 flow. Second operand has 3 states, 3 states have (on average 306.3333333333333) internal successors, (919), 3 states have internal predecessors, (919), 0 states have call successors, (0), 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-10-14 17:13:55,050 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:13:55,050 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 305 of 383 [2024-10-14 17:13:55,050 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:13:55,319 INFO L124 PetriNetUnfolderBase]: 450/1578 cut-off events. [2024-10-14 17:13:55,320 INFO L125 PetriNetUnfolderBase]: For 56/56 co-relation queries the response was YES. [2024-10-14 17:13:55,324 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2217 conditions, 1578 events. 450/1578 cut-off events. For 56/56 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 9819 event pairs, 230 based on Foata normal form. 0/1431 useless extension candidates. Maximal degree in co-relation 2149. Up to 596 conditions per place. [2024-10-14 17:13:55,333 INFO L140 encePairwiseOnDemand]: 380/383 looper letters, 19 selfloop transitions, 2 changer transitions 0/295 dead transitions. [2024-10-14 17:13:55,334 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 295 places, 295 transitions, 644 flow [2024-10-14 17:13:55,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:13:55,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:13:55,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 937 transitions. [2024-10-14 17:13:55,337 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8154917319408181 [2024-10-14 17:13:55,337 INFO L175 Difference]: Start difference. First operand has 294 places, 296 transitions, 604 flow. Second operand 3 states and 937 transitions. [2024-10-14 17:13:55,337 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 295 places, 295 transitions, 644 flow [2024-10-14 17:13:55,339 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 293 places, 295 transitions, 640 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 17:13:55,343 INFO L231 Difference]: Finished difference. Result has 293 places, 295 transitions, 602 flow [2024-10-14 17:13:55,343 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=383, PETRI_DIFFERENCE_MINUEND_FLOW=598, PETRI_DIFFERENCE_MINUEND_PLACES=291, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=295, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=293, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=602, PETRI_PLACES=293, PETRI_TRANSITIONS=295} [2024-10-14 17:13:55,344 INFO L277 CegarLoopForPetriNet]: 353 programPoint places, -60 predicate places. [2024-10-14 17:13:55,344 INFO L471 AbstractCegarLoop]: Abstraction has has 293 places, 295 transitions, 602 flow [2024-10-14 17:13:55,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 306.3333333333333) internal successors, (919), 3 states have internal predecessors, (919), 0 states have call successors, (0), 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-10-14 17:13:55,345 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:13:55,345 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:13:55,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 17:13:55,346 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 114 more)] === [2024-10-14 17:13:55,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:13:55,346 INFO L85 PathProgramCache]: Analyzing trace with hash -1743298796, now seen corresponding path program 1 times [2024-10-14 17:13:55,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:13:55,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746661334] [2024-10-14 17:13:55,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:13:55,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:13:55,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:13:55,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:13:55,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:13:55,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746661334] [2024-10-14 17:13:55,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [746661334] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:13:55,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:13:55,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:13:55,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852360523] [2024-10-14 17:13:55,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:13:55,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:13:55,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:13:55,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:13:55,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:13:55,435 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 300 out of 383 [2024-10-14 17:13:55,437 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 293 places, 295 transitions, 602 flow. Second operand has 3 states, 3 states have (on average 301.3333333333333) internal successors, (904), 3 states have internal predecessors, (904), 0 states have call successors, (0), 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-10-14 17:13:55,437 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:13:55,437 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 300 of 383 [2024-10-14 17:13:55,437 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:13:55,689 INFO L124 PetriNetUnfolderBase]: 450/1577 cut-off events. [2024-10-14 17:13:55,690 INFO L125 PetriNetUnfolderBase]: For 56/56 co-relation queries the response was YES. [2024-10-14 17:13:55,696 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2221 conditions, 1577 events. 450/1577 cut-off events. For 56/56 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 9808 event pairs, 230 based on Foata normal form. 0/1431 useless extension candidates. Maximal degree in co-relation 2145. Up to 601 conditions per place. [2024-10-14 17:13:55,703 INFO L140 encePairwiseOnDemand]: 380/383 looper letters, 24 selfloop transitions, 2 changer transitions 0/294 dead transitions. [2024-10-14 17:13:55,703 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 294 places, 294 transitions, 652 flow [2024-10-14 17:13:55,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:13:55,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:13:55,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 927 transitions. [2024-10-14 17:13:55,706 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8067885117493473 [2024-10-14 17:13:55,706 INFO L175 Difference]: Start difference. First operand has 293 places, 295 transitions, 602 flow. Second operand 3 states and 927 transitions. [2024-10-14 17:13:55,706 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 294 places, 294 transitions, 652 flow [2024-10-14 17:13:55,711 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 292 places, 294 transitions, 648 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 17:13:55,714 INFO L231 Difference]: Finished difference. Result has 292 places, 294 transitions, 600 flow [2024-10-14 17:13:55,715 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=383, PETRI_DIFFERENCE_MINUEND_FLOW=596, PETRI_DIFFERENCE_MINUEND_PLACES=290, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=294, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=292, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=600, PETRI_PLACES=292, PETRI_TRANSITIONS=294} [2024-10-14 17:13:55,715 INFO L277 CegarLoopForPetriNet]: 353 programPoint places, -61 predicate places. [2024-10-14 17:13:55,716 INFO L471 AbstractCegarLoop]: Abstraction has has 292 places, 294 transitions, 600 flow [2024-10-14 17:13:55,718 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 301.3333333333333) internal successors, (904), 3 states have internal predecessors, (904), 0 states have call successors, (0), 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-10-14 17:13:55,718 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:13:55,718 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:13:55,719 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 17:13:55,719 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 114 more)] === [2024-10-14 17:13:55,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:13:55,720 INFO L85 PathProgramCache]: Analyzing trace with hash 581560225, now seen corresponding path program 1 times [2024-10-14 17:13:55,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:13:55,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493501419] [2024-10-14 17:13:55,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:13:55,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:13:55,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:13:55,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:13:55,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:13:55,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493501419] [2024-10-14 17:13:55,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493501419] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:13:55,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:13:55,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:13:55,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31194677] [2024-10-14 17:13:55,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:13:55,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:13:55,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:13:55,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:13:55,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:13:55,788 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 303 out of 383 [2024-10-14 17:13:55,789 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 292 places, 294 transitions, 600 flow. Second operand has 3 states, 3 states have (on average 304.3333333333333) internal successors, (913), 3 states have internal predecessors, (913), 0 states have call successors, (0), 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-10-14 17:13:55,789 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:13:55,790 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 303 of 383 [2024-10-14 17:13:55,790 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:13:56,027 INFO L124 PetriNetUnfolderBase]: 450/1576 cut-off events. [2024-10-14 17:13:56,028 INFO L125 PetriNetUnfolderBase]: For 56/56 co-relation queries the response was YES. [2024-10-14 17:13:56,035 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2217 conditions, 1576 events. 450/1576 cut-off events. For 56/56 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 9784 event pairs, 230 based on Foata normal form. 0/1431 useless extension candidates. Maximal degree in co-relation 2133. Up to 598 conditions per place. [2024-10-14 17:13:56,041 INFO L140 encePairwiseOnDemand]: 380/383 looper letters, 21 selfloop transitions, 2 changer transitions 0/293 dead transitions. [2024-10-14 17:13:56,042 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 293 places, 293 transitions, 644 flow [2024-10-14 17:13:56,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:13:56,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:13:56,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 933 transitions. [2024-10-14 17:13:56,045 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8120104438642297 [2024-10-14 17:13:56,045 INFO L175 Difference]: Start difference. First operand has 292 places, 294 transitions, 600 flow. Second operand 3 states and 933 transitions. [2024-10-14 17:13:56,046 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 293 places, 293 transitions, 644 flow [2024-10-14 17:13:56,047 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 291 places, 293 transitions, 640 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 17:13:56,051 INFO L231 Difference]: Finished difference. Result has 291 places, 293 transitions, 598 flow [2024-10-14 17:13:56,051 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=383, PETRI_DIFFERENCE_MINUEND_FLOW=594, PETRI_DIFFERENCE_MINUEND_PLACES=289, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=293, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=291, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=598, PETRI_PLACES=291, PETRI_TRANSITIONS=293} [2024-10-14 17:13:56,053 INFO L277 CegarLoopForPetriNet]: 353 programPoint places, -62 predicate places. [2024-10-14 17:13:56,053 INFO L471 AbstractCegarLoop]: Abstraction has has 291 places, 293 transitions, 598 flow [2024-10-14 17:13:56,054 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 304.3333333333333) internal successors, (913), 3 states have internal predecessors, (913), 0 states have call successors, (0), 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-10-14 17:13:56,056 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:13:56,056 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:13:56,056 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-14 17:13:56,056 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 114 more)] === [2024-10-14 17:13:56,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:13:56,057 INFO L85 PathProgramCache]: Analyzing trace with hash 1464053019, now seen corresponding path program 1 times [2024-10-14 17:13:56,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:13:56,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116788824] [2024-10-14 17:13:56,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:13:56,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:13:56,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:13:56,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:13:56,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:13:56,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116788824] [2024-10-14 17:13:56,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116788824] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:13:56,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:13:56,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:13:56,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392680680] [2024-10-14 17:13:56,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:13:56,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:13:56,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:13:56,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:13:56,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:13:56,127 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 302 out of 383 [2024-10-14 17:13:56,129 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 291 places, 293 transitions, 598 flow. Second operand has 3 states, 3 states have (on average 303.3333333333333) internal successors, (910), 3 states have internal predecessors, (910), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:13:56,130 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:13:56,130 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 302 of 383 [2024-10-14 17:13:56,130 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:13:56,355 INFO L124 PetriNetUnfolderBase]: 450/1575 cut-off events. [2024-10-14 17:13:56,356 INFO L125 PetriNetUnfolderBase]: For 56/56 co-relation queries the response was YES. [2024-10-14 17:13:56,361 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2217 conditions, 1575 events. 450/1575 cut-off events. For 56/56 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 9796 event pairs, 230 based on Foata normal form. 0/1431 useless extension candidates. Maximal degree in co-relation 2125. Up to 599 conditions per place. [2024-10-14 17:13:56,367 INFO L140 encePairwiseOnDemand]: 380/383 looper letters, 22 selfloop transitions, 2 changer transitions 0/292 dead transitions. [2024-10-14 17:13:56,367 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 292 places, 292 transitions, 644 flow [2024-10-14 17:13:56,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:13:56,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:13:56,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 931 transitions. [2024-10-14 17:13:56,370 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8102697998259356 [2024-10-14 17:13:56,370 INFO L175 Difference]: Start difference. First operand has 291 places, 293 transitions, 598 flow. Second operand 3 states and 931 transitions. [2024-10-14 17:13:56,370 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 292 places, 292 transitions, 644 flow [2024-10-14 17:13:56,371 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 290 places, 292 transitions, 640 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 17:13:56,374 INFO L231 Difference]: Finished difference. Result has 290 places, 292 transitions, 596 flow [2024-10-14 17:13:56,375 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=383, PETRI_DIFFERENCE_MINUEND_FLOW=592, PETRI_DIFFERENCE_MINUEND_PLACES=288, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=292, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=290, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=596, PETRI_PLACES=290, PETRI_TRANSITIONS=292} [2024-10-14 17:13:56,376 INFO L277 CegarLoopForPetriNet]: 353 programPoint places, -63 predicate places. [2024-10-14 17:13:56,376 INFO L471 AbstractCegarLoop]: Abstraction has has 290 places, 292 transitions, 596 flow [2024-10-14 17:13:56,377 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 303.3333333333333) internal successors, (910), 3 states have internal predecessors, (910), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:13:56,377 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:13:56,377 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:13:56,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-14 17:13:56,377 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 114 more)] === [2024-10-14 17:13:56,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:13:56,378 INFO L85 PathProgramCache]: Analyzing trace with hash -2021101458, now seen corresponding path program 1 times [2024-10-14 17:13:56,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:13:56,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999986506] [2024-10-14 17:13:56,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:13:56,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:13:56,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:13:56,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:13:56,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:13:56,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999986506] [2024-10-14 17:13:56,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999986506] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:13:56,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:13:56,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:13:56,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036645577] [2024-10-14 17:13:56,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:13:56,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:13:56,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:13:56,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:13:56,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:13:56,425 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 302 out of 383 [2024-10-14 17:13:56,427 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 290 places, 292 transitions, 596 flow. Second operand has 3 states, 3 states have (on average 303.0) internal successors, (909), 3 states have internal predecessors, (909), 0 states have call successors, (0), 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-10-14 17:13:56,427 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:13:56,427 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 302 of 383 [2024-10-14 17:13:56,427 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:13:56,674 INFO L124 PetriNetUnfolderBase]: 450/1572 cut-off events. [2024-10-14 17:13:56,674 INFO L125 PetriNetUnfolderBase]: For 57/57 co-relation queries the response was YES. [2024-10-14 17:13:56,678 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2213 conditions, 1572 events. 450/1572 cut-off events. For 57/57 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 9812 event pairs, 230 based on Foata normal form. 0/1431 useless extension candidates. Maximal degree in co-relation 2113. Up to 598 conditions per place. [2024-10-14 17:13:56,682 INFO L140 encePairwiseOnDemand]: 379/383 looper letters, 22 selfloop transitions, 1 changer transitions 0/289 dead transitions. [2024-10-14 17:13:56,682 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 289 places, 289 transitions, 636 flow [2024-10-14 17:13:56,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:13:56,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:13:56,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 932 transitions. [2024-10-14 17:13:56,685 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8111401218450827 [2024-10-14 17:13:56,685 INFO L175 Difference]: Start difference. First operand has 290 places, 292 transitions, 596 flow. Second operand 3 states and 932 transitions. [2024-10-14 17:13:56,685 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 289 places, 289 transitions, 636 flow [2024-10-14 17:13:56,687 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 287 places, 289 transitions, 632 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 17:13:56,690 INFO L231 Difference]: Finished difference. Result has 287 places, 289 transitions, 588 flow [2024-10-14 17:13:56,690 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=383, PETRI_DIFFERENCE_MINUEND_FLOW=586, PETRI_DIFFERENCE_MINUEND_PLACES=285, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=289, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=288, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=588, PETRI_PLACES=287, PETRI_TRANSITIONS=289} [2024-10-14 17:13:56,691 INFO L277 CegarLoopForPetriNet]: 353 programPoint places, -66 predicate places. [2024-10-14 17:13:56,692 INFO L471 AbstractCegarLoop]: Abstraction has has 287 places, 289 transitions, 588 flow [2024-10-14 17:13:56,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 303.0) internal successors, (909), 3 states have internal predecessors, (909), 0 states have call successors, (0), 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-10-14 17:13:56,693 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:13:56,693 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:13:56,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-14 17:13:56,693 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 114 more)] === [2024-10-14 17:13:56,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:13:56,694 INFO L85 PathProgramCache]: Analyzing trace with hash -1786525486, now seen corresponding path program 1 times [2024-10-14 17:13:56,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:13:56,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288227718] [2024-10-14 17:13:56,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:13:56,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:13:56,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:13:56,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:13:56,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:13:56,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288227718] [2024-10-14 17:13:56,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288227718] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:13:56,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:13:56,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:13:56,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523368985] [2024-10-14 17:13:56,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:13:56,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:13:56,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:13:56,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:13:56,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:13:56,772 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 305 out of 383 [2024-10-14 17:13:56,774 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 287 places, 289 transitions, 588 flow. Second operand has 3 states, 3 states have (on average 306.3333333333333) internal successors, (919), 3 states have internal predecessors, (919), 0 states have call successors, (0), 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-10-14 17:13:56,774 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:13:56,774 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 305 of 383 [2024-10-14 17:13:56,774 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:13:56,987 INFO L124 PetriNetUnfolderBase]: 450/1571 cut-off events. [2024-10-14 17:13:56,988 INFO L125 PetriNetUnfolderBase]: For 56/56 co-relation queries the response was YES. [2024-10-14 17:13:56,995 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2209 conditions, 1571 events. 450/1571 cut-off events. For 56/56 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 9808 event pairs, 230 based on Foata normal form. 0/1431 useless extension candidates. Maximal degree in co-relation 2109. Up to 596 conditions per place. [2024-10-14 17:13:57,001 INFO L140 encePairwiseOnDemand]: 380/383 looper letters, 19 selfloop transitions, 2 changer transitions 0/288 dead transitions. [2024-10-14 17:13:57,001 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 288 places, 288 transitions, 628 flow [2024-10-14 17:13:57,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:13:57,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:13:57,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 937 transitions. [2024-10-14 17:13:57,004 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8154917319408181 [2024-10-14 17:13:57,005 INFO L175 Difference]: Start difference. First operand has 287 places, 289 transitions, 588 flow. Second operand 3 states and 937 transitions. [2024-10-14 17:13:57,005 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 288 places, 288 transitions, 628 flow [2024-10-14 17:13:57,010 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 287 places, 288 transitions, 627 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-14 17:13:57,013 INFO L231 Difference]: Finished difference. Result has 287 places, 288 transitions, 589 flow [2024-10-14 17:13:57,014 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=383, PETRI_DIFFERENCE_MINUEND_FLOW=585, PETRI_DIFFERENCE_MINUEND_PLACES=285, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=288, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=286, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=589, PETRI_PLACES=287, PETRI_TRANSITIONS=288} [2024-10-14 17:13:57,015 INFO L277 CegarLoopForPetriNet]: 353 programPoint places, -66 predicate places. [2024-10-14 17:13:57,015 INFO L471 AbstractCegarLoop]: Abstraction has has 287 places, 288 transitions, 589 flow [2024-10-14 17:13:57,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 306.3333333333333) internal successors, (919), 3 states have internal predecessors, (919), 0 states have call successors, (0), 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-10-14 17:13:57,016 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:13:57,016 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:13:57,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-14 17:13:57,017 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 114 more)] === [2024-10-14 17:13:57,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:13:57,017 INFO L85 PathProgramCache]: Analyzing trace with hash 1530365719, now seen corresponding path program 1 times [2024-10-14 17:13:57,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:13:57,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714244713] [2024-10-14 17:13:57,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:13:57,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:13:57,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:13:57,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:13:57,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:13:57,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714244713] [2024-10-14 17:13:57,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1714244713] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:13:57,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:13:57,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 17:13:57,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144774197] [2024-10-14 17:13:57,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:13:57,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 17:13:57,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:13:57,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 17:13:57,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-14 17:13:57,627 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 298 out of 383 [2024-10-14 17:13:57,630 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 287 places, 288 transitions, 589 flow. Second operand has 6 states, 6 states have (on average 299.5) internal successors, (1797), 6 states have internal predecessors, (1797), 0 states have call successors, (0), 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-10-14 17:13:57,630 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:13:57,630 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 298 of 383 [2024-10-14 17:13:57,630 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:13:57,870 INFO L124 PetriNetUnfolderBase]: 450/1570 cut-off events. [2024-10-14 17:13:57,870 INFO L125 PetriNetUnfolderBase]: For 56/56 co-relation queries the response was YES. [2024-10-14 17:13:57,877 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2218 conditions, 1570 events. 450/1570 cut-off events. For 56/56 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 9801 event pairs, 230 based on Foata normal form. 0/1431 useless extension candidates. Maximal degree in co-relation 2119. Up to 601 conditions per place. [2024-10-14 17:13:57,884 INFO L140 encePairwiseOnDemand]: 377/383 looper letters, 24 selfloop transitions, 5 changer transitions 0/287 dead transitions. [2024-10-14 17:13:57,884 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 291 places, 287 transitions, 645 flow [2024-10-14 17:13:57,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 17:13:57,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-14 17:13:57,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1818 transitions. [2024-10-14 17:13:57,889 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7911227154046997 [2024-10-14 17:13:57,889 INFO L175 Difference]: Start difference. First operand has 287 places, 288 transitions, 589 flow. Second operand 6 states and 1818 transitions. [2024-10-14 17:13:57,889 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 291 places, 287 transitions, 645 flow [2024-10-14 17:13:57,891 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 289 places, 287 transitions, 641 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 17:13:57,894 INFO L231 Difference]: Finished difference. Result has 289 places, 287 transitions, 593 flow [2024-10-14 17:13:57,894 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=383, PETRI_DIFFERENCE_MINUEND_FLOW=583, PETRI_DIFFERENCE_MINUEND_PLACES=284, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=287, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=282, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=593, PETRI_PLACES=289, PETRI_TRANSITIONS=287} [2024-10-14 17:13:57,895 INFO L277 CegarLoopForPetriNet]: 353 programPoint places, -64 predicate places. [2024-10-14 17:13:57,895 INFO L471 AbstractCegarLoop]: Abstraction has has 289 places, 287 transitions, 593 flow [2024-10-14 17:13:57,896 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 299.5) internal successors, (1797), 6 states have internal predecessors, (1797), 0 states have call successors, (0), 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-10-14 17:13:57,896 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:13:57,897 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:13:57,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-14 17:13:57,897 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 114 more)] === [2024-10-14 17:13:57,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:13:57,906 INFO L85 PathProgramCache]: Analyzing trace with hash 750580831, now seen corresponding path program 1 times [2024-10-14 17:13:57,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:13:57,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433147446] [2024-10-14 17:13:57,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:13:57,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:13:57,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:13:57,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:13:57,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:13:57,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433147446] [2024-10-14 17:13:57,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433147446] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:13:57,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:13:57,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:13:57,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621275176] [2024-10-14 17:13:57,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:13:57,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:13:57,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:13:57,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:13:57,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:13:57,973 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 296 out of 383 [2024-10-14 17:13:57,975 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 289 places, 287 transitions, 593 flow. Second operand has 3 states, 3 states have (on average 297.0) internal successors, (891), 3 states have internal predecessors, (891), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:13:57,975 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:13:57,975 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 296 of 383 [2024-10-14 17:13:57,975 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:13:58,272 INFO L124 PetriNetUnfolderBase]: 659/2053 cut-off events. [2024-10-14 17:13:58,272 INFO L125 PetriNetUnfolderBase]: For 74/74 co-relation queries the response was YES. [2024-10-14 17:13:58,282 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3003 conditions, 2053 events. 659/2053 cut-off events. For 74/74 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 13959 event pairs, 108 based on Foata normal form. 0/1862 useless extension candidates. Maximal degree in co-relation 2985. Up to 645 conditions per place. [2024-10-14 17:13:58,291 INFO L140 encePairwiseOnDemand]: 374/383 looper letters, 39 selfloop transitions, 4 changer transitions 0/298 dead transitions. [2024-10-14 17:13:58,292 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 286 places, 298 transitions, 708 flow [2024-10-14 17:13:58,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:13:58,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:13:58,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 936 transitions. [2024-10-14 17:13:58,295 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.814621409921671 [2024-10-14 17:13:58,295 INFO L175 Difference]: Start difference. First operand has 289 places, 287 transitions, 593 flow. Second operand 3 states and 936 transitions. [2024-10-14 17:13:58,295 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 286 places, 298 transitions, 708 flow [2024-10-14 17:13:58,297 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 281 places, 298 transitions, 698 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-10-14 17:13:58,304 INFO L231 Difference]: Finished difference. Result has 283 places, 285 transitions, 601 flow [2024-10-14 17:13:58,305 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=383, PETRI_DIFFERENCE_MINUEND_FLOW=573, PETRI_DIFFERENCE_MINUEND_PLACES=279, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=282, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=278, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=601, PETRI_PLACES=283, PETRI_TRANSITIONS=285} [2024-10-14 17:13:58,306 INFO L277 CegarLoopForPetriNet]: 353 programPoint places, -70 predicate places. [2024-10-14 17:13:58,306 INFO L471 AbstractCegarLoop]: Abstraction has has 283 places, 285 transitions, 601 flow [2024-10-14 17:13:58,307 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 297.0) internal successors, (891), 3 states have internal predecessors, (891), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:13:58,307 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:13:58,307 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:13:58,307 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-14 17:13:58,308 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 114 more)] === [2024-10-14 17:13:58,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:13:58,308 INFO L85 PathProgramCache]: Analyzing trace with hash -246283356, now seen corresponding path program 1 times [2024-10-14 17:13:58,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:13:58,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958546762] [2024-10-14 17:13:58,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:13:58,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:13:58,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:13:58,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:13:58,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:13:58,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958546762] [2024-10-14 17:13:58,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958546762] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:13:58,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:13:58,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:13:58,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248419533] [2024-10-14 17:13:58,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:13:58,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:13:58,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:13:58,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:13:58,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:13:58,360 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 305 out of 383 [2024-10-14 17:13:58,362 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 283 places, 285 transitions, 601 flow. Second operand has 3 states, 3 states have (on average 306.0) internal successors, (918), 3 states have internal predecessors, (918), 0 states have call successors, (0), 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-10-14 17:13:58,362 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:13:58,362 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 305 of 383 [2024-10-14 17:13:58,362 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:13:58,732 INFO L124 PetriNetUnfolderBase]: 896/2704 cut-off events. [2024-10-14 17:13:58,732 INFO L125 PetriNetUnfolderBase]: For 421/421 co-relation queries the response was YES. [2024-10-14 17:13:58,741 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4255 conditions, 2704 events. 896/2704 cut-off events. For 421/421 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 19747 event pairs, 163 based on Foata normal form. 1/2506 useless extension candidates. Maximal degree in co-relation 4154. Up to 824 conditions per place. [2024-10-14 17:13:58,754 INFO L140 encePairwiseOnDemand]: 377/383 looper letters, 33 selfloop transitions, 3 changer transitions 12/299 dead transitions. [2024-10-14 17:13:58,755 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 283 places, 299 transitions, 722 flow [2024-10-14 17:13:58,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:13:58,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:13:58,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 951 transitions. [2024-10-14 17:13:58,758 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8276762402088773 [2024-10-14 17:13:58,758 INFO L175 Difference]: Start difference. First operand has 283 places, 285 transitions, 601 flow. Second operand 3 states and 951 transitions. [2024-10-14 17:13:58,758 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 283 places, 299 transitions, 722 flow [2024-10-14 17:13:58,760 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 281 places, 299 transitions, 710 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 17:13:58,763 INFO L231 Difference]: Finished difference. Result has 282 places, 274 transitions, 580 flow [2024-10-14 17:13:58,764 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=383, PETRI_DIFFERENCE_MINUEND_FLOW=589, PETRI_DIFFERENCE_MINUEND_PLACES=279, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=283, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=280, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=580, PETRI_PLACES=282, PETRI_TRANSITIONS=274} [2024-10-14 17:13:58,765 INFO L277 CegarLoopForPetriNet]: 353 programPoint places, -71 predicate places. [2024-10-14 17:13:58,765 INFO L471 AbstractCegarLoop]: Abstraction has has 282 places, 274 transitions, 580 flow [2024-10-14 17:13:58,765 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 306.0) internal successors, (918), 3 states have internal predecessors, (918), 0 states have call successors, (0), 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-10-14 17:13:58,766 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:13:58,766 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:13:58,766 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-14 17:13:58,766 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 114 more)] === [2024-10-14 17:13:58,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:13:58,767 INFO L85 PathProgramCache]: Analyzing trace with hash 1286801110, now seen corresponding path program 1 times [2024-10-14 17:13:58,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:13:58,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778504491] [2024-10-14 17:13:58,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:13:58,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:13:58,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:13:58,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:13:58,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:13:58,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778504491] [2024-10-14 17:13:58,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778504491] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:13:58,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:13:58,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:13:58,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894712904] [2024-10-14 17:13:58,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:13:58,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:13:58,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:13:58,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:13:58,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:13:58,825 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 302 out of 383 [2024-10-14 17:13:58,826 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 282 places, 274 transitions, 580 flow. Second operand has 3 states, 3 states have (on average 303.0) internal successors, (909), 3 states have internal predecessors, (909), 0 states have call successors, (0), 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-10-14 17:13:58,826 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:13:58,826 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 302 of 383 [2024-10-14 17:13:58,826 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:13:59,223 INFO L124 PetriNetUnfolderBase]: 1012/2560 cut-off events. [2024-10-14 17:13:59,224 INFO L125 PetriNetUnfolderBase]: For 384/384 co-relation queries the response was YES. [2024-10-14 17:13:59,233 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4569 conditions, 2560 events. 1012/2560 cut-off events. For 384/384 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 16654 event pairs, 126 based on Foata normal form. 4/2434 useless extension candidates. Maximal degree in co-relation 4467. Up to 1254 conditions per place. [2024-10-14 17:13:59,248 INFO L140 encePairwiseOnDemand]: 376/383 looper letters, 38 selfloop transitions, 4 changer transitions 4/288 dead transitions. [2024-10-14 17:13:59,248 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 272 places, 288 transitions, 712 flow [2024-10-14 17:13:59,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:13:59,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:13:59,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 946 transitions. [2024-10-14 17:13:59,251 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8233246301131418 [2024-10-14 17:13:59,251 INFO L175 Difference]: Start difference. First operand has 282 places, 274 transitions, 580 flow. Second operand 3 states and 946 transitions. [2024-10-14 17:13:59,251 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 272 places, 288 transitions, 712 flow [2024-10-14 17:13:59,253 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 271 places, 288 transitions, 707 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-14 17:13:59,256 INFO L231 Difference]: Finished difference. Result has 272 places, 270 transitions, 587 flow [2024-10-14 17:13:59,257 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=383, PETRI_DIFFERENCE_MINUEND_FLOW=571, PETRI_DIFFERENCE_MINUEND_PLACES=269, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=271, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=267, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=587, PETRI_PLACES=272, PETRI_TRANSITIONS=270} [2024-10-14 17:13:59,258 INFO L277 CegarLoopForPetriNet]: 353 programPoint places, -81 predicate places. [2024-10-14 17:13:59,258 INFO L471 AbstractCegarLoop]: Abstraction has has 272 places, 270 transitions, 587 flow [2024-10-14 17:13:59,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 303.0) internal successors, (909), 3 states have internal predecessors, (909), 0 states have call successors, (0), 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-10-14 17:13:59,259 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:13:59,259 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:13:59,259 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-14 17:13:59,259 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 114 more)] === [2024-10-14 17:13:59,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:13:59,260 INFO L85 PathProgramCache]: Analyzing trace with hash 854834517, now seen corresponding path program 1 times [2024-10-14 17:13:59,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:13:59,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940117851] [2024-10-14 17:13:59,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:13:59,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:13:59,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:13:59,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:13:59,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:13:59,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940117851] [2024-10-14 17:13:59,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940117851] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:13:59,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:13:59,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:13:59,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492593360] [2024-10-14 17:13:59,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:13:59,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:13:59,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:13:59,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:13:59,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:13:59,325 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 305 out of 383 [2024-10-14 17:13:59,326 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 272 places, 270 transitions, 587 flow. Second operand has 3 states, 3 states have (on average 306.0) internal successors, (918), 3 states have internal predecessors, (918), 0 states have call successors, (0), 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-10-14 17:13:59,326 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:13:59,326 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 305 of 383 [2024-10-14 17:13:59,327 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:13:59,806 INFO L124 PetriNetUnfolderBase]: 1156/3204 cut-off events. [2024-10-14 17:13:59,807 INFO L125 PetriNetUnfolderBase]: For 739/739 co-relation queries the response was YES. [2024-10-14 17:13:59,820 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5817 conditions, 3204 events. 1156/3204 cut-off events. For 739/739 co-relation queries the response was YES. Maximal size of possible extension queue 166. Compared 23254 event pairs, 115 based on Foata normal form. 4/3026 useless extension candidates. Maximal degree in co-relation 5715. Up to 1430 conditions per place. [2024-10-14 17:13:59,823 INFO L140 encePairwiseOnDemand]: 377/383 looper letters, 0 selfloop transitions, 0 changer transitions 287/287 dead transitions. [2024-10-14 17:13:59,823 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 268 places, 287 transitions, 737 flow [2024-10-14 17:13:59,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:13:59,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:13:59,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 952 transitions. [2024-10-14 17:13:59,827 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8285465622280244 [2024-10-14 17:13:59,827 INFO L175 Difference]: Start difference. First operand has 272 places, 270 transitions, 587 flow. Second operand 3 states and 952 transitions. [2024-10-14 17:13:59,827 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 268 places, 287 transitions, 737 flow [2024-10-14 17:13:59,830 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 268 places, 287 transitions, 737 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-14 17:13:59,832 INFO L231 Difference]: Finished difference. Result has 268 places, 0 transitions, 0 flow [2024-10-14 17:13:59,832 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=383, PETRI_DIFFERENCE_MINUEND_FLOW=583, PETRI_DIFFERENCE_MINUEND_PLACES=266, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=268, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=268, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=268, PETRI_TRANSITIONS=0} [2024-10-14 17:13:59,833 INFO L277 CegarLoopForPetriNet]: 353 programPoint places, -85 predicate places. [2024-10-14 17:13:59,834 INFO L471 AbstractCegarLoop]: Abstraction has has 268 places, 0 transitions, 0 flow [2024-10-14 17:13:59,835 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 306.0) internal successors, (918), 3 states have internal predecessors, (918), 0 states have call successors, (0), 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-10-14 17:13:59,837 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (117 of 118 remaining) [2024-10-14 17:13:59,838 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (116 of 118 remaining) [2024-10-14 17:13:59,838 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (115 of 118 remaining) [2024-10-14 17:13:59,838 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (114 of 118 remaining) [2024-10-14 17:13:59,838 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (113 of 118 remaining) [2024-10-14 17:13:59,840 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (112 of 118 remaining) [2024-10-14 17:13:59,840 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (111 of 118 remaining) [2024-10-14 17:13:59,840 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (110 of 118 remaining) [2024-10-14 17:13:59,840 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (109 of 118 remaining) [2024-10-14 17:13:59,840 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (108 of 118 remaining) [2024-10-14 17:13:59,841 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (107 of 118 remaining) [2024-10-14 17:13:59,841 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (106 of 118 remaining) [2024-10-14 17:13:59,841 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (105 of 118 remaining) [2024-10-14 17:13:59,841 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (104 of 118 remaining) [2024-10-14 17:13:59,841 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (103 of 118 remaining) [2024-10-14 17:13:59,841 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (102 of 118 remaining) [2024-10-14 17:13:59,841 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (101 of 118 remaining) [2024-10-14 17:13:59,841 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (100 of 118 remaining) [2024-10-14 17:13:59,841 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (99 of 118 remaining) [2024-10-14 17:13:59,841 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (98 of 118 remaining) [2024-10-14 17:13:59,841 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (97 of 118 remaining) [2024-10-14 17:13:59,842 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (96 of 118 remaining) [2024-10-14 17:13:59,842 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (95 of 118 remaining) [2024-10-14 17:13:59,842 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (94 of 118 remaining) [2024-10-14 17:13:59,842 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (93 of 118 remaining) [2024-10-14 17:13:59,842 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (92 of 118 remaining) [2024-10-14 17:13:59,842 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (91 of 118 remaining) [2024-10-14 17:13:59,842 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (90 of 118 remaining) [2024-10-14 17:13:59,843 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (89 of 118 remaining) [2024-10-14 17:13:59,843 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (88 of 118 remaining) [2024-10-14 17:13:59,843 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (87 of 118 remaining) [2024-10-14 17:13:59,843 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (86 of 118 remaining) [2024-10-14 17:13:59,843 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (85 of 118 remaining) [2024-10-14 17:13:59,843 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (84 of 118 remaining) [2024-10-14 17:13:59,843 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (83 of 118 remaining) [2024-10-14 17:13:59,843 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (82 of 118 remaining) [2024-10-14 17:13:59,843 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (81 of 118 remaining) [2024-10-14 17:13:59,843 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (80 of 118 remaining) [2024-10-14 17:13:59,843 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (79 of 118 remaining) [2024-10-14 17:13:59,844 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (78 of 118 remaining) [2024-10-14 17:13:59,844 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (77 of 118 remaining) [2024-10-14 17:13:59,844 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (76 of 118 remaining) [2024-10-14 17:13:59,844 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (75 of 118 remaining) [2024-10-14 17:13:59,844 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (74 of 118 remaining) [2024-10-14 17:13:59,844 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (73 of 118 remaining) [2024-10-14 17:13:59,844 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (72 of 118 remaining) [2024-10-14 17:13:59,844 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (71 of 118 remaining) [2024-10-14 17:13:59,844 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (70 of 118 remaining) [2024-10-14 17:13:59,844 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (69 of 118 remaining) [2024-10-14 17:13:59,845 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (68 of 118 remaining) [2024-10-14 17:13:59,845 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (67 of 118 remaining) [2024-10-14 17:13:59,845 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE (66 of 118 remaining) [2024-10-14 17:13:59,845 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE (65 of 118 remaining) [2024-10-14 17:13:59,845 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE (64 of 118 remaining) [2024-10-14 17:13:59,845 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE (63 of 118 remaining) [2024-10-14 17:13:59,845 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE (62 of 118 remaining) [2024-10-14 17:13:59,845 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE (61 of 118 remaining) [2024-10-14 17:13:59,845 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE (60 of 118 remaining) [2024-10-14 17:13:59,845 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25ASSERT_VIOLATIONDATA_RACE (59 of 118 remaining) [2024-10-14 17:13:59,845 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (58 of 118 remaining) [2024-10-14 17:13:59,846 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (57 of 118 remaining) [2024-10-14 17:13:59,846 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (56 of 118 remaining) [2024-10-14 17:13:59,846 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (55 of 118 remaining) [2024-10-14 17:13:59,846 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err0ASSERT_VIOLATIONDATA_RACE (54 of 118 remaining) [2024-10-14 17:13:59,846 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err1ASSERT_VIOLATIONDATA_RACE (53 of 118 remaining) [2024-10-14 17:13:59,847 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err2ASSERT_VIOLATIONDATA_RACE (52 of 118 remaining) [2024-10-14 17:13:59,847 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err3ASSERT_VIOLATIONDATA_RACE (51 of 118 remaining) [2024-10-14 17:13:59,847 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err4ASSERT_VIOLATIONDATA_RACE (50 of 118 remaining) [2024-10-14 17:13:59,847 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err5ASSERT_VIOLATIONDATA_RACE (49 of 118 remaining) [2024-10-14 17:13:59,847 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err6ASSERT_VIOLATIONDATA_RACE (48 of 118 remaining) [2024-10-14 17:13:59,847 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err7ASSERT_VIOLATIONDATA_RACE (47 of 118 remaining) [2024-10-14 17:13:59,848 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err8ASSERT_VIOLATIONDATA_RACE (46 of 118 remaining) [2024-10-14 17:13:59,848 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err9ASSERT_VIOLATIONDATA_RACE (45 of 118 remaining) [2024-10-14 17:13:59,848 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err10ASSERT_VIOLATIONDATA_RACE (44 of 118 remaining) [2024-10-14 17:13:59,848 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (43 of 118 remaining) [2024-10-14 17:13:59,848 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (42 of 118 remaining) [2024-10-14 17:13:59,848 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (41 of 118 remaining) [2024-10-14 17:13:59,848 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (40 of 118 remaining) [2024-10-14 17:13:59,849 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (39 of 118 remaining) [2024-10-14 17:13:59,849 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (38 of 118 remaining) [2024-10-14 17:13:59,849 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (37 of 118 remaining) [2024-10-14 17:13:59,849 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (36 of 118 remaining) [2024-10-14 17:13:59,849 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (35 of 118 remaining) [2024-10-14 17:13:59,849 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (34 of 118 remaining) [2024-10-14 17:13:59,850 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (33 of 118 remaining) [2024-10-14 17:13:59,850 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (32 of 118 remaining) [2024-10-14 17:13:59,850 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (31 of 118 remaining) [2024-10-14 17:13:59,850 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (30 of 118 remaining) [2024-10-14 17:13:59,850 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (29 of 118 remaining) [2024-10-14 17:13:59,850 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (28 of 118 remaining) [2024-10-14 17:13:59,850 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (27 of 118 remaining) [2024-10-14 17:13:59,851 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (26 of 118 remaining) [2024-10-14 17:13:59,851 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (25 of 118 remaining) [2024-10-14 17:13:59,851 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (24 of 118 remaining) [2024-10-14 17:13:59,851 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (23 of 118 remaining) [2024-10-14 17:13:59,851 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (22 of 118 remaining) [2024-10-14 17:13:59,851 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (21 of 118 remaining) [2024-10-14 17:13:59,851 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (20 of 118 remaining) [2024-10-14 17:13:59,851 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (19 of 118 remaining) [2024-10-14 17:13:59,852 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (18 of 118 remaining) [2024-10-14 17:13:59,852 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (17 of 118 remaining) [2024-10-14 17:13:59,852 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (16 of 118 remaining) [2024-10-14 17:13:59,852 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (15 of 118 remaining) [2024-10-14 17:13:59,852 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (14 of 118 remaining) [2024-10-14 17:13:59,852 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (13 of 118 remaining) [2024-10-14 17:13:59,852 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (12 of 118 remaining) [2024-10-14 17:13:59,853 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (11 of 118 remaining) [2024-10-14 17:13:59,853 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err0ASSERT_VIOLATIONDATA_RACE (10 of 118 remaining) [2024-10-14 17:13:59,853 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err1ASSERT_VIOLATIONDATA_RACE (9 of 118 remaining) [2024-10-14 17:13:59,853 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err2ASSERT_VIOLATIONDATA_RACE (8 of 118 remaining) [2024-10-14 17:13:59,853 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err3ASSERT_VIOLATIONDATA_RACE (7 of 118 remaining) [2024-10-14 17:13:59,853 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err4ASSERT_VIOLATIONDATA_RACE (6 of 118 remaining) [2024-10-14 17:13:59,853 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err5ASSERT_VIOLATIONDATA_RACE (5 of 118 remaining) [2024-10-14 17:13:59,853 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err6ASSERT_VIOLATIONDATA_RACE (4 of 118 remaining) [2024-10-14 17:13:59,854 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err7ASSERT_VIOLATIONDATA_RACE (3 of 118 remaining) [2024-10-14 17:13:59,854 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err8ASSERT_VIOLATIONDATA_RACE (2 of 118 remaining) [2024-10-14 17:13:59,854 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err9ASSERT_VIOLATIONDATA_RACE (1 of 118 remaining) [2024-10-14 17:13:59,854 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err10ASSERT_VIOLATIONDATA_RACE (0 of 118 remaining) [2024-10-14 17:13:59,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-14 17:13:59,855 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:13:59,862 INFO L234 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-10-14 17:13:59,862 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 17:13:59,868 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 05:13:59 BasicIcfg [2024-10-14 17:13:59,868 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 17:13:59,869 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 17:13:59,869 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 17:13:59,869 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 17:13:59,870 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 05:13:52" (3/4) ... [2024-10-14 17:13:59,871 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-14 17:13:59,874 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2024-10-14 17:13:59,874 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2024-10-14 17:13:59,874 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread3 [2024-10-14 17:13:59,874 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread4 [2024-10-14 17:13:59,884 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 21 nodes and edges [2024-10-14 17:13:59,884 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-10-14 17:13:59,885 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-10-14 17:13:59,885 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-14 17:13:59,992 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-14 17:13:59,993 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-14 17:13:59,993 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 17:13:59,993 INFO L158 Benchmark]: Toolchain (without parser) took 9687.70ms. Allocated memory was 161.5MB in the beginning and 480.2MB in the end (delta: 318.8MB). Free memory was 130.2MB in the beginning and 273.5MB in the end (delta: -143.3MB). Peak memory consumption was 176.5MB. Max. memory is 16.1GB. [2024-10-14 17:13:59,994 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 161.5MB. Free memory is still 131.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 17:13:59,994 INFO L158 Benchmark]: CACSL2BoogieTranslator took 344.05ms. Allocated memory is still 161.5MB. Free memory was 130.2MB in the beginning and 115.5MB in the end (delta: 14.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-14 17:13:59,994 INFO L158 Benchmark]: Boogie Procedure Inliner took 79.28ms. Allocated memory is still 161.5MB. Free memory was 115.5MB in the beginning and 111.6MB in the end (delta: 3.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-14 17:13:59,995 INFO L158 Benchmark]: Boogie Preprocessor took 68.86ms. Allocated memory is still 161.5MB. Free memory was 111.6MB in the beginning and 108.6MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-14 17:13:59,996 INFO L158 Benchmark]: RCFGBuilder took 1280.64ms. Allocated memory was 161.5MB in the beginning and 195.0MB in the end (delta: 33.6MB). Free memory was 108.6MB in the beginning and 93.9MB in the end (delta: 14.7MB). Peak memory consumption was 64.6MB. Max. memory is 16.1GB. [2024-10-14 17:13:59,996 INFO L158 Benchmark]: TraceAbstraction took 7783.87ms. Allocated memory was 195.0MB in the beginning and 480.2MB in the end (delta: 285.2MB). Free memory was 92.8MB in the beginning and 280.9MB in the end (delta: -188.0MB). Peak memory consumption was 227.2MB. Max. memory is 16.1GB. [2024-10-14 17:13:59,996 INFO L158 Benchmark]: Witness Printer took 124.13ms. Allocated memory is still 480.2MB. Free memory was 279.8MB in the beginning and 273.5MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-14 17:13:59,997 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 161.5MB. Free memory is still 131.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 344.05ms. Allocated memory is still 161.5MB. Free memory was 130.2MB in the beginning and 115.5MB in the end (delta: 14.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 79.28ms. Allocated memory is still 161.5MB. Free memory was 115.5MB in the beginning and 111.6MB in the end (delta: 3.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 68.86ms. Allocated memory is still 161.5MB. Free memory was 111.6MB in the beginning and 108.6MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1280.64ms. Allocated memory was 161.5MB in the beginning and 195.0MB in the end (delta: 33.6MB). Free memory was 108.6MB in the beginning and 93.9MB in the end (delta: 14.7MB). Peak memory consumption was 64.6MB. Max. memory is 16.1GB. * TraceAbstraction took 7783.87ms. Allocated memory was 195.0MB in the beginning and 480.2MB in the end (delta: 285.2MB). Free memory was 92.8MB in the beginning and 280.9MB in the end (delta: -188.0MB). Peak memory consumption was 227.2MB. Max. memory is 16.1GB. * Witness Printer took 124.13ms. Allocated memory is still 480.2MB. Free memory was 279.8MB in the beginning and 273.5MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 81]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 81]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 82]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 82]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 82]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 82]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 85]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 85]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 85]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 111]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 112]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 113]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 114]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 115]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 117]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 118]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 119]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 120]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 121]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 147]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 121]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 124]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 124]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 124]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 124]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 124]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 124]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 124]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 135]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 135]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 135]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 135]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 135]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 135]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 95]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 95]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 96]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 96]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 97]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 97]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 97]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 97]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 100]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 100]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 100]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 456 locations, 118 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 7.6s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 350 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 151 mSDsluCounter, 68 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 67 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 818 IncrementalHoareTripleChecker+Invalid, 885 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 67 mSolverCounterUnsat, 68 mSDtfsCounter, 818 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 36 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=740occurred in iteration=0, InterpolantAutomatonStates: 51, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 1476 NumberOfCodeBlocks, 1476 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 1460 ConstructedInterpolants, 0 QuantifiedInterpolants, 1605 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 70 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-10-14 17:14:00,030 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE