./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/06-symbeq_09-tricky_address4.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/goblint-regression/06-symbeq_09-tricky_address4.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 e3884759389c7a3b94642e5e46b4f06a5e829be11d2d026f21d000ba598ae6cd --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 05:49:22,351 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 05:49:22,432 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-11-19 05:49:22,436 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 05:49:22,436 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 05:49:22,463 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 05:49:22,463 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 05:49:22,464 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 05:49:22,465 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 05:49:22,465 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 05:49:22,466 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 05:49:22,466 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 05:49:22,466 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 05:49:22,467 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 05:49:22,469 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 05:49:22,470 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 05:49:22,470 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 05:49:22,470 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 05:49:22,470 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 05:49:22,470 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 05:49:22,471 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 05:49:22,471 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 05:49:22,472 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-19 05:49:22,473 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 05:49:22,473 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 05:49:22,473 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 05:49:22,473 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 05:49:22,473 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 05:49:22,474 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 05:49:22,474 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 05:49:22,474 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 05:49:22,474 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 05:49:22,474 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 05:49:22,474 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 05:49:22,475 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 05:49:22,475 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 05:49:22,475 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 05:49:22,475 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 05:49:22,475 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 05:49:22,475 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 05:49:22,476 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 05:49:22,483 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 -> e3884759389c7a3b94642e5e46b4f06a5e829be11d2d026f21d000ba598ae6cd [2024-11-19 05:49:22,696 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 05:49:22,717 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 05:49:22,720 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 05:49:22,721 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 05:49:22,721 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 05:49:22,723 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/06-symbeq_09-tricky_address4.i [2024-11-19 05:49:24,012 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 05:49:24,256 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 05:49:24,256 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/06-symbeq_09-tricky_address4.i [2024-11-19 05:49:24,273 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c01bfc202/187cf54d7e2141768f1f41ca2ab37ae0/FLAG06d424d7b [2024-11-19 05:49:24,286 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c01bfc202/187cf54d7e2141768f1f41ca2ab37ae0 [2024-11-19 05:49:24,288 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 05:49:24,289 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 05:49:24,292 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 05:49:24,292 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 05:49:24,296 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 05:49:24,296 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 05:49:24" (1/1) ... [2024-11-19 05:49:24,297 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2433792d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:49:24, skipping insertion in model container [2024-11-19 05:49:24,297 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 05:49:24" (1/1) ... [2024-11-19 05:49:24,330 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 05:49:24,644 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 05:49:24,682 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 05:49:24,716 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 05:49:24,764 INFO L204 MainTranslator]: Completed translation [2024-11-19 05:49:24,765 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:49:24 WrapperNode [2024-11-19 05:49:24,765 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 05:49:24,766 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 05:49:24,766 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 05:49:24,766 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 05:49:24,771 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:49:24" (1/1) ... [2024-11-19 05:49:24,784 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:49:24" (1/1) ... [2024-11-19 05:49:24,815 INFO L138 Inliner]: procedures = 265, calls = 74, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 154 [2024-11-19 05:49:24,816 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 05:49:24,816 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 05:49:24,816 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 05:49:24,817 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 05:49:24,826 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:49:24" (1/1) ... [2024-11-19 05:49:24,826 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:49:24" (1/1) ... [2024-11-19 05:49:24,829 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:49:24" (1/1) ... [2024-11-19 05:49:24,830 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:49:24" (1/1) ... [2024-11-19 05:49:24,838 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:49:24" (1/1) ... [2024-11-19 05:49:24,841 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:49:24" (1/1) ... [2024-11-19 05:49:24,843 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:49:24" (1/1) ... [2024-11-19 05:49:24,844 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:49:24" (1/1) ... [2024-11-19 05:49:24,846 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 05:49:24,847 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 05:49:24,847 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 05:49:24,847 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 05:49:24,848 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:49:24" (1/1) ... [2024-11-19 05:49:24,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 05:49:24,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 05:49:24,894 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-19 05:49:24,898 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-19 05:49:24,933 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-19 05:49:24,934 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-19 05:49:24,934 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-19 05:49:24,934 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-19 05:49:24,934 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 05:49:24,934 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2024-11-19 05:49:24,934 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2024-11-19 05:49:24,934 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-19 05:49:24,935 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 05:49:24,935 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 05:49:24,936 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-19 05:49:25,055 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 05:49:25,057 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 05:49:25,375 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-19 05:49:25,377 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 05:49:25,405 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 05:49:25,407 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-19 05:49:25,408 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 05:49:25 BoogieIcfgContainer [2024-11-19 05:49:25,408 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 05:49:25,411 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 05:49:25,411 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 05:49:25,414 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 05:49:25,415 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 05:49:24" (1/3) ... [2024-11-19 05:49:25,416 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77efb8fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 05:49:25, skipping insertion in model container [2024-11-19 05:49:25,416 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:49:24" (2/3) ... [2024-11-19 05:49:25,416 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77efb8fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 05:49:25, skipping insertion in model container [2024-11-19 05:49:25,416 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 05:49:25" (3/3) ... [2024-11-19 05:49:25,417 INFO L112 eAbstractionObserver]: Analyzing ICFG 06-symbeq_09-tricky_address4.i [2024-11-19 05:49:25,432 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 05:49:25,433 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-11-19 05:49:25,434 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-19 05:49:25,516 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-19 05:49:25,591 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 164 places, 164 transitions, 332 flow [2024-11-19 05:49:25,667 INFO L124 PetriNetUnfolderBase]: 4/163 cut-off events. [2024-11-19 05:49:25,667 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-19 05:49:25,674 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 163 events. 4/163 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 80 event pairs, 0 based on Foata normal form. 0/155 useless extension candidates. Maximal degree in co-relation 91. Up to 2 conditions per place. [2024-11-19 05:49:25,675 INFO L82 GeneralOperation]: Start removeDead. Operand has 164 places, 164 transitions, 332 flow [2024-11-19 05:49:25,678 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 163 places, 163 transitions, 329 flow [2024-11-19 05:49:25,686 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 05:49:25,691 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;@4347fa3f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 05:49:25,692 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-11-19 05:49:25,713 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-19 05:49:25,713 INFO L124 PetriNetUnfolderBase]: 4/113 cut-off events. [2024-11-19 05:49:25,713 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-19 05:49:25,713 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:49:25,714 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:49:25,715 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-19 05:49:25,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:49:25,719 INFO L85 PathProgramCache]: Analyzing trace with hash 2026056588, now seen corresponding path program 1 times [2024-11-19 05:49:25,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:49:25,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67306062] [2024-11-19 05:49:25,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:49:25,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:49:25,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:49:26,111 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-19 05:49:26,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:49:26,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67306062] [2024-11-19 05:49:26,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67306062] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:49:26,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:49:26,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 05:49:26,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018384207] [2024-11-19 05:49:26,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:49:26,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:49:26,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:49:26,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:49:26,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:49:26,170 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 164 [2024-11-19 05:49:26,174 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 163 transitions, 329 flow. Second operand has 3 states, 3 states have (on average 152.0) internal successors, (456), 3 states have internal predecessors, (456), 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-19 05:49:26,176 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:49:26,176 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 164 [2024-11-19 05:49:26,177 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:49:26,254 INFO L124 PetriNetUnfolderBase]: 7/224 cut-off events. [2024-11-19 05:49:26,255 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-19 05:49:26,256 INFO L83 FinitePrefix]: Finished finitePrefix Result has 253 conditions, 224 events. 7/224 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 331 event pairs, 6 based on Foata normal form. 5/217 useless extension candidates. Maximal degree in co-relation 147. Up to 24 conditions per place. [2024-11-19 05:49:26,259 INFO L140 encePairwiseOnDemand]: 158/164 looper letters, 10 selfloop transitions, 2 changer transitions 1/161 dead transitions. [2024-11-19 05:49:26,259 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 161 transitions, 349 flow [2024-11-19 05:49:26,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:49:26,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:49:26,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 467 transitions. [2024-11-19 05:49:26,274 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9491869918699187 [2024-11-19 05:49:26,276 INFO L175 Difference]: Start difference. First operand has 163 places, 163 transitions, 329 flow. Second operand 3 states and 467 transitions. [2024-11-19 05:49:26,277 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 161 transitions, 349 flow [2024-11-19 05:49:26,280 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 161 transitions, 348 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-19 05:49:26,286 INFO L231 Difference]: Finished difference. Result has 165 places, 160 transitions, 332 flow [2024-11-19 05:49:26,289 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=164, PETRI_DIFFERENCE_MINUEND_FLOW=322, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=158, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=332, PETRI_PLACES=165, PETRI_TRANSITIONS=160} [2024-11-19 05:49:26,294 INFO L277 CegarLoopForPetriNet]: 163 programPoint places, 2 predicate places. [2024-11-19 05:49:26,294 INFO L471 AbstractCegarLoop]: Abstraction has has 165 places, 160 transitions, 332 flow [2024-11-19 05:49:26,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 152.0) internal successors, (456), 3 states have internal predecessors, (456), 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-19 05:49:26,295 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:49:26,295 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:49:26,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 05:49:26,296 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-19 05:49:26,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:49:26,298 INFO L85 PathProgramCache]: Analyzing trace with hash -2050415652, now seen corresponding path program 1 times [2024-11-19 05:49:26,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:49:26,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316672504] [2024-11-19 05:49:26,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:49:26,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:49:26,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:49:26,500 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:49:26,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:49:26,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316672504] [2024-11-19 05:49:26,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316672504] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 05:49:26,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1681652335] [2024-11-19 05:49:26,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:49:26,501 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 05:49:26,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 05:49:26,504 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-19 05:49:26,505 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-19 05:49:26,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:49:26,622 INFO L255 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 05:49:26,627 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 05:49:26,709 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:49:26,709 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 05:49:26,761 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:49:26,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1681652335] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 05:49:26,762 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 05:49:26,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2024-11-19 05:49:26,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959969960] [2024-11-19 05:49:26,763 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 05:49:26,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-19 05:49:26,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:49:26,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-19 05:49:26,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-19 05:49:26,804 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 164 [2024-11-19 05:49:26,806 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 160 transitions, 332 flow. Second operand has 10 states, 10 states have (on average 149.0) internal successors, (1490), 10 states have internal predecessors, (1490), 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-19 05:49:26,806 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:49:26,806 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 164 [2024-11-19 05:49:26,806 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:49:26,918 INFO L124 PetriNetUnfolderBase]: 7/230 cut-off events. [2024-11-19 05:49:26,920 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-19 05:49:26,920 INFO L83 FinitePrefix]: Finished finitePrefix Result has 277 conditions, 230 events. 7/230 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 324 event pairs, 6 based on Foata normal form. 2/221 useless extension candidates. Maximal degree in co-relation 194. Up to 24 conditions per place. [2024-11-19 05:49:26,921 INFO L140 encePairwiseOnDemand]: 158/164 looper letters, 14 selfloop transitions, 9 changer transitions 0/168 dead transitions. [2024-11-19 05:49:26,922 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 168 transitions, 396 flow [2024-11-19 05:49:26,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 05:49:26,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-19 05:49:26,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1348 transitions. [2024-11-19 05:49:26,930 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9132791327913279 [2024-11-19 05:49:26,931 INFO L175 Difference]: Start difference. First operand has 165 places, 160 transitions, 332 flow. Second operand 9 states and 1348 transitions. [2024-11-19 05:49:26,931 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 168 transitions, 396 flow [2024-11-19 05:49:26,933 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 168 transitions, 394 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-19 05:49:26,936 INFO L231 Difference]: Finished difference. Result has 174 places, 166 transitions, 380 flow [2024-11-19 05:49:26,938 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=164, PETRI_DIFFERENCE_MINUEND_FLOW=330, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=154, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=380, PETRI_PLACES=174, PETRI_TRANSITIONS=166} [2024-11-19 05:49:26,938 INFO L277 CegarLoopForPetriNet]: 163 programPoint places, 11 predicate places. [2024-11-19 05:49:26,939 INFO L471 AbstractCegarLoop]: Abstraction has has 174 places, 166 transitions, 380 flow [2024-11-19 05:49:26,940 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 149.0) internal successors, (1490), 10 states have internal predecessors, (1490), 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-19 05:49:26,940 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:49:26,940 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 05:49:26,955 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-19 05:49:27,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 05:49:27,145 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-19 05:49:27,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:49:27,150 INFO L85 PathProgramCache]: Analyzing trace with hash -307645988, now seen corresponding path program 2 times [2024-11-19 05:49:27,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:49:27,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578204722] [2024-11-19 05:49:27,150 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 05:49:27,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:49:27,221 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 05:49:27,225 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 05:49:27,668 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-19 05:49:27,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:49:27,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578204722] [2024-11-19 05:49:27,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1578204722] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:49:27,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:49:27,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 05:49:27,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871022482] [2024-11-19 05:49:27,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:49:27,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 05:49:27,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:49:27,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 05:49:27,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-19 05:49:28,175 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 164 [2024-11-19 05:49:28,177 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 166 transitions, 380 flow. Second operand has 6 states, 6 states have (on average 138.66666666666666) internal successors, (832), 6 states have internal predecessors, (832), 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-19 05:49:28,177 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:49:28,177 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 164 [2024-11-19 05:49:28,177 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:49:28,341 INFO L124 PetriNetUnfolderBase]: 129/671 cut-off events. [2024-11-19 05:49:28,342 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2024-11-19 05:49:28,345 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1001 conditions, 671 events. 129/671 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 3491 event pairs, 46 based on Foata normal form. 0/612 useless extension candidates. Maximal degree in co-relation 888. Up to 178 conditions per place. [2024-11-19 05:49:28,349 INFO L140 encePairwiseOnDemand]: 153/164 looper letters, 43 selfloop transitions, 22 changer transitions 0/207 dead transitions. [2024-11-19 05:49:28,351 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 207 transitions, 592 flow [2024-11-19 05:49:28,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 05:49:28,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-19 05:49:28,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 888 transitions. [2024-11-19 05:49:28,354 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9024390243902439 [2024-11-19 05:49:28,354 INFO L175 Difference]: Start difference. First operand has 174 places, 166 transitions, 380 flow. Second operand 6 states and 888 transitions. [2024-11-19 05:49:28,354 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 207 transitions, 592 flow [2024-11-19 05:49:28,358 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 207 transitions, 586 flow, removed 2 selfloop flow, removed 1 redundant places. [2024-11-19 05:49:28,361 INFO L231 Difference]: Finished difference. Result has 182 places, 188 transitions, 520 flow [2024-11-19 05:49:28,361 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=164, PETRI_DIFFERENCE_MINUEND_FLOW=374, PETRI_DIFFERENCE_MINUEND_PLACES=173, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=166, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=156, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=520, PETRI_PLACES=182, PETRI_TRANSITIONS=188} [2024-11-19 05:49:28,362 INFO L277 CegarLoopForPetriNet]: 163 programPoint places, 19 predicate places. [2024-11-19 05:49:28,363 INFO L471 AbstractCegarLoop]: Abstraction has has 182 places, 188 transitions, 520 flow [2024-11-19 05:49:28,363 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 138.66666666666666) internal successors, (832), 6 states have internal predecessors, (832), 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-19 05:49:28,363 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:49:28,364 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 05:49:28,364 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 05:49:28,364 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-19 05:49:28,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:49:28,366 INFO L85 PathProgramCache]: Analyzing trace with hash -434552530, now seen corresponding path program 1 times [2024-11-19 05:49:28,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:49:28,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536755527] [2024-11-19 05:49:28,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:49:28,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:49:28,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:49:28,535 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:49:28,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:49:28,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536755527] [2024-11-19 05:49:28,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1536755527] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 05:49:28,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1726544126] [2024-11-19 05:49:28,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:49:28,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 05:49:28,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 05:49:28,541 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 05:49:28,544 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-19 05:49:28,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:49:28,618 INFO L255 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-19 05:49:28,621 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 05:49:28,654 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:49:28,655 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 05:49:28,728 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:49:28,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1726544126] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 05:49:28,729 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 05:49:28,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2024-11-19 05:49:28,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225274009] [2024-11-19 05:49:28,729 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 05:49:28,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-19 05:49:28,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:49:28,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-19 05:49:28,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2024-11-19 05:49:28,756 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 164 [2024-11-19 05:49:28,758 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 188 transitions, 520 flow. Second operand has 18 states, 18 states have (on average 149.0) internal successors, (2682), 18 states have internal predecessors, (2682), 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-19 05:49:28,758 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:49:28,758 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 164 [2024-11-19 05:49:28,759 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:49:28,975 INFO L124 PetriNetUnfolderBase]: 41/506 cut-off events. [2024-11-19 05:49:28,975 INFO L125 PetriNetUnfolderBase]: For 50/50 co-relation queries the response was YES. [2024-11-19 05:49:28,976 INFO L83 FinitePrefix]: Finished finitePrefix Result has 817 conditions, 506 events. 41/506 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 2211 event pairs, 16 based on Foata normal form. 4/483 useless extension candidates. Maximal degree in co-relation 629. Up to 55 conditions per place. [2024-11-19 05:49:28,978 INFO L140 encePairwiseOnDemand]: 158/164 looper letters, 18 selfloop transitions, 21 changer transitions 0/206 dead transitions. [2024-11-19 05:49:28,978 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 202 places, 206 transitions, 686 flow [2024-11-19 05:49:28,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-19 05:49:28,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2024-11-19 05:49:28,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 3130 transitions. [2024-11-19 05:49:28,982 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9088269454123112 [2024-11-19 05:49:28,983 INFO L175 Difference]: Start difference. First operand has 182 places, 188 transitions, 520 flow. Second operand 21 states and 3130 transitions. [2024-11-19 05:49:28,983 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 202 places, 206 transitions, 686 flow [2024-11-19 05:49:28,986 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 202 places, 206 transitions, 686 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-19 05:49:28,988 INFO L231 Difference]: Finished difference. Result has 207 places, 201 transitions, 650 flow [2024-11-19 05:49:28,988 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=164, PETRI_DIFFERENCE_MINUEND_FLOW=520, PETRI_DIFFERENCE_MINUEND_PLACES=182, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=188, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=177, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=650, PETRI_PLACES=207, PETRI_TRANSITIONS=201} [2024-11-19 05:49:28,989 INFO L277 CegarLoopForPetriNet]: 163 programPoint places, 44 predicate places. [2024-11-19 05:49:28,990 INFO L471 AbstractCegarLoop]: Abstraction has has 207 places, 201 transitions, 650 flow [2024-11-19 05:49:28,991 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 149.0) internal successors, (2682), 18 states have internal predecessors, (2682), 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-19 05:49:28,991 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:49:28,992 INFO L204 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 05:49:29,005 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-19 05:49:29,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2024-11-19 05:49:29,196 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-19 05:49:29,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:49:29,196 INFO L85 PathProgramCache]: Analyzing trace with hash -1059988178, now seen corresponding path program 2 times [2024-11-19 05:49:29,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:49:29,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780994587] [2024-11-19 05:49:29,196 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 05:49:29,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:49:29,218 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 05:49:29,218 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 05:49:29,569 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-19 05:49:29,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:49:29,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780994587] [2024-11-19 05:49:29,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1780994587] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:49:29,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:49:29,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 05:49:29,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40503927] [2024-11-19 05:49:29,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:49:29,570 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 05:49:29,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:49:29,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 05:49:29,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-19 05:49:29,968 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 164 [2024-11-19 05:49:29,969 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 201 transitions, 650 flow. Second operand has 6 states, 6 states have (on average 133.66666666666666) internal successors, (802), 6 states have internal predecessors, (802), 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-19 05:49:29,969 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:49:29,970 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 164 [2024-11-19 05:49:29,970 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:49:30,191 INFO L124 PetriNetUnfolderBase]: 306/1340 cut-off events. [2024-11-19 05:49:30,191 INFO L125 PetriNetUnfolderBase]: For 280/290 co-relation queries the response was YES. [2024-11-19 05:49:30,194 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2507 conditions, 1340 events. 306/1340 cut-off events. For 280/290 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 9088 event pairs, 116 based on Foata normal form. 5/1232 useless extension candidates. Maximal degree in co-relation 2310. Up to 464 conditions per place. [2024-11-19 05:49:30,200 INFO L140 encePairwiseOnDemand]: 149/164 looper letters, 72 selfloop transitions, 36 changer transitions 2/258 dead transitions. [2024-11-19 05:49:30,200 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 258 transitions, 1022 flow [2024-11-19 05:49:30,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 05:49:30,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-19 05:49:30,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 874 transitions. [2024-11-19 05:49:30,202 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8882113821138211 [2024-11-19 05:49:30,202 INFO L175 Difference]: Start difference. First operand has 207 places, 201 transitions, 650 flow. Second operand 6 states and 874 transitions. [2024-11-19 05:49:30,202 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 258 transitions, 1022 flow [2024-11-19 05:49:30,210 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 206 places, 258 transitions, 998 flow, removed 6 selfloop flow, removed 6 redundant places. [2024-11-19 05:49:30,214 INFO L231 Difference]: Finished difference. Result has 210 places, 233 transitions, 878 flow [2024-11-19 05:49:30,214 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=164, PETRI_DIFFERENCE_MINUEND_FLOW=626, PETRI_DIFFERENCE_MINUEND_PLACES=201, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=201, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=183, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=878, PETRI_PLACES=210, PETRI_TRANSITIONS=233} [2024-11-19 05:49:30,216 INFO L277 CegarLoopForPetriNet]: 163 programPoint places, 47 predicate places. [2024-11-19 05:49:30,217 INFO L471 AbstractCegarLoop]: Abstraction has has 210 places, 233 transitions, 878 flow [2024-11-19 05:49:30,218 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 133.66666666666666) internal successors, (802), 6 states have internal predecessors, (802), 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-19 05:49:30,218 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:49:30,218 INFO L204 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 05:49:30,218 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 05:49:30,218 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-19 05:49:30,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:49:30,219 INFO L85 PathProgramCache]: Analyzing trace with hash 949760636, now seen corresponding path program 1 times [2024-11-19 05:49:30,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:49:30,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597986336] [2024-11-19 05:49:30,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:49:30,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:49:30,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:49:30,498 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:49:30,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:49:30,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597986336] [2024-11-19 05:49:30,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597986336] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 05:49:30,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1611668649] [2024-11-19 05:49:30,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:49:30,499 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 05:49:30,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 05:49:30,501 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 05:49:30,503 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-19 05:49:30,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:49:30,585 INFO L255 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-19 05:49:30,588 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 05:49:30,666 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:49:30,666 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 05:49:30,839 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:49:30,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1611668649] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 05:49:30,840 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 05:49:30,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 23 [2024-11-19 05:49:30,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506198140] [2024-11-19 05:49:30,841 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 05:49:30,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-19 05:49:30,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:49:30,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-19 05:49:30,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2024-11-19 05:49:30,872 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 164 [2024-11-19 05:49:30,875 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 210 places, 233 transitions, 878 flow. Second operand has 23 states, 23 states have (on average 149.08695652173913) internal successors, (3429), 23 states have internal predecessors, (3429), 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-19 05:49:30,876 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:49:30,876 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 164 [2024-11-19 05:49:30,876 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:49:31,260 INFO L124 PetriNetUnfolderBase]: 120/944 cut-off events. [2024-11-19 05:49:31,260 INFO L125 PetriNetUnfolderBase]: For 413/413 co-relation queries the response was YES. [2024-11-19 05:49:31,263 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1844 conditions, 944 events. 120/944 cut-off events. For 413/413 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 5990 event pairs, 33 based on Foata normal form. 3/888 useless extension candidates. Maximal degree in co-relation 1568. Up to 134 conditions per place. [2024-11-19 05:49:31,266 INFO L140 encePairwiseOnDemand]: 158/164 looper letters, 21 selfloop transitions, 30 changer transitions 0/250 dead transitions. [2024-11-19 05:49:31,267 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 238 places, 250 transitions, 1102 flow [2024-11-19 05:49:31,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-11-19 05:49:31,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2024-11-19 05:49:31,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 4464 transitions. [2024-11-19 05:49:31,273 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9073170731707317 [2024-11-19 05:49:31,273 INFO L175 Difference]: Start difference. First operand has 210 places, 233 transitions, 878 flow. Second operand 30 states and 4464 transitions. [2024-11-19 05:49:31,273 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 238 places, 250 transitions, 1102 flow [2024-11-19 05:49:31,277 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 238 places, 250 transitions, 1078 flow, removed 12 selfloop flow, removed 0 redundant places. [2024-11-19 05:49:31,280 INFO L231 Difference]: Finished difference. Result has 242 places, 243 transitions, 1006 flow [2024-11-19 05:49:31,280 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=164, PETRI_DIFFERENCE_MINUEND_FLOW=854, PETRI_DIFFERENCE_MINUEND_PLACES=209, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=233, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=210, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=1006, PETRI_PLACES=242, PETRI_TRANSITIONS=243} [2024-11-19 05:49:31,281 INFO L277 CegarLoopForPetriNet]: 163 programPoint places, 79 predicate places. [2024-11-19 05:49:31,281 INFO L471 AbstractCegarLoop]: Abstraction has has 242 places, 243 transitions, 1006 flow [2024-11-19 05:49:31,282 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 149.08695652173913) internal successors, (3429), 23 states have internal predecessors, (3429), 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-19 05:49:31,282 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:49:31,283 INFO L204 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 05:49:31,298 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-19 05:49:31,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 05:49:31,484 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-19 05:49:31,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:49:31,484 INFO L85 PathProgramCache]: Analyzing trace with hash -350299956, now seen corresponding path program 2 times [2024-11-19 05:49:31,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:49:31,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255949994] [2024-11-19 05:49:31,484 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 05:49:31,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:49:31,499 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 05:49:31,499 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 05:49:31,748 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2024-11-19 05:49:31,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:49:31,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255949994] [2024-11-19 05:49:31,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1255949994] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:49:31,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:49:31,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 05:49:31,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996187891] [2024-11-19 05:49:31,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:49:31,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 05:49:31,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:49:31,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 05:49:31,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-19 05:49:32,111 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 164 [2024-11-19 05:49:32,116 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 242 places, 243 transitions, 1006 flow. Second operand has 6 states, 6 states have (on average 139.66666666666666) internal successors, (838), 6 states have internal predecessors, (838), 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-19 05:49:32,116 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:49:32,116 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 164 [2024-11-19 05:49:32,116 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:49:32,370 INFO L124 PetriNetUnfolderBase]: 306/1461 cut-off events. [2024-11-19 05:49:32,370 INFO L125 PetriNetUnfolderBase]: For 881/921 co-relation queries the response was YES. [2024-11-19 05:49:32,373 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3328 conditions, 1461 events. 306/1461 cut-off events. For 881/921 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 10367 event pairs, 72 based on Foata normal form. 10/1424 useless extension candidates. Maximal degree in co-relation 3050. Up to 456 conditions per place. [2024-11-19 05:49:32,378 INFO L140 encePairwiseOnDemand]: 153/164 looper letters, 80 selfloop transitions, 49 changer transitions 0/309 dead transitions. [2024-11-19 05:49:32,378 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 247 places, 309 transitions, 1563 flow [2024-11-19 05:49:32,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 05:49:32,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-19 05:49:32,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 893 transitions. [2024-11-19 05:49:32,380 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.907520325203252 [2024-11-19 05:49:32,380 INFO L175 Difference]: Start difference. First operand has 242 places, 243 transitions, 1006 flow. Second operand 6 states and 893 transitions. [2024-11-19 05:49:32,380 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 247 places, 309 transitions, 1563 flow [2024-11-19 05:49:32,385 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 229 places, 309 transitions, 1517 flow, removed 5 selfloop flow, removed 18 redundant places. [2024-11-19 05:49:32,388 INFO L231 Difference]: Finished difference. Result has 233 places, 284 transitions, 1376 flow [2024-11-19 05:49:32,389 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=164, PETRI_DIFFERENCE_MINUEND_FLOW=960, PETRI_DIFFERENCE_MINUEND_PLACES=224, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=243, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=215, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1376, PETRI_PLACES=233, PETRI_TRANSITIONS=284} [2024-11-19 05:49:32,390 INFO L277 CegarLoopForPetriNet]: 163 programPoint places, 70 predicate places. [2024-11-19 05:49:32,390 INFO L471 AbstractCegarLoop]: Abstraction has has 233 places, 284 transitions, 1376 flow [2024-11-19 05:49:32,390 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 139.66666666666666) internal successors, (838), 6 states have internal predecessors, (838), 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-19 05:49:32,390 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:49:32,391 INFO L204 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 05:49:32,391 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 05:49:32,391 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-19 05:49:32,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:49:32,391 INFO L85 PathProgramCache]: Analyzing trace with hash 1240008017, now seen corresponding path program 1 times [2024-11-19 05:49:32,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:49:32,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279587749] [2024-11-19 05:49:32,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:49:32,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:49:32,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:49:32,794 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2024-11-19 05:49:32,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:49:32,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279587749] [2024-11-19 05:49:32,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279587749] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:49:32,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:49:32,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 05:49:32,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209026319] [2024-11-19 05:49:32,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:49:32,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 05:49:32,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:49:32,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 05:49:32,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-19 05:49:33,115 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 164 [2024-11-19 05:49:33,116 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 233 places, 284 transitions, 1376 flow. Second operand has 6 states, 6 states have (on average 134.66666666666666) internal successors, (808), 6 states have internal predecessors, (808), 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-19 05:49:33,116 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:49:33,116 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 164 [2024-11-19 05:49:33,116 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:49:33,524 INFO L124 PetriNetUnfolderBase]: 579/2228 cut-off events. [2024-11-19 05:49:33,525 INFO L125 PetriNetUnfolderBase]: For 2430/2490 co-relation queries the response was YES. [2024-11-19 05:49:33,532 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5903 conditions, 2228 events. 579/2228 cut-off events. For 2430/2490 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 17336 event pairs, 140 based on Foata normal form. 12/2155 useless extension candidates. Maximal degree in co-relation 5642. Up to 824 conditions per place. [2024-11-19 05:49:33,538 INFO L140 encePairwiseOnDemand]: 149/164 looper letters, 119 selfloop transitions, 78 changer transitions 11/378 dead transitions. [2024-11-19 05:49:33,539 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 238 places, 378 transitions, 2316 flow [2024-11-19 05:49:33,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 05:49:33,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-19 05:49:33,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 879 transitions. [2024-11-19 05:49:33,541 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8932926829268293 [2024-11-19 05:49:33,541 INFO L175 Difference]: Start difference. First operand has 233 places, 284 transitions, 1376 flow. Second operand 6 states and 879 transitions. [2024-11-19 05:49:33,541 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 238 places, 378 transitions, 2316 flow [2024-11-19 05:49:33,552 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 238 places, 378 transitions, 2314 flow, removed 1 selfloop flow, removed 0 redundant places. [2024-11-19 05:49:33,556 INFO L231 Difference]: Finished difference. Result has 242 places, 332 transitions, 1980 flow [2024-11-19 05:49:33,556 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=164, PETRI_DIFFERENCE_MINUEND_FLOW=1374, PETRI_DIFFERENCE_MINUEND_PLACES=233, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=284, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=233, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1980, PETRI_PLACES=242, PETRI_TRANSITIONS=332} [2024-11-19 05:49:33,557 INFO L277 CegarLoopForPetriNet]: 163 programPoint places, 79 predicate places. [2024-11-19 05:49:33,557 INFO L471 AbstractCegarLoop]: Abstraction has has 242 places, 332 transitions, 1980 flow [2024-11-19 05:49:33,558 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 134.66666666666666) internal successors, (808), 6 states have internal predecessors, (808), 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-19 05:49:33,558 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:49:33,558 INFO L204 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 05:49:33,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-19 05:49:33,559 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-19 05:49:33,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:49:33,559 INFO L85 PathProgramCache]: Analyzing trace with hash 1672050417, now seen corresponding path program 1 times [2024-11-19 05:49:33,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:49:33,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093546987] [2024-11-19 05:49:33,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:49:33,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:49:33,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 05:49:33,597 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 05:49:33,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 05:49:33,653 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 05:49:33,657 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-19 05:49:33,658 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (6 of 7 remaining) [2024-11-19 05:49:33,660 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (5 of 7 remaining) [2024-11-19 05:49:33,660 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2024-11-19 05:49:33,660 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (3 of 7 remaining) [2024-11-19 05:49:33,660 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (2 of 7 remaining) [2024-11-19 05:49:33,660 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (1 of 7 remaining) [2024-11-19 05:49:33,660 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (0 of 7 remaining) [2024-11-19 05:49:33,661 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-19 05:49:33,661 INFO L407 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1] [2024-11-19 05:49:33,707 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-19 05:49:33,707 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 05:49:33,712 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 05:49:33 BasicIcfg [2024-11-19 05:49:33,712 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 05:49:33,713 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 05:49:33,713 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 05:49:33,713 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 05:49:33,713 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 05:49:25" (3/4) ... [2024-11-19 05:49:33,714 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-19 05:49:33,778 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-19 05:49:33,778 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 05:49:33,779 INFO L158 Benchmark]: Toolchain (without parser) took 9489.61ms. Allocated memory was 182.5MB in the beginning and 356.5MB in the end (delta: 174.1MB). Free memory was 123.6MB in the beginning and 132.5MB in the end (delta: -8.9MB). Peak memory consumption was 166.7MB. Max. memory is 16.1GB. [2024-11-19 05:49:33,779 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 182.5MB. Free memory is still 147.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 05:49:33,779 INFO L158 Benchmark]: CACSL2BoogieTranslator took 473.46ms. Allocated memory is still 182.5MB. Free memory was 123.6MB in the beginning and 90.5MB in the end (delta: 33.1MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2024-11-19 05:49:33,780 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.40ms. Allocated memory is still 182.5MB. Free memory was 90.5MB in the beginning and 87.1MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-19 05:49:33,780 INFO L158 Benchmark]: Boogie Preprocessor took 29.89ms. Allocated memory is still 182.5MB. Free memory was 87.1MB in the beginning and 85.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 05:49:33,780 INFO L158 Benchmark]: RCFGBuilder took 561.02ms. Allocated memory is still 182.5MB. Free memory was 85.0MB in the beginning and 62.0MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-11-19 05:49:33,780 INFO L158 Benchmark]: TraceAbstraction took 8301.48ms. Allocated memory was 182.5MB in the beginning and 356.5MB in the end (delta: 174.1MB). Free memory was 61.1MB in the beginning and 140.9MB in the end (delta: -79.7MB). Peak memory consumption was 97.5MB. Max. memory is 16.1GB. [2024-11-19 05:49:33,780 INFO L158 Benchmark]: Witness Printer took 66.01ms. Allocated memory is still 356.5MB. Free memory was 140.9MB in the beginning and 132.5MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-19 05:49:33,781 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.11ms. Allocated memory is still 182.5MB. Free memory is still 147.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 473.46ms. Allocated memory is still 182.5MB. Free memory was 123.6MB in the beginning and 90.5MB in the end (delta: 33.1MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.40ms. Allocated memory is still 182.5MB. Free memory was 90.5MB in the beginning and 87.1MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 29.89ms. Allocated memory is still 182.5MB. Free memory was 87.1MB in the beginning and 85.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 561.02ms. Allocated memory is still 182.5MB. Free memory was 85.0MB in the beginning and 62.0MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 8301.48ms. Allocated memory was 182.5MB in the beginning and 356.5MB in the end (delta: 174.1MB). Free memory was 61.1MB in the beginning and 140.9MB in the end (delta: -79.7MB). Peak memory consumption was 97.5MB. Max. memory is 16.1GB. * Witness Printer took 66.01ms. Allocated memory is still 356.5MB. Free memory was 140.9MB in the beginning and 132.5MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - DataRaceFoundResult [Line: 944]: Data race detected Data race detected The following path leads to a data race: [L922-L925] 0 struct s { int datum; pthread_mutex_t mutex; } a[10]; VAL [a={1:0}] [L937] 0 int i = 0; VAL [a={1:0}, i=0] [L937] COND TRUE 0 i < 10 VAL [a={1:0}, i=0] [L937] 0 i++ VAL [a={1:0}, i=1] [L937] COND TRUE 0 i < 10 VAL [a={1:0}, i=1] [L937] 0 i++ VAL [a={1:0}, i=2] [L937] COND TRUE 0 i < 10 VAL [a={1:0}, i=2] [L937] 0 i++ VAL [a={1:0}, i=3] [L937] COND TRUE 0 i < 10 VAL [a={1:0}, i=3] [L937] 0 i++ VAL [a={1:0}, i=4] [L937] COND TRUE 0 i < 10 VAL [a={1:0}, i=4] [L937] 0 i++ VAL [a={1:0}, i=5] [L937] COND TRUE 0 i < 10 VAL [a={1:0}, i=5] [L937] 0 i++ VAL [a={1:0}, i=6] [L937] COND TRUE 0 i < 10 VAL [a={1:0}, i=6] [L937] 0 i++ VAL [a={1:0}, i=7] [L937] COND TRUE 0 i < 10 VAL [a={1:0}, i=7] [L937] 0 i++ VAL [a={1:0}, i=8] [L937] COND TRUE 0 i < 10 VAL [a={1:0}, i=8] [L937] 0 i++ VAL [a={1:0}, i=9] [L937] COND TRUE 0 i < 10 VAL [a={1:0}, i=9] [L937] 0 i++ VAL [a={1:0}, i=10] [L937] COND FALSE 0 !(i < 10) VAL [a={1:0}, i=10] [L939] 0 int i = __VERIFIER_nondet_int(); VAL [a={1:0}, i=9] [L940] CALL 0 assume_abort_if_not(0 <= i && i < 10) [L11] COND FALSE 0 !(!cond) VAL [\old(cond)=1, a={1:0}, cond=1] [L940] RET 0 assume_abort_if_not(0 <= i && i < 10) [L941] 0 pthread_t t1; VAL [a={1:0}, i=9] [L942] FCALL, FORK 0 pthread_create(&t1, ((void *)0), t_fun, ((void *)0)) VAL [a={1:0}, i=9, t1=-1] [L927] 1 int i = __VERIFIER_nondet_int(); VAL [\old(arg)={0:0}, a={1:0}, arg={0:0}, i=8] [L928] CALL 1 assume_abort_if_not(0 <= i && i < 9) [L11] COND FALSE 1 !(!cond) VAL [\old(cond)=1, a={1:0}, cond=1] [L928] RET 1 assume_abort_if_not(0 <= i && i < 9) [L929] 1 struct s *p = &a[i]; VAL [\old(arg)={0:0}, a={1:0}, arg={0:0}, i=8, p={1:224}] [L931] 1 i++ VAL [\old(arg)={0:0}, a={1:0}, arg={0:0}, i=9, p={1:224}] [L944] EXPR 0 a[i].datum VAL [a={1:0}, i=9, t1=-1] [L944] 0 a[i].datum++ VAL [a={1:0}, i=9, t1=-1] [L932] EXPR 1 a[i].datum VAL [\old(arg)={0:0}, a={1:0}, arg={0:0}, i=9, p={1:224}] [L932] 1 a[i].datum++ VAL [\old(arg)={0:0}, a={1:0}, arg={0:0}, i=9, p={1:224}] [L944] 0 a[i].datum++ VAL [a={1:0}, i=9, t1=-1] Now there is a data race, but we were unable to determine exactly which statements and variables are involved. There could be a race between one of the statements * C: a[i].datum++ [944] * C: a[i].datum++ [944] * C: a[i].datum++ [944] * C: a[i].datum++ [932] * C: a[i].datum++ [944] and C: a[i].datum++ [944] - UnprovableResult [Line: 944]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 942]: 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. - UnprovableResult [Line: 932]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 932]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 204 locations, 7 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: 8.1s, OverallIterations: 9, TraceHistogramMax: 10, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 3.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1756 SdHoareTripleChecker+Valid, 2.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1322 mSDsluCounter, 181 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 72 mSDsCounter, 122 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3057 IncrementalHoareTripleChecker+Invalid, 3179 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 122 mSolverCounterUnsat, 109 mSDtfsCounter, 3057 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 802 GetRequests, 695 SyntacticMatches, 11 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 684 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1980occurred in iteration=8, InterpolantAutomatonStates: 87, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 1549 NumberOfCodeBlocks, 1449 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 1722 ConstructedInterpolants, 0 QuantifiedInterpolants, 2532 SizeOfPredicates, 22 NumberOfNonLiveVariables, 760 ConjunctsInSsa, 28 ConjunctsInUnsatCore, 14 InterpolantComputations, 5 PerfectInterpolantSequences, 600/993 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-19 05:49:33,814 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, 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