./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-deagle/airline-25.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-deagle/airline-25.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 a0d81069750f24e52e04bdb7efecd6d77b64aec41e058c154f75fbba11e6c11d --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 14:40:36,020 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 14:40:36,071 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-11-10 14:40:36,078 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 14:40:36,078 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 14:40:36,103 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 14:40:36,107 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 14:40:36,108 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 14:40:36,108 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 14:40:36,109 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 14:40:36,109 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 14:40:36,110 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 14:40:36,110 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 14:40:36,110 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 14:40:36,111 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 14:40:36,111 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 14:40:36,111 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 14:40:36,115 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 14:40:36,115 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 14:40:36,116 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 14:40:36,116 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 14:40:36,116 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 14:40:36,117 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-10 14:40:36,118 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 14:40:36,118 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 14:40:36,118 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 14:40:36,118 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 14:40:36,119 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 14:40:36,128 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 14:40:36,128 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 14:40:36,129 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 14:40:36,129 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 14:40:36,129 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 14:40:36,129 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 14:40:36,130 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 14:40:36,130 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 14:40:36,130 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 14:40:36,130 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 14:40:36,130 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 14:40:36,130 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 14:40:36,130 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 14:40:36,132 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 -> a0d81069750f24e52e04bdb7efecd6d77b64aec41e058c154f75fbba11e6c11d [2024-11-10 14:40:36,382 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 14:40:36,407 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 14:40:36,411 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 14:40:36,412 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 14:40:36,413 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 14:40:36,414 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-deagle/airline-25.i [2024-11-10 14:40:37,828 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 14:40:38,086 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 14:40:38,086 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-deagle/airline-25.i [2024-11-10 14:40:38,101 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/962145991/acfb6e2d111e434cb238b46d7ff8a1f9/FLAGc472d1500 [2024-11-10 14:40:38,117 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/962145991/acfb6e2d111e434cb238b46d7ff8a1f9 [2024-11-10 14:40:38,120 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 14:40:38,121 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 14:40:38,122 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 14:40:38,123 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 14:40:38,128 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 14:40:38,128 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 02:40:38" (1/1) ... [2024-11-10 14:40:38,129 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3da89a9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:40:38, skipping insertion in model container [2024-11-10 14:40:38,129 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 02:40:38" (1/1) ... [2024-11-10 14:40:38,175 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 14:40:38,541 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 14:40:38,550 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 14:40:38,592 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 14:40:38,633 INFO L204 MainTranslator]: Completed translation [2024-11-10 14:40:38,634 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:40:38 WrapperNode [2024-11-10 14:40:38,634 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 14:40:38,635 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 14:40:38,635 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 14:40:38,635 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 14:40:38,647 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:40:38" (1/1) ... [2024-11-10 14:40:38,663 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:40:38" (1/1) ... [2024-11-10 14:40:38,683 INFO L138 Inliner]: procedures = 162, calls = 24, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 87 [2024-11-10 14:40:38,684 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 14:40:38,684 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 14:40:38,685 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 14:40:38,685 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 14:40:38,693 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:40:38" (1/1) ... [2024-11-10 14:40:38,693 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:40:38" (1/1) ... [2024-11-10 14:40:38,696 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:40:38" (1/1) ... [2024-11-10 14:40:38,696 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:40:38" (1/1) ... [2024-11-10 14:40:38,703 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:40:38" (1/1) ... [2024-11-10 14:40:38,703 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:40:38" (1/1) ... [2024-11-10 14:40:38,705 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:40:38" (1/1) ... [2024-11-10 14:40:38,706 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:40:38" (1/1) ... [2024-11-10 14:40:38,709 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 14:40:38,710 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 14:40:38,710 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 14:40:38,710 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 14:40:38,711 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:40:38" (1/1) ... [2024-11-10 14:40:38,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 14:40:38,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 14:40:38,767 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 14:40:38,770 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 14:40:38,820 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-10 14:40:38,822 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-10 14:40:38,822 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-10 14:40:38,822 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 14:40:38,822 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-10 14:40:38,823 INFO L130 BoogieDeclarations]: Found specification of procedure salethread [2024-11-10 14:40:38,823 INFO L138 BoogieDeclarations]: Found implementation of procedure salethread [2024-11-10 14:40:38,823 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-10 14:40:38,823 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-10 14:40:38,823 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-10 14:40:38,823 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 14:40:38,823 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 14:40:38,825 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-10 14:40:39,039 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 14:40:39,042 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 14:40:39,276 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L736: havoc main_~#salethreads~0#1.base, main_~#salethreads~0#1.offset; [2024-11-10 14:40:39,276 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L736-1: SUMMARY for call ULTIMATE.dealloc(main_~#salethreads~0#1.base, main_~#salethreads~0#1.offset); srcloc: null [2024-11-10 14:40:39,277 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-10 14:40:39,278 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 14:40:39,334 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 14:40:39,335 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 14:40:39,339 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 02:40:39 BoogieIcfgContainer [2024-11-10 14:40:39,340 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 14:40:39,342 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 14:40:39,342 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 14:40:39,345 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 14:40:39,346 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 02:40:38" (1/3) ... [2024-11-10 14:40:39,346 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b030d46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 02:40:39, skipping insertion in model container [2024-11-10 14:40:39,347 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:40:38" (2/3) ... [2024-11-10 14:40:39,347 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b030d46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 02:40:39, skipping insertion in model container [2024-11-10 14:40:39,347 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 02:40:39" (3/3) ... [2024-11-10 14:40:39,350 INFO L112 eAbstractionObserver]: Analyzing ICFG airline-25.i [2024-11-10 14:40:39,368 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 14:40:39,369 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 10 error locations. [2024-11-10 14:40:39,369 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-10 14:40:39,435 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-11-10 14:40:39,473 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 97 places, 101 transitions, 209 flow [2024-11-10 14:40:39,530 INFO L124 PetriNetUnfolderBase]: 11/148 cut-off events. [2024-11-10 14:40:39,531 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-10 14:40:39,537 INFO L83 FinitePrefix]: Finished finitePrefix Result has 153 conditions, 148 events. 11/148 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 305 event pairs, 0 based on Foata normal form. 0/121 useless extension candidates. Maximal degree in co-relation 72. Up to 4 conditions per place. [2024-11-10 14:40:39,537 INFO L82 GeneralOperation]: Start removeDead. Operand has 97 places, 101 transitions, 209 flow [2024-11-10 14:40:39,542 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 97 places, 101 transitions, 209 flow [2024-11-10 14:40:39,554 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 14:40:39,561 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;@491f92b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 14:40:39,562 INFO L334 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2024-11-10 14:40:39,568 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-10 14:40:39,570 INFO L124 PetriNetUnfolderBase]: 0/15 cut-off events. [2024-11-10 14:40:39,570 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-10 14:40:39,571 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:40:39,571 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:40:39,572 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [salethreadErr3ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE, salethreadErr0ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2024-11-10 14:40:39,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:40:39,579 INFO L85 PathProgramCache]: Analyzing trace with hash -668704510, now seen corresponding path program 1 times [2024-11-10 14:40:39,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:40:39,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040524066] [2024-11-10 14:40:39,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:40:39,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:40:39,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:40:39,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:40:39,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:40:39,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040524066] [2024-11-10 14:40:39,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040524066] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:40:39,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:40:39,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-10 14:40:39,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202508567] [2024-11-10 14:40:39,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:40:39,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 14:40:39,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:40:39,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 14:40:39,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 14:40:39,807 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 101 [2024-11-10 14:40:39,810 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 101 transitions, 209 flow. Second operand has 2 states, 2 states have (on average 84.5) internal successors, (169), 2 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:40:39,810 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:40:39,811 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 101 [2024-11-10 14:40:39,812 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:40:39,885 INFO L124 PetriNetUnfolderBase]: 3/131 cut-off events. [2024-11-10 14:40:39,886 INFO L125 PetriNetUnfolderBase]: For 4/5 co-relation queries the response was YES. [2024-11-10 14:40:39,888 INFO L83 FinitePrefix]: Finished finitePrefix Result has 144 conditions, 131 events. 3/131 cut-off events. For 4/5 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 262 event pairs, 0 based on Foata normal form. 9/124 useless extension candidates. Maximal degree in co-relation 66. Up to 8 conditions per place. [2024-11-10 14:40:39,890 INFO L140 encePairwiseOnDemand]: 92/101 looper letters, 7 selfloop transitions, 0 changer transitions 0/90 dead transitions. [2024-11-10 14:40:39,890 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 90 transitions, 201 flow [2024-11-10 14:40:39,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 14:40:39,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-11-10 14:40:39,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 184 transitions. [2024-11-10 14:40:39,902 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9108910891089109 [2024-11-10 14:40:39,905 INFO L175 Difference]: Start difference. First operand has 97 places, 101 transitions, 209 flow. Second operand 2 states and 184 transitions. [2024-11-10 14:40:39,906 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 90 transitions, 201 flow [2024-11-10 14:40:39,909 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 90 transitions, 201 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-10 14:40:39,913 INFO L231 Difference]: Finished difference. Result has 91 places, 90 transitions, 187 flow [2024-11-10 14:40:39,918 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=101, PETRI_DIFFERENCE_MINUEND_FLOW=187, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=187, PETRI_PLACES=91, PETRI_TRANSITIONS=90} [2024-11-10 14:40:39,922 INFO L277 CegarLoopForPetriNet]: 97 programPoint places, -6 predicate places. [2024-11-10 14:40:39,923 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 90 transitions, 187 flow [2024-11-10 14:40:39,924 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 84.5) internal successors, (169), 2 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:40:39,925 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:40:39,925 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:40:39,925 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 14:40:39,926 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [salethreadErr3ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE, salethreadErr0ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2024-11-10 14:40:39,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:40:39,927 INFO L85 PathProgramCache]: Analyzing trace with hash -1948147323, now seen corresponding path program 1 times [2024-11-10 14:40:39,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:40:39,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245254348] [2024-11-10 14:40:39,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:40:39,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:40:39,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:40:40,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:40:40,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:40:40,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245254348] [2024-11-10 14:40:40,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245254348] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:40:40,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:40:40,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 14:40:40,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49260058] [2024-11-10 14:40:40,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:40:40,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:40:40,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:40:40,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:40:40,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:40:40,112 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 101 [2024-11-10 14:40:40,113 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 90 transitions, 187 flow. Second operand has 3 states, 3 states have (on average 80.33333333333333) internal successors, (241), 3 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:40:40,115 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:40:40,115 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 101 [2024-11-10 14:40:40,115 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:40:40,205 INFO L124 PetriNetUnfolderBase]: 10/180 cut-off events. [2024-11-10 14:40:40,205 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-10 14:40:40,206 INFO L83 FinitePrefix]: Finished finitePrefix Result has 213 conditions, 180 events. 10/180 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 467 event pairs, 0 based on Foata normal form. 1/160 useless extension candidates. Maximal degree in co-relation 209. Up to 23 conditions per place. [2024-11-10 14:40:40,207 INFO L140 encePairwiseOnDemand]: 98/101 looper letters, 13 selfloop transitions, 2 changer transitions 0/92 dead transitions. [2024-11-10 14:40:40,207 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 92 transitions, 221 flow [2024-11-10 14:40:40,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:40:40,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:40:40,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 250 transitions. [2024-11-10 14:40:40,215 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8250825082508251 [2024-11-10 14:40:40,215 INFO L175 Difference]: Start difference. First operand has 91 places, 90 transitions, 187 flow. Second operand 3 states and 250 transitions. [2024-11-10 14:40:40,216 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 92 transitions, 221 flow [2024-11-10 14:40:40,218 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 92 transitions, 221 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-10 14:40:40,225 INFO L231 Difference]: Finished difference. Result has 94 places, 90 transitions, 195 flow [2024-11-10 14:40:40,226 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=101, PETRI_DIFFERENCE_MINUEND_FLOW=187, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=195, PETRI_PLACES=94, PETRI_TRANSITIONS=90} [2024-11-10 14:40:40,231 INFO L277 CegarLoopForPetriNet]: 97 programPoint places, -3 predicate places. [2024-11-10 14:40:40,231 INFO L471 AbstractCegarLoop]: Abstraction has has 94 places, 90 transitions, 195 flow [2024-11-10 14:40:40,231 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 80.33333333333333) internal successors, (241), 3 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:40:40,231 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:40:40,232 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:40:40,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 14:40:40,232 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [salethreadErr3ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE, salethreadErr0ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2024-11-10 14:40:40,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:40:40,233 INFO L85 PathProgramCache]: Analyzing trace with hash 842382204, now seen corresponding path program 1 times [2024-11-10 14:40:40,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:40:40,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95052404] [2024-11-10 14:40:40,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:40:40,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:40:40,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:40:40,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:40:40,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:40:40,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95052404] [2024-11-10 14:40:40,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95052404] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:40:40,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:40:40,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 14:40:40,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324746690] [2024-11-10 14:40:40,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:40:40,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 14:40:40,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:40:40,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 14:40:40,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-10 14:40:40,972 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 101 [2024-11-10 14:40:40,973 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 90 transitions, 195 flow. Second operand has 6 states, 6 states have (on average 67.0) internal successors, (402), 6 states have internal predecessors, (402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:40:40,973 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:40:40,973 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 101 [2024-11-10 14:40:40,974 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:40:41,118 INFO L124 PetriNetUnfolderBase]: 32/202 cut-off events. [2024-11-10 14:40:41,118 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-11-10 14:40:41,119 INFO L83 FinitePrefix]: Finished finitePrefix Result has 300 conditions, 202 events. 32/202 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 659 event pairs, 2 based on Foata normal form. 0/184 useless extension candidates. Maximal degree in co-relation 294. Up to 55 conditions per place. [2024-11-10 14:40:41,121 INFO L140 encePairwiseOnDemand]: 95/101 looper letters, 28 selfloop transitions, 5 changer transitions 0/97 dead transitions. [2024-11-10 14:40:41,121 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 97 transitions, 275 flow [2024-11-10 14:40:41,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 14:40:41,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-10 14:40:41,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 424 transitions. [2024-11-10 14:40:41,127 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6996699669966997 [2024-11-10 14:40:41,127 INFO L175 Difference]: Start difference. First operand has 94 places, 90 transitions, 195 flow. Second operand 6 states and 424 transitions. [2024-11-10 14:40:41,128 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 97 transitions, 275 flow [2024-11-10 14:40:41,129 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 97 transitions, 271 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:40:41,131 INFO L231 Difference]: Finished difference. Result has 96 places, 89 transitions, 199 flow [2024-11-10 14:40:41,132 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=101, PETRI_DIFFERENCE_MINUEND_FLOW=189, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=199, PETRI_PLACES=96, PETRI_TRANSITIONS=89} [2024-11-10 14:40:41,133 INFO L277 CegarLoopForPetriNet]: 97 programPoint places, -1 predicate places. [2024-11-10 14:40:41,134 INFO L471 AbstractCegarLoop]: Abstraction has has 96 places, 89 transitions, 199 flow [2024-11-10 14:40:41,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 67.0) internal successors, (402), 6 states have internal predecessors, (402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:40:41,135 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:40:41,135 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:40:41,135 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 14:40:41,135 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting salethreadErr3ASSERT_VIOLATIONDATA_RACE === [salethreadErr3ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE, salethreadErr0ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2024-11-10 14:40:41,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:40:41,136 INFO L85 PathProgramCache]: Analyzing trace with hash 1646775817, now seen corresponding path program 1 times [2024-11-10 14:40:41,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:40:41,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683103606] [2024-11-10 14:40:41,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:40:41,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:40:41,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:40:41,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:40:41,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:40:41,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683103606] [2024-11-10 14:40:41,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [683103606] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:40:41,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:40:41,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:40:41,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440939262] [2024-11-10 14:40:41,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:40:41,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:40:41,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:40:41,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:40:41,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:40:41,190 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 101 [2024-11-10 14:40:41,190 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 89 transitions, 199 flow. Second operand has 3 states, 3 states have (on average 83.0) internal successors, (249), 3 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:40:41,192 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:40:41,192 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 101 [2024-11-10 14:40:41,192 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:40:41,229 INFO L124 PetriNetUnfolderBase]: 1/159 cut-off events. [2024-11-10 14:40:41,229 INFO L125 PetriNetUnfolderBase]: For 10/18 co-relation queries the response was YES. [2024-11-10 14:40:41,231 INFO L83 FinitePrefix]: Finished finitePrefix Result has 190 conditions, 159 events. 1/159 cut-off events. For 10/18 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 297 event pairs, 0 based on Foata normal form. 0/144 useless extension candidates. Maximal degree in co-relation 184. Up to 7 conditions per place. [2024-11-10 14:40:41,232 INFO L140 encePairwiseOnDemand]: 98/101 looper letters, 8 selfloop transitions, 2 changer transitions 0/89 dead transitions. [2024-11-10 14:40:41,232 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 89 transitions, 222 flow [2024-11-10 14:40:41,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:40:41,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:40:41,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 254 transitions. [2024-11-10 14:40:41,234 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8382838283828383 [2024-11-10 14:40:41,234 INFO L175 Difference]: Start difference. First operand has 96 places, 89 transitions, 199 flow. Second operand 3 states and 254 transitions. [2024-11-10 14:40:41,234 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 89 transitions, 222 flow [2024-11-10 14:40:41,235 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 89 transitions, 212 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-10 14:40:41,239 INFO L231 Difference]: Finished difference. Result has 92 places, 88 transitions, 191 flow [2024-11-10 14:40:41,239 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=101, PETRI_DIFFERENCE_MINUEND_FLOW=187, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=191, PETRI_PLACES=92, PETRI_TRANSITIONS=88} [2024-11-10 14:40:41,240 INFO L277 CegarLoopForPetriNet]: 97 programPoint places, -5 predicate places. [2024-11-10 14:40:41,241 INFO L471 AbstractCegarLoop]: Abstraction has has 92 places, 88 transitions, 191 flow [2024-11-10 14:40:41,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 83.0) internal successors, (249), 3 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:40:41,242 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:40:41,242 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:40:41,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 14:40:41,243 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting salethreadErr2ASSERT_VIOLATIONDATA_RACE === [salethreadErr3ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE, salethreadErr0ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2024-11-10 14:40:41,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:40:41,244 INFO L85 PathProgramCache]: Analyzing trace with hash 1982139777, now seen corresponding path program 1 times [2024-11-10 14:40:41,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:40:41,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751412935] [2024-11-10 14:40:41,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:40:41,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:40:41,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:40:41,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:40:41,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:40:41,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751412935] [2024-11-10 14:40:41,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1751412935] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:40:41,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:40:41,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:40:41,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554328943] [2024-11-10 14:40:41,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:40:41,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:40:41,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:40:41,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:40:41,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:40:41,303 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 101 [2024-11-10 14:40:41,304 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 88 transitions, 191 flow. Second operand has 3 states, 3 states have (on average 80.0) internal successors, (240), 3 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:40:41,304 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:40:41,304 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 101 [2024-11-10 14:40:41,304 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:40:41,341 INFO L124 PetriNetUnfolderBase]: 8/233 cut-off events. [2024-11-10 14:40:41,342 INFO L125 PetriNetUnfolderBase]: For 13/21 co-relation queries the response was YES. [2024-11-10 14:40:41,343 INFO L83 FinitePrefix]: Finished finitePrefix Result has 283 conditions, 233 events. 8/233 cut-off events. For 13/21 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 806 event pairs, 4 based on Foata normal form. 0/211 useless extension candidates. Maximal degree in co-relation 277. Up to 25 conditions per place. [2024-11-10 14:40:41,344 INFO L140 encePairwiseOnDemand]: 95/101 looper letters, 12 selfloop transitions, 4 changer transitions 0/91 dead transitions. [2024-11-10 14:40:41,344 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 91 transitions, 232 flow [2024-11-10 14:40:41,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:40:41,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:40:41,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 252 transitions. [2024-11-10 14:40:41,346 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8316831683168316 [2024-11-10 14:40:41,346 INFO L175 Difference]: Start difference. First operand has 92 places, 88 transitions, 191 flow. Second operand 3 states and 252 transitions. [2024-11-10 14:40:41,346 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 91 transitions, 232 flow [2024-11-10 14:40:41,347 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 91 transitions, 228 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:40:41,349 INFO L231 Difference]: Finished difference. Result has 93 places, 90 transitions, 215 flow [2024-11-10 14:40:41,349 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=101, PETRI_DIFFERENCE_MINUEND_FLOW=185, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=215, PETRI_PLACES=93, PETRI_TRANSITIONS=90} [2024-11-10 14:40:41,350 INFO L277 CegarLoopForPetriNet]: 97 programPoint places, -4 predicate places. [2024-11-10 14:40:41,350 INFO L471 AbstractCegarLoop]: Abstraction has has 93 places, 90 transitions, 215 flow [2024-11-10 14:40:41,350 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 80.0) internal successors, (240), 3 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:40:41,351 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:40:41,351 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:40:41,351 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 14:40:41,351 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [salethreadErr3ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE, salethreadErr0ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2024-11-10 14:40:41,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:40:41,352 INFO L85 PathProgramCache]: Analyzing trace with hash -296956765, now seen corresponding path program 1 times [2024-11-10 14:40:41,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:40:41,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970883740] [2024-11-10 14:40:41,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:40:41,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:40:41,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 14:40:41,375 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 14:40:41,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 14:40:41,416 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 14:40:41,417 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 14:40:41,418 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (14 of 15 remaining) [2024-11-10 14:40:41,420 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr3ASSERT_VIOLATIONDATA_RACE (13 of 15 remaining) [2024-11-10 14:40:41,420 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr2ASSERT_VIOLATIONDATA_RACE (12 of 15 remaining) [2024-11-10 14:40:41,421 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr0ASSERT_VIOLATIONDATA_RACE (11 of 15 remaining) [2024-11-10 14:40:41,421 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr1ASSERT_VIOLATIONDATA_RACE (10 of 15 remaining) [2024-11-10 14:40:41,421 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (9 of 15 remaining) [2024-11-10 14:40:41,424 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (8 of 15 remaining) [2024-11-10 14:40:41,424 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (7 of 15 remaining) [2024-11-10 14:40:41,424 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (6 of 15 remaining) [2024-11-10 14:40:41,425 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (5 of 15 remaining) [2024-11-10 14:40:41,425 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (4 of 15 remaining) [2024-11-10 14:40:41,425 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr3ASSERT_VIOLATIONDATA_RACE (3 of 15 remaining) [2024-11-10 14:40:41,425 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr2ASSERT_VIOLATIONDATA_RACE (2 of 15 remaining) [2024-11-10 14:40:41,425 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr0ASSERT_VIOLATIONDATA_RACE (1 of 15 remaining) [2024-11-10 14:40:41,426 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr1ASSERT_VIOLATIONDATA_RACE (0 of 15 remaining) [2024-11-10 14:40:41,426 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 14:40:41,426 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-11-10 14:40:41,429 WARN L244 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-10 14:40:41,430 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-11-10 14:40:41,459 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-10 14:40:41,466 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 117 places, 122 transitions, 260 flow [2024-11-10 14:40:41,487 INFO L124 PetriNetUnfolderBase]: 22/263 cut-off events. [2024-11-10 14:40:41,487 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-11-10 14:40:41,488 INFO L83 FinitePrefix]: Finished finitePrefix Result has 275 conditions, 263 events. 22/263 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 615 event pairs, 0 based on Foata normal form. 0/215 useless extension candidates. Maximal degree in co-relation 150. Up to 8 conditions per place. [2024-11-10 14:40:41,489 INFO L82 GeneralOperation]: Start removeDead. Operand has 117 places, 122 transitions, 260 flow [2024-11-10 14:40:41,490 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 117 places, 122 transitions, 260 flow [2024-11-10 14:40:41,491 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 14:40:41,492 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;@491f92b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 14:40:41,492 INFO L334 AbstractCegarLoop]: Starting to check reachability of 19 error locations. [2024-11-10 14:40:41,494 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-10 14:40:41,494 INFO L124 PetriNetUnfolderBase]: 0/15 cut-off events. [2024-11-10 14:40:41,494 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-10 14:40:41,494 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:40:41,495 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:40:41,495 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [salethreadErr3ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE, salethreadErr0ASSERT_VIOLATIONDATA_RACE (and 16 more)] === [2024-11-10 14:40:41,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:40:41,495 INFO L85 PathProgramCache]: Analyzing trace with hash -1178199294, now seen corresponding path program 1 times [2024-11-10 14:40:41,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:40:41,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304292801] [2024-11-10 14:40:41,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:40:41,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:40:41,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:40:41,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:40:41,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:40:41,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304292801] [2024-11-10 14:40:41,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [304292801] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:40:41,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:40:41,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-10 14:40:41,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306657037] [2024-11-10 14:40:41,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:40:41,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 14:40:41,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:40:41,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 14:40:41,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 14:40:41,509 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 122 [2024-11-10 14:40:41,509 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 122 transitions, 260 flow. Second operand has 2 states, 2 states have (on average 99.5) internal successors, (199), 2 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:40:41,509 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:40:41,509 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 122 [2024-11-10 14:40:41,510 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:40:41,551 INFO L124 PetriNetUnfolderBase]: 19/261 cut-off events. [2024-11-10 14:40:41,551 INFO L125 PetriNetUnfolderBase]: For 35/41 co-relation queries the response was YES. [2024-11-10 14:40:41,552 INFO L83 FinitePrefix]: Finished finitePrefix Result has 311 conditions, 261 events. 19/261 cut-off events. For 35/41 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 750 event pairs, 4 based on Foata normal form. 22/249 useless extension candidates. Maximal degree in co-relation 147. Up to 30 conditions per place. [2024-11-10 14:40:41,554 INFO L140 encePairwiseOnDemand]: 111/122 looper letters, 11 selfloop transitions, 0 changer transitions 0/109 dead transitions. [2024-11-10 14:40:41,554 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 109 transitions, 256 flow [2024-11-10 14:40:41,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 14:40:41,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-11-10 14:40:41,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 220 transitions. [2024-11-10 14:40:41,555 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9016393442622951 [2024-11-10 14:40:41,555 INFO L175 Difference]: Start difference. First operand has 117 places, 122 transitions, 260 flow. Second operand 2 states and 220 transitions. [2024-11-10 14:40:41,556 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 109 transitions, 256 flow [2024-11-10 14:40:41,557 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 109 transitions, 256 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-10 14:40:41,566 INFO L231 Difference]: Finished difference. Result has 109 places, 109 transitions, 234 flow [2024-11-10 14:40:41,569 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=122, PETRI_DIFFERENCE_MINUEND_FLOW=234, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=234, PETRI_PLACES=109, PETRI_TRANSITIONS=109} [2024-11-10 14:40:41,569 INFO L277 CegarLoopForPetriNet]: 117 programPoint places, -8 predicate places. [2024-11-10 14:40:41,569 INFO L471 AbstractCegarLoop]: Abstraction has has 109 places, 109 transitions, 234 flow [2024-11-10 14:40:41,570 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 99.5) internal successors, (199), 2 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:40:41,570 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:40:41,570 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:40:41,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 14:40:41,570 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [salethreadErr3ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE, salethreadErr0ASSERT_VIOLATIONDATA_RACE (and 16 more)] === [2024-11-10 14:40:41,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:40:41,570 INFO L85 PathProgramCache]: Analyzing trace with hash 2015790853, now seen corresponding path program 1 times [2024-11-10 14:40:41,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:40:41,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952698632] [2024-11-10 14:40:41,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:40:41,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:40:41,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:40:41,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:40:41,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:40:41,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952698632] [2024-11-10 14:40:41,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952698632] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:40:41,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:40:41,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 14:40:41,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039130878] [2024-11-10 14:40:41,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:40:41,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:40:41,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:40:41,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:40:41,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:40:41,628 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 122 [2024-11-10 14:40:41,629 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 109 transitions, 234 flow. Second operand has 3 states, 3 states have (on average 95.33333333333333) internal successors, (286), 3 states have internal predecessors, (286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:40:41,629 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:40:41,629 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 122 [2024-11-10 14:40:41,629 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:40:41,715 INFO L124 PetriNetUnfolderBase]: 59/513 cut-off events. [2024-11-10 14:40:41,715 INFO L125 PetriNetUnfolderBase]: For 29/29 co-relation queries the response was YES. [2024-11-10 14:40:41,717 INFO L83 FinitePrefix]: Finished finitePrefix Result has 629 conditions, 513 events. 59/513 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 2534 event pairs, 10 based on Foata normal form. 1/449 useless extension candidates. Maximal degree in co-relation 624. Up to 94 conditions per place. [2024-11-10 14:40:41,719 INFO L140 encePairwiseOnDemand]: 119/122 looper letters, 18 selfloop transitions, 2 changer transitions 0/112 dead transitions. [2024-11-10 14:40:41,720 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 112 transitions, 280 flow [2024-11-10 14:40:41,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:40:41,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:40:41,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 300 transitions. [2024-11-10 14:40:41,721 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.819672131147541 [2024-11-10 14:40:41,721 INFO L175 Difference]: Start difference. First operand has 109 places, 109 transitions, 234 flow. Second operand 3 states and 300 transitions. [2024-11-10 14:40:41,721 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 112 transitions, 280 flow [2024-11-10 14:40:41,722 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 112 transitions, 280 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-10 14:40:41,724 INFO L231 Difference]: Finished difference. Result has 112 places, 110 transitions, 246 flow [2024-11-10 14:40:41,724 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=122, PETRI_DIFFERENCE_MINUEND_FLOW=234, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=246, PETRI_PLACES=112, PETRI_TRANSITIONS=110} [2024-11-10 14:40:41,725 INFO L277 CegarLoopForPetriNet]: 117 programPoint places, -5 predicate places. [2024-11-10 14:40:41,725 INFO L471 AbstractCegarLoop]: Abstraction has has 112 places, 110 transitions, 246 flow [2024-11-10 14:40:41,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 95.33333333333333) internal successors, (286), 3 states have internal predecessors, (286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:40:41,725 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:40:41,726 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:40:41,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 14:40:41,726 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [salethreadErr3ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE, salethreadErr0ASSERT_VIOLATIONDATA_RACE (and 16 more)] === [2024-11-10 14:40:41,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:40:41,726 INFO L85 PathProgramCache]: Analyzing trace with hash 550981692, now seen corresponding path program 1 times [2024-11-10 14:40:41,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:40:41,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394651550] [2024-11-10 14:40:41,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:40:41,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:40:41,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:40:41,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:40:41,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:40:41,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394651550] [2024-11-10 14:40:41,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394651550] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:40:41,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:40:41,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 14:40:41,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090735319] [2024-11-10 14:40:41,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:40:41,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 14:40:41,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:40:41,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 14:40:41,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-10 14:40:42,099 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 122 [2024-11-10 14:40:42,100 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 110 transitions, 246 flow. Second operand has 6 states, 6 states have (on average 82.0) internal successors, (492), 6 states have internal predecessors, (492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:40:42,100 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:40:42,100 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 122 [2024-11-10 14:40:42,107 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:40:42,230 INFO L124 PetriNetUnfolderBase]: 179/635 cut-off events. [2024-11-10 14:40:42,231 INFO L125 PetriNetUnfolderBase]: For 31/31 co-relation queries the response was YES. [2024-11-10 14:40:42,233 INFO L83 FinitePrefix]: Finished finitePrefix Result has 976 conditions, 635 events. 179/635 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 3490 event pairs, 12 based on Foata normal form. 0/581 useless extension candidates. Maximal degree in co-relation 969. Up to 208 conditions per place. [2024-11-10 14:40:42,235 INFO L140 encePairwiseOnDemand]: 116/122 looper letters, 41 selfloop transitions, 5 changer transitions 0/125 dead transitions. [2024-11-10 14:40:42,235 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 125 transitions, 368 flow [2024-11-10 14:40:42,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 14:40:42,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-10 14:40:42,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 526 transitions. [2024-11-10 14:40:42,237 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7185792349726776 [2024-11-10 14:40:42,237 INFO L175 Difference]: Start difference. First operand has 112 places, 110 transitions, 246 flow. Second operand 6 states and 526 transitions. [2024-11-10 14:40:42,238 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 125 transitions, 368 flow [2024-11-10 14:40:42,239 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 125 transitions, 366 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-10 14:40:42,240 INFO L231 Difference]: Finished difference. Result has 115 places, 109 transitions, 252 flow [2024-11-10 14:40:42,240 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=122, PETRI_DIFFERENCE_MINUEND_FLOW=242, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=252, PETRI_PLACES=115, PETRI_TRANSITIONS=109} [2024-11-10 14:40:42,241 INFO L277 CegarLoopForPetriNet]: 117 programPoint places, -2 predicate places. [2024-11-10 14:40:42,241 INFO L471 AbstractCegarLoop]: Abstraction has has 115 places, 109 transitions, 252 flow [2024-11-10 14:40:42,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 82.0) internal successors, (492), 6 states have internal predecessors, (492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:40:42,241 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:40:42,241 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:40:42,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 14:40:42,242 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting salethreadErr3ASSERT_VIOLATIONDATA_RACE === [salethreadErr3ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE, salethreadErr0ASSERT_VIOLATIONDATA_RACE (and 16 more)] === [2024-11-10 14:40:42,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:40:42,242 INFO L85 PathProgramCache]: Analyzing trace with hash 1219687510, now seen corresponding path program 1 times [2024-11-10 14:40:42,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:40:42,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993278909] [2024-11-10 14:40:42,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:40:42,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:40:42,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:40:42,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:40:42,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:40:42,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993278909] [2024-11-10 14:40:42,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1993278909] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:40:42,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:40:42,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:40:42,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406076959] [2024-11-10 14:40:42,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:40:42,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:40:42,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:40:42,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:40:42,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:40:42,274 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 122 [2024-11-10 14:40:42,274 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 109 transitions, 252 flow. Second operand has 3 states, 3 states have (on average 95.0) internal successors, (285), 3 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:40:42,274 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:40:42,275 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 122 [2024-11-10 14:40:42,275 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:40:42,374 INFO L124 PetriNetUnfolderBase]: 56/788 cut-off events. [2024-11-10 14:40:42,374 INFO L125 PetriNetUnfolderBase]: For 124/390 co-relation queries the response was YES. [2024-11-10 14:40:42,377 INFO L83 FinitePrefix]: Finished finitePrefix Result has 966 conditions, 788 events. 56/788 cut-off events. For 124/390 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 5088 event pairs, 11 based on Foata normal form. 0/669 useless extension candidates. Maximal degree in co-relation 959. Up to 59 conditions per place. [2024-11-10 14:40:42,380 INFO L140 encePairwiseOnDemand]: 114/122 looper letters, 22 selfloop transitions, 6 changer transitions 0/120 dead transitions. [2024-11-10 14:40:42,381 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 120 transitions, 341 flow [2024-11-10 14:40:42,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:40:42,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:40:42,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 309 transitions. [2024-11-10 14:40:42,382 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8442622950819673 [2024-11-10 14:40:42,382 INFO L175 Difference]: Start difference. First operand has 115 places, 109 transitions, 252 flow. Second operand 3 states and 309 transitions. [2024-11-10 14:40:42,382 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 120 transitions, 341 flow [2024-11-10 14:40:42,384 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 120 transitions, 331 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-10 14:40:42,385 INFO L231 Difference]: Finished difference. Result has 114 places, 115 transitions, 294 flow [2024-11-10 14:40:42,386 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=122, PETRI_DIFFERENCE_MINUEND_FLOW=242, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=294, PETRI_PLACES=114, PETRI_TRANSITIONS=115} [2024-11-10 14:40:42,386 INFO L277 CegarLoopForPetriNet]: 117 programPoint places, -3 predicate places. [2024-11-10 14:40:42,386 INFO L471 AbstractCegarLoop]: Abstraction has has 114 places, 115 transitions, 294 flow [2024-11-10 14:40:42,387 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 95.0) internal successors, (285), 3 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:40:42,387 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:40:42,387 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:40:42,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-10 14:40:42,387 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting salethreadErr2ASSERT_VIOLATIONDATA_RACE === [salethreadErr3ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE, salethreadErr0ASSERT_VIOLATIONDATA_RACE (and 16 more)] === [2024-11-10 14:40:42,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:40:42,388 INFO L85 PathProgramCache]: Analyzing trace with hash 287637838, now seen corresponding path program 1 times [2024-11-10 14:40:42,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:40:42,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567156019] [2024-11-10 14:40:42,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:40:42,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:40:42,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:40:42,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:40:42,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:40:42,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567156019] [2024-11-10 14:40:42,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567156019] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:40:42,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:40:42,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:40:42,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889671577] [2024-11-10 14:40:42,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:40:42,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:40:42,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:40:42,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:40:42,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:40:42,432 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 122 [2024-11-10 14:40:42,433 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 115 transitions, 294 flow. Second operand has 3 states, 3 states have (on average 92.0) internal successors, (276), 3 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:40:42,433 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:40:42,433 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 122 [2024-11-10 14:40:42,433 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:40:42,637 INFO L124 PetriNetUnfolderBase]: 273/1975 cut-off events. [2024-11-10 14:40:42,638 INFO L125 PetriNetUnfolderBase]: For 391/908 co-relation queries the response was YES. [2024-11-10 14:40:42,644 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2765 conditions, 1975 events. 273/1975 cut-off events. For 391/908 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 17167 event pairs, 94 based on Foata normal form. 1/1697 useless extension candidates. Maximal degree in co-relation 2757. Up to 395 conditions per place. [2024-11-10 14:40:42,649 INFO L140 encePairwiseOnDemand]: 111/122 looper letters, 27 selfloop transitions, 8 changer transitions 0/128 dead transitions. [2024-11-10 14:40:42,649 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 128 transitions, 409 flow [2024-11-10 14:40:42,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:40:42,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:40:42,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 306 transitions. [2024-11-10 14:40:42,651 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8360655737704918 [2024-11-10 14:40:42,651 INFO L175 Difference]: Start difference. First operand has 114 places, 115 transitions, 294 flow. Second operand 3 states and 306 transitions. [2024-11-10 14:40:42,651 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 128 transitions, 409 flow [2024-11-10 14:40:42,654 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 128 transitions, 393 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:40:42,655 INFO L231 Difference]: Finished difference. Result has 116 places, 123 transitions, 352 flow [2024-11-10 14:40:42,655 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=122, PETRI_DIFFERENCE_MINUEND_FLOW=282, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=352, PETRI_PLACES=116, PETRI_TRANSITIONS=123} [2024-11-10 14:40:42,656 INFO L277 CegarLoopForPetriNet]: 117 programPoint places, -1 predicate places. [2024-11-10 14:40:42,656 INFO L471 AbstractCegarLoop]: Abstraction has has 116 places, 123 transitions, 352 flow [2024-11-10 14:40:42,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 92.0) internal successors, (276), 3 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:40:42,657 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:40:42,657 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:40:42,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-10 14:40:42,657 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [salethreadErr3ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE, salethreadErr0ASSERT_VIOLATIONDATA_RACE (and 16 more)] === [2024-11-10 14:40:42,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:40:42,657 INFO L85 PathProgramCache]: Analyzing trace with hash 1263110698, now seen corresponding path program 1 times [2024-11-10 14:40:42,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:40:42,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549583138] [2024-11-10 14:40:42,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:40:42,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:40:42,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:40:42,740 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:40:42,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:40:42,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549583138] [2024-11-10 14:40:42,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549583138] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 14:40:42,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1097492767] [2024-11-10 14:40:42,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:40:42,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 14:40:42,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 14:40:42,743 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 14:40:42,745 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-10 14:40:42,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:40:42,835 INFO L255 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 14:40:42,838 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 14:40:42,956 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:40:42,960 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 14:40:43,034 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:40:43,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1097492767] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 14:40:43,035 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 14:40:43,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2024-11-10 14:40:43,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725794281] [2024-11-10 14:40:43,036 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 14:40:43,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 14:40:43,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:40:43,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 14:40:43,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-10 14:40:43,117 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 122 [2024-11-10 14:40:43,119 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 123 transitions, 352 flow. Second operand has 10 states, 10 states have (on average 92.4) internal successors, (924), 10 states have internal predecessors, (924), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:40:43,133 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:40:43,133 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 122 [2024-11-10 14:40:43,133 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:40:43,343 INFO L124 PetriNetUnfolderBase]: 158/747 cut-off events. [2024-11-10 14:40:43,343 INFO L125 PetriNetUnfolderBase]: For 356/423 co-relation queries the response was YES. [2024-11-10 14:40:43,346 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1347 conditions, 747 events. 158/747 cut-off events. For 356/423 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 5241 event pairs, 24 based on Foata normal form. 38/739 useless extension candidates. Maximal degree in co-relation 1338. Up to 100 conditions per place. [2024-11-10 14:40:43,349 INFO L140 encePairwiseOnDemand]: 117/122 looper letters, 47 selfloop transitions, 7 changer transitions 0/120 dead transitions. [2024-11-10 14:40:43,349 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 120 transitions, 510 flow [2024-11-10 14:40:43,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 14:40:43,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-10 14:40:43,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 850 transitions. [2024-11-10 14:40:43,352 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7741347905282332 [2024-11-10 14:40:43,352 INFO L175 Difference]: Start difference. First operand has 116 places, 123 transitions, 352 flow. Second operand 9 states and 850 transitions. [2024-11-10 14:40:43,352 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 120 transitions, 510 flow [2024-11-10 14:40:43,355 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 120 transitions, 480 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:40:43,356 INFO L231 Difference]: Finished difference. Result has 89 places, 88 transitions, 262 flow [2024-11-10 14:40:43,356 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=122, PETRI_DIFFERENCE_MINUEND_FLOW=244, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=262, PETRI_PLACES=89, PETRI_TRANSITIONS=88} [2024-11-10 14:40:43,357 INFO L277 CegarLoopForPetriNet]: 117 programPoint places, -28 predicate places. [2024-11-10 14:40:43,357 INFO L471 AbstractCegarLoop]: Abstraction has has 89 places, 88 transitions, 262 flow [2024-11-10 14:40:43,359 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 92.4) internal successors, (924), 10 states have internal predecessors, (924), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:40:43,359 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:40:43,360 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:40:43,378 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-10 14:40:43,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-11-10 14:40:43,564 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting salethreadErr3ASSERT_VIOLATIONDATA_RACE === [salethreadErr3ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE, salethreadErr0ASSERT_VIOLATIONDATA_RACE (and 16 more)] === [2024-11-10 14:40:43,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:40:43,565 INFO L85 PathProgramCache]: Analyzing trace with hash -587135053, now seen corresponding path program 1 times [2024-11-10 14:40:43,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:40:43,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252109732] [2024-11-10 14:40:43,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:40:43,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:40:43,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:40:43,661 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-10 14:40:43,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:40:43,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252109732] [2024-11-10 14:40:43,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252109732] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:40:43,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:40:43,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 14:40:43,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549660123] [2024-11-10 14:40:43,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:40:43,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 14:40:43,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:40:43,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 14:40:43,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 14:40:43,672 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 122 [2024-11-10 14:40:43,673 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 88 transitions, 262 flow. Second operand has 4 states, 4 states have (on average 97.25) internal successors, (389), 4 states have internal predecessors, (389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:40:43,673 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:40:43,673 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 122 [2024-11-10 14:40:43,673 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:40:43,732 INFO L124 PetriNetUnfolderBase]: 29/292 cut-off events. [2024-11-10 14:40:43,733 INFO L125 PetriNetUnfolderBase]: For 44/46 co-relation queries the response was YES. [2024-11-10 14:40:43,734 INFO L83 FinitePrefix]: Finished finitePrefix Result has 467 conditions, 292 events. 29/292 cut-off events. For 44/46 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1377 event pairs, 4 based on Foata normal form. 8/283 useless extension candidates. Maximal degree in co-relation 458. Up to 29 conditions per place. [2024-11-10 14:40:43,735 INFO L140 encePairwiseOnDemand]: 116/122 looper letters, 23 selfloop transitions, 6 changer transitions 0/98 dead transitions. [2024-11-10 14:40:43,735 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 98 transitions, 365 flow [2024-11-10 14:40:43,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 14:40:43,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-10 14:40:43,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 503 transitions. [2024-11-10 14:40:43,737 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8245901639344262 [2024-11-10 14:40:43,737 INFO L175 Difference]: Start difference. First operand has 89 places, 88 transitions, 262 flow. Second operand 5 states and 503 transitions. [2024-11-10 14:40:43,737 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 98 transitions, 365 flow [2024-11-10 14:40:43,739 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 98 transitions, 350 flow, removed 1 selfloop flow, removed 5 redundant places. [2024-11-10 14:40:43,741 INFO L231 Difference]: Finished difference. Result has 90 places, 89 transitions, 282 flow [2024-11-10 14:40:43,741 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=122, PETRI_DIFFERENCE_MINUEND_FLOW=231, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=282, PETRI_PLACES=90, PETRI_TRANSITIONS=89} [2024-11-10 14:40:43,742 INFO L277 CegarLoopForPetriNet]: 117 programPoint places, -27 predicate places. [2024-11-10 14:40:43,743 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 89 transitions, 282 flow [2024-11-10 14:40:43,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 97.25) internal successors, (389), 4 states have internal predecessors, (389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:40:43,744 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:40:43,744 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:40:43,744 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-10 14:40:43,744 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting salethreadErr3ASSERT_VIOLATIONDATA_RACE === [salethreadErr3ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE, salethreadErr0ASSERT_VIOLATIONDATA_RACE (and 16 more)] === [2024-11-10 14:40:43,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:40:43,745 INFO L85 PathProgramCache]: Analyzing trace with hash 134168077, now seen corresponding path program 1 times [2024-11-10 14:40:43,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:40:43,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301589486] [2024-11-10 14:40:43,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:40:43,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:40:43,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:40:43,838 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-10 14:40:43,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:40:43,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301589486] [2024-11-10 14:40:43,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301589486] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:40:43,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:40:43,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 14:40:43,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847807349] [2024-11-10 14:40:43,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:40:43,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 14:40:43,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:40:43,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 14:40:43,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 14:40:43,850 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 122 [2024-11-10 14:40:43,850 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 89 transitions, 282 flow. Second operand has 4 states, 4 states have (on average 97.25) internal successors, (389), 4 states have internal predecessors, (389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:40:43,851 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:40:43,851 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 122 [2024-11-10 14:40:43,851 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:40:43,908 INFO L124 PetriNetUnfolderBase]: 22/262 cut-off events. [2024-11-10 14:40:43,908 INFO L125 PetriNetUnfolderBase]: For 107/115 co-relation queries the response was YES. [2024-11-10 14:40:43,909 INFO L83 FinitePrefix]: Finished finitePrefix Result has 458 conditions, 262 events. 22/262 cut-off events. For 107/115 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1075 event pairs, 4 based on Foata normal form. 12/265 useless extension candidates. Maximal degree in co-relation 447. Up to 33 conditions per place. [2024-11-10 14:40:43,910 INFO L140 encePairwiseOnDemand]: 116/122 looper letters, 19 selfloop transitions, 7 changer transitions 0/95 dead transitions. [2024-11-10 14:40:43,911 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 95 transitions, 363 flow [2024-11-10 14:40:43,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 14:40:43,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-10 14:40:43,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 499 transitions. [2024-11-10 14:40:43,912 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8180327868852459 [2024-11-10 14:40:43,913 INFO L175 Difference]: Start difference. First operand has 90 places, 89 transitions, 282 flow. Second operand 5 states and 499 transitions. [2024-11-10 14:40:43,913 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 95 transitions, 363 flow [2024-11-10 14:40:43,914 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 95 transitions, 360 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-10 14:40:43,915 INFO L231 Difference]: Finished difference. Result has 95 places, 90 transitions, 316 flow [2024-11-10 14:40:43,915 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=122, PETRI_DIFFERENCE_MINUEND_FLOW=271, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=316, PETRI_PLACES=95, PETRI_TRANSITIONS=90} [2024-11-10 14:40:43,916 INFO L277 CegarLoopForPetriNet]: 117 programPoint places, -22 predicate places. [2024-11-10 14:40:43,916 INFO L471 AbstractCegarLoop]: Abstraction has has 95 places, 90 transitions, 316 flow [2024-11-10 14:40:43,917 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 97.25) internal successors, (389), 4 states have internal predecessors, (389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:40:43,917 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:40:43,917 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:40:43,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-10 14:40:43,917 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting salethreadErr2ASSERT_VIOLATIONDATA_RACE === [salethreadErr3ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE, salethreadErr0ASSERT_VIOLATIONDATA_RACE (and 16 more)] === [2024-11-10 14:40:43,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:40:43,917 INFO L85 PathProgramCache]: Analyzing trace with hash -798320203, now seen corresponding path program 1 times [2024-11-10 14:40:43,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:40:43,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581601310] [2024-11-10 14:40:43,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:40:43,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:40:43,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 14:40:43,941 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 14:40:43,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 14:40:43,968 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 14:40:43,968 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 14:40:43,968 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location salethreadErr2ASSERT_VIOLATIONDATA_RACE (18 of 19 remaining) [2024-11-10 14:40:43,969 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr3ASSERT_VIOLATIONDATA_RACE (17 of 19 remaining) [2024-11-10 14:40:43,969 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr2ASSERT_VIOLATIONDATA_RACE (16 of 19 remaining) [2024-11-10 14:40:43,969 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr0ASSERT_VIOLATIONDATA_RACE (15 of 19 remaining) [2024-11-10 14:40:43,969 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr1ASSERT_VIOLATIONDATA_RACE (14 of 19 remaining) [2024-11-10 14:40:43,969 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (13 of 19 remaining) [2024-11-10 14:40:43,970 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (12 of 19 remaining) [2024-11-10 14:40:43,970 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (11 of 19 remaining) [2024-11-10 14:40:43,970 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (10 of 19 remaining) [2024-11-10 14:40:43,970 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (9 of 19 remaining) [2024-11-10 14:40:43,970 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (8 of 19 remaining) [2024-11-10 14:40:43,970 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (7 of 19 remaining) [2024-11-10 14:40:43,970 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr3ASSERT_VIOLATIONDATA_RACE (6 of 19 remaining) [2024-11-10 14:40:43,971 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr2ASSERT_VIOLATIONDATA_RACE (5 of 19 remaining) [2024-11-10 14:40:43,971 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr0ASSERT_VIOLATIONDATA_RACE (4 of 19 remaining) [2024-11-10 14:40:43,971 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr1ASSERT_VIOLATIONDATA_RACE (3 of 19 remaining) [2024-11-10 14:40:43,971 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr3ASSERT_VIOLATIONDATA_RACE (2 of 19 remaining) [2024-11-10 14:40:43,971 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr0ASSERT_VIOLATIONDATA_RACE (1 of 19 remaining) [2024-11-10 14:40:43,971 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr1ASSERT_VIOLATIONDATA_RACE (0 of 19 remaining) [2024-11-10 14:40:43,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-10 14:40:43,972 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:40:44,049 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 2 thread instances [2024-11-10 14:40:44,049 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 14:40:44,055 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 02:40:44 BasicIcfg [2024-11-10 14:40:44,056 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 14:40:44,057 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 14:40:44,057 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 14:40:44,057 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 14:40:44,057 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 02:40:39" (3/4) ... [2024-11-10 14:40:44,058 INFO L137 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-10 14:40:44,128 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-10 14:40:44,128 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 14:40:44,128 INFO L158 Benchmark]: Toolchain (without parser) took 6007.29ms. Allocated memory was 146.8MB in the beginning and 226.5MB in the end (delta: 79.7MB). Free memory was 111.4MB in the beginning and 165.5MB in the end (delta: -54.1MB). Peak memory consumption was 25.8MB. Max. memory is 16.1GB. [2024-11-10 14:40:44,129 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 146.8MB. Free memory was 116.1MB in the beginning and 116.0MB in the end (delta: 133.0kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 14:40:44,129 INFO L158 Benchmark]: CACSL2BoogieTranslator took 511.68ms. Allocated memory is still 146.8MB. Free memory was 111.4MB in the beginning and 89.6MB in the end (delta: 21.8MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-11-10 14:40:44,129 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.07ms. Allocated memory is still 146.8MB. Free memory was 88.9MB in the beginning and 86.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 14:40:44,129 INFO L158 Benchmark]: Boogie Preprocessor took 24.48ms. Allocated memory is still 146.8MB. Free memory was 86.9MB in the beginning and 85.6MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 14:40:44,130 INFO L158 Benchmark]: IcfgBuilder took 630.11ms. Allocated memory is still 146.8MB. Free memory was 85.6MB in the beginning and 103.0MB in the end (delta: -17.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-10 14:40:44,130 INFO L158 Benchmark]: TraceAbstraction took 4714.21ms. Allocated memory was 146.8MB in the beginning and 226.5MB in the end (delta: 79.7MB). Free memory was 102.8MB in the beginning and 177.0MB in the end (delta: -74.2MB). Peak memory consumption was 9.7MB. Max. memory is 16.1GB. [2024-11-10 14:40:44,130 INFO L158 Benchmark]: Witness Printer took 71.41ms. Allocated memory is still 226.5MB. Free memory was 177.0MB in the beginning and 165.5MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-10 14:40:44,134 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21ms. Allocated memory is still 146.8MB. Free memory was 116.1MB in the beginning and 116.0MB in the end (delta: 133.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 511.68ms. Allocated memory is still 146.8MB. Free memory was 111.4MB in the beginning and 89.6MB in the end (delta: 21.8MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.07ms. Allocated memory is still 146.8MB. Free memory was 88.9MB in the beginning and 86.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 24.48ms. Allocated memory is still 146.8MB. Free memory was 86.9MB in the beginning and 85.6MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 630.11ms. Allocated memory is still 146.8MB. Free memory was 85.6MB in the beginning and 103.0MB in the end (delta: -17.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 4714.21ms. Allocated memory was 146.8MB in the beginning and 226.5MB in the end (delta: 79.7MB). Free memory was 102.8MB in the beginning and 177.0MB in the end (delta: -74.2MB). Peak memory consumption was 9.7MB. Max. memory is 16.1GB. * Witness Printer took 71.41ms. Allocated memory is still 226.5MB. Free memory was 177.0MB in the beginning and 165.5MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - DataRaceFoundResult [Line: 722]: Data race detected Data race detected The following path leads to a data race: [L717] 0 int numberOfSeatsSold; VAL [numberOfSeatsSold=0] [L718] 0 int stopSales; VAL [numberOfSeatsSold=0, stopSales=0] [L719] 0 int numOfTickets; VAL [numOfTickets=0, numberOfSeatsSold=0, stopSales=0] [L736] 0 pthread_t salethreads[25]; VAL [\old(argc)=101, \old(argv)={103:102}, argc=101, numOfTickets=0, numberOfSeatsSold=0, salethreads={8:0}, stopSales=0] [L738] 0 numOfTickets = 25 VAL [\old(argc)=101, \old(argv)={103:102}, argc=101, numOfTickets=25, numberOfSeatsSold=0, salethreads={8:0}, stopSales=0] [L741] 0 numberOfSeatsSold = 0 VAL [\old(argc)=101, \old(argv)={103:102}, argc=101, numOfTickets=25, numberOfSeatsSold=0, salethreads={8:0}, stopSales=0] [L744] 0 stopSales = 0 VAL [\old(argc)=101, \old(argv)={103:102}, argc=101, numOfTickets=25, numberOfSeatsSold=0, salethreads={8:0}, stopSales=0] [L746] 0 int i = 0; VAL [\old(argc)=101, \old(argv)={103:102}, argc=101, i=0, numOfTickets=25, numberOfSeatsSold=0, salethreads={8:0}, stopSales=0] [L746] COND TRUE 0 i < 25 VAL [\old(argc)=101, \old(argv)={103:102}, argc=101, i=0, numOfTickets=25, numberOfSeatsSold=0, salethreads={8:0}, stopSales=0] [L747] 0 pthread_create(&salethreads[i], 0, salethread, ((void *)0)) VAL [\old(argc)=101, \old(argv)={103:102}, argc=101, i=0, numOfTickets=25, numberOfSeatsSold=0, salethreads={8:0}, stopSales=0] [L747] FCALL, FORK 0 pthread_create(&salethreads[i], 0, salethread, ((void *)0)) VAL [\old(arg)={0:0}, \old(argc)=101, \old(argv)={103:102}, argc=101, i=0, numOfTickets=25, numberOfSeatsSold=0, salethreads={8:0}, stopSales=0] [L721] 1 !stopSales VAL [\old(arg)={0:0}, arg={0:0}, numOfTickets=25, numberOfSeatsSold=0, stopSales=0] [L746] 0 i++ VAL [\old(arg)={0:0}, \old(argc)=101, \old(argv)={103:102}, arg={0:0}, argc=101, i=1, numOfTickets=25, numberOfSeatsSold=0, salethreads={8:0}, stopSales=0] [L746] COND TRUE 0 i < 25 VAL [\old(arg)={0:0}, \old(argc)=101, \old(argv)={103:102}, arg={0:0}, argc=101, i=1, numOfTickets=25, numberOfSeatsSold=0, salethreads={8:0}, stopSales=0] [L747] 0 pthread_create(&salethreads[i], 0, salethread, ((void *)0)) VAL [\old(arg)={0:0}, \old(argc)=101, \old(argv)={103:102}, arg={0:0}, argc=101, i=1, numOfTickets=25, numberOfSeatsSold=0, salethreads={8:0}, stopSales=0] [L747] FCALL, FORK 0 pthread_create(&salethreads[i], 0, salethread, ((void *)0)) VAL [\old(arg)={0:0}, \old(argc)=101, \old(argv)={103:102}, arg={0:0}, argc=101, i=1, numOfTickets=25, numberOfSeatsSold=0, salethreads={8:0}, stopSales=0] [L721] 2 !stopSales VAL [\old(arg)={0:0}, arg={0:0}, numOfTickets=25, numberOfSeatsSold=0, stopSales=0] [L721] COND TRUE 1 !stopSales VAL [\old(arg)={0:0}, arg={0:0}, numOfTickets=25, numberOfSeatsSold=0, stopSales=0] [L722] 1 int _numberOfSeatsSold = numberOfSeatsSold; VAL [\old(arg)={0:0}, arg={0:0}, numOfTickets=25, numberOfSeatsSold=0, stopSales=0] [L721] 2 !stopSales VAL [\old(arg)={0:0}, arg={0:0}, numOfTickets=25, numberOfSeatsSold=0, stopSales=0] [L721] COND TRUE 2 !stopSales VAL [\old(arg)={0:0}, arg={0:0}, numOfTickets=25, numberOfSeatsSold=0, stopSales=0] [L722] 2 int _numberOfSeatsSold = numberOfSeatsSold; VAL [\old(arg)={0:0}, _numberOfSeatsSold=0, arg={0:0}, numOfTickets=25, numberOfSeatsSold=0, stopSales=0] [L723] COND FALSE 1 !(_numberOfSeatsSold >= (25 - (((25 / 10) == 0) ? 1 : (25 / 10)))) VAL [\old(arg)={0:0}, _numberOfSeatsSold=0, arg={0:0}, numOfTickets=25, numberOfSeatsSold=0, stopSales=0] [L729] 1 numberOfSeatsSold = _numberOfSeatsSold + 1 VAL [\old(arg)={0:0}, _numberOfSeatsSold=0, arg={0:0}, numOfTickets=25, numberOfSeatsSold=1, stopSales=0] [L722] 2 int _numberOfSeatsSold = numberOfSeatsSold; VAL [\old(arg)={0:0}, _numberOfSeatsSold=0, arg={0:0}, numOfTickets=25, numberOfSeatsSold=1, stopSales=0] Now there is a data race on ~numberOfSeatsSold~0 between C: numberOfSeatsSold = _numberOfSeatsSold + 1 [729] and C: int _numberOfSeatsSold = numberOfSeatsSold; [722] - UnprovableResult [Line: 721]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 725]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 729]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 738]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 741]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 744]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 752]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 747]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 750]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 747]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 113 locations, 15 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 2.0s, OverallIterations: 6, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 107 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 59 mSDsluCounter, 13 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 11 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 239 IncrementalHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 11 mSolverCounterUnsat, 13 mSDtfsCounter, 239 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=215occurred in iteration=5, InterpolantAutomatonStates: 17, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 194 NumberOfCodeBlocks, 194 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 140 ConstructedInterpolants, 0 QuantifiedInterpolants, 263 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data with 2 thread instances CFG has 4 procedures, 131 locations, 19 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 2.5s, OverallIterations: 9, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 260 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 191 mSDsluCounter, 48 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 30 mSDsCounter, 28 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 546 IncrementalHoareTripleChecker+Invalid, 574 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 28 mSolverCounterUnsat, 18 mSDtfsCounter, 546 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 129 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=352occurred in iteration=5, InterpolantAutomatonStates: 36, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 429 NumberOfCodeBlocks, 429 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 404 ConstructedInterpolants, 0 QuantifiedInterpolants, 815 SizeOfPredicates, 2 NumberOfNonLiveVariables, 130 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 10 InterpolantComputations, 7 PerfectInterpolantSequences, 24/30 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-11-10 14:40:44,158 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE