./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/09-regions_28-list2alloc.i --full-output --witness-type violation_witness --validate ../results-verified/LOGDIR/SV-COMP24_no-data-race/09-regions_28-list2alloc.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/goblint-regression/09-regions_28-list2alloc.i ../results-verified/LOGDIR/SV-COMP24_no-data-race/09-regions_28-list2alloc.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:23:02,658 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-29 15:23:02,700 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-10-29 15:23:02,705 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-29 15:23:02,707 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-29 15:23:02,733 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-29 15:23:02,734 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-29 15:23:02,734 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-29 15:23:02,735 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-29 15:23:02,735 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-29 15:23:02,736 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-29 15:23:02,737 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-29 15:23:02,737 INFO L153 SettingsManager]: * Use SBE=true [2024-10-29 15:23:02,737 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-29 15:23:02,739 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-29 15:23:02,739 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-29 15:23:02,739 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-29 15:23:02,739 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-29 15:23:02,739 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-29 15:23:02,740 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-29 15:23:02,740 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-29 15:23:02,742 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-29 15:23:02,742 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-10-29 15:23:02,742 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-29 15:23:02,743 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-29 15:23:02,743 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-29 15:23:02,743 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-29 15:23:02,743 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-29 15:23:02,743 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-29 15:23:02,743 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-29 15:23:02,744 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-29 15:23:02,744 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-29 15:23:02,744 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-29 15:23:02,744 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-29 15:23:02,744 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-29 15:23:02,745 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-29 15:23:02,745 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-29 15:23:02,745 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-29 15:23:02,745 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-29 15:23:02,745 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-29 15:23:02,745 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-29 15:23:02,747 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:23:02,939 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-29 15:23:02,960 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-29 15:23:02,963 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-29 15:23:02,963 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-10-29 15:23:02,964 INFO L274 PluginConnector]: Witness Parser initialized [2024-10-29 15:23:02,965 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../results-verified/LOGDIR/SV-COMP24_no-data-race/09-regions_28-list2alloc.yml/witness.graphml [2024-10-29 15:23:03,046 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-29 15:23:03,046 INFO L274 PluginConnector]: CDTParser initialized [2024-10-29 15:23:03,046 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/09-regions_28-list2alloc.i [2024-10-29 15:23:04,259 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-29 15:23:04,462 INFO L384 CDTParser]: Found 1 translation units. [2024-10-29 15:23:04,464 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/09-regions_28-list2alloc.i [2024-10-29 15:23:04,482 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d0a33d31/0573fc3168f84df59ca77ddc97e3f5bd/FLAG18fad8c86 [2024-10-29 15:23:04,814 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d0a33d31/0573fc3168f84df59ca77ddc97e3f5bd [2024-10-29 15:23:04,814 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-29 15:23:04,815 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-10-29 15:23:04,818 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-29 15:23:04,818 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-29 15:23:04,822 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-29 15:23:04,823 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.graphml de.uni_freiburg.informatik.ultimate.witnessparser VIOLATION_WITNESS 29.10 03:23:03" (1/2) ... [2024-10-29 15:23:04,824 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b9cc00e and model type witness.graphml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 29.10 03:23:04, skipping insertion in model container [2024-10-29 15:23:04,824 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.graphml de.uni_freiburg.informatik.ultimate.witnessparser VIOLATION_WITNESS 29.10 03:23:03" (1/2) ... [2024-10-29 15:23:04,825 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@194743ad and model type witness.graphml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 29.10 03:23:04, skipping insertion in model container [2024-10-29 15:23:04,825 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.10 03:23:04" (2/2) ... [2024-10-29 15:23:04,825 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b9cc00e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 03:23:04, skipping insertion in model container [2024-10-29 15:23:04,825 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.10 03:23:04" (2/2) ... [2024-10-29 15:23:04,868 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-29 15:23:05,279 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-29 15:23:05,294 INFO L200 MainTranslator]: Completed pre-run [2024-10-29 15:23:05,335 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-29 15:23:05,436 INFO L204 MainTranslator]: Completed translation [2024-10-29 15:23:05,445 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 03:23:05 WrapperNode [2024-10-29 15:23:05,445 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-29 15:23:05,446 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-29 15:23:05,447 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-29 15:23:05,447 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-29 15:23:05,453 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 03:23:05" (1/1) ... [2024-10-29 15:23:05,470 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 03:23:05" (1/1) ... [2024-10-29 15:23:05,495 INFO L138 Inliner]: procedures = 368, calls = 31, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 105 [2024-10-29 15:23:05,496 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-29 15:23:05,496 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-29 15:23:05,496 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-29 15:23:05,497 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-29 15:23:05,504 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 03:23:05" (1/1) ... [2024-10-29 15:23:05,504 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 03:23:05" (1/1) ... [2024-10-29 15:23:05,508 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 03:23:05" (1/1) ... [2024-10-29 15:23:05,508 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 03:23:05" (1/1) ... [2024-10-29 15:23:05,516 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 03:23:05" (1/1) ... [2024-10-29 15:23:05,517 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 03:23:05" (1/1) ... [2024-10-29 15:23:05,519 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 03:23:05" (1/1) ... [2024-10-29 15:23:05,520 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 03:23:05" (1/1) ... [2024-10-29 15:23:05,522 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-29 15:23:05,522 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-29 15:23:05,523 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-29 15:23:05,523 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-29 15:23:05,523 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 03:23:05" (1/1) ... [2024-10-29 15:23:05,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-29 15:23:05,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-29 15:23:05,545 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:23:05,547 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:23:05,579 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-10-29 15:23:05,579 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-10-29 15:23:05,580 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-10-29 15:23:05,580 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-10-29 15:23:05,580 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-29 15:23:05,580 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-29 15:23:05,580 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2024-10-29 15:23:05,580 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2024-10-29 15:23:05,581 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2024-10-29 15:23:05,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-10-29 15:23:05,581 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-29 15:23:05,582 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-29 15:23:05,583 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:23:05,677 INFO L238 CfgBuilder]: Building ICFG [2024-10-29 15:23:05,678 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-29 15:23:05,929 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-29 15:23:05,929 INFO L287 CfgBuilder]: Performing block encoding [2024-10-29 15:23:05,954 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-29 15:23:05,955 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-29 15:23:05,955 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.10 03:23:05 BoogieIcfgContainer [2024-10-29 15:23:05,955 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-29 15:23:05,957 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-29 15:23:05,958 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-29 15:23:05,960 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-29 15:23:05,960 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.graphml de.uni_freiburg.informatik.ultimate.witnessparser VIOLATION_WITNESS 29.10 03:23:03" (1/4) ... [2024-10-29 15:23:05,961 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36eb7bb9 and model type witness.graphml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction VIOLATION_WITNESS 29.10 03:23:05, skipping insertion in model container [2024-10-29 15:23:05,961 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.10 03:23:04" (2/4) ... [2024-10-29 15:23:05,961 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36eb7bb9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.10 03:23:05, skipping insertion in model container [2024-10-29 15:23:05,961 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 03:23:05" (3/4) ... [2024-10-29 15:23:05,961 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36eb7bb9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.10 03:23:05, skipping insertion in model container [2024-10-29 15:23:05,961 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.10 03:23:05" (4/4) ... [2024-10-29 15:23:05,962 INFO L112 eAbstractionObserver]: Analyzing ICFG 09-regions_28-list2alloc.i [2024-10-29 15:23:05,962 WARN L117 eAbstractionObserver]: Found a witness automaton. I will only consider traces that are accepted by the witness automaton [2024-10-29 15:23:05,977 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-29 15:23:05,977 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 14 error locations. [2024-10-29 15:23:05,977 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-29 15:23:06,022 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-29 15:23:06,038 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:23:06,052 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 181 places, 177 transitions, 358 flow [2024-10-29 15:23:06,120 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 1449 states, 1423 states have (on average 1.9114546732255797) internal successors, (2720), 1448 states have internal predecessors, (2720), 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:23:06,147 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-29 15:23:06,152 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;@534c6832, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-29 15:23:06,153 INFO L334 AbstractCegarLoop]: Starting to check reachability of 21 error locations. [2024-10-29 15:23:06,156 INFO L276 IsEmpty]: Start isEmpty. Operand has 1449 states, 1423 states have (on average 1.9114546732255797) internal successors, (2720), 1448 states have internal predecessors, (2720), 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:23:06,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-10-29 15:23:06,161 INFO L207 NwaCegarLoop]: Found error trace [2024-10-29 15:23:06,162 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] [2024-10-29 15:23:06,163 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2024-10-29 15:23:06,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-29 15:23:06,167 INFO L85 PathProgramCache]: Analyzing trace with hash 1230530595, now seen corresponding path program 1 times [2024-10-29 15:23:06,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-29 15:23:06,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690135301] [2024-10-29 15:23:06,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-29 15:23:06,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-29 15:23:06,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-29 15:23:06,793 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:23:06,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-29 15:23:06,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690135301] [2024-10-29 15:23:06,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690135301] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-29 15:23:06,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-29 15:23:06,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-29 15:23:06,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000751710] [2024-10-29 15:23:06,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-29 15:23:06,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-29 15:23:06,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-29 15:23:06,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-29 15:23:06,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-29 15:23:06,824 INFO L87 Difference]: Start difference. First operand has 1449 states, 1423 states have (on average 1.9114546732255797) internal successors, (2720), 1448 states have internal predecessors, (2720), 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 6 states, 5 states have (on average 7.0) internal successors, (35), 6 states have internal predecessors, (35), 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:23:07,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-29 15:23:07,063 INFO L93 Difference]: Finished difference Result 1449 states and 2720 transitions. [2024-10-29 15:23:07,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-29 15:23:07,065 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.0) internal successors, (35), 6 states have internal predecessors, (35), 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 35 [2024-10-29 15:23:07,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-29 15:23:07,090 INFO L225 Difference]: With dead ends: 1449 [2024-10-29 15:23:07,090 INFO L226 Difference]: Without dead ends: 1447 [2024-10-29 15:23:07,093 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-29 15:23:07,097 INFO L432 NwaCegarLoop]: 159 mSDtfsCounter, 4 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 456 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-29 15:23:07,098 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 456 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-29 15:23:07,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1447 states. [2024-10-29 15:23:07,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1447 to 1447. [2024-10-29 15:23:07,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1447 states, 1423 states have (on average 1.910049191848208) internal successors, (2718), 1446 states have internal predecessors, (2718), 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:23:07,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1447 states to 1447 states and 2718 transitions. [2024-10-29 15:23:07,191 INFO L78 Accepts]: Start accepts. Automaton has 1447 states and 2718 transitions. Word has length 35 [2024-10-29 15:23:07,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-29 15:23:07,192 INFO L471 AbstractCegarLoop]: Abstraction has 1447 states and 2718 transitions. [2024-10-29 15:23:07,192 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.0) internal successors, (35), 6 states have internal predecessors, (35), 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:23:07,193 INFO L276 IsEmpty]: Start isEmpty. Operand 1447 states and 2718 transitions. [2024-10-29 15:23:07,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-10-29 15:23:07,194 INFO L207 NwaCegarLoop]: Found error trace [2024-10-29 15:23:07,194 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] [2024-10-29 15:23:07,194 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-29 15:23:07,195 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2024-10-29 15:23:07,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-29 15:23:07,197 INFO L85 PathProgramCache]: Analyzing trace with hash 1677527440, now seen corresponding path program 1 times [2024-10-29 15:23:07,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-29 15:23:07,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625960128] [2024-10-29 15:23:07,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-29 15:23:07,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-29 15:23:07,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-29 15:23:07,526 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:23:07,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-29 15:23:07,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625960128] [2024-10-29 15:23:07,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625960128] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-29 15:23:07,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-29 15:23:07,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-29 15:23:07,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992460775] [2024-10-29 15:23:07,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-29 15:23:07,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-29 15:23:07,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-29 15:23:07,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-29 15:23:07,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-29 15:23:07,531 INFO L87 Difference]: Start difference. First operand 1447 states and 2718 transitions. Second operand has 6 states, 5 states have (on average 8.6) internal successors, (43), 6 states have internal predecessors, (43), 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:23:07,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-29 15:23:07,666 INFO L93 Difference]: Finished difference Result 1447 states and 2718 transitions. [2024-10-29 15:23:07,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-29 15:23:07,666 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.6) internal successors, (43), 6 states have internal predecessors, (43), 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 43 [2024-10-29 15:23:07,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-29 15:23:07,672 INFO L225 Difference]: With dead ends: 1447 [2024-10-29 15:23:07,673 INFO L226 Difference]: Without dead ends: 1445 [2024-10-29 15:23:07,673 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-29 15:23:07,674 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 4 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-29 15:23:07,675 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 355 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-29 15:23:07,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1445 states. [2024-10-29 15:23:07,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1445 to 1445. [2024-10-29 15:23:07,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1445 states, 1423 states have (on average 1.9086437104708363) internal successors, (2716), 1444 states have internal predecessors, (2716), 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:23:07,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1445 states to 1445 states and 2716 transitions. [2024-10-29 15:23:07,702 INFO L78 Accepts]: Start accepts. Automaton has 1445 states and 2716 transitions. Word has length 43 [2024-10-29 15:23:07,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-29 15:23:07,702 INFO L471 AbstractCegarLoop]: Abstraction has 1445 states and 2716 transitions. [2024-10-29 15:23:07,702 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.6) internal successors, (43), 6 states have internal predecessors, (43), 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:23:07,702 INFO L276 IsEmpty]: Start isEmpty. Operand 1445 states and 2716 transitions. [2024-10-29 15:23:07,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-10-29 15:23:07,703 INFO L207 NwaCegarLoop]: Found error trace [2024-10-29 15:23:07,703 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] [2024-10-29 15:23:07,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-29 15:23:07,703 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2024-10-29 15:23:07,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-29 15:23:07,704 INFO L85 PathProgramCache]: Analyzing trace with hash 1607055914, now seen corresponding path program 1 times [2024-10-29 15:23:07,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-29 15:23:07,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742002258] [2024-10-29 15:23:07,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-29 15:23:07,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-29 15:23:07,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-29 15:23:07,736 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:23:07,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-29 15:23:07,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742002258] [2024-10-29 15:23:07,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742002258] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-29 15:23:07,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-29 15:23:07,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-29 15:23:07,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211076250] [2024-10-29 15:23:07,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-29 15:23:07,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-29 15:23:07,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-29 15:23:07,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-29 15:23:07,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-29 15:23:07,738 INFO L87 Difference]: Start difference. First operand 1445 states and 2716 transitions. Second operand has 3 states, 2 states have (on average 26.0) internal successors, (52), 3 states have internal predecessors, (52), 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:23:07,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-29 15:23:07,763 INFO L93 Difference]: Finished difference Result 1445 states and 2716 transitions. [2024-10-29 15:23:07,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-29 15:23:07,763 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 26.0) internal successors, (52), 3 states have internal predecessors, (52), 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 52 [2024-10-29 15:23:07,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-29 15:23:07,769 INFO L225 Difference]: With dead ends: 1445 [2024-10-29 15:23:07,769 INFO L226 Difference]: Without dead ends: 1444 [2024-10-29 15:23:07,770 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:23:07,770 INFO L432 NwaCegarLoop]: 163 mSDtfsCounter, 2 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-29 15:23:07,771 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 314 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-29 15:23:07,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1444 states. [2024-10-29 15:23:07,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1444 to 1444. [2024-10-29 15:23:07,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1444 states, 1423 states have (on average 1.9079409697821503) internal successors, (2715), 1443 states have internal predecessors, (2715), 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:23:07,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1444 states to 1444 states and 2715 transitions. [2024-10-29 15:23:07,806 INFO L78 Accepts]: Start accepts. Automaton has 1444 states and 2715 transitions. Word has length 52 [2024-10-29 15:23:07,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-29 15:23:07,808 INFO L471 AbstractCegarLoop]: Abstraction has 1444 states and 2715 transitions. [2024-10-29 15:23:07,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 26.0) internal successors, (52), 3 states have internal predecessors, (52), 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:23:07,808 INFO L276 IsEmpty]: Start isEmpty. Operand 1444 states and 2715 transitions. [2024-10-29 15:23:07,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-10-29 15:23:07,811 INFO L207 NwaCegarLoop]: Found error trace [2024-10-29 15:23:07,811 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] [2024-10-29 15:23:07,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-29 15:23:07,811 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2024-10-29 15:23:07,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-29 15:23:07,812 INFO L85 PathProgramCache]: Analyzing trace with hash -438055570, now seen corresponding path program 1 times [2024-10-29 15:23:07,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-29 15:23:07,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582869845] [2024-10-29 15:23:07,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-29 15:23:07,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-29 15:23:07,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-29 15:23:07,866 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:23:07,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-29 15:23:07,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582869845] [2024-10-29 15:23:07,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582869845] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-29 15:23:07,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-29 15:23:07,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-29 15:23:07,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038485891] [2024-10-29 15:23:07,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-29 15:23:07,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-29 15:23:07,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-29 15:23:07,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-29 15:23:07,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-29 15:23:07,868 INFO L87 Difference]: Start difference. First operand 1444 states and 2715 transitions. Second operand has 3 states, 2 states have (on average 42.5) internal successors, (85), 3 states have internal predecessors, (85), 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:23:07,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-29 15:23:07,889 INFO L93 Difference]: Finished difference Result 1444 states and 2715 transitions. [2024-10-29 15:23:07,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-29 15:23:07,889 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 42.5) internal successors, (85), 3 states have internal predecessors, (85), 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 85 [2024-10-29 15:23:07,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-29 15:23:07,895 INFO L225 Difference]: With dead ends: 1444 [2024-10-29 15:23:07,895 INFO L226 Difference]: Without dead ends: 1443 [2024-10-29 15:23:07,896 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:23:07,896 INFO L432 NwaCegarLoop]: 162 mSDtfsCounter, 2 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-29 15:23:07,897 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 315 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-29 15:23:07,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1443 states. [2024-10-29 15:23:07,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1443 to 1443. [2024-10-29 15:23:07,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1443 states, 1423 states have (on average 1.9072382290934644) internal successors, (2714), 1442 states have internal predecessors, (2714), 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:23:07,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1443 states to 1443 states and 2714 transitions. [2024-10-29 15:23:07,918 INFO L78 Accepts]: Start accepts. Automaton has 1443 states and 2714 transitions. Word has length 85 [2024-10-29 15:23:07,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-29 15:23:07,918 INFO L471 AbstractCegarLoop]: Abstraction has 1443 states and 2714 transitions. [2024-10-29 15:23:07,918 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 42.5) internal successors, (85), 3 states have internal predecessors, (85), 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:23:07,919 INFO L276 IsEmpty]: Start isEmpty. Operand 1443 states and 2714 transitions. [2024-10-29 15:23:07,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-10-29 15:23:07,920 INFO L207 NwaCegarLoop]: Found error trace [2024-10-29 15:23:07,920 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] [2024-10-29 15:23:07,920 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-29 15:23:07,920 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2024-10-29 15:23:07,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-29 15:23:07,921 INFO L85 PathProgramCache]: Analyzing trace with hash 5804600, now seen corresponding path program 1 times [2024-10-29 15:23:07,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-29 15:23:07,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557785282] [2024-10-29 15:23:07,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-29 15:23:07,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-29 15:23:07,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-29 15:23:07,989 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:23:07,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-29 15:23:07,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557785282] [2024-10-29 15:23:07,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557785282] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-29 15:23:07,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-29 15:23:07,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-29 15:23:07,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684273929] [2024-10-29 15:23:07,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-29 15:23:07,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-29 15:23:07,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-29 15:23:07,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-29 15:23:07,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-29 15:23:07,991 INFO L87 Difference]: Start difference. First operand 1443 states and 2714 transitions. Second operand has 3 states, 2 states have (on average 48.0) internal successors, (96), 3 states have internal predecessors, (96), 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:23:08,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-29 15:23:08,011 INFO L93 Difference]: Finished difference Result 1443 states and 2714 transitions. [2024-10-29 15:23:08,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-29 15:23:08,011 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 48.0) internal successors, (96), 3 states have internal predecessors, (96), 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 96 [2024-10-29 15:23:08,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-29 15:23:08,017 INFO L225 Difference]: With dead ends: 1443 [2024-10-29 15:23:08,017 INFO L226 Difference]: Without dead ends: 1363 [2024-10-29 15:23:08,018 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:23:08,018 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 75 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-29 15:23:08,019 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 261 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-29 15:23:08,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1363 states. [2024-10-29 15:23:08,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1363 to 1363. [2024-10-29 15:23:08,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1363 states, 1352 states have (on average 1.8905325443786982) internal successors, (2556), 1362 states have internal predecessors, (2556), 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:23:08,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1363 states to 1363 states and 2556 transitions. [2024-10-29 15:23:08,040 INFO L78 Accepts]: Start accepts. Automaton has 1363 states and 2556 transitions. Word has length 96 [2024-10-29 15:23:08,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-29 15:23:08,041 INFO L471 AbstractCegarLoop]: Abstraction has 1363 states and 2556 transitions. [2024-10-29 15:23:08,041 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 48.0) internal successors, (96), 3 states have internal predecessors, (96), 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:23:08,041 INFO L276 IsEmpty]: Start isEmpty. Operand 1363 states and 2556 transitions. [2024-10-29 15:23:08,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-10-29 15:23:08,042 INFO L207 NwaCegarLoop]: Found error trace [2024-10-29 15:23:08,042 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] [2024-10-29 15:23:08,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-29 15:23:08,043 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2024-10-29 15:23:08,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-29 15:23:08,043 INFO L85 PathProgramCache]: Analyzing trace with hash 471380028, now seen corresponding path program 1 times [2024-10-29 15:23:08,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-29 15:23:08,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42208722] [2024-10-29 15:23:08,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-29 15:23:08,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-29 15:23:08,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-29 15:23:08,385 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:23:08,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-29 15:23:08,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42208722] [2024-10-29 15:23:08,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42208722] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-29 15:23:08,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-29 15:23:08,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-29 15:23:08,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970087547] [2024-10-29 15:23:08,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-29 15:23:08,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-29 15:23:08,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-29 15:23:08,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-29 15:23:08,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-29 15:23:08,387 INFO L87 Difference]: Start difference. First operand 1363 states and 2556 transitions. Second operand has 6 states, 5 states have (on average 20.4) internal successors, (102), 6 states have internal predecessors, (102), 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:23:08,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-29 15:23:08,540 INFO L93 Difference]: Finished difference Result 1462 states and 2745 transitions. [2024-10-29 15:23:08,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-29 15:23:08,541 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 20.4) internal successors, (102), 6 states have internal predecessors, (102), 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 102 [2024-10-29 15:23:08,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-29 15:23:08,548 INFO L225 Difference]: With dead ends: 1462 [2024-10-29 15:23:08,548 INFO L226 Difference]: Without dead ends: 1438 [2024-10-29 15:23:08,549 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-29 15:23:08,551 INFO L432 NwaCegarLoop]: 211 mSDtfsCounter, 84 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-29 15:23:08,551 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 479 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-29 15:23:08,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1438 states. [2024-10-29 15:23:08,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1438 to 1394. [2024-10-29 15:23:08,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1394 states, 1383 states have (on average 1.8900939985538685) internal successors, (2614), 1393 states have internal predecessors, (2614), 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:23:08,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1394 states to 1394 states and 2614 transitions. [2024-10-29 15:23:08,576 INFO L78 Accepts]: Start accepts. Automaton has 1394 states and 2614 transitions. Word has length 102 [2024-10-29 15:23:08,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-29 15:23:08,576 INFO L471 AbstractCegarLoop]: Abstraction has 1394 states and 2614 transitions. [2024-10-29 15:23:08,576 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 20.4) internal successors, (102), 6 states have internal predecessors, (102), 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:23:08,577 INFO L276 IsEmpty]: Start isEmpty. Operand 1394 states and 2614 transitions. [2024-10-29 15:23:08,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-10-29 15:23:08,580 INFO L207 NwaCegarLoop]: Found error trace [2024-10-29 15:23:08,580 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] [2024-10-29 15:23:08,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-29 15:23:08,580 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2024-10-29 15:23:08,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-29 15:23:08,580 INFO L85 PathProgramCache]: Analyzing trace with hash -2145989061, now seen corresponding path program 1 times [2024-10-29 15:23:08,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-29 15:23:08,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013803477] [2024-10-29 15:23:08,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-29 15:23:08,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-29 15:23:08,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-29 15:23:08,918 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:23:08,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-29 15:23:08,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013803477] [2024-10-29 15:23:08,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1013803477] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-29 15:23:08,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-29 15:23:08,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-29 15:23:08,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770281090] [2024-10-29 15:23:08,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-29 15:23:08,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-29 15:23:08,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-29 15:23:08,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-29 15:23:08,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-29 15:23:08,920 INFO L87 Difference]: Start difference. First operand 1394 states and 2614 transitions. Second operand has 6 states, 5 states have (on average 21.6) internal successors, (108), 6 states have internal predecessors, (108), 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:23:09,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-29 15:23:09,236 INFO L93 Difference]: Finished difference Result 1680 states and 3168 transitions. [2024-10-29 15:23:09,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-29 15:23:09,237 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 21.6) internal successors, (108), 6 states have internal predecessors, (108), 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 108 [2024-10-29 15:23:09,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-29 15:23:09,245 INFO L225 Difference]: With dead ends: 1680 [2024-10-29 15:23:09,246 INFO L226 Difference]: Without dead ends: 1485 [2024-10-29 15:23:09,247 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-29 15:23:09,248 INFO L432 NwaCegarLoop]: 261 mSDtfsCounter, 154 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 426 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 573 SdHoareTripleChecker+Invalid, 428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 426 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-29 15:23:09,249 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 573 Invalid, 428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 426 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-29 15:23:09,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1485 states. [2024-10-29 15:23:09,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1485 to 1442. [2024-10-29 15:23:09,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1442 states, 1431 states have (on average 1.8909853249475892) internal successors, (2706), 1441 states have internal predecessors, (2706), 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:23:09,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1442 states to 1442 states and 2706 transitions. [2024-10-29 15:23:09,282 INFO L78 Accepts]: Start accepts. Automaton has 1442 states and 2706 transitions. Word has length 108 [2024-10-29 15:23:09,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-29 15:23:09,282 INFO L471 AbstractCegarLoop]: Abstraction has 1442 states and 2706 transitions. [2024-10-29 15:23:09,282 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 21.6) internal successors, (108), 6 states have internal predecessors, (108), 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:23:09,283 INFO L276 IsEmpty]: Start isEmpty. Operand 1442 states and 2706 transitions. [2024-10-29 15:23:09,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-10-29 15:23:09,284 INFO L207 NwaCegarLoop]: Found error trace [2024-10-29 15:23:09,284 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] [2024-10-29 15:23:09,284 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-29 15:23:09,285 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2024-10-29 15:23:09,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-29 15:23:09,285 INFO L85 PathProgramCache]: Analyzing trace with hash -2142416959, now seen corresponding path program 1 times [2024-10-29 15:23:09,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-29 15:23:09,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34854367] [2024-10-29 15:23:09,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-29 15:23:09,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-29 15:23:09,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-29 15:23:09,621 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:23:09,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-29 15:23:09,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34854367] [2024-10-29 15:23:09,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [34854367] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-29 15:23:09,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-29 15:23:09,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-29 15:23:09,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356816541] [2024-10-29 15:23:09,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-29 15:23:09,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-29 15:23:09,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-29 15:23:09,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-29 15:23:09,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-29 15:23:09,623 INFO L87 Difference]: Start difference. First operand 1442 states and 2706 transitions. Second operand has 6 states, 5 states have (on average 22.0) internal successors, (110), 6 states have internal predecessors, (110), 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:23:09,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-29 15:23:09,737 INFO L93 Difference]: Finished difference Result 1542 states and 2894 transitions. [2024-10-29 15:23:09,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-29 15:23:09,737 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 22.0) internal successors, (110), 6 states have internal predecessors, (110), 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 110 [2024-10-29 15:23:09,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-29 15:23:09,743 INFO L225 Difference]: With dead ends: 1542 [2024-10-29 15:23:09,744 INFO L226 Difference]: Without dead ends: 1514 [2024-10-29 15:23:09,744 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-29 15:23:09,745 INFO L432 NwaCegarLoop]: 213 mSDtfsCounter, 85 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-29 15:23:09,745 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 373 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-29 15:23:09,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1514 states. [2024-10-29 15:23:09,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1514 to 1472. [2024-10-29 15:23:09,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1472 states, 1461 states have (on average 1.890485968514716) internal successors, (2762), 1471 states have internal predecessors, (2762), 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:23:09,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1472 states to 1472 states and 2762 transitions. [2024-10-29 15:23:09,770 INFO L78 Accepts]: Start accepts. Automaton has 1472 states and 2762 transitions. Word has length 110 [2024-10-29 15:23:09,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-29 15:23:09,771 INFO L471 AbstractCegarLoop]: Abstraction has 1472 states and 2762 transitions. [2024-10-29 15:23:09,771 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 22.0) internal successors, (110), 6 states have internal predecessors, (110), 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:23:09,771 INFO L276 IsEmpty]: Start isEmpty. Operand 1472 states and 2762 transitions. [2024-10-29 15:23:09,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-10-29 15:23:09,772 INFO L207 NwaCegarLoop]: Found error trace [2024-10-29 15:23:09,772 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] [2024-10-29 15:23:09,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-29 15:23:09,772 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2024-10-29 15:23:09,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-29 15:23:09,773 INFO L85 PathProgramCache]: Analyzing trace with hash 1079059043, now seen corresponding path program 1 times [2024-10-29 15:23:09,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-29 15:23:09,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968445458] [2024-10-29 15:23:09,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-29 15:23:09,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-29 15:23:09,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-29 15:23:09,850 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:23:09,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-29 15:23:09,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968445458] [2024-10-29 15:23:09,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968445458] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-29 15:23:09,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-29 15:23:09,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-29 15:23:09,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457692600] [2024-10-29 15:23:09,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-29 15:23:09,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-29 15:23:09,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-29 15:23:09,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-29 15:23:09,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-29 15:23:09,852 INFO L87 Difference]: Start difference. First operand 1472 states and 2762 transitions. Second operand has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 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:23:09,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-29 15:23:09,882 INFO L93 Difference]: Finished difference Result 2530 states and 4793 transitions. [2024-10-29 15:23:09,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-29 15:23:09,883 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 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 115 [2024-10-29 15:23:09,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-29 15:23:09,889 INFO L225 Difference]: With dead ends: 2530 [2024-10-29 15:23:09,889 INFO L226 Difference]: Without dead ends: 1367 [2024-10-29 15:23:09,893 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:23:09,894 INFO L432 NwaCegarLoop]: 198 mSDtfsCounter, 62 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-29 15:23:09,894 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 327 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-29 15:23:09,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1367 states. [2024-10-29 15:23:09,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1367 to 1367. [2024-10-29 15:23:09,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1367 states, 1356 states have (on average 1.8628318584070795) internal successors, (2526), 1366 states have internal predecessors, (2526), 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:23:09,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1367 states to 1367 states and 2526 transitions. [2024-10-29 15:23:09,917 INFO L78 Accepts]: Start accepts. Automaton has 1367 states and 2526 transitions. Word has length 115 [2024-10-29 15:23:09,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-29 15:23:09,918 INFO L471 AbstractCegarLoop]: Abstraction has 1367 states and 2526 transitions. [2024-10-29 15:23:09,918 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 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:23:09,918 INFO L276 IsEmpty]: Start isEmpty. Operand 1367 states and 2526 transitions. [2024-10-29 15:23:09,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-10-29 15:23:09,919 INFO L207 NwaCegarLoop]: Found error trace [2024-10-29 15:23:09,919 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] [2024-10-29 15:23:09,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-29 15:23:09,919 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2024-10-29 15:23:09,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-29 15:23:09,920 INFO L85 PathProgramCache]: Analyzing trace with hash -651737647, now seen corresponding path program 2 times [2024-10-29 15:23:09,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-29 15:23:09,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879956196] [2024-10-29 15:23:09,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-29 15:23:09,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-29 15:23:09,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-29 15:23:09,975 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-29 15:23:09,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-29 15:23:10,024 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-29 15:23:10,025 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-29 15:23:10,025 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (20 of 21 remaining) [2024-10-29 15:23:10,026 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (19 of 21 remaining) [2024-10-29 15:23:10,027 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (18 of 21 remaining) [2024-10-29 15:23:10,027 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (17 of 21 remaining) [2024-10-29 15:23:10,027 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (16 of 21 remaining) [2024-10-29 15:23:10,027 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (15 of 21 remaining) [2024-10-29 15:23:10,027 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (14 of 21 remaining) [2024-10-29 15:23:10,027 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (13 of 21 remaining) [2024-10-29 15:23:10,027 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 21 remaining) [2024-10-29 15:23:10,028 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (11 of 21 remaining) [2024-10-29 15:23:10,028 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (10 of 21 remaining) [2024-10-29 15:23:10,028 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (9 of 21 remaining) [2024-10-29 15:23:10,028 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (8 of 21 remaining) [2024-10-29 15:23:10,028 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONDATA_RACE (7 of 21 remaining) [2024-10-29 15:23:10,028 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5ASSERT_VIOLATIONDATA_RACE (6 of 21 remaining) [2024-10-29 15:23:10,028 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (5 of 21 remaining) [2024-10-29 15:23:10,029 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (4 of 21 remaining) [2024-10-29 15:23:10,029 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (3 of 21 remaining) [2024-10-29 15:23:10,029 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (2 of 21 remaining) [2024-10-29 15:23:10,029 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONDATA_RACE (1 of 21 remaining) [2024-10-29 15:23:10,029 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5ASSERT_VIOLATIONDATA_RACE (0 of 21 remaining) [2024-10-29 15:23:10,029 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-29 15:23:10,031 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-29 15:23:10,094 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-10-29 15:23:10,094 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-10-29 15:23:10,096 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.10 03:23:10 BasicIcfg [2024-10-29 15:23:10,096 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-29 15:23:10,097 INFO L158 Benchmark]: Toolchain (without parser) took 5281.77ms. Allocated memory was 192.9MB in the beginning and 350.2MB in the end (delta: 157.3MB). Free memory was 119.6MB in the beginning and 144.2MB in the end (delta: -24.6MB). Peak memory consumption was 133.0MB. Max. memory is 16.1GB. [2024-10-29 15:23:10,097 INFO L158 Benchmark]: Witness Parser took 0.17ms. Allocated memory is still 192.9MB. Free memory is still 153.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-29 15:23:10,097 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 192.9MB. Free memory is still 166.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-29 15:23:10,097 INFO L158 Benchmark]: CACSL2BoogieTranslator took 627.97ms. Allocated memory is still 192.9MB. Free memory was 119.3MB in the beginning and 152.2MB in the end (delta: -32.9MB). Peak memory consumption was 40.0MB. Max. memory is 16.1GB. [2024-10-29 15:23:10,097 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.46ms. Allocated memory is still 192.9MB. Free memory was 152.2MB in the beginning and 149.1MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-29 15:23:10,098 INFO L158 Benchmark]: Boogie Preprocessor took 25.66ms. Allocated memory is still 192.9MB. Free memory was 149.1MB in the beginning and 146.0MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-29 15:23:10,098 INFO L158 Benchmark]: RCFGBuilder took 433.06ms. Allocated memory is still 192.9MB. Free memory was 146.0MB in the beginning and 120.8MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-10-29 15:23:10,098 INFO L158 Benchmark]: TraceAbstraction took 4139.78ms. Allocated memory was 192.9MB in the beginning and 350.2MB in the end (delta: 157.3MB). Free memory was 119.7MB in the beginning and 144.2MB in the end (delta: -24.4MB). Peak memory consumption was 135.0MB. Max. memory is 16.1GB. [2024-10-29 15:23:10,099 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Witness Parser took 0.17ms. Allocated memory is still 192.9MB. Free memory is still 153.6MB. There was no memory consumed. Max. memory is 16.1GB. * CDTParser took 0.13ms. Allocated memory is still 192.9MB. Free memory is still 166.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 627.97ms. Allocated memory is still 192.9MB. Free memory was 119.3MB in the beginning and 152.2MB in the end (delta: -32.9MB). Peak memory consumption was 40.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.46ms. Allocated memory is still 192.9MB. Free memory was 152.2MB in the beginning and 149.1MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 25.66ms. Allocated memory is still 192.9MB. Free memory was 149.1MB in the beginning and 146.0MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 433.06ms. Allocated memory is still 192.9MB. Free memory was 146.0MB in the beginning and 120.8MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 4139.78ms. Allocated memory was 192.9MB in the beginning and 350.2MB in the end (delta: 157.3MB). Free memory was 119.7MB in the beginning and 144.2MB in the end (delta: -24.4MB). Peak memory consumption was 135.0MB. Max. memory is 16.1GB. * 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: 1253]: Data race detected Data race detected The following path leads to a data race: [L1223-L1226] 0 struct s { int datum; struct s *next; } *A, *B; VAL [A={0:0}, B={0:0}] [L1233] 0 pthread_mutex_t A_mutex = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; VAL [A={0:0}, A_mutex={1:0}, B={0:0}] [L1234] 0 pthread_mutex_t B_mutex = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; VAL [A={0:0}, A_mutex={1:0}, B={0:0}, B_mutex={2:0}] [L1245] 0 pthread_t t1; [L1246] CALL, EXPR 0 new(3) [L1228] 0 struct s *p = malloc(sizeof(struct s)); VAL [A={0:0}, A_mutex={1:0}, B={0:0}, B_mutex={2:0}, \old(x)=3, p={-2:0}, x=3] [L1229] 0 p->datum = x VAL [A={0:0}, A_mutex={1:0}, B={0:0}, B_mutex={2:0}, \old(x)=3, p={-2:0}, x=3] [L1230] 0 p->next = ((void *)0) VAL [A={0:0}, A_mutex={1:0}, B={0:0}, B_mutex={2:0}, \old(x)=3, p={-2:0}, x=3] [L1231] 0 return p; VAL [A={0:0}, A_mutex={1:0}, B={0:0}, B_mutex={2:0}, \old(x)=3, \result={-2:0}, p={-2:0}, x=3] [L1246] RET, EXPR 0 new(3) [L1246] 0 A = new(3) VAL [A={-2:0}, A_mutex={1:0}, B={0:0}, B_mutex={2:0}] [L1247] CALL, EXPR 0 new(5) [L1228] 0 struct s *p = malloc(sizeof(struct s)); VAL [A={-2:0}, A_mutex={1:0}, B={0:0}, B_mutex={2:0}, \old(x)=5, p={-3:0}, x=5] [L1229] 0 p->datum = x VAL [A={-2:0}, A_mutex={1:0}, B={0:0}, B_mutex={2:0}, \old(x)=5, p={-3:0}, x=5] [L1230] 0 p->next = ((void *)0) VAL [A={-2:0}, A_mutex={1:0}, B={0:0}, B_mutex={2:0}, \old(x)=5, p={-3:0}, x=5] [L1231] 0 return p; VAL [A={-2:0}, A_mutex={1:0}, B={0:0}, B_mutex={2:0}, \old(x)=5, \result={-3:0}, p={-3:0}, x=5] [L1247] RET, EXPR 0 new(5) [L1247] 0 B = new(5) VAL [A={-2:0}, A_mutex={1:0}, B={-3:0}, B_mutex={2:0}] [L1248] FCALL, FORK 0 pthread_create(&t1, ((void *)0), t_fun, ((void *)0)) VAL [A={-2:0}, A_mutex={1:0}, B={-3:0}, B_mutex={2:0}, \old(arg)={0:0}, t1=-1] [L1249] 0 int *data; VAL [A={-2:0}, A_mutex={1:0}, B={-3:0}, B_mutex={2:0}, \old(arg)={0:0}, t1=-1] [L1251] EXPR 0 A->datum VAL [A={-2:0}, A_mutex={1:0}, B={-3:0}, B_mutex={2:0}, \old(arg)={0:0}, arg={0:0}, t1=-1] [L1251] 0 data = &A->datum VAL [A={-2:0}, A_mutex={1:0}, B={-3:0}, B_mutex={2:0}, \old(arg)={0:0}, arg={0:0}, data={-2:0}, t1=-1] [L1253] 0 *data = 42 VAL [A={-2:0}, A_mutex={1:0}, B={-3:0}, B_mutex={2:0}, \old(arg)={0:0}, arg={0:0}, data={-2:0}, t1=-1] [L1237] EXPR 1 A->datum VAL [A={-2:0}, A_mutex={1:0}, B={-3:0}, B_mutex={2:0}, \old(arg)={0:0}, arg={0:0}] [L1237] 1 A->datum++ VAL [A={-2:0}, A_mutex={1:0}, B={-3:0}, B_mutex={2:0}, \old(arg)={0:0}, arg={0:0}] [L1253] 0 *data = 42 VAL [A={-2:0}, A_mutex={1:0}, B={-3:0}, B_mutex={2:0}, \old(arg)={0:0}, arg={0:0}, data={-2:0}, t1=-1] Now there is a data race, but we were unable to determine exactly which statements and variables are involved. There could be a race between one of the statements * C: p->datum = x [1229] * C: p->next = ((void *)0) [1230] * C: A->datum++ [1237] * C: p->next = ((void *)0) [1230] * C: p->datum = x [1229] * C: p->datum = x [1229] * C: p->datum = x [1229] * C: A->datum [1237] * C: p->next = ((void *)0) [1230] * C: p->next = ((void *)0) [1230] * C: A = new(3) [1246] * C: B = new(5) [1247] * C: A->datum [1251] and C: *data = 42 [1253] - UnprovableResult [Line: 1229]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1230]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1246]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1229]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1230]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1247]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1251]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1248]: 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: 1237]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1237]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1237]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1240]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1240]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1240]: 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, 235 locations, 21 error locations. Started 1 CEGAR loops. OverallTime: 4.0s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 472 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 472 mSDsluCounter, 3453 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1762 mSDsCounter, 25 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1249 IncrementalHoareTripleChecker+Invalid, 1274 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 25 mSolverCounterUnsat, 1691 mSDtfsCounter, 1249 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 39 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1472occurred in iteration=8, InterpolantAutomatonStates: 42, 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, 9 MinimizatonAttempts, 129 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 861 NumberOfCodeBlocks, 861 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 737 ConstructedInterpolants, 0 QuantifiedInterpolants, 1174 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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 RESULT: Ultimate proved your program to be incorrect! [2024-10-29 15:23:10,121 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