./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-race-challenges/per-thread-array-index-race.i --full-output --witness-type violation_witness --validate ../results-verified/LOGDIR/SV-COMP24_no-data-race/per-thread-array-index-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/per-thread-array-index-race.i ../results-verified/LOGDIR/SV-COMP24_no-data-race/per-thread-array-index-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:23:14,181 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-29 15:23:14,245 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-10-29 15:23:14,250 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-29 15:23:14,251 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-29 15:23:14,283 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-29 15:23:14,284 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-29 15:23:14,284 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-29 15:23:14,285 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-29 15:23:14,285 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-29 15:23:14,286 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-29 15:23:14,286 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-29 15:23:14,287 INFO L153 SettingsManager]: * Use SBE=true [2024-10-29 15:23:14,287 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-29 15:23:14,287 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-29 15:23:14,288 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-29 15:23:14,290 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-29 15:23:14,294 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-29 15:23:14,294 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-29 15:23:14,294 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-29 15:23:14,295 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-29 15:23:14,295 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-29 15:23:14,295 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-10-29 15:23:14,296 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-29 15:23:14,296 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-29 15:23:14,296 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-29 15:23:14,296 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-29 15:23:14,296 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-29 15:23:14,298 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-29 15:23:14,298 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-29 15:23:14,299 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-29 15:23:14,299 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-29 15:23:14,299 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-29 15:23:14,300 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-29 15:23:14,300 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-29 15:23:14,300 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-29 15:23:14,300 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-29 15:23:14,301 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-29 15:23:14,301 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-29 15:23:14,301 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-29 15:23:14,301 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-29 15:23:14,302 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> None [2024-10-29 15:23:14,546 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-29 15:23:14,566 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-29 15:23:14,569 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-29 15:23:14,571 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-29 15:23:14,571 INFO L274 PluginConnector]: CDTParser initialized [2024-10-29 15:23:14,573 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-race-challenges/per-thread-array-index-race.i [2024-10-29 15:23:16,078 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-29 15:23:16,365 INFO L384 CDTParser]: Found 1 translation units. [2024-10-29 15:23:16,365 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-race-challenges/per-thread-array-index-race.i [2024-10-29 15:23:16,383 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9c7875d45/04b1ed5afdf7438681fd0fc71800bdd8/FLAGecbb7a725 [2024-10-29 15:23:16,395 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9c7875d45/04b1ed5afdf7438681fd0fc71800bdd8 [2024-10-29 15:23:16,397 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-10-29 15:23:16,398 INFO L274 PluginConnector]: Witness Parser initialized [2024-10-29 15:23:16,399 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../results-verified/LOGDIR/SV-COMP24_no-data-race/per-thread-array-index-race.yml/witness.graphml [2024-10-29 15:23:16,459 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-29 15:23:16,461 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-10-29 15:23:16,462 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-29 15:23:16,462 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-29 15:23:16,467 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-29 15:23:16,467 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.10 03:23:16" (1/2) ... [2024-10-29 15:23:16,468 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57c9f930 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 03:23:16, skipping insertion in model container [2024-10-29 15:23:16,469 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.10 03:23:16" (1/2) ... [2024-10-29 15:23:16,469 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@7585f587 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 03:23:16, skipping insertion in model container [2024-10-29 15:23:16,470 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.graphml de.uni_freiburg.informatik.ultimate.witnessparser VIOLATION_WITNESS 29.10 03:23:16" (2/2) ... [2024-10-29 15:23:16,470 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57c9f930 and model type witness.graphml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 29.10 03:23:16, skipping insertion in model container [2024-10-29 15:23:16,470 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.graphml de.uni_freiburg.informatik.ultimate.witnessparser VIOLATION_WITNESS 29.10 03:23:16" (2/2) ... [2024-10-29 15:23:16,515 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-29 15:23:17,017 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-29 15:23:17,025 INFO L200 MainTranslator]: Completed pre-run [2024-10-29 15:23:17,078 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-29 15:23:17,143 INFO L204 MainTranslator]: Completed translation [2024-10-29 15:23:17,144 INFO L201 PluginConnector]: Adding new model witness.graphml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 29.10 03:23:17 WrapperNode [2024-10-29 15:23:17,144 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-29 15:23:17,145 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-29 15:23:17,145 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-29 15:23:17,145 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-29 15:23:17,152 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:23:17" (1/1) ... [2024-10-29 15:23:17,172 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:23:17" (1/1) ... [2024-10-29 15:23:17,193 INFO L138 Inliner]: procedures = 261, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 68 [2024-10-29 15:23:17,193 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-29 15:23:17,194 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-29 15:23:17,194 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-29 15:23:17,194 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-29 15:23:17,203 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:23:17" (1/1) ... [2024-10-29 15:23:17,204 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:23:17" (1/1) ... [2024-10-29 15:23:17,207 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:23:17" (1/1) ... [2024-10-29 15:23:17,207 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:23:17" (1/1) ... [2024-10-29 15:23:17,214 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:23:17" (1/1) ... [2024-10-29 15:23:17,217 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:23:17" (1/1) ... [2024-10-29 15:23:17,221 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:23:17" (1/1) ... [2024-10-29 15:23:17,222 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:23:17" (1/1) ... [2024-10-29 15:23:17,228 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-29 15:23:17,229 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-29 15:23:17,230 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-29 15:23:17,230 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-29 15:23:17,231 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:23:17" (1/1) ... [2024-10-29 15:23:17,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-29 15:23:17,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-29 15:23:17,258 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-29 15:23:17,266 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-29 15:23:17,318 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-29 15:23:17,318 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-10-29 15:23:17,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-10-29 15:23:17,318 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-29 15:23:17,318 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2024-10-29 15:23:17,318 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2024-10-29 15:23:17,319 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-29 15:23:17,319 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-29 15:23:17,320 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-29 15:23:17,429 INFO L238 CfgBuilder]: Building ICFG [2024-10-29 15:23:17,431 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-29 15:23:17,618 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-29 15:23:17,618 INFO L287 CfgBuilder]: Performing block encoding [2024-10-29 15:23:17,636 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-29 15:23:17,637 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-29 15:23:17,639 INFO L201 PluginConnector]: Adding new model witness.graphml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.10 03:23:17 BoogieIcfgContainer [2024-10-29 15:23:17,639 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-29 15:23:17,641 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-29 15:23:17,642 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-29 15:23:17,645 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-29 15:23:17,645 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.10 03:23:16" (1/4) ... [2024-10-29 15:23:17,645 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29cb4683 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.10 03:23:17, skipping insertion in model container [2024-10-29 15:23:17,646 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.graphml de.uni_freiburg.informatik.ultimate.witnessparser VIOLATION_WITNESS 29.10 03:23:16" (2/4) ... [2024-10-29 15:23:17,646 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29cb4683 and model type witness.graphml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction VIOLATION_WITNESS 29.10 03:23:17, skipping insertion in model container [2024-10-29 15:23:17,647 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:23:17" (3/4) ... [2024-10-29 15:23:17,647 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29cb4683 and model type witness.graphml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction VIOLATION_WITNESS 29.10 03:23:17, skipping insertion in model container [2024-10-29 15:23:17,647 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:23:17" (4/4) ... [2024-10-29 15:23:17,648 INFO L112 eAbstractionObserver]: Analyzing ICFG per-thread-array-index-race.i [2024-10-29 15:23:17,649 WARN L117 eAbstractionObserver]: Found a witness automaton. I will only consider traces that are accepted by the witness automaton [2024-10-29 15:23:17,669 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-29 15:23:17,669 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2024-10-29 15:23:17,669 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-29 15:23:17,738 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-10-29 15:23:17,759 WARN L158 CegarLoopFactory]: Violation witness validation is only supported for CEGAR loops based on FINITE_AUTOMATA. Ignoring concurrency settiong PETRI_NET and switching to FINITE_AUTOMATA. [2024-10-29 15:23:17,777 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 96 places, 97 transitions, 201 flow [2024-10-29 15:23:17,914 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 921 states, 899 states have (on average 1.96440489432703) internal successors, (1766), 920 states have internal predecessors, (1766), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-29 15:23:17,974 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-29 15:23:17,983 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;@41d73094, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-29 15:23:17,984 INFO L334 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2024-10-29 15:23:17,988 INFO L276 IsEmpty]: Start isEmpty. Operand has 921 states, 899 states have (on average 1.96440489432703) internal successors, (1766), 920 states have internal predecessors, (1766), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-29 15:23:17,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-29 15:23:17,996 INFO L207 NwaCegarLoop]: Found error trace [2024-10-29 15:23:17,997 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] [2024-10-29 15:23:17,997 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-10-29 15:23:18,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-29 15:23:18,006 INFO L85 PathProgramCache]: Analyzing trace with hash 1217357057, now seen corresponding path program 1 times [2024-10-29 15:23:18,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-29 15:23:18,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777234934] [2024-10-29 15:23:18,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-29 15:23:18,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-29 15:23:18,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-29 15:23:18,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-29 15:23:18,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-29 15:23:18,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777234934] [2024-10-29 15:23:18,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777234934] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-29 15:23:18,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-29 15:23:18,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-29 15:23:18,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283740581] [2024-10-29 15:23:18,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-29 15:23:18,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-29 15:23:18,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-29 15:23:18,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-29 15:23:18,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-29 15:23:18,315 INFO L87 Difference]: Start difference. First operand has 921 states, 899 states have (on average 1.96440489432703) internal successors, (1766), 920 states have internal predecessors, (1766), 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 11.5) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-29 15:23:18,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-29 15:23:18,409 INFO L93 Difference]: Finished difference Result 1827 states and 3517 transitions. [2024-10-29 15:23:18,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-29 15:23:18,412 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 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 23 [2024-10-29 15:23:18,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-29 15:23:18,432 INFO L225 Difference]: With dead ends: 1827 [2024-10-29 15:23:18,432 INFO L226 Difference]: Without dead ends: 888 [2024-10-29 15:23:18,440 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-29 15:23:18,443 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 2 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-29 15:23:18,444 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 168 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-29 15:23:18,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 888 states. [2024-10-29 15:23:18,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 888 to 888. [2024-10-29 15:23:18,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 888 states, 869 states have (on average 1.907940161104718) internal successors, (1658), 887 states have internal predecessors, (1658), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-29 15:23:18,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 888 states to 888 states and 1658 transitions. [2024-10-29 15:23:18,543 INFO L78 Accepts]: Start accepts. Automaton has 888 states and 1658 transitions. Word has length 23 [2024-10-29 15:23:18,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-29 15:23:18,544 INFO L471 AbstractCegarLoop]: Abstraction has 888 states and 1658 transitions. [2024-10-29 15:23:18,545 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-29 15:23:18,545 INFO L276 IsEmpty]: Start isEmpty. Operand 888 states and 1658 transitions. [2024-10-29 15:23:18,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-29 15:23:18,546 INFO L207 NwaCegarLoop]: Found error trace [2024-10-29 15:23:18,547 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:23:18,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-29 15:23:18,548 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-10-29 15:23:18,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-29 15:23:18,550 INFO L85 PathProgramCache]: Analyzing trace with hash -505661471, now seen corresponding path program 1 times [2024-10-29 15:23:18,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-29 15:23:18,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666076595] [2024-10-29 15:23:18,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-29 15:23:18,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-29 15:23:18,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-29 15:23:18,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-29 15:23:18,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-29 15:23:18,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666076595] [2024-10-29 15:23:18,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666076595] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-29 15:23:18,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-29 15:23:18,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-29 15:23:18,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408437325] [2024-10-29 15:23:18,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-29 15:23:18,667 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-29 15:23:18,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-29 15:23:18,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-29 15:23:18,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-29 15:23:18,669 INFO L87 Difference]: Start difference. First operand 888 states and 1658 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:23:18,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-29 15:23:18,709 INFO L93 Difference]: Finished difference Result 899 states and 1669 transitions. [2024-10-29 15:23:18,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-29 15:23:18,710 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:23:18,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-29 15:23:18,717 INFO L225 Difference]: With dead ends: 899 [2024-10-29 15:23:18,717 INFO L226 Difference]: Without dead ends: 810 [2024-10-29 15:23:18,719 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-29 15:23:18,720 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 61 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-29 15:23:18,721 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 182 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-29 15:23:18,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 810 states. [2024-10-29 15:23:18,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 810 to 802. [2024-10-29 15:23:18,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 802 states, 792 states have (on average 1.8851010101010102) internal successors, (1493), 801 states have internal predecessors, (1493), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-29 15:23:18,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 802 states to 802 states and 1493 transitions. [2024-10-29 15:23:18,756 INFO L78 Accepts]: Start accepts. Automaton has 802 states and 1493 transitions. Word has length 34 [2024-10-29 15:23:18,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-29 15:23:18,757 INFO L471 AbstractCegarLoop]: Abstraction has 802 states and 1493 transitions. [2024-10-29 15:23:18,757 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:23:18,758 INFO L276 IsEmpty]: Start isEmpty. Operand 802 states and 1493 transitions. [2024-10-29 15:23:18,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-10-29 15:23:18,760 INFO L207 NwaCegarLoop]: Found error trace [2024-10-29 15:23:18,760 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] [2024-10-29 15:23:18,760 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-29 15:23:18,761 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-10-29 15:23:18,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-29 15:23:18,765 INFO L85 PathProgramCache]: Analyzing trace with hash 1832601665, now seen corresponding path program 1 times [2024-10-29 15:23:18,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-29 15:23:18,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145508335] [2024-10-29 15:23:18,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-29 15:23:18,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-29 15:23:18,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-29 15:23:19,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-29 15:23:19,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-29 15:23:19,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145508335] [2024-10-29 15:23:19,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145508335] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-29 15:23:19,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-29 15:23:19,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-29 15:23:19,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127724183] [2024-10-29 15:23:19,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-29 15:23:19,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-29 15:23:19,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-29 15:23:19,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-29 15:23:19,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-29 15:23:19,312 INFO L87 Difference]: Start difference. First operand 802 states and 1493 transitions. Second operand has 6 states, 5 states have (on average 7.2) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-29 15:23:19,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-29 15:23:19,480 INFO L93 Difference]: Finished difference Result 872 states and 1616 transitions. [2024-10-29 15:23:19,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-29 15:23:19,481 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.2) internal successors, (36), 6 states have internal predecessors, (36), 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 36 [2024-10-29 15:23:19,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-29 15:23:19,487 INFO L225 Difference]: With dead ends: 872 [2024-10-29 15:23:19,487 INFO L226 Difference]: Without dead ends: 851 [2024-10-29 15:23:19,488 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-29 15:23:19,491 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 77 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-29 15:23:19,492 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 263 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-29 15:23:19,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 851 states. [2024-10-29 15:23:19,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 851 to 831. [2024-10-29 15:23:19,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 831 states, 822 states have (on average 1.8832116788321167) internal successors, (1548), 830 states have internal predecessors, (1548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-29 15:23:19,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 831 states to 831 states and 1548 transitions. [2024-10-29 15:23:19,514 INFO L78 Accepts]: Start accepts. Automaton has 831 states and 1548 transitions. Word has length 36 [2024-10-29 15:23:19,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-29 15:23:19,515 INFO L471 AbstractCegarLoop]: Abstraction has 831 states and 1548 transitions. [2024-10-29 15:23:19,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.2) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-29 15:23:19,516 INFO L276 IsEmpty]: Start isEmpty. Operand 831 states and 1548 transitions. [2024-10-29 15:23:19,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-10-29 15:23:19,518 INFO L207 NwaCegarLoop]: Found error trace [2024-10-29 15:23:19,518 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] [2024-10-29 15:23:19,518 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-29 15:23:19,518 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-10-29 15:23:19,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-29 15:23:19,519 INFO L85 PathProgramCache]: Analyzing trace with hash -711986221, now seen corresponding path program 1 times [2024-10-29 15:23:19,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-29 15:23:19,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827957938] [2024-10-29 15:23:19,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-29 15:23:19,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-29 15:23:19,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-29 15:23:19,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-29 15:23:19,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-29 15:23:19,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827957938] [2024-10-29 15:23:19,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827957938] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-29 15:23:19,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-29 15:23:19,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-29 15:23:19,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118189005] [2024-10-29 15:23:19,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-29 15:23:19,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-29 15:23:19,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-29 15:23:19,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-29 15:23:19,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-29 15:23:19,650 INFO L87 Difference]: Start difference. First operand 831 states and 1548 transitions. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-29 15:23:19,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-29 15:23:19,708 INFO L93 Difference]: Finished difference Result 839 states and 1555 transitions. [2024-10-29 15:23:19,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-29 15:23:19,709 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 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 36 [2024-10-29 15:23:19,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-29 15:23:19,714 INFO L225 Difference]: With dead ends: 839 [2024-10-29 15:23:19,714 INFO L226 Difference]: Without dead ends: 829 [2024-10-29 15:23:19,716 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:23:19,716 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 35 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-29 15:23:19,717 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 221 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-29 15:23:19,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 829 states. [2024-10-29 15:23:19,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 829 to 829. [2024-10-29 15:23:19,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 829 states, 820 states have (on average 1.8841463414634145) internal successors, (1545), 828 states have internal predecessors, (1545), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-29 15:23:19,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 829 states to 829 states and 1545 transitions. [2024-10-29 15:23:19,737 INFO L78 Accepts]: Start accepts. Automaton has 829 states and 1545 transitions. Word has length 36 [2024-10-29 15:23:19,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-29 15:23:19,737 INFO L471 AbstractCegarLoop]: Abstraction has 829 states and 1545 transitions. [2024-10-29 15:23:19,737 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-29 15:23:19,738 INFO L276 IsEmpty]: Start isEmpty. Operand 829 states and 1545 transitions. [2024-10-29 15:23:19,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-10-29 15:23:19,742 INFO L207 NwaCegarLoop]: Found error trace [2024-10-29 15:23:19,742 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] [2024-10-29 15:23:19,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-29 15:23:19,742 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-10-29 15:23:19,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-29 15:23:19,743 INFO L85 PathProgramCache]: Analyzing trace with hash -355644590, now seen corresponding path program 1 times [2024-10-29 15:23:19,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-29 15:23:19,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754290758] [2024-10-29 15:23:19,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-29 15:23:19,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-29 15:23:19,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-29 15:23:20,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-29 15:23:20,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-29 15:23:20,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754290758] [2024-10-29 15:23:20,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1754290758] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-29 15:23:20,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-29 15:23:20,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-29 15:23:20,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597341354] [2024-10-29 15:23:20,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-29 15:23:20,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-29 15:23:20,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-29 15:23:20,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-29 15:23:20,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-29 15:23:20,053 INFO L87 Difference]: Start difference. First operand 829 states and 1545 transitions. Second operand has 6 states, 5 states have (on average 10.2) internal successors, (51), 6 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-29 15:23:20,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-29 15:23:20,264 INFO L93 Difference]: Finished difference Result 929 states and 1727 transitions. [2024-10-29 15:23:20,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-29 15:23:20,264 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 10.2) internal successors, (51), 6 states have internal predecessors, (51), 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 51 [2024-10-29 15:23:20,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-29 15:23:20,270 INFO L225 Difference]: With dead ends: 929 [2024-10-29 15:23:20,271 INFO L226 Difference]: Without dead ends: 745 [2024-10-29 15:23:20,272 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-29 15:23:20,272 INFO L432 NwaCegarLoop]: 188 mSDtfsCounter, 130 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 390 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-29 15:23:20,273 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 390 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-29 15:23:20,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 745 states. [2024-10-29 15:23:20,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 745 to 713. [2024-10-29 15:23:20,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 713 states, 705 states have (on average 1.8638297872340426) internal successors, (1314), 712 states have internal predecessors, (1314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-29 15:23:20,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 713 states to 713 states and 1314 transitions. [2024-10-29 15:23:20,291 INFO L78 Accepts]: Start accepts. Automaton has 713 states and 1314 transitions. Word has length 51 [2024-10-29 15:23:20,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-29 15:23:20,291 INFO L471 AbstractCegarLoop]: Abstraction has 713 states and 1314 transitions. [2024-10-29 15:23:20,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 10.2) internal successors, (51), 6 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-29 15:23:20,292 INFO L276 IsEmpty]: Start isEmpty. Operand 713 states and 1314 transitions. [2024-10-29 15:23:20,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-10-29 15:23:20,293 INFO L207 NwaCegarLoop]: Found error trace [2024-10-29 15:23:20,293 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:23:20,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-29 15:23:20,294 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-10-29 15:23:20,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-29 15:23:20,294 INFO L85 PathProgramCache]: Analyzing trace with hash -1677272267, now seen corresponding path program 1 times [2024-10-29 15:23:20,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-29 15:23:20,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335012661] [2024-10-29 15:23:20,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-29 15:23:20,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-29 15:23:20,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-29 15:23:20,574 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:23:20,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-29 15:23:20,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335012661] [2024-10-29 15:23:20,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [335012661] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-29 15:23:20,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-29 15:23:20,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-29 15:23:20,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93742110] [2024-10-29 15:23:20,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-29 15:23:20,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-29 15:23:20,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-29 15:23:20,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-29 15:23:20,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-29 15:23:20,578 INFO L87 Difference]: Start difference. First operand 713 states and 1314 transitions. Second operand has 6 states, 5 states have (on average 10.6) internal successors, (53), 6 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-29 15:23:20,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-29 15:23:20,681 INFO L93 Difference]: Finished difference Result 782 states and 1427 transitions. [2024-10-29 15:23:20,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-29 15:23:20,682 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 10.6) internal successors, (53), 6 states have internal predecessors, (53), 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 53 [2024-10-29 15:23:20,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-29 15:23:20,687 INFO L225 Difference]: With dead ends: 782 [2024-10-29 15:23:20,687 INFO L226 Difference]: Without dead ends: 670 [2024-10-29 15:23:20,687 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-29 15:23:20,688 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 76 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-29 15:23:20,689 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 219 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-29 15:23:20,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 670 states. [2024-10-29 15:23:20,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 670 to 666. [2024-10-29 15:23:20,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 666 states, 659 states have (on average 1.8558421851289832) internal successors, (1223), 665 states have internal predecessors, (1223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-29 15:23:20,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 666 states to 666 states and 1223 transitions. [2024-10-29 15:23:20,726 INFO L78 Accepts]: Start accepts. Automaton has 666 states and 1223 transitions. Word has length 53 [2024-10-29 15:23:20,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-29 15:23:20,726 INFO L471 AbstractCegarLoop]: Abstraction has 666 states and 1223 transitions. [2024-10-29 15:23:20,726 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 10.6) internal successors, (53), 6 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-29 15:23:20,726 INFO L276 IsEmpty]: Start isEmpty. Operand 666 states and 1223 transitions. [2024-10-29 15:23:20,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-10-29 15:23:20,728 INFO L207 NwaCegarLoop]: Found error trace [2024-10-29 15:23:20,728 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, 1, 1, 1, 1, 1, 1] [2024-10-29 15:23:20,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-29 15:23:20,729 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-10-29 15:23:20,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-29 15:23:20,730 INFO L85 PathProgramCache]: Analyzing trace with hash 1116980680, now seen corresponding path program 1 times [2024-10-29 15:23:20,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-29 15:23:20,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481399599] [2024-10-29 15:23:20,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-29 15:23:20,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-29 15:23:20,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-29 15:23:20,766 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-29 15:23:20,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-29 15:23:20,809 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-29 15:23:20,810 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-29 15:23:20,811 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 9 remaining) [2024-10-29 15:23:20,815 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (7 of 9 remaining) [2024-10-29 15:23:20,816 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (6 of 9 remaining) [2024-10-29 15:23:20,816 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (5 of 9 remaining) [2024-10-29 15:23:20,816 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (4 of 9 remaining) [2024-10-29 15:23:20,816 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 9 remaining) [2024-10-29 15:23:20,817 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (2 of 9 remaining) [2024-10-29 15:23:20,817 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 9 remaining) [2024-10-29 15:23:20,817 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (0 of 9 remaining) [2024-10-29 15:23:20,817 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-29 15:23:20,820 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-10-29 15:23:20,822 WARN L244 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-29 15:23:20,822 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-10-29 15:23:20,845 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-10-29 15:23:20,847 WARN L158 CegarLoopFactory]: Violation witness validation is only supported for CEGAR loops based on FINITE_AUTOMATA. Ignoring concurrency settiong PETRI_NET and switching to FINITE_AUTOMATA. [2024-10-29 15:23:20,849 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 119 places, 119 transitions, 254 flow [2024-10-29 15:23:21,360 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 19569 states, 19490 states have (on average 2.8680861980502823) internal successors, (55899), 19568 states have internal predecessors, (55899), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-29 15:23:21,362 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-29 15:23:21,363 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;@41d73094, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-29 15:23:21,363 INFO L334 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2024-10-29 15:23:21,418 INFO L276 IsEmpty]: Start isEmpty. Operand has 19569 states, 19490 states have (on average 2.8680861980502823) internal successors, (55899), 19568 states have internal predecessors, (55899), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-29 15:23:21,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-29 15:23:21,419 INFO L207 NwaCegarLoop]: Found error trace [2024-10-29 15:23:21,419 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] [2024-10-29 15:23:21,419 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-10-29 15:23:21,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-29 15:23:21,420 INFO L85 PathProgramCache]: Analyzing trace with hash -1052754472, now seen corresponding path program 1 times [2024-10-29 15:23:21,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-29 15:23:21,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885682258] [2024-10-29 15:23:21,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-29 15:23:21,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-29 15:23:21,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-29 15:23:21,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-29 15:23:21,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-29 15:23:21,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885682258] [2024-10-29 15:23:21,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1885682258] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-29 15:23:21,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-29 15:23:21,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-29 15:23:21,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593769445] [2024-10-29 15:23:21,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-29 15:23:21,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-29 15:23:21,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-29 15:23:21,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-29 15:23:21,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-29 15:23:21,496 INFO L87 Difference]: Start difference. First operand has 19569 states, 19490 states have (on average 2.8680861980502823) internal successors, (55899), 19568 states have internal predecessors, (55899), 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 11.5) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-29 15:23:22,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-29 15:23:22,055 INFO L93 Difference]: Finished difference Result 39123 states and 111783 transitions. [2024-10-29 15:23:22,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-29 15:23:22,056 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 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 23 [2024-10-29 15:23:22,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-29 15:23:22,219 INFO L225 Difference]: With dead ends: 39123 [2024-10-29 15:23:22,220 INFO L226 Difference]: Without dead ends: 19356 [2024-10-29 15:23:22,270 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-29 15:23:22,271 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 2 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-29 15:23:22,272 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 205 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-29 15:23:22,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19356 states. [2024-10-29 15:23:23,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19356 to 19356. [2024-10-29 15:23:23,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19356 states, 19282 states have (on average 2.8201431386785605) internal successors, (54378), 19355 states have internal predecessors, (54378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-29 15:23:23,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19356 states to 19356 states and 54378 transitions. [2024-10-29 15:23:23,392 INFO L78 Accepts]: Start accepts. Automaton has 19356 states and 54378 transitions. Word has length 23 [2024-10-29 15:23:23,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-29 15:23:23,393 INFO L471 AbstractCegarLoop]: Abstraction has 19356 states and 54378 transitions. [2024-10-29 15:23:23,394 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-29 15:23:23,394 INFO L276 IsEmpty]: Start isEmpty. Operand 19356 states and 54378 transitions. [2024-10-29 15:23:23,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-29 15:23:23,396 INFO L207 NwaCegarLoop]: Found error trace [2024-10-29 15:23:23,396 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:23:23,396 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-29 15:23:23,396 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-10-29 15:23:23,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-29 15:23:23,397 INFO L85 PathProgramCache]: Analyzing trace with hash -676367167, now seen corresponding path program 1 times [2024-10-29 15:23:23,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-29 15:23:23,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074811586] [2024-10-29 15:23:23,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-29 15:23:23,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-29 15:23:23,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-29 15:23:23,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-29 15:23:23,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-29 15:23:23,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074811586] [2024-10-29 15:23:23,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074811586] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-29 15:23:23,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-29 15:23:23,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-29 15:23:23,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247874914] [2024-10-29 15:23:23,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-29 15:23:23,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-29 15:23:23,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-29 15:23:23,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-29 15:23:23,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-29 15:23:23,428 INFO L87 Difference]: Start difference. First operand 19356 states and 54378 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:23:23,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-29 15:23:23,605 INFO L93 Difference]: Finished difference Result 19415 states and 54485 transitions. [2024-10-29 15:23:23,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-29 15:23:23,608 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:23:23,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-29 15:23:23,736 INFO L225 Difference]: With dead ends: 19415 [2024-10-29 15:23:23,736 INFO L226 Difference]: Without dead ends: 17078 [2024-10-29 15:23:23,756 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-29 15:23:23,757 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 81 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-29 15:23:23,758 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 207 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-29 15:23:23,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17078 states. [2024-10-29 15:23:24,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17078 to 17022. [2024-10-29 15:23:24,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17022 states, 16994 states have (on average 2.8067553254089677) internal successors, (47698), 17021 states have internal predecessors, (47698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-29 15:23:24,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17022 states to 17022 states and 47698 transitions. [2024-10-29 15:23:24,490 INFO L78 Accepts]: Start accepts. Automaton has 17022 states and 47698 transitions. Word has length 34 [2024-10-29 15:23:24,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-29 15:23:24,492 INFO L471 AbstractCegarLoop]: Abstraction has 17022 states and 47698 transitions. [2024-10-29 15:23:24,492 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:23:24,492 INFO L276 IsEmpty]: Start isEmpty. Operand 17022 states and 47698 transitions. [2024-10-29 15:23:24,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-10-29 15:23:24,493 INFO L207 NwaCegarLoop]: Found error trace [2024-10-29 15:23:24,493 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] [2024-10-29 15:23:24,494 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-29 15:23:24,494 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-10-29 15:23:24,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-29 15:23:24,494 INFO L85 PathProgramCache]: Analyzing trace with hash 993188865, now seen corresponding path program 1 times [2024-10-29 15:23:24,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-29 15:23:24,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505963313] [2024-10-29 15:23:24,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-29 15:23:24,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-29 15:23:24,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-29 15:23:24,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-29 15:23:24,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-29 15:23:24,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505963313] [2024-10-29 15:23:24,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505963313] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-29 15:23:24,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-29 15:23:24,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-29 15:23:24,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104537673] [2024-10-29 15:23:24,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-29 15:23:24,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-29 15:23:24,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-29 15:23:24,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-29 15:23:24,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-29 15:23:24,793 INFO L87 Difference]: Start difference. First operand 17022 states and 47698 transitions. Second operand has 6 states, 5 states have (on average 7.2) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-29 15:23:25,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-29 15:23:25,116 INFO L93 Difference]: Finished difference Result 19382 states and 54112 transitions. [2024-10-29 15:23:25,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-29 15:23:25,116 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.2) internal successors, (36), 6 states have internal predecessors, (36), 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 36 [2024-10-29 15:23:25,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-29 15:23:25,220 INFO L225 Difference]: With dead ends: 19382 [2024-10-29 15:23:25,220 INFO L226 Difference]: Without dead ends: 18961 [2024-10-29 15:23:25,234 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-29 15:23:25,236 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 148 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-29 15:23:25,237 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 444 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-29 15:23:25,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18961 states. [2024-10-29 15:23:25,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18961 to 18151. [2024-10-29 15:23:25,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18151 states, 18124 states have (on average 2.808044581770029) internal successors, (50893), 18150 states have internal predecessors, (50893), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-29 15:23:25,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18151 states to 18151 states and 50893 transitions. [2024-10-29 15:23:26,021 INFO L78 Accepts]: Start accepts. Automaton has 18151 states and 50893 transitions. Word has length 36 [2024-10-29 15:23:26,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-29 15:23:26,021 INFO L471 AbstractCegarLoop]: Abstraction has 18151 states and 50893 transitions. [2024-10-29 15:23:26,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.2) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-29 15:23:26,022 INFO L276 IsEmpty]: Start isEmpty. Operand 18151 states and 50893 transitions. [2024-10-29 15:23:26,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-10-29 15:23:26,023 INFO L207 NwaCegarLoop]: Found error trace [2024-10-29 15:23:26,023 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] [2024-10-29 15:23:26,023 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-29 15:23:26,024 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-10-29 15:23:26,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-29 15:23:26,024 INFO L85 PathProgramCache]: Analyzing trace with hash -1551399021, now seen corresponding path program 1 times [2024-10-29 15:23:26,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-29 15:23:26,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269260818] [2024-10-29 15:23:26,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-29 15:23:26,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-29 15:23:26,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-29 15:23:26,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-29 15:23:26,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-29 15:23:26,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269260818] [2024-10-29 15:23:26,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269260818] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-29 15:23:26,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-29 15:23:26,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-29 15:23:26,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339578372] [2024-10-29 15:23:26,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-29 15:23:26,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-29 15:23:26,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-29 15:23:26,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-29 15:23:26,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-29 15:23:26,099 INFO L87 Difference]: Start difference. First operand 18151 states and 50893 transitions. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-29 15:23:26,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-29 15:23:26,332 INFO L93 Difference]: Finished difference Result 18159 states and 50900 transitions. [2024-10-29 15:23:26,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-29 15:23:26,333 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 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 36 [2024-10-29 15:23:26,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-29 15:23:26,451 INFO L225 Difference]: With dead ends: 18159 [2024-10-29 15:23:26,451 INFO L226 Difference]: Without dead ends: 18149 [2024-10-29 15:23:26,458 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:23:26,459 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 35 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 281 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.0s IncrementalHoareTripleChecker+Time [2024-10-29 15:23:26,460 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 281 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-29 15:23:26,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18149 states. [2024-10-29 15:23:26,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18149 to 18149. [2024-10-29 15:23:26,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18149 states, 18122 states have (on average 2.808188941617923) internal successors, (50890), 18148 states have internal predecessors, (50890), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-29 15:23:26,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18149 states to 18149 states and 50890 transitions. [2024-10-29 15:23:26,930 INFO L78 Accepts]: Start accepts. Automaton has 18149 states and 50890 transitions. Word has length 36 [2024-10-29 15:23:26,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-29 15:23:26,931 INFO L471 AbstractCegarLoop]: Abstraction has 18149 states and 50890 transitions. [2024-10-29 15:23:26,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-29 15:23:26,931 INFO L276 IsEmpty]: Start isEmpty. Operand 18149 states and 50890 transitions. [2024-10-29 15:23:26,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-10-29 15:23:26,932 INFO L207 NwaCegarLoop]: Found error trace [2024-10-29 15:23:26,932 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] [2024-10-29 15:23:26,932 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-29 15:23:26,933 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-10-29 15:23:26,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-29 15:23:26,933 INFO L85 PathProgramCache]: Analyzing trace with hash 491012349, now seen corresponding path program 1 times [2024-10-29 15:23:26,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-29 15:23:26,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140045866] [2024-10-29 15:23:26,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-29 15:23:26,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-29 15:23:26,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-29 15:23:27,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-29 15:23:27,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-29 15:23:27,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140045866] [2024-10-29 15:23:27,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140045866] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-29 15:23:27,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-29 15:23:27,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-29 15:23:27,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609927520] [2024-10-29 15:23:27,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-29 15:23:27,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-29 15:23:27,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-29 15:23:27,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-29 15:23:27,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-29 15:23:27,449 INFO L87 Difference]: Start difference. First operand 18149 states and 50890 transitions. Second operand has 6 states, 5 states have (on average 10.2) internal successors, (51), 6 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-29 15:23:27,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-29 15:23:27,986 INFO L93 Difference]: Finished difference Result 28826 states and 81071 transitions. [2024-10-29 15:23:27,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-29 15:23:27,986 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 10.2) internal successors, (51), 6 states have internal predecessors, (51), 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 51 [2024-10-29 15:23:27,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-29 15:23:28,142 INFO L225 Difference]: With dead ends: 28826 [2024-10-29 15:23:28,142 INFO L226 Difference]: Without dead ends: 27059 [2024-10-29 15:23:28,166 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-29 15:23:28,167 INFO L432 NwaCegarLoop]: 270 mSDtfsCounter, 216 mSDsluCounter, 406 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 676 SdHoareTripleChecker+Invalid, 355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-29 15:23:28,168 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [216 Valid, 676 Invalid, 355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 345 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-29 15:23:28,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27059 states. [2024-10-29 15:23:28,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27059 to 20600. [2024-10-29 15:23:28,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20600 states, 20573 states have (on average 2.821221989986876) internal successors, (58041), 20599 states have internal predecessors, (58041), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-29 15:23:28,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20600 states to 20600 states and 58041 transitions. [2024-10-29 15:23:28,919 INFO L78 Accepts]: Start accepts. Automaton has 20600 states and 58041 transitions. Word has length 51 [2024-10-29 15:23:28,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-29 15:23:28,919 INFO L471 AbstractCegarLoop]: Abstraction has 20600 states and 58041 transitions. [2024-10-29 15:23:28,919 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 10.2) internal successors, (51), 6 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-29 15:23:28,919 INFO L276 IsEmpty]: Start isEmpty. Operand 20600 states and 58041 transitions. [2024-10-29 15:23:28,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-10-29 15:23:28,920 INFO L207 NwaCegarLoop]: Found error trace [2024-10-29 15:23:28,921 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:23:28,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-29 15:23:28,921 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-10-29 15:23:28,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-29 15:23:28,922 INFO L85 PathProgramCache]: Analyzing trace with hash 211230976, now seen corresponding path program 1 times [2024-10-29 15:23:28,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-29 15:23:28,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855777343] [2024-10-29 15:23:28,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-29 15:23:28,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-29 15:23:28,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-29 15:23:29,203 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:23:29,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-29 15:23:29,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855777343] [2024-10-29 15:23:29,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855777343] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-29 15:23:29,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-29 15:23:29,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-29 15:23:29,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460404496] [2024-10-29 15:23:29,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-29 15:23:29,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-29 15:23:29,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-29 15:23:29,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-29 15:23:29,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-29 15:23:29,206 INFO L87 Difference]: Start difference. First operand 20600 states and 58041 transitions. Second operand has 6 states, 5 states have (on average 10.6) internal successors, (53), 6 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-29 15:23:29,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-29 15:23:29,569 INFO L93 Difference]: Finished difference Result 22801 states and 63683 transitions. [2024-10-29 15:23:29,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-29 15:23:29,570 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 10.6) internal successors, (53), 6 states have internal predecessors, (53), 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 53 [2024-10-29 15:23:29,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-29 15:23:29,665 INFO L225 Difference]: With dead ends: 22801 [2024-10-29 15:23:29,666 INFO L226 Difference]: Without dead ends: 21799 [2024-10-29 15:23:29,683 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-29 15:23:29,684 INFO L432 NwaCegarLoop]: 206 mSDtfsCounter, 130 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-29 15:23:29,684 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 433 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-29 15:23:29,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21799 states. [2024-10-29 15:23:30,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21799 to 21343. [2024-10-29 15:23:30,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21343 states, 21317 states have (on average 2.820894122062204) internal successors, (60133), 21342 states have internal predecessors, (60133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-29 15:23:30,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21343 states to 21343 states and 60133 transitions. [2024-10-29 15:23:30,365 INFO L78 Accepts]: Start accepts. Automaton has 21343 states and 60133 transitions. Word has length 53 [2024-10-29 15:23:30,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-29 15:23:30,365 INFO L471 AbstractCegarLoop]: Abstraction has 21343 states and 60133 transitions. [2024-10-29 15:23:30,366 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 10.6) internal successors, (53), 6 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-29 15:23:30,366 INFO L276 IsEmpty]: Start isEmpty. Operand 21343 states and 60133 transitions. [2024-10-29 15:23:30,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-10-29 15:23:30,368 INFO L207 NwaCegarLoop]: Found error trace [2024-10-29 15:23:30,368 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-29 15:23:30,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-29 15:23:30,369 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-10-29 15:23:30,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-29 15:23:30,370 INFO L85 PathProgramCache]: Analyzing trace with hash -1556004279, now seen corresponding path program 1 times [2024-10-29 15:23:30,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-29 15:23:30,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551983555] [2024-10-29 15:23:30,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-29 15:23:30,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-29 15:23:30,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-29 15:23:30,950 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-29 15:23:30,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-29 15:23:30,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551983555] [2024-10-29 15:23:30,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551983555] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-29 15:23:30,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [112321221] [2024-10-29 15:23:30,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-29 15:23:30,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-29 15:23:30,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-29 15:23:30,953 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-29 15:23:30,955 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-29 15:23:31,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-29 15:23:31,056 INFO L255 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-10-29 15:23:31,060 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-29 15:23:31,105 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-29 15:23:31,158 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-29 15:23:31,158 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-29 15:23:31,218 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-10-29 15:23:31,234 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2024-10-29 15:23:31,264 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-29 15:23:31,264 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42 [2024-10-29 15:23:31,293 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-29 15:23:31,293 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57 [2024-10-29 15:23:31,667 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45 [2024-10-29 15:23:31,678 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-29 15:23:31,678 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-29 15:23:31,717 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (and (forall ((v_ArrVal_249 (Array Int Int))) (= (select (select (store |c_#race| c_~datas~0.base v_ArrVal_249) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| 3 .cse0)) |c_ULTIMATE.start_main_#t~nondet10#1|)) (forall ((v_ArrVal_249 (Array Int Int))) (= (select (select (store |c_#race| c_~datas~0.base v_ArrVal_249) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| 1 .cse0)) |c_ULTIMATE.start_main_#t~nondet10#1|)) (forall ((v_ArrVal_249 (Array Int Int))) (= (select (select (store |c_#race| c_~datas~0.base v_ArrVal_249) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse0)) |c_ULTIMATE.start_main_#t~nondet10#1|)) (forall ((v_ArrVal_249 (Array Int Int))) (= (select (select (store |c_#race| c_~datas~0.base v_ArrVal_249) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| 2 .cse0)) |c_ULTIMATE.start_main_#t~nondet10#1|)))) is different from false [2024-10-29 15:23:31,851 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| 3 .cse2))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base|) .cse1 |c_ULTIMATE.start_main_#t~nondet10#1|)))) (and (forall ((v_ArrVal_249 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet10#1| (select (select (store .cse0 c_~datas~0.base v_ArrVal_249) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse1))) (forall ((v_ArrVal_249 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_249) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| 2 .cse2)) |c_ULTIMATE.start_main_#t~nondet10#1|)) (forall ((v_ArrVal_249 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_249) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse2)) |c_ULTIMATE.start_main_#t~nondet10#1|)) (forall ((v_ArrVal_249 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_249) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| 1 .cse2)) |c_ULTIMATE.start_main_#t~nondet10#1|)))))) is different from false [2024-10-29 15:23:35,759 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-29 15:23:35,760 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 50 treesize of output 66 [2024-10-29 15:23:35,770 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-29 15:23:35,770 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 113 treesize of output 34 [2024-10-29 15:23:35,781 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2024-10-29 15:23:35,781 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 1 [2024-10-29 15:23:35,787 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2024-10-29 15:23:35,788 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 1 [2024-10-29 15:23:35,797 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2024-10-29 15:23:35,797 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 1 [2024-10-29 15:23:35,848 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 2 times theorem prover too weak. 6 trivial. 1 not checked. [2024-10-29 15:23:35,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [112321221] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-29 15:23:35,849 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-29 15:23:35,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 16 [2024-10-29 15:23:35,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573601301] [2024-10-29 15:23:35,849 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-29 15:23:35,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-10-29 15:23:35,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-29 15:23:35,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-10-29 15:23:35,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=147, Unknown=20, NotChecked=54, Total=272 [2024-10-29 15:23:35,851 INFO L87 Difference]: Start difference. First operand 21343 states and 60133 transitions. Second operand has 17 states, 16 states have (on average 4.75) internal successors, (76), 17 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-29 15:23:36,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-29 15:23:36,619 INFO L93 Difference]: Finished difference Result 21343 states and 60133 transitions. [2024-10-29 15:23:36,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-29 15:23:36,620 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 4.75) internal successors, (76), 17 states have internal predecessors, (76), 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 63 [2024-10-29 15:23:36,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-29 15:23:36,712 INFO L225 Difference]: With dead ends: 21343 [2024-10-29 15:23:36,713 INFO L226 Difference]: Without dead ends: 20949 [2024-10-29 15:23:36,726 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=123, Invalid=371, Unknown=20, NotChecked=86, Total=600 [2024-10-29 15:23:36,728 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 375 mSDsluCounter, 821 mSDsCounter, 0 mSdLazyCounter, 491 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 375 SdHoareTripleChecker+Valid, 895 SdHoareTripleChecker+Invalid, 1119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 491 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 587 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-29 15:23:36,728 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [375 Valid, 895 Invalid, 1119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 491 Invalid, 0 Unknown, 587 Unchecked, 0.5s Time] [2024-10-29 15:23:36,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20949 states. [2024-10-29 15:23:37,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20949 to 19720. [2024-10-29 15:23:37,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19720 states, 19700 states have (on average 2.8185786802030455) internal successors, (55526), 19719 states have internal predecessors, (55526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-29 15:23:37,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19720 states to 19720 states and 55526 transitions. [2024-10-29 15:23:37,308 INFO L78 Accepts]: Start accepts. Automaton has 19720 states and 55526 transitions. Word has length 63 [2024-10-29 15:23:37,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-29 15:23:37,309 INFO L471 AbstractCegarLoop]: Abstraction has 19720 states and 55526 transitions. [2024-10-29 15:23:37,309 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 4.75) internal successors, (76), 17 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-29 15:23:37,309 INFO L276 IsEmpty]: Start isEmpty. Operand 19720 states and 55526 transitions. [2024-10-29 15:23:37,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-10-29 15:23:37,311 INFO L207 NwaCegarLoop]: Found error trace [2024-10-29 15:23:37,311 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-29 15:23:37,330 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-29 15:23:37,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-10-29 15:23:37,516 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-10-29 15:23:37,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-29 15:23:37,516 INFO L85 PathProgramCache]: Analyzing trace with hash 2079017046, now seen corresponding path program 1 times [2024-10-29 15:23:37,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-29 15:23:37,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822469829] [2024-10-29 15:23:37,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-29 15:23:37,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-29 15:23:37,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-29 15:23:37,880 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-29 15:23:37,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-29 15:23:37,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822469829] [2024-10-29 15:23:37,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822469829] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-29 15:23:37,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-29 15:23:37,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-29 15:23:37,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350867221] [2024-10-29 15:23:37,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-29 15:23:37,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-29 15:23:37,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-29 15:23:37,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-29 15:23:37,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-10-29 15:23:37,885 INFO L87 Difference]: Start difference. First operand 19720 states and 55526 transitions. Second operand has 11 states, 10 states have (on average 5.8) internal successors, (58), 11 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-29 15:23:39,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-29 15:23:39,003 INFO L93 Difference]: Finished difference Result 26448 states and 73564 transitions. [2024-10-29 15:23:39,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-10-29 15:23:39,003 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.8) internal successors, (58), 11 states have internal predecessors, (58), 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 63 [2024-10-29 15:23:39,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-29 15:23:39,125 INFO L225 Difference]: With dead ends: 26448 [2024-10-29 15:23:39,125 INFO L226 Difference]: Without dead ends: 25437 [2024-10-29 15:23:39,144 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=116, Invalid=346, Unknown=0, NotChecked=0, Total=462 [2024-10-29 15:23:39,145 INFO L432 NwaCegarLoop]: 230 mSDtfsCounter, 521 mSDsluCounter, 1089 mSDsCounter, 0 mSdLazyCounter, 825 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 521 SdHoareTripleChecker+Valid, 1319 SdHoareTripleChecker+Invalid, 897 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 825 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-29 15:23:39,145 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [521 Valid, 1319 Invalid, 897 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 825 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-29 15:23:39,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25437 states. [2024-10-29 15:23:39,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25437 to 17824. [2024-10-29 15:23:39,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17824 states, 17804 states have (on average 2.802066951246911) internal successors, (49888), 17823 states have internal predecessors, (49888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-29 15:23:39,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17824 states to 17824 states and 49888 transitions. [2024-10-29 15:23:39,752 INFO L78 Accepts]: Start accepts. Automaton has 17824 states and 49888 transitions. Word has length 63 [2024-10-29 15:23:39,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-29 15:23:39,752 INFO L471 AbstractCegarLoop]: Abstraction has 17824 states and 49888 transitions. [2024-10-29 15:23:39,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.8) internal successors, (58), 11 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-29 15:23:39,752 INFO L276 IsEmpty]: Start isEmpty. Operand 17824 states and 49888 transitions. [2024-10-29 15:23:39,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-10-29 15:23:39,755 INFO L207 NwaCegarLoop]: Found error trace [2024-10-29 15:23:39,755 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-29 15:23:39,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-29 15:23:39,758 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-10-29 15:23:39,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-29 15:23:39,759 INFO L85 PathProgramCache]: Analyzing trace with hash -377750705, now seen corresponding path program 1 times [2024-10-29 15:23:39,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-29 15:23:39,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648898836] [2024-10-29 15:23:39,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-29 15:23:39,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-29 15:23:39,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-29 15:23:40,207 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:23:40,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-29 15:23:40,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648898836] [2024-10-29 15:23:40,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648898836] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-29 15:23:40,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-29 15:23:40,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-29 15:23:40,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729634824] [2024-10-29 15:23:40,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-29 15:23:40,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-29 15:23:40,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-29 15:23:40,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-29 15:23:40,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-10-29 15:23:40,210 INFO L87 Difference]: Start difference. First operand 17824 states and 49888 transitions. Second operand has 11 states, 10 states have (on average 6.3) internal successors, (63), 11 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-29 15:23:40,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-29 15:23:40,831 INFO L93 Difference]: Finished difference Result 17824 states and 49888 transitions. [2024-10-29 15:23:40,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-29 15:23:40,832 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 6.3) internal successors, (63), 11 states have internal predecessors, (63), 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 63 [2024-10-29 15:23:40,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-29 15:23:40,917 INFO L225 Difference]: With dead ends: 17824 [2024-10-29 15:23:40,917 INFO L226 Difference]: Without dead ends: 16216 [2024-10-29 15:23:40,932 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2024-10-29 15:23:40,933 INFO L432 NwaCegarLoop]: 169 mSDtfsCounter, 287 mSDsluCounter, 746 mSDsCounter, 0 mSdLazyCounter, 516 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 SdHoareTripleChecker+Valid, 915 SdHoareTripleChecker+Invalid, 550 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 516 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-29 15:23:40,933 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [287 Valid, 915 Invalid, 550 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 516 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-29 15:23:40,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16216 states. [2024-10-29 15:23:41,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16216 to 15240. [2024-10-29 15:23:41,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15240 states, 15228 states have (on average 2.805358550039401) internal successors, (42720), 15239 states have internal predecessors, (42720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-29 15:23:41,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15240 states to 15240 states and 42720 transitions. [2024-10-29 15:23:41,499 INFO L78 Accepts]: Start accepts. Automaton has 15240 states and 42720 transitions. Word has length 63 [2024-10-29 15:23:41,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-29 15:23:41,499 INFO L471 AbstractCegarLoop]: Abstraction has 15240 states and 42720 transitions. [2024-10-29 15:23:41,499 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 6.3) internal successors, (63), 11 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-29 15:23:41,499 INFO L276 IsEmpty]: Start isEmpty. Operand 15240 states and 42720 transitions. [2024-10-29 15:23:41,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-10-29 15:23:41,502 INFO L207 NwaCegarLoop]: Found error trace [2024-10-29 15:23:41,503 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-29 15:23:41,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-29 15:23:41,503 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-10-29 15:23:41,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-29 15:23:41,503 INFO L85 PathProgramCache]: Analyzing trace with hash -1205642319, now seen corresponding path program 1 times [2024-10-29 15:23:41,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-29 15:23:41,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779680707] [2024-10-29 15:23:41,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-29 15:23:41,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-29 15:23:41,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-29 15:23:41,763 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-29 15:23:41,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-29 15:23:41,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779680707] [2024-10-29 15:23:41,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779680707] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-29 15:23:41,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-29 15:23:41,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-29 15:23:41,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843393255] [2024-10-29 15:23:41,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-29 15:23:41,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-29 15:23:41,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-29 15:23:41,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-29 15:23:41,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-29 15:23:41,766 INFO L87 Difference]: Start difference. First operand 15240 states and 42720 transitions. Second operand has 6 states, 5 states have (on average 11.6) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-29 15:23:42,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-29 15:23:42,064 INFO L93 Difference]: Finished difference Result 22668 states and 62914 transitions. [2024-10-29 15:23:42,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-29 15:23:42,064 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.6) internal successors, (58), 6 states have internal predecessors, (58), 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 68 [2024-10-29 15:23:42,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-29 15:23:42,141 INFO L225 Difference]: With dead ends: 22668 [2024-10-29 15:23:42,141 INFO L226 Difference]: Without dead ends: 20866 [2024-10-29 15:23:42,151 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-29 15:23:42,152 INFO L432 NwaCegarLoop]: 268 mSDtfsCounter, 210 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 471 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-29 15:23:42,152 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 471 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-29 15:23:42,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20866 states. [2024-10-29 15:23:42,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20866 to 15907. [2024-10-29 15:23:42,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15907 states, 15895 states have (on average 2.7935828877005346) internal successors, (44404), 15906 states have internal predecessors, (44404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-29 15:23:42,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15907 states to 15907 states and 44404 transitions. [2024-10-29 15:23:42,620 INFO L78 Accepts]: Start accepts. Automaton has 15907 states and 44404 transitions. Word has length 68 [2024-10-29 15:23:42,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-29 15:23:42,621 INFO L471 AbstractCegarLoop]: Abstraction has 15907 states and 44404 transitions. [2024-10-29 15:23:42,621 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.6) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-29 15:23:42,621 INFO L276 IsEmpty]: Start isEmpty. Operand 15907 states and 44404 transitions. [2024-10-29 15:23:42,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-10-29 15:23:42,625 INFO L207 NwaCegarLoop]: Found error trace [2024-10-29 15:23:42,625 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-29 15:23:42,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-29 15:23:42,625 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-10-29 15:23:42,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-29 15:23:42,626 INFO L85 PathProgramCache]: Analyzing trace with hash -236645324, now seen corresponding path program 1 times [2024-10-29 15:23:42,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-29 15:23:42,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922741773] [2024-10-29 15:23:42,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-29 15:23:42,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-29 15:23:42,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-29 15:23:42,646 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-29 15:23:42,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-29 15:23:42,664 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-29 15:23:42,665 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-29 15:23:42,665 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 11 remaining) [2024-10-29 15:23:42,665 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (9 of 11 remaining) [2024-10-29 15:23:42,666 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (8 of 11 remaining) [2024-10-29 15:23:42,666 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (7 of 11 remaining) [2024-10-29 15:23:42,666 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (6 of 11 remaining) [2024-10-29 15:23:42,666 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (5 of 11 remaining) [2024-10-29 15:23:42,666 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (4 of 11 remaining) [2024-10-29 15:23:42,666 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 11 remaining) [2024-10-29 15:23:42,667 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (2 of 11 remaining) [2024-10-29 15:23:42,667 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 11 remaining) [2024-10-29 15:23:42,667 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (0 of 11 remaining) [2024-10-29 15:23:42,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-29 15:23:42,668 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-29 15:23:42,669 WARN L244 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-29 15:23:42,669 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-10-29 15:23:42,697 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-10-29 15:23:42,698 WARN L158 CegarLoopFactory]: Violation witness validation is only supported for CEGAR loops based on FINITE_AUTOMATA. Ignoring concurrency settiong PETRI_NET and switching to FINITE_AUTOMATA. [2024-10-29 15:23:42,699 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 142 places, 141 transitions, 309 flow [2024-10-29 15:23:54,167 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 422265 states, 421979 states have (on average 3.7866457809511846) internal successors, (1597885), 422264 states have internal predecessors, (1597885), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-29 15:23:54,169 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-29 15:23:54,170 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;@41d73094, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-29 15:23:54,170 INFO L334 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2024-10-29 15:23:54,829 INFO L276 IsEmpty]: Start isEmpty. Operand has 422265 states, 421979 states have (on average 3.7866457809511846) internal successors, (1597885), 422264 states have internal predecessors, (1597885), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-29 15:23:54,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-29 15:23:54,830 INFO L207 NwaCegarLoop]: Found error trace [2024-10-29 15:23:54,830 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] [2024-10-29 15:23:54,830 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2024-10-29 15:23:54,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-29 15:23:54,831 INFO L85 PathProgramCache]: Analyzing trace with hash 2068287621, now seen corresponding path program 1 times [2024-10-29 15:23:54,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-29 15:23:54,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052543436] [2024-10-29 15:23:54,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-29 15:23:54,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-29 15:23:54,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-29 15:23:54,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-29 15:23:54,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-29 15:23:54,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052543436] [2024-10-29 15:23:54,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1052543436] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-29 15:23:54,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-29 15:23:54,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-29 15:23:54,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846089838] [2024-10-29 15:23:54,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-29 15:23:54,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-29 15:23:54,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-29 15:23:54,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-29 15:23:54,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-29 15:23:55,574 INFO L87 Difference]: Start difference. First operand has 422265 states, 421979 states have (on average 3.7866457809511846) internal successors, (1597885), 422264 states have internal predecessors, (1597885), 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 11.5) internal successors, (23), 3 states have internal predecessors, (23), 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) Killed by 15