./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-race-challenges/thread-join-counter-outer-race-3.i --full-output --witness-type violation_witness --validate ../results-verified/LOGDIR/SV-COMP24_no-data-race/thread-join-counter-outer-race-3.yml/witness.graphml --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 194c01fd 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/AutomizerReachWitnessValidation.xml -i ../sv-benchmarks/c/pthread-race-challenges/thread-join-counter-outer-race-3.i ../results-verified/LOGDIR/SV-COMP24_no-data-race/thread-join-counter-outer-race-3.yml/witness.graphml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.positions.where.we.compute.the.hoare.annotation None --- Real Ultimate output --- This is Ultimate 0.2.5-dev-194c01f-m [2024-10-29 15:24:14,676 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-29 15:24:14,752 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-10-29 15:24:14,759 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-29 15:24:14,759 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-29 15:24:14,788 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-29 15:24:14,789 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-29 15:24:14,789 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-29 15:24:14,790 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-29 15:24:14,790 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-29 15:24:14,791 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-29 15:24:14,791 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-29 15:24:14,791 INFO L153 SettingsManager]: * Use SBE=true [2024-10-29 15:24:14,792 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-29 15:24:14,792 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-29 15:24:14,793 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-29 15:24:14,793 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-29 15:24:14,793 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-29 15:24:14,793 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-29 15:24:14,794 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-29 15:24:14,794 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-29 15:24:14,798 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-29 15:24:14,799 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-10-29 15:24:14,799 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-29 15:24:14,799 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-29 15:24:14,799 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-29 15:24:14,800 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-29 15:24:14,800 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-29 15:24:14,800 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-29 15:24:14,801 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-29 15:24:14,801 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-29 15:24:14,801 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-29 15:24:14,801 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-29 15:24:14,802 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-29 15:24:14,802 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-29 15:24:14,806 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-29 15:24:14,807 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-29 15:24:14,807 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-29 15:24:14,807 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-29 15:24:14,807 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-29 15:24:14,807 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-29 15:24:14,808 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.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> None [2024-10-29 15:24:15,089 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-29 15:24:15,116 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-29 15:24:15,119 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-29 15:24:15,120 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-29 15:24:15,121 INFO L274 PluginConnector]: CDTParser initialized [2024-10-29 15:24:15,122 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-race-challenges/thread-join-counter-outer-race-3.i [2024-10-29 15:24:16,668 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-29 15:24:16,921 INFO L384 CDTParser]: Found 1 translation units. [2024-10-29 15:24:16,922 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-race-challenges/thread-join-counter-outer-race-3.i [2024-10-29 15:24:16,936 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/105c75b7c/0296bcca2381408089cff6f3274917c9/FLAG949c8a327 [2024-10-29 15:24:17,255 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/105c75b7c/0296bcca2381408089cff6f3274917c9 [2024-10-29 15:24:17,258 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-10-29 15:24:17,258 INFO L274 PluginConnector]: Witness Parser initialized [2024-10-29 15:24:17,259 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../results-verified/LOGDIR/SV-COMP24_no-data-race/thread-join-counter-outer-race-3.yml/witness.graphml [2024-10-29 15:24:17,325 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-29 15:24:17,327 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-10-29 15:24:17,328 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-29 15:24:17,328 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-29 15:24:17,333 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-29 15:24:17,334 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.10 03:24:17" (1/2) ... [2024-10-29 15:24:17,335 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a229d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 03:24:17, skipping insertion in model container [2024-10-29 15:24:17,335 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.10 03:24:17" (1/2) ... [2024-10-29 15:24:17,336 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@156c6cf8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 03:24:17, skipping insertion in model container [2024-10-29 15:24:17,336 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.graphml de.uni_freiburg.informatik.ultimate.witnessparser VIOLATION_WITNESS 29.10 03:24:17" (2/2) ... [2024-10-29 15:24:17,336 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a229d and model type witness.graphml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 29.10 03:24:17, skipping insertion in model container [2024-10-29 15:24:17,336 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.graphml de.uni_freiburg.informatik.ultimate.witnessparser VIOLATION_WITNESS 29.10 03:24:17" (2/2) ... [2024-10-29 15:24:17,388 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-29 15:24:17,737 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-29 15:24:17,764 INFO L200 MainTranslator]: Completed pre-run [2024-10-29 15:24:17,798 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-29 15:24:17,872 INFO L204 MainTranslator]: Completed translation [2024-10-29 15:24:17,872 INFO L201 PluginConnector]: Adding new model witness.graphml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 29.10 03:24:17 WrapperNode [2024-10-29 15:24:17,873 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-29 15:24:17,874 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-29 15:24:17,874 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-29 15:24:17,874 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-29 15:24:17,880 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "witness.graphml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 29.10 03:24:17" (1/1) ... [2024-10-29 15:24:17,901 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "witness.graphml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 29.10 03:24:17" (1/1) ... [2024-10-29 15:24:17,952 INFO L138 Inliner]: procedures = 159, calls = 26, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 198 [2024-10-29 15:24:17,953 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-29 15:24:17,954 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-29 15:24:17,954 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-29 15:24:17,954 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-29 15:24:17,963 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.graphml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 29.10 03:24:17" (1/1) ... [2024-10-29 15:24:17,964 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.graphml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 29.10 03:24:17" (1/1) ... [2024-10-29 15:24:17,968 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.graphml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 29.10 03:24:17" (1/1) ... [2024-10-29 15:24:17,971 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.graphml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 29.10 03:24:17" (1/1) ... [2024-10-29 15:24:17,985 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.graphml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 29.10 03:24:17" (1/1) ... [2024-10-29 15:24:17,992 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.graphml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 29.10 03:24:17" (1/1) ... [2024-10-29 15:24:17,998 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.graphml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 29.10 03:24:17" (1/1) ... [2024-10-29 15:24:18,000 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.graphml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 29.10 03:24:17" (1/1) ... [2024-10-29 15:24:18,006 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-29 15:24:18,010 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-29 15:24:18,010 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-29 15:24:18,010 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-29 15:24:18,012 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.graphml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 29.10 03:24:17" (1/1) ... [2024-10-29 15:24:18,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-29 15:24:18,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-29 15:24:18,046 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-29 15:24:18,053 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-29 15:24:18,096 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-10-29 15:24:18,097 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-29 15:24:18,097 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-10-29 15:24:18,097 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2024-10-29 15:24:18,097 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2024-10-29 15:24:18,097 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-10-29 15:24:18,097 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-29 15:24:18,097 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-29 15:24:18,099 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-29 15:24:18,262 INFO L238 CfgBuilder]: Building ICFG [2024-10-29 15:24:18,264 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-29 15:24:18,588 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-29 15:24:18,588 INFO L287 CfgBuilder]: Performing block encoding [2024-10-29 15:24:18,629 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-29 15:24:18,629 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-29 15:24:18,635 INFO L201 PluginConnector]: Adding new model witness.graphml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.10 03:24:18 BoogieIcfgContainer [2024-10-29 15:24:18,635 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-29 15:24:18,637 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-29 15:24:18,637 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-29 15:24:18,640 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-29 15:24:18,641 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.10 03:24:17" (1/4) ... [2024-10-29 15:24:18,644 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cf588ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.10 03:24:18, skipping insertion in model container [2024-10-29 15:24:18,644 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.graphml de.uni_freiburg.informatik.ultimate.witnessparser VIOLATION_WITNESS 29.10 03:24:17" (2/4) ... [2024-10-29 15:24:18,645 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cf588ea and model type witness.graphml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction VIOLATION_WITNESS 29.10 03:24:18, skipping insertion in model container [2024-10-29 15:24:18,645 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.graphml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 29.10 03:24:17" (3/4) ... [2024-10-29 15:24:18,645 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cf588ea and model type witness.graphml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction VIOLATION_WITNESS 29.10 03:24:18, skipping insertion in model container [2024-10-29 15:24:18,645 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.graphml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.10 03:24:18" (4/4) ... [2024-10-29 15:24:18,646 INFO L112 eAbstractionObserver]: Analyzing ICFG thread-join-counter-outer-race-3.i [2024-10-29 15:24:18,647 WARN L117 eAbstractionObserver]: Found a witness automaton. I will only consider traces that are accepted by the witness automaton [2024-10-29 15:24:18,665 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-29 15:24:18,665 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2024-10-29 15:24:18,665 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-29 15:24:18,731 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-29 15:24:18,752 WARN L158 CegarLoopFactory]: Violation witness validation is only supported for CEGAR loops based on FINITE_AUTOMATA. Ignoring concurrency settiong PETRI_NET and switching to FINITE_AUTOMATA. [2024-10-29 15:24:18,772 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 233 places, 234 transitions, 472 flow [2024-10-29 15:24:18,883 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 1718 states, 1691 states have (on average 1.9337670017740982) internal successors, (3270), 1717 states have internal predecessors, (3270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-29 15:24:18,921 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-29 15:24:18,929 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=None, 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;@722aae39, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-29 15:24:18,930 INFO L334 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2024-10-29 15:24:18,937 INFO L276 IsEmpty]: Start isEmpty. Operand has 1718 states, 1691 states have (on average 1.9337670017740982) internal successors, (3270), 1717 states have internal predecessors, (3270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-29 15:24:18,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-10-29 15:24:18,951 INFO L207 NwaCegarLoop]: Found error trace [2024-10-29 15:24:18,952 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-29 15:24:18,953 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-10-29 15:24:18,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-29 15:24:18,960 INFO L85 PathProgramCache]: Analyzing trace with hash 1255789169, now seen corresponding path program 1 times [2024-10-29 15:24:18,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-29 15:24:18,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572987679] [2024-10-29 15:24:18,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-29 15:24:18,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-29 15:24:19,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-29 15:24:19,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-29 15:24:19,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-29 15:24:19,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572987679] [2024-10-29 15:24:19,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572987679] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-29 15:24:19,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-29 15:24:19,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-29 15:24:19,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406239205] [2024-10-29 15:24:19,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-29 15:24:19,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-29 15:24:19,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-29 15:24:19,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-29 15:24:19,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-29 15:24:19,458 INFO L87 Difference]: Start difference. First operand has 1718 states, 1691 states have (on average 1.9337670017740982) internal successors, (3270), 1717 states have internal predecessors, (3270), 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) Second operand has 3 states, 2 states have (on average 77.0) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-29 15:24:19,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-29 15:24:19,652 INFO L93 Difference]: Finished difference Result 3429 states and 6783 transitions. [2024-10-29 15:24:19,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-29 15:24:19,655 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 77.0) internal successors, (154), 3 states have internal predecessors, (154), 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) Word has length 154 [2024-10-29 15:24:19,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-29 15:24:19,693 INFO L225 Difference]: With dead ends: 3429 [2024-10-29 15:24:19,693 INFO L226 Difference]: Without dead ends: 1857 [2024-10-29 15:24:19,700 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-29 15:24:19,704 INFO L432 NwaCegarLoop]: 259 mSDtfsCounter, 72 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 464 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-29 15:24:19,705 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 464 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-29 15:24:19,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1857 states. [2024-10-29 15:24:19,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1857 to 1664. [2024-10-29 15:24:19,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1664 states, 1645 states have (on average 1.8808510638297873) internal successors, (3094), 1663 states have internal predecessors, (3094), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-29 15:24:19,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1664 states to 1664 states and 3094 transitions. [2024-10-29 15:24:19,836 INFO L78 Accepts]: Start accepts. Automaton has 1664 states and 3094 transitions. Word has length 154 [2024-10-29 15:24:19,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-29 15:24:19,837 INFO L471 AbstractCegarLoop]: Abstraction has 1664 states and 3094 transitions. [2024-10-29 15:24:19,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 77.0) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-29 15:24:19,838 INFO L276 IsEmpty]: Start isEmpty. Operand 1664 states and 3094 transitions. [2024-10-29 15:24:19,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-10-29 15:24:19,841 INFO L207 NwaCegarLoop]: Found error trace [2024-10-29 15:24:19,841 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-29 15:24:19,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-29 15:24:19,842 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-10-29 15:24:19,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-29 15:24:19,843 INFO L85 PathProgramCache]: Analyzing trace with hash -940757651, now seen corresponding path program 1 times [2024-10-29 15:24:19,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-29 15:24:19,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870943756] [2024-10-29 15:24:19,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-29 15:24:19,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-29 15:24:19,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-29 15:24:20,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-29 15:24:20,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-29 15:24:20,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870943756] [2024-10-29 15:24:20,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870943756] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-29 15:24:20,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-29 15:24:20,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-29 15:24:20,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834507223] [2024-10-29 15:24:20,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-29 15:24:20,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-29 15:24:20,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-29 15:24:20,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-29 15:24:20,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-29 15:24:20,047 INFO L87 Difference]: Start difference. First operand 1664 states and 3094 transitions. Second operand has 3 states, 2 states have (on average 79.5) internal successors, (159), 3 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-29 15:24:20,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-29 15:24:20,137 INFO L93 Difference]: Finished difference Result 1719 states and 3199 transitions. [2024-10-29 15:24:20,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-29 15:24:20,137 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 79.5) internal successors, (159), 3 states have internal predecessors, (159), 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) Word has length 159 [2024-10-29 15:24:20,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-29 15:24:20,152 INFO L225 Difference]: With dead ends: 1719 [2024-10-29 15:24:20,153 INFO L226 Difference]: Without dead ends: 1685 [2024-10-29 15:24:20,154 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-29 15:24:20,155 INFO L432 NwaCegarLoop]: 240 mSDtfsCounter, 31 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 440 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-29 15:24:20,156 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 440 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-29 15:24:20,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1685 states. [2024-10-29 15:24:20,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1685 to 1657. [2024-10-29 15:24:20,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1657 states, 1641 states have (on average 1.8769043266301035) internal successors, (3080), 1656 states have internal predecessors, (3080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-29 15:24:20,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1657 states to 1657 states and 3080 transitions. [2024-10-29 15:24:20,224 INFO L78 Accepts]: Start accepts. Automaton has 1657 states and 3080 transitions. Word has length 159 [2024-10-29 15:24:20,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-29 15:24:20,225 INFO L471 AbstractCegarLoop]: Abstraction has 1657 states and 3080 transitions. [2024-10-29 15:24:20,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 79.5) internal successors, (159), 3 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-29 15:24:20,226 INFO L276 IsEmpty]: Start isEmpty. Operand 1657 states and 3080 transitions. [2024-10-29 15:24:20,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-10-29 15:24:20,228 INFO L207 NwaCegarLoop]: Found error trace [2024-10-29 15:24:20,228 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-29 15:24:20,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-29 15:24:20,228 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-10-29 15:24:20,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-29 15:24:20,229 INFO L85 PathProgramCache]: Analyzing trace with hash 2070782679, now seen corresponding path program 1 times [2024-10-29 15:24:20,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-29 15:24:20,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215230230] [2024-10-29 15:24:20,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-29 15:24:20,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-29 15:24:20,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-29 15:24:20,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-10-29 15:24:20,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-29 15:24:20,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215230230] [2024-10-29 15:24:20,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215230230] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-29 15:24:20,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-29 15:24:20,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-29 15:24:20,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160536805] [2024-10-29 15:24:20,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-29 15:24:20,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-29 15:24:20,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-29 15:24:20,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-29 15:24:20,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-29 15:24:20,512 INFO L87 Difference]: Start difference. First operand 1657 states and 3080 transitions. Second operand has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-29 15:24:20,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-29 15:24:20,558 INFO L93 Difference]: Finished difference Result 1657 states and 3080 transitions. [2024-10-29 15:24:20,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-29 15:24:20,559 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 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) Word has length 160 [2024-10-29 15:24:20,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-29 15:24:20,569 INFO L225 Difference]: With dead ends: 1657 [2024-10-29 15:24:20,569 INFO L226 Difference]: Without dead ends: 1644 [2024-10-29 15:24:20,570 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-29 15:24:20,571 INFO L432 NwaCegarLoop]: 217 mSDtfsCounter, 9 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-29 15:24:20,571 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 284 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-29 15:24:20,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1644 states. [2024-10-29 15:24:20,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1644 to 1644. [2024-10-29 15:24:20,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1644 states, 1629 states have (on average 1.8821362799263353) internal successors, (3066), 1643 states have internal predecessors, (3066), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-29 15:24:20,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1644 states to 1644 states and 3066 transitions. [2024-10-29 15:24:20,610 INFO L78 Accepts]: Start accepts. Automaton has 1644 states and 3066 transitions. Word has length 160 [2024-10-29 15:24:20,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-29 15:24:20,611 INFO L471 AbstractCegarLoop]: Abstraction has 1644 states and 3066 transitions. [2024-10-29 15:24:20,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-29 15:24:20,612 INFO L276 IsEmpty]: Start isEmpty. Operand 1644 states and 3066 transitions. [2024-10-29 15:24:20,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-10-29 15:24:20,615 INFO L207 NwaCegarLoop]: Found error trace [2024-10-29 15:24:20,615 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-29 15:24:20,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-29 15:24:20,615 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-10-29 15:24:20,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-29 15:24:20,616 INFO L85 PathProgramCache]: Analyzing trace with hash -16343545, now seen corresponding path program 1 times [2024-10-29 15:24:20,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-29 15:24:20,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035116231] [2024-10-29 15:24:20,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-29 15:24:20,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-29 15:24:20,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-29 15:24:20,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-29 15:24:20,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-29 15:24:20,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035116231] [2024-10-29 15:24:20,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035116231] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-29 15:24:20,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-29 15:24:20,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-29 15:24:20,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032747889] [2024-10-29 15:24:20,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-29 15:24:20,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-29 15:24:20,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-29 15:24:20,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-29 15:24:20,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-29 15:24:20,766 INFO L87 Difference]: Start difference. First operand 1644 states and 3066 transitions. Second operand has 3 states, 2 states have (on average 88.5) internal successors, (177), 3 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-29 15:24:20,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-29 15:24:20,819 INFO L93 Difference]: Finished difference Result 1672 states and 3118 transitions. [2024-10-29 15:24:20,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-29 15:24:20,821 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 88.5) internal successors, (177), 3 states have internal predecessors, (177), 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) Word has length 177 [2024-10-29 15:24:20,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-29 15:24:20,832 INFO L225 Difference]: With dead ends: 1672 [2024-10-29 15:24:20,832 INFO L226 Difference]: Without dead ends: 1626 [2024-10-29 15:24:20,833 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-29 15:24:20,836 INFO L432 NwaCegarLoop]: 256 mSDtfsCounter, 47 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 467 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-29 15:24:20,837 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 467 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-29 15:24:20,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1626 states. [2024-10-29 15:24:20,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1626 to 1612. [2024-10-29 15:24:20,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1612 states, 1598 states have (on average 1.8773466833541927) internal successors, (3000), 1611 states have internal predecessors, (3000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-29 15:24:20,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1612 states to 1612 states and 3000 transitions. [2024-10-29 15:24:20,886 INFO L78 Accepts]: Start accepts. Automaton has 1612 states and 3000 transitions. Word has length 177 [2024-10-29 15:24:20,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-29 15:24:20,887 INFO L471 AbstractCegarLoop]: Abstraction has 1612 states and 3000 transitions. [2024-10-29 15:24:20,887 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 88.5) internal successors, (177), 3 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-29 15:24:20,887 INFO L276 IsEmpty]: Start isEmpty. Operand 1612 states and 3000 transitions. [2024-10-29 15:24:20,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2024-10-29 15:24:20,891 INFO L207 NwaCegarLoop]: Found error trace [2024-10-29 15:24:20,891 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-29 15:24:20,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-29 15:24:20,892 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-10-29 15:24:20,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-29 15:24:20,893 INFO L85 PathProgramCache]: Analyzing trace with hash 1628727542, now seen corresponding path program 1 times [2024-10-29 15:24:20,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-29 15:24:20,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458748862] [2024-10-29 15:24:20,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-29 15:24:20,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-29 15:24:20,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-29 15:24:20,983 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-29 15:24:20,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-29 15:24:20,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458748862] [2024-10-29 15:24:20,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458748862] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-29 15:24:20,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-29 15:24:20,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-29 15:24:20,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059099759] [2024-10-29 15:24:20,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-29 15:24:20,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-29 15:24:20,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-29 15:24:20,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-29 15:24:20,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-29 15:24:20,987 INFO L87 Difference]: Start difference. First operand 1612 states and 3000 transitions. Second operand has 3 states, 2 states have (on average 93.5) internal successors, (187), 3 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-29 15:24:21,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-29 15:24:21,030 INFO L93 Difference]: Finished difference Result 1730 states and 3206 transitions. [2024-10-29 15:24:21,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-29 15:24:21,031 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 93.5) internal successors, (187), 3 states have internal predecessors, (187), 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) Word has length 187 [2024-10-29 15:24:21,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-29 15:24:21,041 INFO L225 Difference]: With dead ends: 1730 [2024-10-29 15:24:21,041 INFO L226 Difference]: Without dead ends: 1614 [2024-10-29 15:24:21,042 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-29 15:24:21,044 INFO L432 NwaCegarLoop]: 241 mSDtfsCounter, 34 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 454 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-29 15:24:21,044 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 454 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-29 15:24:21,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1614 states. [2024-10-29 15:24:21,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1614 to 1539. [2024-10-29 15:24:21,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1539 states, 1526 states have (on average 1.855832241153342) internal successors, (2832), 1538 states have internal predecessors, (2832), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-29 15:24:21,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1539 states to 1539 states and 2832 transitions. [2024-10-29 15:24:21,081 INFO L78 Accepts]: Start accepts. Automaton has 1539 states and 2832 transitions. Word has length 187 [2024-10-29 15:24:21,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-29 15:24:21,082 INFO L471 AbstractCegarLoop]: Abstraction has 1539 states and 2832 transitions. [2024-10-29 15:24:21,082 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 93.5) internal successors, (187), 3 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-29 15:24:21,082 INFO L276 IsEmpty]: Start isEmpty. Operand 1539 states and 2832 transitions. [2024-10-29 15:24:21,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-10-29 15:24:21,085 INFO L207 NwaCegarLoop]: Found error trace [2024-10-29 15:24:21,086 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-29 15:24:21,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-29 15:24:21,086 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting threadErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-10-29 15:24:21,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-29 15:24:21,087 INFO L85 PathProgramCache]: Analyzing trace with hash -1609610950, now seen corresponding path program 1 times [2024-10-29 15:24:21,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-29 15:24:21,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008829130] [2024-10-29 15:24:21,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-29 15:24:21,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-29 15:24:21,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-29 15:24:21,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-29 15:24:21,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-29 15:24:21,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008829130] [2024-10-29 15:24:21,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008829130] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-29 15:24:21,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-29 15:24:21,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-29 15:24:21,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231277975] [2024-10-29 15:24:21,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-29 15:24:21,180 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-29 15:24:21,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-29 15:24:21,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-29 15:24:21,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-29 15:24:21,184 INFO L87 Difference]: Start difference. First operand 1539 states and 2832 transitions. Second operand has 3 states, 2 states have (on average 95.0) internal successors, (190), 3 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-29 15:24:21,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-29 15:24:21,248 INFO L93 Difference]: Finished difference Result 1628 states and 2990 transitions. [2024-10-29 15:24:21,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-29 15:24:21,249 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 95.0) internal successors, (190), 3 states have internal predecessors, (190), 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) Word has length 190 [2024-10-29 15:24:21,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-29 15:24:21,258 INFO L225 Difference]: With dead ends: 1628 [2024-10-29 15:24:21,258 INFO L226 Difference]: Without dead ends: 1413 [2024-10-29 15:24:21,259 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-29 15:24:21,260 INFO L432 NwaCegarLoop]: 253 mSDtfsCounter, 48 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 455 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-29 15:24:21,260 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 455 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-29 15:24:21,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1413 states. [2024-10-29 15:24:21,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1413 to 1381. [2024-10-29 15:24:21,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1381 states, 1372 states have (on average 1.813411078717201) internal successors, (2488), 1380 states have internal predecessors, (2488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-29 15:24:21,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1381 states to 1381 states and 2488 transitions. [2024-10-29 15:24:21,295 INFO L78 Accepts]: Start accepts. Automaton has 1381 states and 2488 transitions. Word has length 190 [2024-10-29 15:24:21,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-29 15:24:21,296 INFO L471 AbstractCegarLoop]: Abstraction has 1381 states and 2488 transitions. [2024-10-29 15:24:21,297 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 95.0) internal successors, (190), 3 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-29 15:24:21,297 INFO L276 IsEmpty]: Start isEmpty. Operand 1381 states and 2488 transitions. [2024-10-29 15:24:21,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2024-10-29 15:24:21,300 INFO L207 NwaCegarLoop]: Found error trace [2024-10-29 15:24:21,300 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-29 15:24:21,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-29 15:24:21,301 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-10-29 15:24:21,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-29 15:24:21,301 INFO L85 PathProgramCache]: Analyzing trace with hash -88393970, now seen corresponding path program 1 times [2024-10-29 15:24:21,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-29 15:24:21,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113081344] [2024-10-29 15:24:21,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-29 15:24:21,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-29 15:24:21,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-29 15:24:21,355 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-29 15:24:21,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-29 15:24:21,452 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-29 15:24:21,452 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-29 15:24:21,453 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location threadErr0ASSERT_VIOLATIONDATA_RACE (10 of 11 remaining) [2024-10-29 15:24:21,455 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (9 of 11 remaining) [2024-10-29 15:24:21,455 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (8 of 11 remaining) [2024-10-29 15:24:21,455 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (7 of 11 remaining) [2024-10-29 15:24:21,455 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (6 of 11 remaining) [2024-10-29 15:24:21,455 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 11 remaining) [2024-10-29 15:24:21,456 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (4 of 11 remaining) [2024-10-29 15:24:21,456 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (3 of 11 remaining) [2024-10-29 15:24:21,456 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (2 of 11 remaining) [2024-10-29 15:24:21,456 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (1 of 11 remaining) [2024-10-29 15:24:21,456 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (0 of 11 remaining) [2024-10-29 15:24:21,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-29 15:24:21,461 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-10-29 15:24:21,580 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not [2024-10-29 15:24:21,581 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not [2024-10-29 15:24:21,585 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: The program execution was not completely translated back. [2024-10-29 15:24:21,596 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-10-29 15:24:21,596 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-10-29 15:24:21,599 INFO L201 PluginConnector]: Adding new model witness.graphml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.10 03:24:21 BasicIcfg [2024-10-29 15:24:21,599 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-29 15:24:21,600 INFO L158 Benchmark]: Toolchain (without parser) took 4273.75ms. Allocated memory was 165.7MB in the beginning and 211.8MB in the end (delta: 46.1MB). Free memory was 93.3MB in the beginning and 68.6MB in the end (delta: 24.6MB). Peak memory consumption was 72.4MB. Max. memory is 16.1GB. [2024-10-29 15:24:21,600 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 113.2MB. Free memory is still 74.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-29 15:24:21,600 INFO L158 Benchmark]: Witness Parser took 0.13ms. Allocated memory is still 165.7MB. Free memory is still 95.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-29 15:24:21,601 INFO L158 Benchmark]: CACSL2BoogieTranslator took 545.22ms. Allocated memory is still 165.7MB. Free memory was 93.1MB in the beginning and 136.0MB in the end (delta: -42.9MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2024-10-29 15:24:21,602 INFO L158 Benchmark]: Boogie Procedure Inliner took 79.30ms. Allocated memory is still 165.7MB. Free memory was 136.0MB in the beginning and 133.8MB in the end (delta: 2.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-29 15:24:21,603 INFO L158 Benchmark]: Boogie Preprocessor took 55.32ms. Allocated memory is still 165.7MB. Free memory was 133.8MB in the beginning and 131.5MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-29 15:24:21,603 INFO L158 Benchmark]: RCFGBuilder took 625.71ms. Allocated memory is still 165.7MB. Free memory was 130.9MB in the beginning and 108.5MB in the end (delta: 22.4MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-10-29 15:24:21,603 INFO L158 Benchmark]: TraceAbstraction took 2962.37ms. Allocated memory was 165.7MB in the beginning and 211.8MB in the end (delta: 46.1MB). Free memory was 107.8MB in the beginning and 68.6MB in the end (delta: 39.2MB). Peak memory consumption was 87.0MB. Max. memory is 16.1GB. [2024-10-29 15:24:21,605 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.22ms. Allocated memory is still 113.2MB. Free memory is still 74.8MB. There was no memory consumed. Max. memory is 16.1GB. * Witness Parser took 0.13ms. Allocated memory is still 165.7MB. Free memory is still 95.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 545.22ms. Allocated memory is still 165.7MB. Free memory was 93.1MB in the beginning and 136.0MB in the end (delta: -42.9MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 79.30ms. Allocated memory is still 165.7MB. Free memory was 136.0MB in the beginning and 133.8MB in the end (delta: 2.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 55.32ms. Allocated memory is still 165.7MB. Free memory was 133.8MB in the beginning and 131.5MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 625.71ms. Allocated memory is still 165.7MB. Free memory was 130.9MB in the beginning and 108.5MB in the end (delta: 22.4MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 2962.37ms. Allocated memory was 165.7MB in the beginning and 211.8MB in the end (delta: 46.1MB). Free memory was 107.8MB in the beginning and 68.6MB in the end (delta: 39.2MB). Peak memory consumption was 87.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - DataRaceFoundResult [Line: 692]: Data race detected Data race detected The following path leads to a data race: [L685] 0 int threads_alive = -1; VAL [threads_alive=-1] [L686] 0 pthread_mutex_t threads_alive_mutex = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; VAL [threads_alive=-1, threads_alive_mutex={1:0}] [L687] 0 pthread_cond_t threads_alive_cond = { { {0}, {0}, {0, 0}, {0, 0}, 0, 0, {0, 0} } }; VAL [threads_alive=-1, threads_alive_mutex={1:0}] [L688] 0 int data = 0; VAL [data=0, threads_alive=-1, threads_alive_mutex={1:0}] [L689] 0 pthread_mutex_t data_mutex = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; VAL [data=0, data_mutex={2:0}, threads_alive=-1, threads_alive_mutex={1:0}] [L701] 0 int threads_total = __VERIFIER_nondet_int(); VAL [data=0, data_mutex={2:0}, threads_alive=-1, threads_alive_mutex={1:0}, threads_total=1] [L702] CALL 0 assume_abort_if_not(threads_total >= 0) [L682] COND FALSE 0 !(!cond) VAL [\old(cond)=1, cond=1, data=0, data_mutex={2:0}, threads_alive=-1, threads_alive_mutex={1:0}] [L702] RET 0 assume_abort_if_not(threads_total >= 0) [L703] 0 int i = 0; VAL [data=0, data_mutex={2:0}, i=0, threads_alive=-1, threads_alive_mutex={1:0}, threads_total=1] [L703] COND TRUE 0 i < threads_total VAL [data=0, data_mutex={2:0}, i=0, threads_alive=-1, threads_alive_mutex={1:0}, threads_total=1] [L705] 0 threads_alive++ VAL [data=0, data_mutex={2:0}, i=0, threads_alive=0, threads_alive_mutex={1:0}, threads_total=1] [L707] 0 pthread_t tid; VAL [data=0, data_mutex={2:0}, i=0, threads_alive=0, threads_alive_mutex={1:0}, threads_total=1] [L708] FCALL, FORK 0 pthread_create(&tid, ((void *)0), &thread, ((void *)0)) VAL [\old(arg)={0:0}, data=0, data_mutex={2:0}, i=0, threads_alive=0, threads_alive_mutex={1:0}, threads_total=1, tid=-1] [L692] 1 data = __VERIFIER_nondet_int() VAL [\old(arg)={0:0}, arg={0:0}, data=0, data_mutex={2:0}, threads_alive=0, threads_alive_mutex={1:0}] [L703] 0 i++ VAL [\old(arg)={0:0}, arg={0:0}, data=0, data_mutex={2:0}, i=1, threads_alive=0, threads_alive_mutex={1:0}, threads_total=1] [L703] COND FALSE 0 !(i < threads_total) VAL [\old(arg)={0:0}, arg={0:0}, data=0, data_mutex={2:0}, i=1, threads_alive=0, threads_alive_mutex={1:0}, threads_total=1] [L712] COND FALSE 0 !(\read(threads_alive)) VAL [\old(arg)={0:0}, arg={0:0}, data=0, data_mutex={2:0}, threads_alive=0, threads_alive_mutex={1:0}, threads_total=1] [L715] 0 return data; VAL [\old(arg)={0:0}, arg={0:0}, data=0, data_mutex={2:0}, threads_alive=0, threads_alive_mutex={1:0}, threads_total=1] [L692] 1 data = __VERIFIER_nondet_int() VAL [\old(arg)={0:0}, arg={0:0}, data=0, data_mutex={2:0}, threads_alive=0, threads_alive_mutex={1:0}] Now there is a data race on ~data~0 between C: return data; [715] and C: data = __VERIFIER_nondet_int() [692] - UnprovableResult [Line: 705]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 712]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 715]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 705]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 708]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 695]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 695]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 263 locations, 11 error locations. Started 1 CEGAR loops. OverallTime: 2.7s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 241 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 241 mSDsluCounter, 2564 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1098 mSDsCounter, 11 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 249 IncrementalHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 11 mSolverCounterUnsat, 1466 mSDtfsCounter, 249 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1718occurred in iteration=0, InterpolantAutomatonStates: 18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 6 MinimizatonAttempts, 342 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 1222 NumberOfCodeBlocks, 1222 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 1021 ConstructedInterpolants, 0 QuantifiedInterpolants, 1639 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 1/1 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-10-29 15:24:21,636 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE