./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-race-challenges/value-barrier-race.i --full-output --witness-type violation_witness --validate ../results-verified/LOGDIR/SV-COMP24_no-data-race/value-barrier-race.yml/witness.graphml --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 194c01fd Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../sv-benchmarks/c/pthread-race-challenges/value-barrier-race.i ../results-verified/LOGDIR/SV-COMP24_no-data-race/value-barrier-race.yml/witness.graphml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.positions.where.we.compute.the.hoare.annotation None --- Real Ultimate output --- This is Ultimate 0.2.5-dev-194c01f-m [2024-10-29 15:24:20,990 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-29 15:24:21,045 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-10-29 15:24:21,050 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-29 15:24:21,052 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-29 15:24:21,076 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-29 15:24:21,078 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-29 15:24:21,078 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-29 15:24:21,079 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-29 15:24:21,082 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-29 15:24:21,082 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-29 15:24:21,083 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-29 15:24:21,083 INFO L153 SettingsManager]: * Use SBE=true [2024-10-29 15:24:21,083 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-29 15:24:21,083 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-29 15:24:21,083 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-29 15:24:21,083 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-29 15:24:21,084 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-29 15:24:21,084 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-29 15:24:21,084 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-29 15:24:21,084 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-29 15:24:21,087 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-29 15:24:21,087 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-10-29 15:24:21,087 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-29 15:24:21,087 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-29 15:24:21,087 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-29 15:24:21,087 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-29 15:24:21,088 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-29 15:24:21,088 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-29 15:24:21,088 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-29 15:24:21,089 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-29 15:24:21,089 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-29 15:24:21,089 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-29 15:24:21,089 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-29 15:24:21,090 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-29 15:24:21,090 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-29 15:24:21,090 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-29 15:24:21,090 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-29 15:24:21,090 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-29 15:24:21,090 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-29 15:24:21,091 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-29 15:24:21,091 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> None [2024-10-29 15:24:21,340 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-29 15:24:21,361 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-29 15:24:21,363 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-29 15:24:21,364 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-29 15:24:21,364 INFO L274 PluginConnector]: CDTParser initialized [2024-10-29 15:24:21,365 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-race-challenges/value-barrier-race.i [2024-10-29 15:24:22,825 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-29 15:24:22,996 INFO L384 CDTParser]: Found 1 translation units. [2024-10-29 15:24:22,997 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-race-challenges/value-barrier-race.i [2024-10-29 15:24:23,009 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/202163103/6e59872206284b3eac2fe6d443f9674a/FLAG4dbc297f6 [2024-10-29 15:24:23,020 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/202163103/6e59872206284b3eac2fe6d443f9674a [2024-10-29 15:24:23,022 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-10-29 15:24:23,023 INFO L274 PluginConnector]: Witness Parser initialized [2024-10-29 15:24:23,023 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../results-verified/LOGDIR/SV-COMP24_no-data-race/value-barrier-race.yml/witness.graphml [2024-10-29 15:24:23,074 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-29 15:24:23,075 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-10-29 15:24:23,076 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-29 15:24:23,077 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-29 15:24:23,080 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-29 15:24:23,081 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.10 03:24:23" (1/2) ... [2024-10-29 15:24:23,082 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@638e3635 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 03:24:23, skipping insertion in model container [2024-10-29 15:24:23,082 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.10 03:24:23" (1/2) ... [2024-10-29 15:24:23,082 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@50cf2461 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 03:24:23, skipping insertion in model container [2024-10-29 15:24:23,082 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.graphml de.uni_freiburg.informatik.ultimate.witnessparser VIOLATION_WITNESS 29.10 03:24:23" (2/2) ... [2024-10-29 15:24:23,083 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@638e3635 and model type witness.graphml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 29.10 03:24:23, skipping insertion in model container [2024-10-29 15:24:23,083 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.graphml de.uni_freiburg.informatik.ultimate.witnessparser VIOLATION_WITNESS 29.10 03:24:23" (2/2) ... [2024-10-29 15:24:23,115 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-29 15:24:23,552 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-29 15:24:23,559 INFO L200 MainTranslator]: Completed pre-run [2024-10-29 15:24:23,611 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-29 15:24:23,660 INFO L204 MainTranslator]: Completed translation [2024-10-29 15:24:23,661 INFO L201 PluginConnector]: Adding new model witness.graphml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 29.10 03:24:23 WrapperNode [2024-10-29 15:24:23,661 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-29 15:24:23,662 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-29 15:24:23,662 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-29 15:24:23,663 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-29 15:24:23,669 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "witness.graphml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 29.10 03:24:23" (1/1) ... [2024-10-29 15:24:23,686 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "witness.graphml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 29.10 03:24:23" (1/1) ... [2024-10-29 15:24:23,712 INFO L138 Inliner]: procedures = 261, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 72 [2024-10-29 15:24:23,713 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-29 15:24:23,714 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-29 15:24:23,714 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-29 15:24:23,714 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-29 15:24:23,722 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.graphml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 29.10 03:24:23" (1/1) ... [2024-10-29 15:24:23,722 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.graphml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 29.10 03:24:23" (1/1) ... [2024-10-29 15:24:23,724 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.graphml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 29.10 03:24:23" (1/1) ... [2024-10-29 15:24:23,726 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.graphml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 29.10 03:24:23" (1/1) ... [2024-10-29 15:24:23,733 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.graphml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 29.10 03:24:23" (1/1) ... [2024-10-29 15:24:23,736 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.graphml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 29.10 03:24:23" (1/1) ... [2024-10-29 15:24:23,737 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.graphml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 29.10 03:24:23" (1/1) ... [2024-10-29 15:24:23,738 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.graphml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 29.10 03:24:23" (1/1) ... [2024-10-29 15:24:23,740 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-29 15:24:23,740 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-29 15:24:23,741 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-29 15:24:23,741 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-29 15:24:23,741 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.graphml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 29.10 03:24:23" (1/1) ... [2024-10-29 15:24:23,746 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-29 15:24:23,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-29 15:24:23,768 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-29 15:24:23,773 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-29 15:24:23,810 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-29 15:24:23,810 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-10-29 15:24:23,811 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-10-29 15:24:23,811 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-29 15:24:23,811 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2024-10-29 15:24:23,811 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2024-10-29 15:24:23,811 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-29 15:24:23,811 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-29 15:24:23,812 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-29 15:24:23,914 INFO L238 CfgBuilder]: Building ICFG [2024-10-29 15:24:23,916 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-29 15:24:24,076 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-29 15:24:24,076 INFO L287 CfgBuilder]: Performing block encoding [2024-10-29 15:24:24,088 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-29 15:24:24,089 INFO L316 CfgBuilder]: Removed 3 assume(true) statements. [2024-10-29 15:24:24,089 INFO L201 PluginConnector]: Adding new model witness.graphml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.10 03:24:24 BoogieIcfgContainer [2024-10-29 15:24:24,089 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-29 15:24:24,091 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-29 15:24:24,091 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-29 15:24:24,094 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-29 15:24:24,094 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.10 03:24:23" (1/4) ... [2024-10-29 15:24:24,094 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37ec136d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.10 03:24:24, skipping insertion in model container [2024-10-29 15:24:24,095 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.graphml de.uni_freiburg.informatik.ultimate.witnessparser VIOLATION_WITNESS 29.10 03:24:23" (2/4) ... [2024-10-29 15:24:24,098 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37ec136d and model type witness.graphml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction VIOLATION_WITNESS 29.10 03:24:24, skipping insertion in model container [2024-10-29 15:24:24,098 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.graphml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 29.10 03:24:23" (3/4) ... [2024-10-29 15:24:24,098 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37ec136d and model type witness.graphml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction VIOLATION_WITNESS 29.10 03:24:24, skipping insertion in model container [2024-10-29 15:24:24,099 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.graphml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.10 03:24:24" (4/4) ... [2024-10-29 15:24:24,100 INFO L112 eAbstractionObserver]: Analyzing ICFG value-barrier-race.i [2024-10-29 15:24:24,100 WARN L117 eAbstractionObserver]: Found a witness automaton. I will only consider traces that are accepted by the witness automaton [2024-10-29 15:24:24,117 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-29 15:24:24,118 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2024-10-29 15:24:24,118 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-29 15:24:24,153 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-10-29 15:24:24,170 WARN L158 CegarLoopFactory]: Violation witness validation is only supported for CEGAR loops based on FINITE_AUTOMATA. Ignoring concurrency settiong PETRI_NET and switching to FINITE_AUTOMATA. [2024-10-29 15:24:24,183 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 91 places, 94 transitions, 195 flow [2024-10-29 15:24:24,257 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 687 states, 662 states have (on average 2.081570996978852) internal successors, (1378), 686 states have internal predecessors, (1378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-29 15:24:24,289 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-29 15:24:24,294 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;@65cabf8a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-29 15:24:24,295 INFO L334 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2024-10-29 15:24:24,299 INFO L276 IsEmpty]: Start isEmpty. Operand has 687 states, 662 states have (on average 2.081570996978852) internal successors, (1378), 686 states have internal predecessors, (1378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-29 15:24:24,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-29 15:24:24,305 INFO L207 NwaCegarLoop]: Found error trace [2024-10-29 15:24:24,306 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] [2024-10-29 15:24:24,306 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-10-29 15:24:24,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-29 15:24:24,311 INFO L85 PathProgramCache]: Analyzing trace with hash 1537660805, now seen corresponding path program 1 times [2024-10-29 15:24:24,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-29 15:24:24,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774151916] [2024-10-29 15:24:24,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-29 15:24:24,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-29 15:24:24,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-29 15:24:24,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-29 15:24:24,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-29 15:24:24,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774151916] [2024-10-29 15:24:24,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774151916] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-29 15:24:24,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-29 15:24:24,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-29 15:24:24,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563125180] [2024-10-29 15:24:24,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-29 15:24:24,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-29 15:24:24,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-29 15:24:24,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-29 15:24:24,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-29 15:24:24,599 INFO L87 Difference]: Start difference. First operand has 687 states, 662 states have (on average 2.081570996978852) internal successors, (1378), 686 states have internal predecessors, (1378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-29 15:24:24,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-29 15:24:24,654 INFO L93 Difference]: Finished difference Result 1370 states and 2771 transitions. [2024-10-29 15:24:24,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-29 15:24:24,660 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 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 28 [2024-10-29 15:24:24,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-29 15:24:24,675 INFO L225 Difference]: With dead ends: 1370 [2024-10-29 15:24:24,675 INFO L226 Difference]: Without dead ends: 668 [2024-10-29 15:24:24,680 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-29 15:24:24,682 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 13 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-29 15:24:24,683 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 175 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-29 15:24:24,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 668 states. [2024-10-29 15:24:24,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 668 to 656. [2024-10-29 15:24:24,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 656 states, 635 states have (on average 1.9511811023622048) internal successors, (1239), 655 states have internal predecessors, (1239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-29 15:24:24,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 656 states to 656 states and 1239 transitions. [2024-10-29 15:24:24,756 INFO L78 Accepts]: Start accepts. Automaton has 656 states and 1239 transitions. Word has length 28 [2024-10-29 15:24:24,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-29 15:24:24,757 INFO L471 AbstractCegarLoop]: Abstraction has 656 states and 1239 transitions. [2024-10-29 15:24:24,757 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-29 15:24:24,757 INFO L276 IsEmpty]: Start isEmpty. Operand 656 states and 1239 transitions. [2024-10-29 15:24:24,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-10-29 15:24:24,758 INFO L207 NwaCegarLoop]: Found error trace [2024-10-29 15:24:24,758 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] [2024-10-29 15:24:24,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-29 15:24:24,759 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-10-29 15:24:24,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-29 15:24:24,759 INFO L85 PathProgramCache]: Analyzing trace with hash 1216131606, now seen corresponding path program 1 times [2024-10-29 15:24:24,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-29 15:24:24,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590812813] [2024-10-29 15:24:24,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-29 15:24:24,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-29 15:24:24,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-29 15:24:25,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-29 15:24:25,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-29 15:24:25,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590812813] [2024-10-29 15:24:25,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590812813] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-29 15:24:25,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-29 15:24:25,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-29 15:24:25,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880735521] [2024-10-29 15:24:25,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-29 15:24:25,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-29 15:24:25,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-29 15:24:25,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-29 15:24:25,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-29 15:24:25,192 INFO L87 Difference]: Start difference. First operand 656 states and 1239 transitions. Second operand has 6 states, 5 states have (on average 6.0) internal successors, (30), 6 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-29 15:24:25,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-29 15:24:25,262 INFO L93 Difference]: Finished difference Result 656 states and 1239 transitions. [2024-10-29 15:24:25,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-29 15:24:25,262 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.0) internal successors, (30), 6 states have internal predecessors, (30), 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 30 [2024-10-29 15:24:25,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-29 15:24:25,268 INFO L225 Difference]: With dead ends: 656 [2024-10-29 15:24:25,268 INFO L226 Difference]: Without dead ends: 643 [2024-10-29 15:24:25,269 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:24:25,272 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 68 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-29 15:24:25,272 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 248 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-29 15:24:25,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 643 states. [2024-10-29 15:24:25,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 643 to 643. [2024-10-29 15:24:25,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 643 states, 626 states have (on average 1.939297124600639) internal successors, (1214), 642 states have internal predecessors, (1214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-29 15:24:25,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 643 states and 1214 transitions. [2024-10-29 15:24:25,319 INFO L78 Accepts]: Start accepts. Automaton has 643 states and 1214 transitions. Word has length 30 [2024-10-29 15:24:25,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-29 15:24:25,319 INFO L471 AbstractCegarLoop]: Abstraction has 643 states and 1214 transitions. [2024-10-29 15:24:25,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.0) internal successors, (30), 6 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-29 15:24:25,323 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 1214 transitions. [2024-10-29 15:24:25,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-29 15:24:25,324 INFO L207 NwaCegarLoop]: Found error trace [2024-10-29 15:24:25,324 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] [2024-10-29 15:24:25,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-29 15:24:25,324 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-10-29 15:24:25,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-29 15:24:25,325 INFO L85 PathProgramCache]: Analyzing trace with hash 2021984939, now seen corresponding path program 1 times [2024-10-29 15:24:25,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-29 15:24:25,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248969125] [2024-10-29 15:24:25,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-29 15:24:25,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-29 15:24:25,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-29 15:24:25,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-29 15:24:25,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-29 15:24:25,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248969125] [2024-10-29 15:24:25,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248969125] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-29 15:24:25,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-29 15:24:25,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-29 15:24:25,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664982410] [2024-10-29 15:24:25,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-29 15:24:25,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-29 15:24:25,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-29 15:24:25,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-29 15:24:25,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-29 15:24:25,365 INFO L87 Difference]: Start difference. First operand 643 states and 1214 transitions. Second operand has 3 states, 2 states have (on average 17.0) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-29 15:24:25,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-29 15:24:25,413 INFO L93 Difference]: Finished difference Result 877 states and 1659 transitions. [2024-10-29 15:24:25,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-29 15:24:25,413 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 17.0) internal successors, (34), 3 states have internal predecessors, (34), 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 34 [2024-10-29 15:24:25,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-29 15:24:25,418 INFO L225 Difference]: With dead ends: 877 [2024-10-29 15:24:25,418 INFO L226 Difference]: Without dead ends: 827 [2024-10-29 15:24:25,419 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-29 15:24:25,419 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 63 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-29 15:24:25,421 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 212 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-29 15:24:25,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 827 states. [2024-10-29 15:24:25,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 827 to 633. [2024-10-29 15:24:25,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 633 states, 617 states have (on average 1.9335494327390599) internal successors, (1193), 632 states have internal predecessors, (1193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-29 15:24:25,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 633 states to 633 states and 1193 transitions. [2024-10-29 15:24:25,438 INFO L78 Accepts]: Start accepts. Automaton has 633 states and 1193 transitions. Word has length 34 [2024-10-29 15:24:25,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-29 15:24:25,439 INFO L471 AbstractCegarLoop]: Abstraction has 633 states and 1193 transitions. [2024-10-29 15:24:25,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 17.0) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-29 15:24:25,439 INFO L276 IsEmpty]: Start isEmpty. Operand 633 states and 1193 transitions. [2024-10-29 15:24:25,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-29 15:24:25,440 INFO L207 NwaCegarLoop]: Found error trace [2024-10-29 15:24:25,440 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] [2024-10-29 15:24:25,440 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-29 15:24:25,441 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-10-29 15:24:25,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-29 15:24:25,441 INFO L85 PathProgramCache]: Analyzing trace with hash -212740164, now seen corresponding path program 1 times [2024-10-29 15:24:25,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-29 15:24:25,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859144005] [2024-10-29 15:24:25,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-29 15:24:25,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-29 15:24:25,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-29 15:24:25,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-29 15:24:25,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-29 15:24:25,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859144005] [2024-10-29 15:24:25,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859144005] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-29 15:24:25,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-29 15:24:25,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-29 15:24:25,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706136045] [2024-10-29 15:24:25,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-29 15:24:25,472 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-29 15:24:25,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-29 15:24:25,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-29 15:24:25,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-29 15:24:25,473 INFO L87 Difference]: Start difference. First operand 633 states and 1193 transitions. Second operand has 3 states, 2 states have (on average 17.0) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-29 15:24:25,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-29 15:24:25,494 INFO L93 Difference]: Finished difference Result 662 states and 1250 transitions. [2024-10-29 15:24:25,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-29 15:24:25,494 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 17.0) internal successors, (34), 3 states have internal predecessors, (34), 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 34 [2024-10-29 15:24:25,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-29 15:24:25,497 INFO L225 Difference]: With dead ends: 662 [2024-10-29 15:24:25,498 INFO L226 Difference]: Without dead ends: 648 [2024-10-29 15:24:25,500 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-29 15:24:25,501 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 12 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-29 15:24:25,502 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 170 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-29 15:24:25,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 648 states. [2024-10-29 15:24:25,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 648 to 638. [2024-10-29 15:24:25,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 638 states, 624 states have (on average 1.9294871794871795) internal successors, (1204), 637 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-29 15:24:25,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 1204 transitions. [2024-10-29 15:24:25,514 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 1204 transitions. Word has length 34 [2024-10-29 15:24:25,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-29 15:24:25,514 INFO L471 AbstractCegarLoop]: Abstraction has 638 states and 1204 transitions. [2024-10-29 15:24:25,514 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 17.0) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-29 15:24:25,515 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 1204 transitions. [2024-10-29 15:24:25,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-10-29 15:24:25,516 INFO L207 NwaCegarLoop]: Found error trace [2024-10-29 15:24:25,516 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] [2024-10-29 15:24:25,517 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-29 15:24:25,517 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-10-29 15:24:25,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-29 15:24:25,518 INFO L85 PathProgramCache]: Analyzing trace with hash 37244536, now seen corresponding path program 1 times [2024-10-29 15:24:25,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-29 15:24:25,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468956842] [2024-10-29 15:24:25,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-29 15:24:25,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-29 15:24:25,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-29 15:24:25,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-29 15:24:25,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-29 15:24:25,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468956842] [2024-10-29 15:24:25,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468956842] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-29 15:24:25,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-29 15:24:25,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-29 15:24:25,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918953677] [2024-10-29 15:24:25,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-29 15:24:25,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-29 15:24:25,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-29 15:24:25,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-29 15:24:25,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-29 15:24:25,554 INFO L87 Difference]: Start difference. First operand 638 states and 1204 transitions. Second operand has 3 states, 2 states have (on average 18.5) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-29 15:24:25,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-29 15:24:25,571 INFO L93 Difference]: Finished difference Result 771 states and 1426 transitions. [2024-10-29 15:24:25,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-29 15:24:25,572 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 18.5) internal successors, (37), 3 states have internal predecessors, (37), 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 37 [2024-10-29 15:24:25,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-29 15:24:25,581 INFO L225 Difference]: With dead ends: 771 [2024-10-29 15:24:25,581 INFO L226 Difference]: Without dead ends: 676 [2024-10-29 15:24:25,582 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-29 15:24:25,583 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 58 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-29 15:24:25,583 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 212 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-29 15:24:25,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 676 states. [2024-10-29 15:24:25,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 676 to 592. [2024-10-29 15:24:25,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 592 states, 581 states have (on average 1.8881239242685026) internal successors, (1097), 591 states have internal predecessors, (1097), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-29 15:24:25,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 1097 transitions. [2024-10-29 15:24:25,597 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 1097 transitions. Word has length 37 [2024-10-29 15:24:25,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-29 15:24:25,597 INFO L471 AbstractCegarLoop]: Abstraction has 592 states and 1097 transitions. [2024-10-29 15:24:25,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 18.5) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-29 15:24:25,597 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 1097 transitions. [2024-10-29 15:24:25,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-10-29 15:24:25,601 INFO L207 NwaCegarLoop]: Found error trace [2024-10-29 15:24:25,602 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:24:25,603 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-29 15:24:25,603 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-10-29 15:24:25,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-29 15:24:25,603 INFO L85 PathProgramCache]: Analyzing trace with hash -438296460, now seen corresponding path program 1 times [2024-10-29 15:24:25,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-29 15:24:25,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742698530] [2024-10-29 15:24:25,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-29 15:24:25,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-29 15:24:25,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-29 15:24:25,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-29 15:24:25,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-29 15:24:25,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742698530] [2024-10-29 15:24:25,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1742698530] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-29 15:24:25,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-29 15:24:25,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-29 15:24:25,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093303005] [2024-10-29 15:24:25,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-29 15:24:25,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-29 15:24:25,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-29 15:24:25,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-29 15:24:25,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-29 15:24:25,685 INFO L87 Difference]: Start difference. First operand 592 states and 1097 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 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:24:25,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-29 15:24:25,743 INFO L93 Difference]: Finished difference Result 600 states and 1104 transitions. [2024-10-29 15:24:25,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-29 15:24:25,743 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 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:24:25,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-29 15:24:25,746 INFO L225 Difference]: With dead ends: 600 [2024-10-29 15:24:25,746 INFO L226 Difference]: Without dead ends: 577 [2024-10-29 15:24:25,746 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-29 15:24:25,747 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 26 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-29 15:24:25,747 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 230 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-29 15:24:25,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2024-10-29 15:24:25,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 577. [2024-10-29 15:24:25,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 577 states, 566 states have (on average 1.9098939929328622) internal successors, (1081), 576 states have internal predecessors, (1081), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-29 15:24:25,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 577 states and 1081 transitions. [2024-10-29 15:24:25,756 INFO L78 Accepts]: Start accepts. Automaton has 577 states and 1081 transitions. Word has length 43 [2024-10-29 15:24:25,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-29 15:24:25,757 INFO L471 AbstractCegarLoop]: Abstraction has 577 states and 1081 transitions. [2024-10-29 15:24:25,757 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 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:24:25,757 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states and 1081 transitions. [2024-10-29 15:24:25,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-10-29 15:24:25,758 INFO L207 NwaCegarLoop]: Found error trace [2024-10-29 15:24:25,758 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-29 15:24:25,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-29 15:24:25,758 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-10-29 15:24:25,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-29 15:24:25,759 INFO L85 PathProgramCache]: Analyzing trace with hash -443007062, now seen corresponding path program 1 times [2024-10-29 15:24:25,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-29 15:24:25,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179026289] [2024-10-29 15:24:25,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-29 15:24:25,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-29 15:24:25,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-29 15:24:25,777 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-29 15:24:25,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-29 15:24:25,817 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-29 15:24:25,817 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-29 15:24:25,818 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 9 remaining) [2024-10-29 15:24:25,819 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (7 of 9 remaining) [2024-10-29 15:24:25,819 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (6 of 9 remaining) [2024-10-29 15:24:25,819 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (5 of 9 remaining) [2024-10-29 15:24:25,820 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (4 of 9 remaining) [2024-10-29 15:24:25,820 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 9 remaining) [2024-10-29 15:24:25,820 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (2 of 9 remaining) [2024-10-29 15:24:25,820 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 9 remaining) [2024-10-29 15:24:25,820 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (0 of 9 remaining) [2024-10-29 15:24:25,820 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-29 15:24:25,822 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-10-29 15:24:25,824 WARN L244 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-29 15:24:25,824 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-10-29 15:24:25,841 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-10-29 15:24:25,846 WARN L158 CegarLoopFactory]: Violation witness validation is only supported for CEGAR loops based on FINITE_AUTOMATA. Ignoring concurrency settiong PETRI_NET and switching to FINITE_AUTOMATA. [2024-10-29 15:24:25,847 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 105 places, 109 transitions, 234 flow [2024-10-29 15:24:26,052 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 8451 states, 8363 states have (on average 3.0905177567858426) internal successors, (25846), 8450 states have internal predecessors, (25846), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-29 15:24:26,055 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-29 15:24:26,056 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;@65cabf8a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-29 15:24:26,056 INFO L334 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2024-10-29 15:24:26,083 INFO L276 IsEmpty]: Start isEmpty. Operand has 8451 states, 8363 states have (on average 3.0905177567858426) internal successors, (25846), 8450 states have internal predecessors, (25846), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-29 15:24:26,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-29 15:24:26,088 INFO L207 NwaCegarLoop]: Found error trace [2024-10-29 15:24:26,088 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] [2024-10-29 15:24:26,089 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-10-29 15:24:26,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-29 15:24:26,090 INFO L85 PathProgramCache]: Analyzing trace with hash 2051612229, now seen corresponding path program 1 times [2024-10-29 15:24:26,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-29 15:24:26,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675281163] [2024-10-29 15:24:26,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-29 15:24:26,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-29 15:24:26,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-29 15:24:26,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-29 15:24:26,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-29 15:24:26,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675281163] [2024-10-29 15:24:26,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1675281163] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-29 15:24:26,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-29 15:24:26,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-29 15:24:26,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567192120] [2024-10-29 15:24:26,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-29 15:24:26,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-29 15:24:26,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-29 15:24:26,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-29 15:24:26,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-29 15:24:26,140 INFO L87 Difference]: Start difference. First operand has 8451 states, 8363 states have (on average 3.0905177567858426) internal successors, (25846), 8450 states have internal predecessors, (25846), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-29 15:24:26,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-29 15:24:26,288 INFO L93 Difference]: Finished difference Result 17186 states and 52691 transitions. [2024-10-29 15:24:26,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-29 15:24:26,289 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 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 28 [2024-10-29 15:24:26,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-29 15:24:26,344 INFO L225 Difference]: With dead ends: 17186 [2024-10-29 15:24:26,344 INFO L226 Difference]: Without dead ends: 8580 [2024-10-29 15:24:26,360 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-29 15:24:26,361 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 24 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-29 15:24:26,362 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 206 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-29 15:24:26,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8580 states. [2024-10-29 15:24:26,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8580 to 8352. [2024-10-29 15:24:26,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8352 states, 8271 states have (on average 2.8939668722040865) internal successors, (23936), 8351 states have internal predecessors, (23936), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-29 15:24:26,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8352 states to 8352 states and 23936 transitions. [2024-10-29 15:24:26,652 INFO L78 Accepts]: Start accepts. Automaton has 8352 states and 23936 transitions. Word has length 28 [2024-10-29 15:24:26,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-29 15:24:26,652 INFO L471 AbstractCegarLoop]: Abstraction has 8352 states and 23936 transitions. [2024-10-29 15:24:26,652 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-29 15:24:26,653 INFO L276 IsEmpty]: Start isEmpty. Operand 8352 states and 23936 transitions. [2024-10-29 15:24:26,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-10-29 15:24:26,653 INFO L207 NwaCegarLoop]: Found error trace [2024-10-29 15:24:26,653 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] [2024-10-29 15:24:26,653 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-29 15:24:26,653 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-10-29 15:24:26,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-29 15:24:26,654 INFO L85 PathProgramCache]: Analyzing trace with hash 1202214518, now seen corresponding path program 1 times [2024-10-29 15:24:26,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-29 15:24:26,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369689698] [2024-10-29 15:24:26,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-29 15:24:26,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-29 15:24:26,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-29 15:24:26,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-29 15:24:26,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-29 15:24:26,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369689698] [2024-10-29 15:24:26,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1369689698] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-29 15:24:26,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-29 15:24:26,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-29 15:24:26,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613658484] [2024-10-29 15:24:26,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-29 15:24:26,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-29 15:24:26,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-29 15:24:26,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-29 15:24:26,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-29 15:24:26,891 INFO L87 Difference]: Start difference. First operand 8352 states and 23936 transitions. Second operand has 6 states, 5 states have (on average 6.0) internal successors, (30), 6 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-29 15:24:26,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-29 15:24:26,984 INFO L93 Difference]: Finished difference Result 8352 states and 23936 transitions. [2024-10-29 15:24:26,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-29 15:24:26,984 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.0) internal successors, (30), 6 states have internal predecessors, (30), 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 30 [2024-10-29 15:24:26,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-29 15:24:27,025 INFO L225 Difference]: With dead ends: 8352 [2024-10-29 15:24:27,026 INFO L226 Difference]: Without dead ends: 8195 [2024-10-29 15:24:27,030 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:24:27,030 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 159 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-29 15:24:27,030 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 308 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-29 15:24:27,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8195 states. [2024-10-29 15:24:27,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8195 to 8195. [2024-10-29 15:24:27,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8195 states, 8127 states have (on average 2.8890119355235635) internal successors, (23479), 8194 states have internal predecessors, (23479), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-29 15:24:27,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8195 states to 8195 states and 23479 transitions. [2024-10-29 15:24:27,242 INFO L78 Accepts]: Start accepts. Automaton has 8195 states and 23479 transitions. Word has length 30 [2024-10-29 15:24:27,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-29 15:24:27,242 INFO L471 AbstractCegarLoop]: Abstraction has 8195 states and 23479 transitions. [2024-10-29 15:24:27,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.0) internal successors, (30), 6 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-29 15:24:27,243 INFO L276 IsEmpty]: Start isEmpty. Operand 8195 states and 23479 transitions. [2024-10-29 15:24:27,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-29 15:24:27,243 INFO L207 NwaCegarLoop]: Found error trace [2024-10-29 15:24:27,243 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] [2024-10-29 15:24:27,244 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-29 15:24:27,244 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-10-29 15:24:27,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-29 15:24:27,244 INFO L85 PathProgramCache]: Analyzing trace with hash -155149538, now seen corresponding path program 1 times [2024-10-29 15:24:27,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-29 15:24:27,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733665855] [2024-10-29 15:24:27,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-29 15:24:27,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-29 15:24:27,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-29 15:24:27,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-29 15:24:27,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-29 15:24:27,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733665855] [2024-10-29 15:24:27,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733665855] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-29 15:24:27,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-29 15:24:27,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-29 15:24:27,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2147002527] [2024-10-29 15:24:27,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-29 15:24:27,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-29 15:24:27,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-29 15:24:27,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-29 15:24:27,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-29 15:24:27,280 INFO L87 Difference]: Start difference. First operand 8195 states and 23479 transitions. Second operand has 3 states, 2 states have (on average 17.0) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-29 15:24:27,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-29 15:24:27,386 INFO L93 Difference]: Finished difference Result 11982 states and 33718 transitions. [2024-10-29 15:24:27,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-29 15:24:27,387 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 17.0) internal successors, (34), 3 states have internal predecessors, (34), 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 34 [2024-10-29 15:24:27,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-29 15:24:27,435 INFO L225 Difference]: With dead ends: 11982 [2024-10-29 15:24:27,436 INFO L226 Difference]: Without dead ends: 10735 [2024-10-29 15:24:27,444 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-29 15:24:27,445 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 76 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-29 15:24:27,445 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 239 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-29 15:24:27,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10735 states. [2024-10-29 15:24:27,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10735 to 7956. [2024-10-29 15:24:27,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7956 states, 7897 states have (on average 2.8728631125743953) internal successors, (22687), 7955 states have internal predecessors, (22687), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-29 15:24:27,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7956 states to 7956 states and 22687 transitions. [2024-10-29 15:24:27,776 INFO L78 Accepts]: Start accepts. Automaton has 7956 states and 22687 transitions. Word has length 34 [2024-10-29 15:24:27,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-29 15:24:27,777 INFO L471 AbstractCegarLoop]: Abstraction has 7956 states and 22687 transitions. [2024-10-29 15:24:27,777 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 17.0) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-29 15:24:27,777 INFO L276 IsEmpty]: Start isEmpty. Operand 7956 states and 22687 transitions. [2024-10-29 15:24:27,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-29 15:24:27,778 INFO L207 NwaCegarLoop]: Found error trace [2024-10-29 15:24:27,778 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] [2024-10-29 15:24:27,778 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-29 15:24:27,778 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-10-29 15:24:27,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-29 15:24:27,779 INFO L85 PathProgramCache]: Analyzing trace with hash 1904705372, now seen corresponding path program 1 times [2024-10-29 15:24:27,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-29 15:24:27,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200537217] [2024-10-29 15:24:27,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-29 15:24:27,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-29 15:24:27,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-29 15:24:27,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-29 15:24:27,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-29 15:24:27,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200537217] [2024-10-29 15:24:27,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200537217] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-29 15:24:27,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-29 15:24:27,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-29 15:24:27,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197084081] [2024-10-29 15:24:27,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-29 15:24:27,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-29 15:24:27,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-29 15:24:27,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-29 15:24:27,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-29 15:24:27,802 INFO L87 Difference]: Start difference. First operand 7956 states and 22687 transitions. Second operand has 3 states, 2 states have (on average 17.0) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-29 15:24:27,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-29 15:24:27,871 INFO L93 Difference]: Finished difference Result 8400 states and 23926 transitions. [2024-10-29 15:24:27,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-29 15:24:27,871 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 17.0) internal successors, (34), 3 states have internal predecessors, (34), 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 34 [2024-10-29 15:24:27,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-29 15:24:28,003 INFO L225 Difference]: With dead ends: 8400 [2024-10-29 15:24:28,004 INFO L226 Difference]: Without dead ends: 8219 [2024-10-29 15:24:28,008 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-29 15:24:28,009 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 23 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-29 15:24:28,010 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 200 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-29 15:24:28,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8219 states. [2024-10-29 15:24:28,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8219 to 8069. [2024-10-29 15:24:28,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8069 states, 8013 states have (on average 2.868588543616623) internal successors, (22986), 8068 states have internal predecessors, (22986), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-29 15:24:28,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8069 states to 8069 states and 22986 transitions. [2024-10-29 15:24:28,167 INFO L78 Accepts]: Start accepts. Automaton has 8069 states and 22986 transitions. Word has length 34 [2024-10-29 15:24:28,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-29 15:24:28,168 INFO L471 AbstractCegarLoop]: Abstraction has 8069 states and 22986 transitions. [2024-10-29 15:24:28,168 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 17.0) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-29 15:24:28,168 INFO L276 IsEmpty]: Start isEmpty. Operand 8069 states and 22986 transitions. [2024-10-29 15:24:28,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-10-29 15:24:28,169 INFO L207 NwaCegarLoop]: Found error trace [2024-10-29 15:24:28,169 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] [2024-10-29 15:24:28,169 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-29 15:24:28,169 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-10-29 15:24:28,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-29 15:24:28,170 INFO L85 PathProgramCache]: Analyzing trace with hash -674714638, now seen corresponding path program 1 times [2024-10-29 15:24:28,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-29 15:24:28,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761246224] [2024-10-29 15:24:28,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-29 15:24:28,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-29 15:24:28,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-29 15:24:28,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-29 15:24:28,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-29 15:24:28,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761246224] [2024-10-29 15:24:28,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1761246224] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-29 15:24:28,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-29 15:24:28,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-29 15:24:28,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846789622] [2024-10-29 15:24:28,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-29 15:24:28,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-29 15:24:28,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-29 15:24:28,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-29 15:24:28,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-29 15:24:28,211 INFO L87 Difference]: Start difference. First operand 8069 states and 22986 transitions. Second operand has 3 states, 2 states have (on average 18.5) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-29 15:24:28,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-29 15:24:28,287 INFO L93 Difference]: Finished difference Result 11743 states and 32628 transitions. [2024-10-29 15:24:28,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-29 15:24:28,287 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 18.5) internal successors, (37), 3 states have internal predecessors, (37), 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 37 [2024-10-29 15:24:28,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-29 15:24:28,332 INFO L225 Difference]: With dead ends: 11743 [2024-10-29 15:24:28,333 INFO L226 Difference]: Without dead ends: 9452 [2024-10-29 15:24:28,341 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-29 15:24:28,342 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 76 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-29 15:24:28,342 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 246 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-29 15:24:28,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9452 states. [2024-10-29 15:24:28,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9452 to 7482. [2024-10-29 15:24:28,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7482 states, 7435 states have (on average 2.8029589778076662) internal successors, (20840), 7481 states have internal predecessors, (20840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-29 15:24:28,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7482 states to 7482 states and 20840 transitions. [2024-10-29 15:24:28,665 INFO L78 Accepts]: Start accepts. Automaton has 7482 states and 20840 transitions. Word has length 37 [2024-10-29 15:24:28,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-29 15:24:28,666 INFO L471 AbstractCegarLoop]: Abstraction has 7482 states and 20840 transitions. [2024-10-29 15:24:28,666 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 18.5) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-29 15:24:28,666 INFO L276 IsEmpty]: Start isEmpty. Operand 7482 states and 20840 transitions. [2024-10-29 15:24:28,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-10-29 15:24:28,667 INFO L207 NwaCegarLoop]: Found error trace [2024-10-29 15:24:28,667 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:24:28,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-29 15:24:28,667 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-10-29 15:24:28,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-29 15:24:28,668 INFO L85 PathProgramCache]: Analyzing trace with hash -868542783, now seen corresponding path program 1 times [2024-10-29 15:24:28,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-29 15:24:28,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677868622] [2024-10-29 15:24:28,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-29 15:24:28,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-29 15:24:28,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-29 15:24:28,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-29 15:24:28,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-29 15:24:28,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677868622] [2024-10-29 15:24:28,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677868622] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-29 15:24:28,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-29 15:24:28,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-29 15:24:28,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362053600] [2024-10-29 15:24:28,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-29 15:24:28,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-29 15:24:28,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-29 15:24:28,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-29 15:24:28,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-29 15:24:28,718 INFO L87 Difference]: Start difference. First operand 7482 states and 20840 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 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:24:28,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-29 15:24:28,787 INFO L93 Difference]: Finished difference Result 7490 states and 20847 transitions. [2024-10-29 15:24:28,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-29 15:24:28,788 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 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:24:28,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-29 15:24:28,821 INFO L225 Difference]: With dead ends: 7490 [2024-10-29 15:24:28,821 INFO L226 Difference]: Without dead ends: 7467 [2024-10-29 15:24:28,824 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-29 15:24:28,825 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 26 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-29 15:24:28,825 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 269 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-29 15:24:28,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7467 states. [2024-10-29 15:24:28,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7467 to 7467. [2024-10-29 15:24:28,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7467 states, 7420 states have (on average 2.806469002695418) internal successors, (20824), 7466 states have internal predecessors, (20824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-29 15:24:28,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7467 states to 7467 states and 20824 transitions. [2024-10-29 15:24:28,961 INFO L78 Accepts]: Start accepts. Automaton has 7467 states and 20824 transitions. Word has length 43 [2024-10-29 15:24:28,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-29 15:24:28,962 INFO L471 AbstractCegarLoop]: Abstraction has 7467 states and 20824 transitions. [2024-10-29 15:24:28,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 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:24:28,962 INFO L276 IsEmpty]: Start isEmpty. Operand 7467 states and 20824 transitions. [2024-10-29 15:24:28,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-10-29 15:24:28,963 INFO L207 NwaCegarLoop]: Found error trace [2024-10-29 15:24:28,963 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] [2024-10-29 15:24:28,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-29 15:24:28,963 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-10-29 15:24:28,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-29 15:24:28,963 INFO L85 PathProgramCache]: Analyzing trace with hash -830666548, now seen corresponding path program 1 times [2024-10-29 15:24:28,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-29 15:24:28,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195858605] [2024-10-29 15:24:28,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-29 15:24:28,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-29 15:24:28,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-29 15:24:29,106 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-29 15:24:29,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-29 15:24:29,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195858605] [2024-10-29 15:24:29,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [195858605] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-29 15:24:29,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-29 15:24:29,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-29 15:24:29,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421929285] [2024-10-29 15:24:29,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-29 15:24:29,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-29 15:24:29,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-29 15:24:29,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-29 15:24:29,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-29 15:24:29,109 INFO L87 Difference]: Start difference. First operand 7467 states and 20824 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-29 15:24:29,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-29 15:24:29,153 INFO L93 Difference]: Finished difference Result 9613 states and 26460 transitions. [2024-10-29 15:24:29,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-29 15:24:29,153 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 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 50 [2024-10-29 15:24:29,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-29 15:24:29,172 INFO L225 Difference]: With dead ends: 9613 [2024-10-29 15:24:29,172 INFO L226 Difference]: Without dead ends: 3439 [2024-10-29 15:24:29,187 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-29 15:24:29,190 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 10 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-29 15:24:29,190 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 138 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-29 15:24:29,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3439 states. [2024-10-29 15:24:29,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3439 to 3439. [2024-10-29 15:24:29,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3439 states, 3418 states have (on average 2.7305441778818023) internal successors, (9333), 3438 states have internal predecessors, (9333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-29 15:24:29,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3439 states to 3439 states and 9333 transitions. [2024-10-29 15:24:29,265 INFO L78 Accepts]: Start accepts. Automaton has 3439 states and 9333 transitions. Word has length 50 [2024-10-29 15:24:29,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-29 15:24:29,266 INFO L471 AbstractCegarLoop]: Abstraction has 3439 states and 9333 transitions. [2024-10-29 15:24:29,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-29 15:24:29,267 INFO L276 IsEmpty]: Start isEmpty. Operand 3439 states and 9333 transitions. [2024-10-29 15:24:29,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-10-29 15:24:29,268 INFO L207 NwaCegarLoop]: Found error trace [2024-10-29 15:24:29,268 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] [2024-10-29 15:24:29,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-29 15:24:29,268 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-10-29 15:24:29,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-29 15:24:29,269 INFO L85 PathProgramCache]: Analyzing trace with hash 1580506741, now seen corresponding path program 1 times [2024-10-29 15:24:29,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-29 15:24:29,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121152642] [2024-10-29 15:24:29,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-29 15:24:29,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-29 15:24:29,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-29 15:24:29,279 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-29 15:24:29,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-29 15:24:29,287 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-29 15:24:29,288 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-29 15:24:29,288 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location threadErr0ASSERT_VIOLATIONDATA_RACE (10 of 11 remaining) [2024-10-29 15:24:29,288 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (9 of 11 remaining) [2024-10-29 15:24:29,288 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (8 of 11 remaining) [2024-10-29 15:24:29,288 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (7 of 11 remaining) [2024-10-29 15:24:29,288 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (6 of 11 remaining) [2024-10-29 15:24:29,289 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 11 remaining) [2024-10-29 15:24:29,289 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (4 of 11 remaining) [2024-10-29 15:24:29,289 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (3 of 11 remaining) [2024-10-29 15:24:29,289 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (2 of 11 remaining) [2024-10-29 15:24:29,289 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 11 remaining) [2024-10-29 15:24:29,289 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (0 of 11 remaining) [2024-10-29 15:24:29,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-29 15:24:29,290 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-29 15:24:29,322 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 2 thread instances [2024-10-29 15:24:29,322 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-10-29 15:24:29,324 INFO L201 PluginConnector]: Adding new model witness.graphml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.10 03:24:29 BasicIcfg [2024-10-29 15:24:29,325 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-29 15:24:29,325 INFO L158 Benchmark]: Toolchain (without parser) took 6250.09ms. Allocated memory was 148.9MB in the beginning and 679.5MB in the end (delta: 530.6MB). Free memory was 74.2MB in the beginning and 361.7MB in the end (delta: -287.6MB). Peak memory consumption was 246.1MB. Max. memory is 16.1GB. [2024-10-29 15:24:29,325 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 148.9MB. Free memory is still 121.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-29 15:24:29,325 INFO L158 Benchmark]: Witness Parser took 0.13ms. Allocated memory is still 148.9MB. Free memory was 76.3MB in the beginning and 76.2MB in the end (delta: 45.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-29 15:24:29,326 INFO L158 Benchmark]: CACSL2BoogieTranslator took 585.03ms. Allocated memory was 148.9MB in the beginning and 253.8MB in the end (delta: 104.9MB). Free memory was 73.9MB in the beginning and 207.7MB in the end (delta: -133.8MB). Peak memory consumption was 22.7MB. Max. memory is 16.1GB. [2024-10-29 15:24:29,326 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.49ms. Allocated memory is still 253.8MB. Free memory was 207.7MB in the beginning and 204.6MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-29 15:24:29,326 INFO L158 Benchmark]: Boogie Preprocessor took 25.88ms. Allocated memory is still 253.8MB. Free memory was 204.6MB in the beginning and 203.5MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-29 15:24:29,326 INFO L158 Benchmark]: RCFGBuilder took 348.76ms. Allocated memory is still 253.8MB. Free memory was 203.5MB in the beginning and 186.7MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-29 15:24:29,326 INFO L158 Benchmark]: TraceAbstraction took 5233.78ms. Allocated memory was 253.8MB in the beginning and 679.5MB in the end (delta: 425.7MB). Free memory was 186.7MB in the beginning and 361.7MB in the end (delta: -175.0MB). Peak memory consumption was 250.7MB. Max. memory is 16.1GB. [2024-10-29 15:24:29,330 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 148.9MB. Free memory is still 121.2MB. There was no memory consumed. Max. memory is 16.1GB. * Witness Parser took 0.13ms. Allocated memory is still 148.9MB. Free memory was 76.3MB in the beginning and 76.2MB in the end (delta: 45.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 585.03ms. Allocated memory was 148.9MB in the beginning and 253.8MB in the end (delta: 104.9MB). Free memory was 73.9MB in the beginning and 207.7MB in the end (delta: -133.8MB). Peak memory consumption was 22.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.49ms. Allocated memory is still 253.8MB. Free memory was 207.7MB in the beginning and 204.6MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 25.88ms. Allocated memory is still 253.8MB. Free memory was 204.6MB in the beginning and 203.5MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 348.76ms. Allocated memory is still 253.8MB. Free memory was 203.5MB in the beginning and 186.7MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 5233.78ms. Allocated memory was 253.8MB in the beginning and 679.5MB in the end (delta: 425.7MB). Free memory was 186.7MB in the beginning and 361.7MB in the end (delta: -175.0MB). Peak memory consumption was 250.7MB. 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 - 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: 1022]: Data race detected Data race detected The following path leads to a data race: [L1019] 0 _Bool ready = 0; VAL [ready=0] [L1020] 0 int data = 0; VAL [data=0, ready=0] [L1027] 0 int threads_total = __VERIFIER_nondet_int(); VAL [data=0, ready=0, threads_total=1] [L1028] CALL 0 assume_abort_if_not(threads_total >= 0) [L1016] COND FALSE 0 !(!cond) VAL [\old(cond)=1, cond=1, data=0, ready=0] [L1028] RET 0 assume_abort_if_not(threads_total >= 0) [L1029] 0 pthread_t *tids = malloc(threads_total * sizeof(pthread_t)); VAL [data=0, ready=0, threads_total=1, tids={-2:0}] [L1030] 0 int i = 0; VAL [data=0, i=0, ready=0, threads_total=1, tids={-2:0}] [L1030] COND TRUE 0 i < threads_total VAL [data=0, i=0, ready=0, threads_total=1, tids={-2:0}] [L1031] 0 pthread_create(&tids[i], ((void *)0), &thread, ((void *)0)) VAL [data=0, i=0, ready=0, threads_total=1, tids={-2:0}] [L1031] FCALL, FORK 0 pthread_create(&tids[i], ((void *)0), &thread, ((void *)0)) VAL [\old(arg)={0:0}, data=0, i=0, ready=0, threads_total=1, tids={-2:0}] [L1022] 1 !ready VAL [\old(arg)={0:0}, arg={0:0}, data=0, ready=0] [L1030] 0 i++ VAL [\old(arg)={0:0}, arg={0:0}, data=0, i=1, ready=0, threads_total=1, tids={-2:0}] [L1030] COND FALSE 0 !(i < threads_total) VAL [\old(arg)={0:0}, arg={0:0}, data=0, i=1, ready=0, threads_total=1, tids={-2:0}] [L1033] 0 data = __VERIFIER_nondet_int() VAL [\old(arg)={0:0}, arg={0:0}, data=0, ready=0, threads_total=1, tids={-2:0}] [L1034] 0 ready = 1 VAL [\old(arg)={0:0}, arg={0:0}, data=0, ready=1, threads_total=1, tids={-2:0}] [L1022] 1 !ready VAL [\old(arg)={0:0}, arg={0:0}, data=0, ready=1] Now there is a data race on ~ready~0 between C: ready = 1 [1034] and C: !ready [1022] - UnprovableResult [Line: 1033]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1031]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1034]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1036]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1031]: 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: 1023]: 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, 101 locations, 9 error locations. Started 1 CEGAR loops. OverallTime: 1.6s, OverallIterations: 7, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 240 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 240 mSDsluCounter, 1247 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 632 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 150 IncrementalHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 615 mSDtfsCounter, 150 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 20 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=687occurred in iteration=0, InterpolantAutomatonStates: 24, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 6 MinimizatonAttempts, 300 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 254 NumberOfCodeBlocks, 254 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 200 ConstructedInterpolants, 0 QuantifiedInterpolants, 361 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data with 2 thread instances CFG has 4 procedures, 113 locations, 11 error locations. Started 1 CEGAR loops. OverallTime: 3.4s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 394 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 394 mSDsluCounter, 1606 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 788 mSDsCounter, 11 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 209 IncrementalHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 11 mSolverCounterUnsat, 818 mSDtfsCounter, 209 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 23 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8451occurred in iteration=0, InterpolantAutomatonStates: 27, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.4s AutomataMinimizationTime, 7 MinimizatonAttempts, 5127 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 309 NumberOfCodeBlocks, 309 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 249 ConstructedInterpolants, 0 QuantifiedInterpolants, 500 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 1/1 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-10-29 15:24:29,370 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE