./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-deagle/airline-5.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-deagle/airline-5.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b3375d634339bd0477387b7559c4eae5ae554f112c0f1d9d1b21e4edc4514353 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 14:40:37,485 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 14:40:37,581 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-11-10 14:40:37,587 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 14:40:37,589 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 14:40:37,618 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 14:40:37,620 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 14:40:37,621 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 14:40:37,622 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 14:40:37,623 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 14:40:37,624 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 14:40:37,624 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 14:40:37,625 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 14:40:37,625 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 14:40:37,625 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 14:40:37,625 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 14:40:37,626 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 14:40:37,626 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 14:40:37,629 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 14:40:37,629 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 14:40:37,629 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 14:40:37,630 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 14:40:37,631 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-10 14:40:37,631 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 14:40:37,631 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 14:40:37,632 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 14:40:37,633 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 14:40:37,633 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 14:40:37,633 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 14:40:37,633 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 14:40:37,634 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 14:40:37,634 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 14:40:37,634 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 14:40:37,634 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 14:40:37,635 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 14:40:37,635 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 14:40:37,635 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 14:40:37,636 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 14:40:37,636 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 14:40:37,637 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 14:40:37,637 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 14:40:37,637 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 -> b3375d634339bd0477387b7559c4eae5ae554f112c0f1d9d1b21e4edc4514353 [2024-11-10 14:40:37,897 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 14:40:37,920 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 14:40:37,924 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 14:40:37,925 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 14:40:37,926 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 14:40:37,927 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-deagle/airline-5.i [2024-11-10 14:40:39,357 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 14:40:39,592 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 14:40:39,592 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-deagle/airline-5.i [2024-11-10 14:40:39,607 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f14a80dd9/71cafb8e87e246319d7dff1818b5a050/FLAG06569286f [2024-11-10 14:40:39,931 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f14a80dd9/71cafb8e87e246319d7dff1818b5a050 [2024-11-10 14:40:39,933 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 14:40:39,934 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 14:40:39,935 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 14:40:39,936 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 14:40:39,940 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 14:40:39,941 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 02:40:39" (1/1) ... [2024-11-10 14:40:39,941 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43200fbe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:40:39, skipping insertion in model container [2024-11-10 14:40:39,942 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 02:40:39" (1/1) ... [2024-11-10 14:40:39,981 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 14:40:40,344 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 14:40:40,351 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 14:40:40,392 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 14:40:40,420 INFO L204 MainTranslator]: Completed translation [2024-11-10 14:40:40,421 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:40:40 WrapperNode [2024-11-10 14:40:40,421 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 14:40:40,422 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 14:40:40,422 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 14:40:40,422 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 14:40:40,428 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:40:40" (1/1) ... [2024-11-10 14:40:40,451 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:40:40" (1/1) ... [2024-11-10 14:40:40,472 INFO L138 Inliner]: procedures = 162, calls = 24, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 87 [2024-11-10 14:40:40,475 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 14:40:40,476 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 14:40:40,476 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 14:40:40,476 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 14:40:40,487 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:40:40" (1/1) ... [2024-11-10 14:40:40,487 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:40:40" (1/1) ... [2024-11-10 14:40:40,492 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:40:40" (1/1) ... [2024-11-10 14:40:40,492 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:40:40" (1/1) ... [2024-11-10 14:40:40,500 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:40:40" (1/1) ... [2024-11-10 14:40:40,503 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:40:40" (1/1) ... [2024-11-10 14:40:40,504 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:40:40" (1/1) ... [2024-11-10 14:40:40,509 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:40:40" (1/1) ... [2024-11-10 14:40:40,513 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 14:40:40,513 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 14:40:40,514 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 14:40:40,514 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 14:40:40,515 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:40:40" (1/1) ... [2024-11-10 14:40:40,520 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 14:40:40,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 14:40:40,575 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 14:40:40,579 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 14:40:40,625 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-10 14:40:40,625 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-10 14:40:40,625 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-10 14:40:40,626 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 14:40:40,626 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-10 14:40:40,626 INFO L130 BoogieDeclarations]: Found specification of procedure salethread [2024-11-10 14:40:40,626 INFO L138 BoogieDeclarations]: Found implementation of procedure salethread [2024-11-10 14:40:40,626 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-10 14:40:40,626 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-10 14:40:40,626 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-10 14:40:40,627 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 14:40:40,627 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 14:40:40,628 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-10 14:40:40,759 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 14:40:40,763 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 14:40:40,986 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L736: havoc main_~#salethreads~0#1.base, main_~#salethreads~0#1.offset; [2024-11-10 14:40:40,986 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L736-1: SUMMARY for call ULTIMATE.dealloc(main_~#salethreads~0#1.base, main_~#salethreads~0#1.offset); srcloc: null [2024-11-10 14:40:40,988 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-10 14:40:40,988 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 14:40:41,036 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 14:40:41,038 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 14:40:41,039 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 02:40:41 BoogieIcfgContainer [2024-11-10 14:40:41,039 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 14:40:41,041 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 14:40:41,041 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 14:40:41,045 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 14:40:41,046 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 02:40:39" (1/3) ... [2024-11-10 14:40:41,047 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bd8e61c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 02:40:41, skipping insertion in model container [2024-11-10 14:40:41,047 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:40:40" (2/3) ... [2024-11-10 14:40:41,048 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bd8e61c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 02:40:41, skipping insertion in model container [2024-11-10 14:40:41,048 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 02:40:41" (3/3) ... [2024-11-10 14:40:41,050 INFO L112 eAbstractionObserver]: Analyzing ICFG airline-5.i [2024-11-10 14:40:41,065 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 14:40:41,066 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 10 error locations. [2024-11-10 14:40:41,067 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-10 14:40:41,121 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-11-10 14:40:41,154 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 97 places, 101 transitions, 209 flow [2024-11-10 14:40:41,206 INFO L124 PetriNetUnfolderBase]: 11/148 cut-off events. [2024-11-10 14:40:41,206 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-10 14:40:41,212 INFO L83 FinitePrefix]: Finished finitePrefix Result has 153 conditions, 148 events. 11/148 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 305 event pairs, 0 based on Foata normal form. 0/121 useless extension candidates. Maximal degree in co-relation 72. Up to 4 conditions per place. [2024-11-10 14:40:41,212 INFO L82 GeneralOperation]: Start removeDead. Operand has 97 places, 101 transitions, 209 flow [2024-11-10 14:40:41,217 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 97 places, 101 transitions, 209 flow [2024-11-10 14:40:41,224 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 14:40:41,230 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;@733b61c2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 14:40:41,231 INFO L334 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2024-11-10 14:40:41,236 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-10 14:40:41,237 INFO L124 PetriNetUnfolderBase]: 0/15 cut-off events. [2024-11-10 14:40:41,237 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-10 14:40:41,237 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:40:41,239 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:40:41,240 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [salethreadErr3ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE, salethreadErr0ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2024-11-10 14:40:41,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:40:41,247 INFO L85 PathProgramCache]: Analyzing trace with hash -668704510, now seen corresponding path program 1 times [2024-11-10 14:40:41,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:40:41,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554961107] [2024-11-10 14:40:41,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:40:41,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:40:41,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:40:41,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:40:41,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:40:41,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554961107] [2024-11-10 14:40:41,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554961107] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:40:41,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:40:41,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-10 14:40:41,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676601871] [2024-11-10 14:40:41,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:40:41,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 14:40:41,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:40:41,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 14:40:41,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 14:40:41,559 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 101 [2024-11-10 14:40:41,563 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 101 transitions, 209 flow. Second operand has 2 states, 2 states have (on average 84.5) internal successors, (169), 2 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:40:41,563 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:40:41,564 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 101 [2024-11-10 14:40:41,565 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:40:41,639 INFO L124 PetriNetUnfolderBase]: 3/131 cut-off events. [2024-11-10 14:40:41,639 INFO L125 PetriNetUnfolderBase]: For 4/5 co-relation queries the response was YES. [2024-11-10 14:40:41,642 INFO L83 FinitePrefix]: Finished finitePrefix Result has 144 conditions, 131 events. 3/131 cut-off events. For 4/5 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 262 event pairs, 0 based on Foata normal form. 9/124 useless extension candidates. Maximal degree in co-relation 66. Up to 8 conditions per place. [2024-11-10 14:40:41,644 INFO L140 encePairwiseOnDemand]: 92/101 looper letters, 7 selfloop transitions, 0 changer transitions 0/90 dead transitions. [2024-11-10 14:40:41,644 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 90 transitions, 201 flow [2024-11-10 14:40:41,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 14:40:41,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-11-10 14:40:41,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 184 transitions. [2024-11-10 14:40:41,659 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9108910891089109 [2024-11-10 14:40:41,661 INFO L175 Difference]: Start difference. First operand has 97 places, 101 transitions, 209 flow. Second operand 2 states and 184 transitions. [2024-11-10 14:40:41,662 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 90 transitions, 201 flow [2024-11-10 14:40:41,665 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 90 transitions, 201 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-10 14:40:41,672 INFO L231 Difference]: Finished difference. Result has 91 places, 90 transitions, 187 flow [2024-11-10 14:40:41,675 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=101, PETRI_DIFFERENCE_MINUEND_FLOW=187, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=187, PETRI_PLACES=91, PETRI_TRANSITIONS=90} [2024-11-10 14:40:41,679 INFO L277 CegarLoopForPetriNet]: 97 programPoint places, -6 predicate places. [2024-11-10 14:40:41,679 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 90 transitions, 187 flow [2024-11-10 14:40:41,680 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 84.5) internal successors, (169), 2 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:40:41,681 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:40:41,681 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-11-10 14:40:41,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 14:40:41,682 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [salethreadErr3ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE, salethreadErr0ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2024-11-10 14:40:41,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:40:41,682 INFO L85 PathProgramCache]: Analyzing trace with hash -1948147323, now seen corresponding path program 1 times [2024-11-10 14:40:41,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:40:41,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225105994] [2024-11-10 14:40:41,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:40:41,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:40:41,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:40:41,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:40:41,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:40:41,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225105994] [2024-11-10 14:40:41,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [225105994] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:40:41,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:40:41,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 14:40:41,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588384142] [2024-11-10 14:40:41,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:40:41,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:40:41,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:40:41,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:40:41,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:40:41,859 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 101 [2024-11-10 14:40:41,860 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 90 transitions, 187 flow. Second operand has 3 states, 3 states have (on average 80.33333333333333) internal successors, (241), 3 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:40:41,864 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:40:41,864 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 101 [2024-11-10 14:40:41,864 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:40:41,942 INFO L124 PetriNetUnfolderBase]: 10/180 cut-off events. [2024-11-10 14:40:41,943 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-10 14:40:41,944 INFO L83 FinitePrefix]: Finished finitePrefix Result has 213 conditions, 180 events. 10/180 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 467 event pairs, 0 based on Foata normal form. 1/160 useless extension candidates. Maximal degree in co-relation 209. Up to 23 conditions per place. [2024-11-10 14:40:41,946 INFO L140 encePairwiseOnDemand]: 98/101 looper letters, 13 selfloop transitions, 2 changer transitions 0/92 dead transitions. [2024-11-10 14:40:41,947 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 92 transitions, 221 flow [2024-11-10 14:40:41,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:40:41,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:40:41,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 250 transitions. [2024-11-10 14:40:41,950 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8250825082508251 [2024-11-10 14:40:41,950 INFO L175 Difference]: Start difference. First operand has 91 places, 90 transitions, 187 flow. Second operand 3 states and 250 transitions. [2024-11-10 14:40:41,950 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 92 transitions, 221 flow [2024-11-10 14:40:41,953 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 92 transitions, 221 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-10 14:40:41,956 INFO L231 Difference]: Finished difference. Result has 94 places, 90 transitions, 195 flow [2024-11-10 14:40:41,957 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=101, PETRI_DIFFERENCE_MINUEND_FLOW=187, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=195, PETRI_PLACES=94, PETRI_TRANSITIONS=90} [2024-11-10 14:40:41,958 INFO L277 CegarLoopForPetriNet]: 97 programPoint places, -3 predicate places. [2024-11-10 14:40:41,958 INFO L471 AbstractCegarLoop]: Abstraction has has 94 places, 90 transitions, 195 flow [2024-11-10 14:40:41,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 80.33333333333333) internal successors, (241), 3 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:40:41,959 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:40:41,960 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:40:41,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 14:40:41,960 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [salethreadErr3ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE, salethreadErr0ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2024-11-10 14:40:41,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:40:41,961 INFO L85 PathProgramCache]: Analyzing trace with hash 842382204, now seen corresponding path program 1 times [2024-11-10 14:40:41,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:40:41,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052508635] [2024-11-10 14:40:41,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:40:41,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:40:42,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:40:42,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:40:42,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:40:42,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052508635] [2024-11-10 14:40:42,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1052508635] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:40:42,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:40:42,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 14:40:42,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164324587] [2024-11-10 14:40:42,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:40:42,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 14:40:42,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:40:42,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 14:40:42,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-10 14:40:42,671 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 101 [2024-11-10 14:40:42,672 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 90 transitions, 195 flow. Second operand has 6 states, 6 states have (on average 67.0) internal successors, (402), 6 states have internal predecessors, (402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:40:42,674 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:40:42,674 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 101 [2024-11-10 14:40:42,674 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:40:42,802 INFO L124 PetriNetUnfolderBase]: 32/202 cut-off events. [2024-11-10 14:40:42,804 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-11-10 14:40:42,806 INFO L83 FinitePrefix]: Finished finitePrefix Result has 300 conditions, 202 events. 32/202 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 659 event pairs, 2 based on Foata normal form. 0/184 useless extension candidates. Maximal degree in co-relation 294. Up to 55 conditions per place. [2024-11-10 14:40:42,807 INFO L140 encePairwiseOnDemand]: 95/101 looper letters, 28 selfloop transitions, 5 changer transitions 0/97 dead transitions. [2024-11-10 14:40:42,808 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 97 transitions, 275 flow [2024-11-10 14:40:42,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 14:40:42,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-10 14:40:42,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 424 transitions. [2024-11-10 14:40:42,814 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6996699669966997 [2024-11-10 14:40:42,814 INFO L175 Difference]: Start difference. First operand has 94 places, 90 transitions, 195 flow. Second operand 6 states and 424 transitions. [2024-11-10 14:40:42,814 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 97 transitions, 275 flow [2024-11-10 14:40:42,815 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 97 transitions, 271 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:40:42,818 INFO L231 Difference]: Finished difference. Result has 96 places, 89 transitions, 199 flow [2024-11-10 14:40:42,819 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=101, PETRI_DIFFERENCE_MINUEND_FLOW=189, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=199, PETRI_PLACES=96, PETRI_TRANSITIONS=89} [2024-11-10 14:40:42,820 INFO L277 CegarLoopForPetriNet]: 97 programPoint places, -1 predicate places. [2024-11-10 14:40:42,821 INFO L471 AbstractCegarLoop]: Abstraction has has 96 places, 89 transitions, 199 flow [2024-11-10 14:40:42,821 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 67.0) internal successors, (402), 6 states have internal predecessors, (402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:40:42,821 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:40:42,822 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] [2024-11-10 14:40:42,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 14:40:42,822 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting salethreadErr3ASSERT_VIOLATIONDATA_RACE === [salethreadErr3ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE, salethreadErr0ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2024-11-10 14:40:42,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:40:42,823 INFO L85 PathProgramCache]: Analyzing trace with hash 1646775817, now seen corresponding path program 1 times [2024-11-10 14:40:42,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:40:42,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358755754] [2024-11-10 14:40:42,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:40:42,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:40:42,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:40:42,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:40:42,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:40:42,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358755754] [2024-11-10 14:40:42,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [358755754] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:40:42,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:40:42,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:40:42,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297588285] [2024-11-10 14:40:42,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:40:42,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:40:42,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:40:42,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:40:42,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:40:42,878 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 101 [2024-11-10 14:40:42,879 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 89 transitions, 199 flow. Second operand has 3 states, 3 states have (on average 83.0) internal successors, (249), 3 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:40:42,879 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:40:42,879 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 101 [2024-11-10 14:40:42,879 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:40:42,923 INFO L124 PetriNetUnfolderBase]: 1/159 cut-off events. [2024-11-10 14:40:42,923 INFO L125 PetriNetUnfolderBase]: For 10/18 co-relation queries the response was YES. [2024-11-10 14:40:42,924 INFO L83 FinitePrefix]: Finished finitePrefix Result has 190 conditions, 159 events. 1/159 cut-off events. For 10/18 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 297 event pairs, 0 based on Foata normal form. 0/144 useless extension candidates. Maximal degree in co-relation 184. Up to 7 conditions per place. [2024-11-10 14:40:42,924 INFO L140 encePairwiseOnDemand]: 98/101 looper letters, 8 selfloop transitions, 2 changer transitions 0/89 dead transitions. [2024-11-10 14:40:42,924 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 89 transitions, 222 flow [2024-11-10 14:40:42,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:40:42,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:40:42,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 254 transitions. [2024-11-10 14:40:42,926 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8382838283828383 [2024-11-10 14:40:42,926 INFO L175 Difference]: Start difference. First operand has 96 places, 89 transitions, 199 flow. Second operand 3 states and 254 transitions. [2024-11-10 14:40:42,926 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 89 transitions, 222 flow [2024-11-10 14:40:42,927 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 89 transitions, 212 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-10 14:40:42,929 INFO L231 Difference]: Finished difference. Result has 92 places, 88 transitions, 191 flow [2024-11-10 14:40:42,929 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=101, PETRI_DIFFERENCE_MINUEND_FLOW=187, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=191, PETRI_PLACES=92, PETRI_TRANSITIONS=88} [2024-11-10 14:40:42,929 INFO L277 CegarLoopForPetriNet]: 97 programPoint places, -5 predicate places. [2024-11-10 14:40:42,930 INFO L471 AbstractCegarLoop]: Abstraction has has 92 places, 88 transitions, 191 flow [2024-11-10 14:40:42,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 83.0) internal successors, (249), 3 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:40:42,931 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:40:42,931 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:40:42,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 14:40:42,932 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting salethreadErr2ASSERT_VIOLATIONDATA_RACE === [salethreadErr3ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE, salethreadErr0ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2024-11-10 14:40:42,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:40:42,932 INFO L85 PathProgramCache]: Analyzing trace with hash 1982139777, now seen corresponding path program 1 times [2024-11-10 14:40:42,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:40:42,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548220112] [2024-11-10 14:40:42,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:40:42,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:40:42,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:40:42,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:40:42,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:40:42,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548220112] [2024-11-10 14:40:42,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [548220112] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:40:42,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:40:42,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:40:42,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842218436] [2024-11-10 14:40:42,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:40:42,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:40:42,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:40:42,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:40:42,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:40:42,986 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 101 [2024-11-10 14:40:42,986 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 88 transitions, 191 flow. Second operand has 3 states, 3 states have (on average 80.0) internal successors, (240), 3 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:40:42,987 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:40:42,987 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 101 [2024-11-10 14:40:42,987 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:40:43,035 INFO L124 PetriNetUnfolderBase]: 8/233 cut-off events. [2024-11-10 14:40:43,035 INFO L125 PetriNetUnfolderBase]: For 13/21 co-relation queries the response was YES. [2024-11-10 14:40:43,036 INFO L83 FinitePrefix]: Finished finitePrefix Result has 283 conditions, 233 events. 8/233 cut-off events. For 13/21 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 806 event pairs, 4 based on Foata normal form. 0/211 useless extension candidates. Maximal degree in co-relation 277. Up to 25 conditions per place. [2024-11-10 14:40:43,037 INFO L140 encePairwiseOnDemand]: 95/101 looper letters, 12 selfloop transitions, 4 changer transitions 0/91 dead transitions. [2024-11-10 14:40:43,037 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 91 transitions, 232 flow [2024-11-10 14:40:43,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:40:43,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:40:43,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 252 transitions. [2024-11-10 14:40:43,039 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8316831683168316 [2024-11-10 14:40:43,039 INFO L175 Difference]: Start difference. First operand has 92 places, 88 transitions, 191 flow. Second operand 3 states and 252 transitions. [2024-11-10 14:40:43,039 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 91 transitions, 232 flow [2024-11-10 14:40:43,040 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 91 transitions, 228 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:40:43,042 INFO L231 Difference]: Finished difference. Result has 93 places, 90 transitions, 215 flow [2024-11-10 14:40:43,042 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=101, PETRI_DIFFERENCE_MINUEND_FLOW=185, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=215, PETRI_PLACES=93, PETRI_TRANSITIONS=90} [2024-11-10 14:40:43,044 INFO L277 CegarLoopForPetriNet]: 97 programPoint places, -4 predicate places. [2024-11-10 14:40:43,045 INFO L471 AbstractCegarLoop]: Abstraction has has 93 places, 90 transitions, 215 flow [2024-11-10 14:40:43,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 80.0) internal successors, (240), 3 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:40:43,046 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:40:43,046 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:40:43,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 14:40:43,047 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [salethreadErr3ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE, salethreadErr0ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2024-11-10 14:40:43,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:40:43,050 INFO L85 PathProgramCache]: Analyzing trace with hash -296956765, now seen corresponding path program 1 times [2024-11-10 14:40:43,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:40:43,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840243722] [2024-11-10 14:40:43,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:40:43,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:40:43,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 14:40:43,077 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 14:40:43,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 14:40:43,113 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 14:40:43,114 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 14:40:43,116 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (14 of 15 remaining) [2024-11-10 14:40:43,117 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr3ASSERT_VIOLATIONDATA_RACE (13 of 15 remaining) [2024-11-10 14:40:43,118 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr2ASSERT_VIOLATIONDATA_RACE (12 of 15 remaining) [2024-11-10 14:40:43,118 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr0ASSERT_VIOLATIONDATA_RACE (11 of 15 remaining) [2024-11-10 14:40:43,118 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr1ASSERT_VIOLATIONDATA_RACE (10 of 15 remaining) [2024-11-10 14:40:43,118 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (9 of 15 remaining) [2024-11-10 14:40:43,119 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (8 of 15 remaining) [2024-11-10 14:40:43,119 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (7 of 15 remaining) [2024-11-10 14:40:43,119 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (6 of 15 remaining) [2024-11-10 14:40:43,119 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (5 of 15 remaining) [2024-11-10 14:40:43,119 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (4 of 15 remaining) [2024-11-10 14:40:43,120 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr3ASSERT_VIOLATIONDATA_RACE (3 of 15 remaining) [2024-11-10 14:40:43,120 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr2ASSERT_VIOLATIONDATA_RACE (2 of 15 remaining) [2024-11-10 14:40:43,120 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr0ASSERT_VIOLATIONDATA_RACE (1 of 15 remaining) [2024-11-10 14:40:43,120 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr1ASSERT_VIOLATIONDATA_RACE (0 of 15 remaining) [2024-11-10 14:40:43,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 14:40:43,121 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-11-10 14:40:43,124 WARN L244 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-10 14:40:43,126 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-11-10 14:40:43,147 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-10 14:40:43,150 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 117 places, 122 transitions, 260 flow [2024-11-10 14:40:43,177 INFO L124 PetriNetUnfolderBase]: 22/263 cut-off events. [2024-11-10 14:40:43,177 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-11-10 14:40:43,179 INFO L83 FinitePrefix]: Finished finitePrefix Result has 275 conditions, 263 events. 22/263 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 615 event pairs, 0 based on Foata normal form. 0/215 useless extension candidates. Maximal degree in co-relation 150. Up to 8 conditions per place. [2024-11-10 14:40:43,180 INFO L82 GeneralOperation]: Start removeDead. Operand has 117 places, 122 transitions, 260 flow [2024-11-10 14:40:43,181 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 117 places, 122 transitions, 260 flow [2024-11-10 14:40:43,182 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 14:40:43,185 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;@733b61c2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 14:40:43,185 INFO L334 AbstractCegarLoop]: Starting to check reachability of 19 error locations. [2024-11-10 14:40:43,187 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-10 14:40:43,187 INFO L124 PetriNetUnfolderBase]: 0/15 cut-off events. [2024-11-10 14:40:43,187 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-10 14:40:43,187 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:40:43,187 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:40:43,188 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [salethreadErr3ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE, salethreadErr0ASSERT_VIOLATIONDATA_RACE (and 16 more)] === [2024-11-10 14:40:43,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:40:43,188 INFO L85 PathProgramCache]: Analyzing trace with hash -1178199294, now seen corresponding path program 1 times [2024-11-10 14:40:43,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:40:43,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770135996] [2024-11-10 14:40:43,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:40:43,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:40:43,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:40:43,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:40:43,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:40:43,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770135996] [2024-11-10 14:40:43,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [770135996] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:40:43,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:40:43,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-10 14:40:43,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665517166] [2024-11-10 14:40:43,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:40:43,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 14:40:43,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:40:43,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 14:40:43,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 14:40:43,208 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 122 [2024-11-10 14:40:43,208 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 122 transitions, 260 flow. Second operand has 2 states, 2 states have (on average 99.5) internal successors, (199), 2 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:40:43,208 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:40:43,208 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 122 [2024-11-10 14:40:43,208 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:40:43,258 INFO L124 PetriNetUnfolderBase]: 19/261 cut-off events. [2024-11-10 14:40:43,258 INFO L125 PetriNetUnfolderBase]: For 36/42 co-relation queries the response was YES. [2024-11-10 14:40:43,259 INFO L83 FinitePrefix]: Finished finitePrefix Result has 311 conditions, 261 events. 19/261 cut-off events. For 36/42 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 750 event pairs, 4 based on Foata normal form. 22/249 useless extension candidates. Maximal degree in co-relation 147. Up to 30 conditions per place. [2024-11-10 14:40:43,261 INFO L140 encePairwiseOnDemand]: 111/122 looper letters, 11 selfloop transitions, 0 changer transitions 0/109 dead transitions. [2024-11-10 14:40:43,261 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 109 transitions, 256 flow [2024-11-10 14:40:43,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 14:40:43,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-11-10 14:40:43,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 220 transitions. [2024-11-10 14:40:43,263 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9016393442622951 [2024-11-10 14:40:43,263 INFO L175 Difference]: Start difference. First operand has 117 places, 122 transitions, 260 flow. Second operand 2 states and 220 transitions. [2024-11-10 14:40:43,263 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 109 transitions, 256 flow [2024-11-10 14:40:43,264 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 109 transitions, 256 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-10 14:40:43,267 INFO L231 Difference]: Finished difference. Result has 109 places, 109 transitions, 234 flow [2024-11-10 14:40:43,267 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=122, PETRI_DIFFERENCE_MINUEND_FLOW=234, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=234, PETRI_PLACES=109, PETRI_TRANSITIONS=109} [2024-11-10 14:40:43,268 INFO L277 CegarLoopForPetriNet]: 117 programPoint places, -8 predicate places. [2024-11-10 14:40:43,271 INFO L471 AbstractCegarLoop]: Abstraction has has 109 places, 109 transitions, 234 flow [2024-11-10 14:40:43,271 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 99.5) internal successors, (199), 2 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:40:43,271 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:40:43,271 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-11-10 14:40:43,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 14:40:43,272 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [salethreadErr3ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE, salethreadErr0ASSERT_VIOLATIONDATA_RACE (and 16 more)] === [2024-11-10 14:40:43,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:40:43,272 INFO L85 PathProgramCache]: Analyzing trace with hash 2015790853, now seen corresponding path program 1 times [2024-11-10 14:40:43,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:40:43,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229713094] [2024-11-10 14:40:43,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:40:43,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:40:43,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:40:43,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:40:43,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:40:43,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229713094] [2024-11-10 14:40:43,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229713094] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:40:43,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:40:43,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 14:40:43,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878942559] [2024-11-10 14:40:43,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:40:43,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:40:43,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:40:43,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:40:43,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:40:43,327 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 122 [2024-11-10 14:40:43,328 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 109 transitions, 234 flow. Second operand has 3 states, 3 states have (on average 95.33333333333333) internal successors, (286), 3 states have internal predecessors, (286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:40:43,328 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:40:43,328 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 122 [2024-11-10 14:40:43,328 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:40:43,401 INFO L124 PetriNetUnfolderBase]: 59/513 cut-off events. [2024-11-10 14:40:43,402 INFO L125 PetriNetUnfolderBase]: For 29/29 co-relation queries the response was YES. [2024-11-10 14:40:43,404 INFO L83 FinitePrefix]: Finished finitePrefix Result has 629 conditions, 513 events. 59/513 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 2534 event pairs, 10 based on Foata normal form. 1/449 useless extension candidates. Maximal degree in co-relation 624. Up to 94 conditions per place. [2024-11-10 14:40:43,406 INFO L140 encePairwiseOnDemand]: 119/122 looper letters, 18 selfloop transitions, 2 changer transitions 0/112 dead transitions. [2024-11-10 14:40:43,406 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 112 transitions, 280 flow [2024-11-10 14:40:43,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:40:43,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:40:43,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 300 transitions. [2024-11-10 14:40:43,407 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.819672131147541 [2024-11-10 14:40:43,407 INFO L175 Difference]: Start difference. First operand has 109 places, 109 transitions, 234 flow. Second operand 3 states and 300 transitions. [2024-11-10 14:40:43,408 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 112 transitions, 280 flow [2024-11-10 14:40:43,409 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 112 transitions, 280 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-10 14:40:43,411 INFO L231 Difference]: Finished difference. Result has 112 places, 110 transitions, 246 flow [2024-11-10 14:40:43,411 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=122, PETRI_DIFFERENCE_MINUEND_FLOW=234, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=246, PETRI_PLACES=112, PETRI_TRANSITIONS=110} [2024-11-10 14:40:43,412 INFO L277 CegarLoopForPetriNet]: 117 programPoint places, -5 predicate places. [2024-11-10 14:40:43,413 INFO L471 AbstractCegarLoop]: Abstraction has has 112 places, 110 transitions, 246 flow [2024-11-10 14:40:43,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 95.33333333333333) internal successors, (286), 3 states have internal predecessors, (286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:40:43,413 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:40:43,416 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] [2024-11-10 14:40:43,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 14:40:43,417 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [salethreadErr3ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE, salethreadErr0ASSERT_VIOLATIONDATA_RACE (and 16 more)] === [2024-11-10 14:40:43,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:40:43,417 INFO L85 PathProgramCache]: Analyzing trace with hash 550981692, now seen corresponding path program 1 times [2024-11-10 14:40:43,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:40:43,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429975110] [2024-11-10 14:40:43,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:40:43,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:40:43,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:40:43,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:40:43,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:40:43,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429975110] [2024-11-10 14:40:43,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429975110] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:40:43,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:40:43,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 14:40:43,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770186896] [2024-11-10 14:40:43,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:40:43,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 14:40:43,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:40:43,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 14:40:43,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-10 14:40:43,797 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 122 [2024-11-10 14:40:43,798 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 110 transitions, 246 flow. Second operand has 6 states, 6 states have (on average 82.0) internal successors, (492), 6 states have internal predecessors, (492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:40:43,799 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:40:43,799 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 122 [2024-11-10 14:40:43,799 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:40:43,934 INFO L124 PetriNetUnfolderBase]: 179/635 cut-off events. [2024-11-10 14:40:43,934 INFO L125 PetriNetUnfolderBase]: For 31/31 co-relation queries the response was YES. [2024-11-10 14:40:43,936 INFO L83 FinitePrefix]: Finished finitePrefix Result has 976 conditions, 635 events. 179/635 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 3490 event pairs, 12 based on Foata normal form. 0/581 useless extension candidates. Maximal degree in co-relation 969. Up to 208 conditions per place. [2024-11-10 14:40:43,941 INFO L140 encePairwiseOnDemand]: 116/122 looper letters, 41 selfloop transitions, 5 changer transitions 0/125 dead transitions. [2024-11-10 14:40:43,941 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 125 transitions, 368 flow [2024-11-10 14:40:43,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 14:40:43,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-10 14:40:43,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 526 transitions. [2024-11-10 14:40:43,943 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7185792349726776 [2024-11-10 14:40:43,943 INFO L175 Difference]: Start difference. First operand has 112 places, 110 transitions, 246 flow. Second operand 6 states and 526 transitions. [2024-11-10 14:40:43,943 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 125 transitions, 368 flow [2024-11-10 14:40:43,945 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 125 transitions, 366 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-10 14:40:43,946 INFO L231 Difference]: Finished difference. Result has 115 places, 109 transitions, 252 flow [2024-11-10 14:40:43,946 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=122, PETRI_DIFFERENCE_MINUEND_FLOW=242, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=252, PETRI_PLACES=115, PETRI_TRANSITIONS=109} [2024-11-10 14:40:43,947 INFO L277 CegarLoopForPetriNet]: 117 programPoint places, -2 predicate places. [2024-11-10 14:40:43,948 INFO L471 AbstractCegarLoop]: Abstraction has has 115 places, 109 transitions, 252 flow [2024-11-10 14:40:43,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 82.0) internal successors, (492), 6 states have internal predecessors, (492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:40:43,949 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:40:43,949 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] [2024-11-10 14:40:43,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 14:40:43,949 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting salethreadErr3ASSERT_VIOLATIONDATA_RACE === [salethreadErr3ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE, salethreadErr0ASSERT_VIOLATIONDATA_RACE (and 16 more)] === [2024-11-10 14:40:43,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:40:43,949 INFO L85 PathProgramCache]: Analyzing trace with hash 1219687510, now seen corresponding path program 1 times [2024-11-10 14:40:43,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:40:43,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669164041] [2024-11-10 14:40:43,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:40:43,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:40:43,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:40:43,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:40:43,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:40:43,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669164041] [2024-11-10 14:40:43,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669164041] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:40:43,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:40:43,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:40:43,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302013062] [2024-11-10 14:40:43,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:40:43,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:40:43,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:40:43,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:40:43,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:40:43,988 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 122 [2024-11-10 14:40:43,988 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 109 transitions, 252 flow. Second operand has 3 states, 3 states have (on average 95.0) internal successors, (285), 3 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:40:43,988 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:40:43,988 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 122 [2024-11-10 14:40:43,989 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:40:44,145 INFO L124 PetriNetUnfolderBase]: 56/788 cut-off events. [2024-11-10 14:40:44,146 INFO L125 PetriNetUnfolderBase]: For 124/390 co-relation queries the response was YES. [2024-11-10 14:40:44,148 INFO L83 FinitePrefix]: Finished finitePrefix Result has 966 conditions, 788 events. 56/788 cut-off events. For 124/390 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 5088 event pairs, 11 based on Foata normal form. 0/669 useless extension candidates. Maximal degree in co-relation 959. Up to 59 conditions per place. [2024-11-10 14:40:44,151 INFO L140 encePairwiseOnDemand]: 114/122 looper letters, 22 selfloop transitions, 6 changer transitions 0/120 dead transitions. [2024-11-10 14:40:44,151 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 120 transitions, 341 flow [2024-11-10 14:40:44,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:40:44,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:40:44,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 309 transitions. [2024-11-10 14:40:44,154 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8442622950819673 [2024-11-10 14:40:44,154 INFO L175 Difference]: Start difference. First operand has 115 places, 109 transitions, 252 flow. Second operand 3 states and 309 transitions. [2024-11-10 14:40:44,154 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 120 transitions, 341 flow [2024-11-10 14:40:44,156 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 120 transitions, 331 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-10 14:40:44,158 INFO L231 Difference]: Finished difference. Result has 114 places, 115 transitions, 294 flow [2024-11-10 14:40:44,159 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=122, PETRI_DIFFERENCE_MINUEND_FLOW=242, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=294, PETRI_PLACES=114, PETRI_TRANSITIONS=115} [2024-11-10 14:40:44,159 INFO L277 CegarLoopForPetriNet]: 117 programPoint places, -3 predicate places. [2024-11-10 14:40:44,160 INFO L471 AbstractCegarLoop]: Abstraction has has 114 places, 115 transitions, 294 flow [2024-11-10 14:40:44,160 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 95.0) internal successors, (285), 3 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:40:44,160 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:40:44,160 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:40:44,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-10 14:40:44,161 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting salethreadErr2ASSERT_VIOLATIONDATA_RACE === [salethreadErr3ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE, salethreadErr0ASSERT_VIOLATIONDATA_RACE (and 16 more)] === [2024-11-10 14:40:44,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:40:44,161 INFO L85 PathProgramCache]: Analyzing trace with hash 287637838, now seen corresponding path program 1 times [2024-11-10 14:40:44,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:40:44,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805248065] [2024-11-10 14:40:44,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:40:44,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:40:44,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:40:44,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:40:44,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:40:44,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805248065] [2024-11-10 14:40:44,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1805248065] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:40:44,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:40:44,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:40:44,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486862751] [2024-11-10 14:40:44,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:40:44,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:40:44,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:40:44,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:40:44,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:40:44,221 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 122 [2024-11-10 14:40:44,222 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 115 transitions, 294 flow. Second operand has 3 states, 3 states have (on average 92.0) internal successors, (276), 3 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:40:44,222 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:40:44,223 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 122 [2024-11-10 14:40:44,223 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:40:44,435 INFO L124 PetriNetUnfolderBase]: 273/1975 cut-off events. [2024-11-10 14:40:44,436 INFO L125 PetriNetUnfolderBase]: For 391/908 co-relation queries the response was YES. [2024-11-10 14:40:44,441 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2765 conditions, 1975 events. 273/1975 cut-off events. For 391/908 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 17167 event pairs, 94 based on Foata normal form. 1/1697 useless extension candidates. Maximal degree in co-relation 2757. Up to 395 conditions per place. [2024-11-10 14:40:44,448 INFO L140 encePairwiseOnDemand]: 111/122 looper letters, 27 selfloop transitions, 8 changer transitions 0/128 dead transitions. [2024-11-10 14:40:44,448 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 128 transitions, 409 flow [2024-11-10 14:40:44,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:40:44,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:40:44,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 306 transitions. [2024-11-10 14:40:44,450 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8360655737704918 [2024-11-10 14:40:44,450 INFO L175 Difference]: Start difference. First operand has 114 places, 115 transitions, 294 flow. Second operand 3 states and 306 transitions. [2024-11-10 14:40:44,452 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 128 transitions, 409 flow [2024-11-10 14:40:44,454 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 128 transitions, 393 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:40:44,457 INFO L231 Difference]: Finished difference. Result has 116 places, 123 transitions, 352 flow [2024-11-10 14:40:44,458 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=122, PETRI_DIFFERENCE_MINUEND_FLOW=282, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=352, PETRI_PLACES=116, PETRI_TRANSITIONS=123} [2024-11-10 14:40:44,459 INFO L277 CegarLoopForPetriNet]: 117 programPoint places, -1 predicate places. [2024-11-10 14:40:44,459 INFO L471 AbstractCegarLoop]: Abstraction has has 116 places, 123 transitions, 352 flow [2024-11-10 14:40:44,459 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 92.0) internal successors, (276), 3 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:40:44,459 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:40:44,460 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:40:44,460 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-10 14:40:44,460 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [salethreadErr3ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE, salethreadErr0ASSERT_VIOLATIONDATA_RACE (and 16 more)] === [2024-11-10 14:40:44,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:40:44,461 INFO L85 PathProgramCache]: Analyzing trace with hash 1263110698, now seen corresponding path program 1 times [2024-11-10 14:40:44,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:40:44,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683727050] [2024-11-10 14:40:44,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:40:44,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:40:44,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:40:44,560 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:40:44,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:40:44,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683727050] [2024-11-10 14:40:44,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [683727050] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 14:40:44,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1622660187] [2024-11-10 14:40:44,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:40:44,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 14:40:44,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 14:40:44,563 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 14:40:44,565 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-10 14:40:44,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:40:44,658 INFO L255 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 14:40:44,660 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 14:40:44,730 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:40:44,730 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 14:40:44,787 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:40:44,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1622660187] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 14:40:44,788 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 14:40:44,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2024-11-10 14:40:44,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196897798] [2024-11-10 14:40:44,788 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 14:40:44,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 14:40:44,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:40:44,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 14:40:44,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-10 14:40:44,863 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 122 [2024-11-10 14:40:44,864 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 123 transitions, 352 flow. Second operand has 10 states, 10 states have (on average 92.4) internal successors, (924), 10 states have internal predecessors, (924), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:40:44,865 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:40:44,865 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 122 [2024-11-10 14:40:44,865 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:40:45,025 INFO L124 PetriNetUnfolderBase]: 158/747 cut-off events. [2024-11-10 14:40:45,026 INFO L125 PetriNetUnfolderBase]: For 356/423 co-relation queries the response was YES. [2024-11-10 14:40:45,028 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1347 conditions, 747 events. 158/747 cut-off events. For 356/423 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 5241 event pairs, 24 based on Foata normal form. 38/739 useless extension candidates. Maximal degree in co-relation 1338. Up to 100 conditions per place. [2024-11-10 14:40:45,030 INFO L140 encePairwiseOnDemand]: 117/122 looper letters, 47 selfloop transitions, 7 changer transitions 0/120 dead transitions. [2024-11-10 14:40:45,031 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 120 transitions, 510 flow [2024-11-10 14:40:45,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 14:40:45,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-10 14:40:45,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 850 transitions. [2024-11-10 14:40:45,033 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7741347905282332 [2024-11-10 14:40:45,034 INFO L175 Difference]: Start difference. First operand has 116 places, 123 transitions, 352 flow. Second operand 9 states and 850 transitions. [2024-11-10 14:40:45,034 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 120 transitions, 510 flow [2024-11-10 14:40:45,036 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 120 transitions, 480 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:40:45,037 INFO L231 Difference]: Finished difference. Result has 89 places, 88 transitions, 262 flow [2024-11-10 14:40:45,037 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=122, PETRI_DIFFERENCE_MINUEND_FLOW=244, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=262, PETRI_PLACES=89, PETRI_TRANSITIONS=88} [2024-11-10 14:40:45,038 INFO L277 CegarLoopForPetriNet]: 117 programPoint places, -28 predicate places. [2024-11-10 14:40:45,038 INFO L471 AbstractCegarLoop]: Abstraction has has 89 places, 88 transitions, 262 flow [2024-11-10 14:40:45,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 92.4) internal successors, (924), 10 states have internal predecessors, (924), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:40:45,039 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:40:45,039 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:40:45,057 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-10 14:40:45,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-11-10 14:40:45,240 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting salethreadErr3ASSERT_VIOLATIONDATA_RACE === [salethreadErr3ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE, salethreadErr0ASSERT_VIOLATIONDATA_RACE (and 16 more)] === [2024-11-10 14:40:45,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:40:45,240 INFO L85 PathProgramCache]: Analyzing trace with hash -587135053, now seen corresponding path program 1 times [2024-11-10 14:40:45,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:40:45,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464165889] [2024-11-10 14:40:45,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:40:45,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:40:45,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:40:45,313 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-10 14:40:45,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:40:45,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464165889] [2024-11-10 14:40:45,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464165889] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:40:45,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:40:45,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 14:40:45,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322174841] [2024-11-10 14:40:45,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:40:45,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 14:40:45,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:40:45,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 14:40:45,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 14:40:45,324 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 122 [2024-11-10 14:40:45,325 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 88 transitions, 262 flow. Second operand has 4 states, 4 states have (on average 97.25) internal successors, (389), 4 states have internal predecessors, (389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:40:45,325 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:40:45,325 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 122 [2024-11-10 14:40:45,325 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:40:45,381 INFO L124 PetriNetUnfolderBase]: 29/292 cut-off events. [2024-11-10 14:40:45,381 INFO L125 PetriNetUnfolderBase]: For 44/46 co-relation queries the response was YES. [2024-11-10 14:40:45,382 INFO L83 FinitePrefix]: Finished finitePrefix Result has 467 conditions, 292 events. 29/292 cut-off events. For 44/46 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1377 event pairs, 4 based on Foata normal form. 8/283 useless extension candidates. Maximal degree in co-relation 458. Up to 29 conditions per place. [2024-11-10 14:40:45,383 INFO L140 encePairwiseOnDemand]: 116/122 looper letters, 23 selfloop transitions, 6 changer transitions 0/98 dead transitions. [2024-11-10 14:40:45,383 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 98 transitions, 365 flow [2024-11-10 14:40:45,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 14:40:45,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-10 14:40:45,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 503 transitions. [2024-11-10 14:40:45,385 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8245901639344262 [2024-11-10 14:40:45,385 INFO L175 Difference]: Start difference. First operand has 89 places, 88 transitions, 262 flow. Second operand 5 states and 503 transitions. [2024-11-10 14:40:45,385 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 98 transitions, 365 flow [2024-11-10 14:40:45,386 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 98 transitions, 350 flow, removed 1 selfloop flow, removed 5 redundant places. [2024-11-10 14:40:45,387 INFO L231 Difference]: Finished difference. Result has 90 places, 89 transitions, 282 flow [2024-11-10 14:40:45,388 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=122, PETRI_DIFFERENCE_MINUEND_FLOW=231, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=282, PETRI_PLACES=90, PETRI_TRANSITIONS=89} [2024-11-10 14:40:45,388 INFO L277 CegarLoopForPetriNet]: 117 programPoint places, -27 predicate places. [2024-11-10 14:40:45,388 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 89 transitions, 282 flow [2024-11-10 14:40:45,389 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 97.25) internal successors, (389), 4 states have internal predecessors, (389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:40:45,389 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:40:45,389 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:40:45,389 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-10 14:40:45,389 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting salethreadErr3ASSERT_VIOLATIONDATA_RACE === [salethreadErr3ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE, salethreadErr0ASSERT_VIOLATIONDATA_RACE (and 16 more)] === [2024-11-10 14:40:45,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:40:45,390 INFO L85 PathProgramCache]: Analyzing trace with hash 134168077, now seen corresponding path program 1 times [2024-11-10 14:40:45,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:40:45,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65131449] [2024-11-10 14:40:45,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:40:45,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:40:45,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:40:45,461 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-10 14:40:45,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:40:45,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65131449] [2024-11-10 14:40:45,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [65131449] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:40:45,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:40:45,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 14:40:45,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879133749] [2024-11-10 14:40:45,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:40:45,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 14:40:45,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:40:45,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 14:40:45,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 14:40:45,473 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 122 [2024-11-10 14:40:45,473 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 89 transitions, 282 flow. Second operand has 4 states, 4 states have (on average 97.25) internal successors, (389), 4 states have internal predecessors, (389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:40:45,473 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:40:45,473 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 122 [2024-11-10 14:40:45,473 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:40:45,537 INFO L124 PetriNetUnfolderBase]: 22/262 cut-off events. [2024-11-10 14:40:45,537 INFO L125 PetriNetUnfolderBase]: For 107/115 co-relation queries the response was YES. [2024-11-10 14:40:45,538 INFO L83 FinitePrefix]: Finished finitePrefix Result has 458 conditions, 262 events. 22/262 cut-off events. For 107/115 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1075 event pairs, 4 based on Foata normal form. 12/265 useless extension candidates. Maximal degree in co-relation 447. Up to 33 conditions per place. [2024-11-10 14:40:45,539 INFO L140 encePairwiseOnDemand]: 116/122 looper letters, 19 selfloop transitions, 7 changer transitions 0/95 dead transitions. [2024-11-10 14:40:45,540 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 95 transitions, 363 flow [2024-11-10 14:40:45,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 14:40:45,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-10 14:40:45,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 499 transitions. [2024-11-10 14:40:45,541 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8180327868852459 [2024-11-10 14:40:45,542 INFO L175 Difference]: Start difference. First operand has 90 places, 89 transitions, 282 flow. Second operand 5 states and 499 transitions. [2024-11-10 14:40:45,542 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 95 transitions, 363 flow [2024-11-10 14:40:45,544 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 95 transitions, 360 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-10 14:40:45,545 INFO L231 Difference]: Finished difference. Result has 95 places, 90 transitions, 316 flow [2024-11-10 14:40:45,545 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=122, PETRI_DIFFERENCE_MINUEND_FLOW=271, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=316, PETRI_PLACES=95, PETRI_TRANSITIONS=90} [2024-11-10 14:40:45,546 INFO L277 CegarLoopForPetriNet]: 117 programPoint places, -22 predicate places. [2024-11-10 14:40:45,546 INFO L471 AbstractCegarLoop]: Abstraction has has 95 places, 90 transitions, 316 flow [2024-11-10 14:40:45,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 97.25) internal successors, (389), 4 states have internal predecessors, (389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:40:45,547 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:40:45,547 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:40:45,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-10 14:40:45,547 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting salethreadErr2ASSERT_VIOLATIONDATA_RACE === [salethreadErr3ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE, salethreadErr0ASSERT_VIOLATIONDATA_RACE (and 16 more)] === [2024-11-10 14:40:45,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:40:45,548 INFO L85 PathProgramCache]: Analyzing trace with hash -798320203, now seen corresponding path program 1 times [2024-11-10 14:40:45,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:40:45,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736731918] [2024-11-10 14:40:45,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:40:45,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:40:45,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 14:40:45,568 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 14:40:45,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 14:40:45,591 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 14:40:45,591 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 14:40:45,591 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location salethreadErr2ASSERT_VIOLATIONDATA_RACE (18 of 19 remaining) [2024-11-10 14:40:45,592 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr3ASSERT_VIOLATIONDATA_RACE (17 of 19 remaining) [2024-11-10 14:40:45,592 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr2ASSERT_VIOLATIONDATA_RACE (16 of 19 remaining) [2024-11-10 14:40:45,593 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr0ASSERT_VIOLATIONDATA_RACE (15 of 19 remaining) [2024-11-10 14:40:45,593 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr1ASSERT_VIOLATIONDATA_RACE (14 of 19 remaining) [2024-11-10 14:40:45,593 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (13 of 19 remaining) [2024-11-10 14:40:45,593 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (12 of 19 remaining) [2024-11-10 14:40:45,593 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (11 of 19 remaining) [2024-11-10 14:40:45,593 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (10 of 19 remaining) [2024-11-10 14:40:45,593 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (9 of 19 remaining) [2024-11-10 14:40:45,593 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (8 of 19 remaining) [2024-11-10 14:40:45,593 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (7 of 19 remaining) [2024-11-10 14:40:45,593 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr3ASSERT_VIOLATIONDATA_RACE (6 of 19 remaining) [2024-11-10 14:40:45,593 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr2ASSERT_VIOLATIONDATA_RACE (5 of 19 remaining) [2024-11-10 14:40:45,594 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr0ASSERT_VIOLATIONDATA_RACE (4 of 19 remaining) [2024-11-10 14:40:45,594 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr1ASSERT_VIOLATIONDATA_RACE (3 of 19 remaining) [2024-11-10 14:40:45,594 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr3ASSERT_VIOLATIONDATA_RACE (2 of 19 remaining) [2024-11-10 14:40:45,594 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr0ASSERT_VIOLATIONDATA_RACE (1 of 19 remaining) [2024-11-10 14:40:45,594 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr1ASSERT_VIOLATIONDATA_RACE (0 of 19 remaining) [2024-11-10 14:40:45,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-10 14:40:45,596 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:40:45,670 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 2 thread instances [2024-11-10 14:40:45,670 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 14:40:45,676 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 02:40:45 BasicIcfg [2024-11-10 14:40:45,676 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 14:40:45,677 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 14:40:45,677 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 14:40:45,677 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 14:40:45,677 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 02:40:41" (3/4) ... [2024-11-10 14:40:45,678 INFO L137 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-10 14:40:45,746 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-10 14:40:45,749 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 14:40:45,749 INFO L158 Benchmark]: Toolchain (without parser) took 5815.80ms. Allocated memory was 161.5MB in the beginning and 260.0MB in the end (delta: 98.6MB). Free memory was 96.0MB in the beginning and 179.2MB in the end (delta: -83.2MB). Peak memory consumption was 14.9MB. Max. memory is 16.1GB. [2024-11-10 14:40:45,750 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 96.5MB. Free memory was 50.8MB in the beginning and 50.7MB in the end (delta: 84.0kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 14:40:45,750 INFO L158 Benchmark]: CACSL2BoogieTranslator took 485.79ms. Allocated memory is still 161.5MB. Free memory was 96.0MB in the beginning and 122.7MB in the end (delta: -26.7MB). Peak memory consumption was 9.0MB. Max. memory is 16.1GB. [2024-11-10 14:40:45,750 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.38ms. Allocated memory is still 161.5MB. Free memory was 122.7MB in the beginning and 120.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 14:40:45,750 INFO L158 Benchmark]: Boogie Preprocessor took 37.00ms. Allocated memory is still 161.5MB. Free memory was 120.6MB in the beginning and 119.1MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 14:40:45,751 INFO L158 Benchmark]: IcfgBuilder took 526.06ms. Allocated memory is still 161.5MB. Free memory was 119.1MB in the beginning and 99.6MB in the end (delta: 19.5MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-10 14:40:45,751 INFO L158 Benchmark]: TraceAbstraction took 4634.99ms. Allocated memory was 161.5MB in the beginning and 260.0MB in the end (delta: 98.6MB). Free memory was 99.0MB in the beginning and 190.7MB in the end (delta: -91.7MB). Peak memory consumption was 9.7MB. Max. memory is 16.1GB. [2024-11-10 14:40:45,751 INFO L158 Benchmark]: Witness Printer took 72.24ms. Allocated memory is still 260.0MB. Free memory was 190.7MB in the beginning and 179.2MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-10 14:40:45,753 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.21ms. Allocated memory is still 96.5MB. Free memory was 50.8MB in the beginning and 50.7MB in the end (delta: 84.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 485.79ms. Allocated memory is still 161.5MB. Free memory was 96.0MB in the beginning and 122.7MB in the end (delta: -26.7MB). Peak memory consumption was 9.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 53.38ms. Allocated memory is still 161.5MB. Free memory was 122.7MB in the beginning and 120.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 37.00ms. Allocated memory is still 161.5MB. Free memory was 120.6MB in the beginning and 119.1MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 526.06ms. Allocated memory is still 161.5MB. Free memory was 119.1MB in the beginning and 99.6MB in the end (delta: 19.5MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 4634.99ms. Allocated memory was 161.5MB in the beginning and 260.0MB in the end (delta: 98.6MB). Free memory was 99.0MB in the beginning and 190.7MB in the end (delta: -91.7MB). Peak memory consumption was 9.7MB. Max. memory is 16.1GB. * Witness Printer took 72.24ms. Allocated memory is still 260.0MB. Free memory was 190.7MB in the beginning and 179.2MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - DataRaceFoundResult [Line: 722]: Data race detected Data race detected The following path leads to a data race: [L717] 0 int numberOfSeatsSold; VAL [numberOfSeatsSold=0] [L718] 0 int stopSales; VAL [numberOfSeatsSold=0, stopSales=0] [L719] 0 int numOfTickets; VAL [numOfTickets=0, numberOfSeatsSold=0, stopSales=0] [L736] 0 pthread_t salethreads[5]; VAL [\old(argc)=49, \old(argv)={51:50}, argc=49, numOfTickets=0, numberOfSeatsSold=0, salethreads={8:0}, stopSales=0] [L738] 0 numOfTickets = 5 VAL [\old(argc)=49, \old(argv)={51:50}, argc=49, numOfTickets=5, numberOfSeatsSold=0, salethreads={8:0}, stopSales=0] [L741] 0 numberOfSeatsSold = 0 VAL [\old(argc)=49, \old(argv)={51:50}, argc=49, numOfTickets=5, numberOfSeatsSold=0, salethreads={8:0}, stopSales=0] [L744] 0 stopSales = 0 VAL [\old(argc)=49, \old(argv)={51:50}, argc=49, numOfTickets=5, numberOfSeatsSold=0, salethreads={8:0}, stopSales=0] [L746] 0 int i = 0; VAL [\old(argc)=49, \old(argv)={51:50}, argc=49, i=0, numOfTickets=5, numberOfSeatsSold=0, salethreads={8:0}, stopSales=0] [L746] COND TRUE 0 i < 5 VAL [\old(argc)=49, \old(argv)={51:50}, argc=49, i=0, numOfTickets=5, numberOfSeatsSold=0, salethreads={8:0}, stopSales=0] [L747] 0 pthread_create(&salethreads[i], 0, salethread, ((void *)0)) VAL [\old(argc)=49, \old(argv)={51:50}, argc=49, i=0, numOfTickets=5, numberOfSeatsSold=0, salethreads={8:0}, stopSales=0] [L747] FCALL, FORK 0 pthread_create(&salethreads[i], 0, salethread, ((void *)0)) VAL [\old(arg)={0:0}, \old(argc)=49, \old(argv)={51:50}, argc=49, i=0, numOfTickets=5, numberOfSeatsSold=0, salethreads={8:0}, stopSales=0] [L721] 1 !stopSales VAL [\old(arg)={0:0}, arg={0:0}, numOfTickets=5, numberOfSeatsSold=0, stopSales=0] [L746] 0 i++ VAL [\old(arg)={0:0}, \old(argc)=49, \old(argv)={51:50}, arg={0:0}, argc=49, i=1, numOfTickets=5, numberOfSeatsSold=0, salethreads={8:0}, stopSales=0] [L746] COND TRUE 0 i < 5 VAL [\old(arg)={0:0}, \old(argc)=49, \old(argv)={51:50}, arg={0:0}, argc=49, i=1, numOfTickets=5, numberOfSeatsSold=0, salethreads={8:0}, stopSales=0] [L747] 0 pthread_create(&salethreads[i], 0, salethread, ((void *)0)) VAL [\old(arg)={0:0}, \old(argc)=49, \old(argv)={51:50}, arg={0:0}, argc=49, i=1, numOfTickets=5, numberOfSeatsSold=0, salethreads={8:0}, stopSales=0] [L747] FCALL, FORK 0 pthread_create(&salethreads[i], 0, salethread, ((void *)0)) VAL [\old(arg)={0:0}, \old(argc)=49, \old(argv)={51:50}, arg={0:0}, argc=49, i=1, numOfTickets=5, numberOfSeatsSold=0, salethreads={8:0}, stopSales=0] [L721] 2 !stopSales VAL [\old(arg)={0:0}, arg={0:0}, numOfTickets=5, numberOfSeatsSold=0, stopSales=0] [L721] COND TRUE 1 !stopSales VAL [\old(arg)={0:0}, arg={0:0}, numOfTickets=5, numberOfSeatsSold=0, stopSales=0] [L722] 1 int _numberOfSeatsSold = numberOfSeatsSold; VAL [\old(arg)={0:0}, arg={0:0}, numOfTickets=5, numberOfSeatsSold=0, stopSales=0] [L721] 2 !stopSales VAL [\old(arg)={0:0}, arg={0:0}, numOfTickets=5, numberOfSeatsSold=0, stopSales=0] [L721] COND TRUE 2 !stopSales VAL [\old(arg)={0:0}, arg={0:0}, numOfTickets=5, numberOfSeatsSold=0, stopSales=0] [L722] 2 int _numberOfSeatsSold = numberOfSeatsSold; VAL [\old(arg)={0:0}, _numberOfSeatsSold=0, arg={0:0}, numOfTickets=5, numberOfSeatsSold=0, stopSales=0] [L723] COND FALSE 1 !(_numberOfSeatsSold >= (5 - (((5 / 10) == 0) ? 1 : (5 / 10)))) VAL [\old(arg)={0:0}, _numberOfSeatsSold=0, arg={0:0}, numOfTickets=5, numberOfSeatsSold=0, stopSales=0] [L729] 1 numberOfSeatsSold = _numberOfSeatsSold + 1 VAL [\old(arg)={0:0}, _numberOfSeatsSold=0, arg={0:0}, numOfTickets=5, numberOfSeatsSold=1, stopSales=0] [L722] 2 int _numberOfSeatsSold = numberOfSeatsSold; VAL [\old(arg)={0:0}, _numberOfSeatsSold=0, arg={0:0}, numOfTickets=5, numberOfSeatsSold=1, stopSales=0] Now there is a data race on ~numberOfSeatsSold~0 between C: numberOfSeatsSold = _numberOfSeatsSold + 1 [729] and C: int _numberOfSeatsSold = numberOfSeatsSold; [722] - UnprovableResult [Line: 721]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 725]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 729]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 738]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 741]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 744]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 752]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 747]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 750]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 747]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 113 locations, 15 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: 2.0s, OverallIterations: 6, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 107 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 59 mSDsluCounter, 13 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 11 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 239 IncrementalHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 11 mSolverCounterUnsat, 13 mSDtfsCounter, 239 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=215occurred in iteration=5, InterpolantAutomatonStates: 17, 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, 0.7s InterpolantComputationTime, 194 NumberOfCodeBlocks, 194 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 140 ConstructedInterpolants, 0 QuantifiedInterpolants, 263 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 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 - StatisticsResult: Ultimate Automizer benchmark data with 2 thread instances CFG has 4 procedures, 131 locations, 19 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: 2.4s, OverallIterations: 9, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 260 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 191 mSDsluCounter, 48 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 30 mSDsCounter, 28 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 546 IncrementalHoareTripleChecker+Invalid, 574 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 28 mSolverCounterUnsat, 18 mSDtfsCounter, 546 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 129 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=352occurred in iteration=5, InterpolantAutomatonStates: 36, 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, 0.7s InterpolantComputationTime, 429 NumberOfCodeBlocks, 429 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 404 ConstructedInterpolants, 0 QuantifiedInterpolants, 815 SizeOfPredicates, 2 NumberOfNonLiveVariables, 130 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 10 InterpolantComputations, 7 PerfectInterpolantSequences, 24/30 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 RESULT: Ultimate proved your program to be incorrect! [2024-11-10 14:40:45,786 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 Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE