./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/02-base_26-malloc_struct.i --full-output --witness-type violation_witness --validate ../results-verified/LOGDIR/SV-COMP24_no-data-race/02-base_26-malloc_struct.yml/witness.graphml --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 194c01fd Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../sv-benchmarks/c/goblint-regression/02-base_26-malloc_struct.i ../results-verified/LOGDIR/SV-COMP24_no-data-race/02-base_26-malloc_struct.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:22:28,367 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-29 15:22:28,435 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-10-29 15:22:28,441 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-29 15:22:28,443 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-29 15:22:28,475 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-29 15:22:28,476 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-29 15:22:28,476 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-29 15:22:28,477 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-29 15:22:28,479 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-29 15:22:28,480 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-29 15:22:28,480 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-29 15:22:28,480 INFO L153 SettingsManager]: * Use SBE=true [2024-10-29 15:22:28,482 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-29 15:22:28,483 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-29 15:22:28,483 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-29 15:22:28,483 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-29 15:22:28,483 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-29 15:22:28,483 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-29 15:22:28,484 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-29 15:22:28,484 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-29 15:22:28,487 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-29 15:22:28,487 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-10-29 15:22:28,488 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-29 15:22:28,488 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-29 15:22:28,489 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-29 15:22:28,489 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-29 15:22:28,489 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-29 15:22:28,490 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-29 15:22:28,490 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-29 15:22:28,490 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-29 15:22:28,491 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-29 15:22:28,491 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-29 15:22:28,492 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-29 15:22:28,492 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-29 15:22:28,492 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-29 15:22:28,493 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-29 15:22:28,493 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-29 15:22:28,493 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-29 15:22:28,493 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-29 15:22:28,494 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-29 15:22:28,494 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:22:28,781 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-29 15:22:28,803 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-29 15:22:28,807 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-29 15:22:28,808 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-10-29 15:22:28,809 INFO L274 PluginConnector]: Witness Parser initialized [2024-10-29 15:22:28,811 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../results-verified/LOGDIR/SV-COMP24_no-data-race/02-base_26-malloc_struct.yml/witness.graphml [2024-10-29 15:22:28,870 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-29 15:22:28,870 INFO L274 PluginConnector]: CDTParser initialized [2024-10-29 15:22:28,871 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/02-base_26-malloc_struct.i [2024-10-29 15:22:30,325 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-29 15:22:30,624 INFO L384 CDTParser]: Found 1 translation units. [2024-10-29 15:22:30,625 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/02-base_26-malloc_struct.i [2024-10-29 15:22:30,649 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/519688c07/0f3d6eac285246acb96f63086ce7c594/FLAGa26f45d97 [2024-10-29 15:22:30,667 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/519688c07/0f3d6eac285246acb96f63086ce7c594 [2024-10-29 15:22:30,668 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-29 15:22:30,670 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-10-29 15:22:30,671 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-29 15:22:30,671 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-29 15:22:30,679 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-29 15:22:30,680 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.graphml de.uni_freiburg.informatik.ultimate.witnessparser VIOLATION_WITNESS 29.10 03:22:28" (1/2) ... [2024-10-29 15:22:30,681 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b30f461 and model type witness.graphml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 29.10 03:22:30, skipping insertion in model container [2024-10-29 15:22:30,681 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.graphml de.uni_freiburg.informatik.ultimate.witnessparser VIOLATION_WITNESS 29.10 03:22:28" (1/2) ... [2024-10-29 15:22:30,682 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@581321e8 and model type witness.graphml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 29.10 03:22:30, skipping insertion in model container [2024-10-29 15:22:30,682 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.10 03:22:30" (2/2) ... [2024-10-29 15:22:30,682 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b30f461 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 03:22:30, skipping insertion in model container [2024-10-29 15:22:30,682 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.10 03:22:30" (2/2) ... [2024-10-29 15:22:30,733 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-29 15:22:31,303 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-29 15:22:31,323 INFO L200 MainTranslator]: Completed pre-run [2024-10-29 15:22:31,383 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-29 15:22:31,485 INFO L204 MainTranslator]: Completed translation [2024-10-29 15:22:31,486 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 03:22:31 WrapperNode [2024-10-29 15:22:31,487 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-29 15:22:31,488 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-29 15:22:31,488 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-29 15:22:31,488 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-29 15:22:31,496 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 03:22:31" (1/1) ... [2024-10-29 15:22:31,529 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 03:22:31" (1/1) ... [2024-10-29 15:22:31,549 INFO L138 Inliner]: procedures = 365, calls = 18, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 58 [2024-10-29 15:22:31,550 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-29 15:22:31,551 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-29 15:22:31,551 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-29 15:22:31,551 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-29 15:22:31,560 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 03:22:31" (1/1) ... [2024-10-29 15:22:31,560 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 03:22:31" (1/1) ... [2024-10-29 15:22:31,564 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 03:22:31" (1/1) ... [2024-10-29 15:22:31,568 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 03:22:31" (1/1) ... [2024-10-29 15:22:31,577 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 03:22:31" (1/1) ... [2024-10-29 15:22:31,579 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 03:22:31" (1/1) ... [2024-10-29 15:22:31,581 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 03:22:31" (1/1) ... [2024-10-29 15:22:31,582 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 03:22:31" (1/1) ... [2024-10-29 15:22:31,584 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-29 15:22:31,585 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-29 15:22:31,585 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-29 15:22:31,585 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-29 15:22:31,586 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 03:22:31" (1/1) ... [2024-10-29 15:22:31,593 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-29 15:22:31,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-29 15:22:31,621 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:22:31,624 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:22:31,670 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-10-29 15:22:31,670 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-10-29 15:22:31,670 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-10-29 15:22:31,671 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-10-29 15:22:31,671 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-29 15:22:31,671 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-29 15:22:31,671 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2024-10-29 15:22:31,671 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2024-10-29 15:22:31,672 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-10-29 15:22:31,672 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-29 15:22:31,672 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-29 15:22:31,673 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:22:31,820 INFO L238 CfgBuilder]: Building ICFG [2024-10-29 15:22:31,823 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-29 15:22:32,022 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-29 15:22:32,022 INFO L287 CfgBuilder]: Performing block encoding [2024-10-29 15:22:32,056 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-29 15:22:32,056 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-29 15:22:32,057 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.10 03:22:32 BoogieIcfgContainer [2024-10-29 15:22:32,057 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-29 15:22:32,059 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-29 15:22:32,059 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-29 15:22:32,064 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-29 15:22:32,064 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.graphml de.uni_freiburg.informatik.ultimate.witnessparser VIOLATION_WITNESS 29.10 03:22:28" (1/4) ... [2024-10-29 15:22:32,065 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@af96bec and model type witness.graphml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction VIOLATION_WITNESS 29.10 03:22:32, skipping insertion in model container [2024-10-29 15:22:32,067 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.10 03:22:30" (2/4) ... [2024-10-29 15:22:32,067 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@af96bec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.10 03:22:32, skipping insertion in model container [2024-10-29 15:22:32,067 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 03:22:31" (3/4) ... [2024-10-29 15:22:32,067 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@af96bec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.10 03:22:32, skipping insertion in model container [2024-10-29 15:22:32,067 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.10 03:22:32" (4/4) ... [2024-10-29 15:22:32,069 INFO L112 eAbstractionObserver]: Analyzing ICFG 02-base_26-malloc_struct.i [2024-10-29 15:22:32,069 WARN L117 eAbstractionObserver]: Found a witness automaton. I will only consider traces that are accepted by the witness automaton [2024-10-29 15:22:32,088 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-29 15:22:32,089 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2024-10-29 15:22:32,089 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-29 15:22:32,147 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-29 15:22:32,161 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:22:32,171 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 99 places, 95 transitions, 194 flow [2024-10-29 15:22:32,260 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 1076 states, 1055 states have (on average 1.9488151658767772) internal successors, (2056), 1075 states have internal predecessors, (2056), 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:22:32,293 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-29 15:22:32,302 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;@58763e83, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-29 15:22:32,303 INFO L334 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2024-10-29 15:22:32,309 INFO L276 IsEmpty]: Start isEmpty. Operand has 1076 states, 1055 states have (on average 1.9488151658767772) internal successors, (2056), 1075 states have internal predecessors, (2056), 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:22:32,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-29 15:22:32,315 INFO L207 NwaCegarLoop]: Found error trace [2024-10-29 15:22:32,317 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-29 15:22:32,317 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-10-29 15:22:32,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-29 15:22:32,322 INFO L85 PathProgramCache]: Analyzing trace with hash 1486570224, now seen corresponding path program 1 times [2024-10-29 15:22:32,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-29 15:22:32,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978268423] [2024-10-29 15:22:32,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-29 15:22:32,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-29 15:22:32,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-29 15:22:32,585 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:22:32,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-29 15:22:32,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978268423] [2024-10-29 15:22:32,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978268423] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-29 15:22:32,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-29 15:22:32,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-29 15:22:32,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58510905] [2024-10-29 15:22:32,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-29 15:22:32,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-29 15:22:32,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-29 15:22:32,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-29 15:22:32,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-29 15:22:32,622 INFO L87 Difference]: Start difference. First operand has 1076 states, 1055 states have (on average 1.9488151658767772) internal successors, (2056), 1075 states have internal predecessors, (2056), 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 9.5) internal successors, (19), 3 states have internal predecessors, (19), 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:22:32,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-29 15:22:32,728 INFO L93 Difference]: Finished difference Result 1076 states and 2056 transitions. [2024-10-29 15:22:32,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-29 15:22:32,730 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 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 19 [2024-10-29 15:22:32,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-29 15:22:32,751 INFO L225 Difference]: With dead ends: 1076 [2024-10-29 15:22:32,751 INFO L226 Difference]: Without dead ends: 1075 [2024-10-29 15:22:32,754 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:22:32,757 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 2 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-29 15:22:32,758 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 156 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-29 15:22:32,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1075 states. [2024-10-29 15:22:32,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1075 to 1075. [2024-10-29 15:22:32,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1075 states, 1055 states have (on average 1.947867298578199) internal successors, (2055), 1074 states have internal predecessors, (2055), 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:22:32,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1075 states to 1075 states and 2055 transitions. [2024-10-29 15:22:32,855 INFO L78 Accepts]: Start accepts. Automaton has 1075 states and 2055 transitions. Word has length 19 [2024-10-29 15:22:32,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-29 15:22:32,856 INFO L471 AbstractCegarLoop]: Abstraction has 1075 states and 2055 transitions. [2024-10-29 15:22:32,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 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:22:32,857 INFO L276 IsEmpty]: Start isEmpty. Operand 1075 states and 2055 transitions. [2024-10-29 15:22:32,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-29 15:22:32,858 INFO L207 NwaCegarLoop]: Found error trace [2024-10-29 15:22:32,858 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:22:32,858 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-29 15:22:32,858 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-10-29 15:22:32,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-29 15:22:32,860 INFO L85 PathProgramCache]: Analyzing trace with hash 1118414709, now seen corresponding path program 1 times [2024-10-29 15:22:32,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-29 15:22:32,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982553945] [2024-10-29 15:22:32,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-29 15:22:32,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-29 15:22:32,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-29 15:22:32,946 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:22:32,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-29 15:22:32,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982553945] [2024-10-29 15:22:32,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1982553945] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-29 15:22:32,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-29 15:22:32,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-29 15:22:32,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49251352] [2024-10-29 15:22:32,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-29 15:22:32,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-29 15:22:32,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-29 15:22:32,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-29 15:22:32,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-29 15:22:32,951 INFO L87 Difference]: Start difference. First operand 1075 states and 2055 transitions. 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:22:32,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-29 15:22:32,992 INFO L93 Difference]: Finished difference Result 1075 states and 2055 transitions. [2024-10-29 15:22:32,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-29 15:22:32,993 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:22:32,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-29 15:22:32,999 INFO L225 Difference]: With dead ends: 1075 [2024-10-29 15:22:33,000 INFO L226 Difference]: Without dead ends: 976 [2024-10-29 15:22:33,001 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:22:33,003 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 64 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-29 15:22:33,003 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 99 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-29 15:22:33,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 976 states. [2024-10-29 15:22:33,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 976 to 976. [2024-10-29 15:22:33,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 976 states, 968 states have (on average 1.9225206611570247) internal successors, (1861), 975 states have internal predecessors, (1861), 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:22:33,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 976 states to 976 states and 1861 transitions. [2024-10-29 15:22:33,028 INFO L78 Accepts]: Start accepts. Automaton has 976 states and 1861 transitions. Word has length 23 [2024-10-29 15:22:33,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-29 15:22:33,029 INFO L471 AbstractCegarLoop]: Abstraction has 976 states and 1861 transitions. [2024-10-29 15:22:33,029 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:22:33,029 INFO L276 IsEmpty]: Start isEmpty. Operand 976 states and 1861 transitions. [2024-10-29 15:22:33,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-10-29 15:22:33,031 INFO L207 NwaCegarLoop]: Found error trace [2024-10-29 15:22:33,031 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] [2024-10-29 15:22:33,032 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-29 15:22:33,032 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-10-29 15:22:33,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-29 15:22:33,037 INFO L85 PathProgramCache]: Analyzing trace with hash -794414378, now seen corresponding path program 1 times [2024-10-29 15:22:33,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-29 15:22:33,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282663408] [2024-10-29 15:22:33,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-29 15:22:33,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-29 15:22:33,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-29 15:22:33,655 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:22:33,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-29 15:22:33,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282663408] [2024-10-29 15:22:33,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282663408] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-29 15:22:33,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-29 15:22:33,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-29 15:22:33,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465867028] [2024-10-29 15:22:33,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-29 15:22:33,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-29 15:22:33,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-29 15:22:33,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-29 15:22:33,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-29 15:22:33,658 INFO L87 Difference]: Start difference. First operand 976 states and 1861 transitions. Second operand has 6 states, 5 states have (on average 8.0) internal successors, (40), 6 states have internal predecessors, (40), 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:22:33,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-29 15:22:33,950 INFO L93 Difference]: Finished difference Result 1186 states and 2268 transitions. [2024-10-29 15:22:33,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-29 15:22:33,951 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.0) internal successors, (40), 6 states have internal predecessors, (40), 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 40 [2024-10-29 15:22:33,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-29 15:22:33,960 INFO L225 Difference]: With dead ends: 1186 [2024-10-29 15:22:33,960 INFO L226 Difference]: Without dead ends: 1153 [2024-10-29 15:22:33,962 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:22:33,964 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 103 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-29 15:22:33,964 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 310 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-29 15:22:33,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1153 states. [2024-10-29 15:22:33,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1153 to 1072. [2024-10-29 15:22:33,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1072 states, 1064 states have (on average 1.931390977443609) internal successors, (2055), 1071 states have internal predecessors, (2055), 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:22:33,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1072 states to 1072 states and 2055 transitions. [2024-10-29 15:22:33,992 INFO L78 Accepts]: Start accepts. Automaton has 1072 states and 2055 transitions. Word has length 40 [2024-10-29 15:22:33,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-29 15:22:33,993 INFO L471 AbstractCegarLoop]: Abstraction has 1072 states and 2055 transitions. [2024-10-29 15:22:33,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.0) internal successors, (40), 6 states have internal predecessors, (40), 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:22:33,994 INFO L276 IsEmpty]: Start isEmpty. Operand 1072 states and 2055 transitions. [2024-10-29 15:22:33,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-10-29 15:22:33,998 INFO L207 NwaCegarLoop]: Found error trace [2024-10-29 15:22:33,999 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] [2024-10-29 15:22:33,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-29 15:22:33,999 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-10-29 15:22:34,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-29 15:22:34,001 INFO L85 PathProgramCache]: Analyzing trace with hash 662746690, now seen corresponding path program 1 times [2024-10-29 15:22:34,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-29 15:22:34,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358518066] [2024-10-29 15:22:34,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-29 15:22:34,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-29 15:22:34,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-29 15:22:34,314 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:22:34,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-29 15:22:34,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358518066] [2024-10-29 15:22:34,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [358518066] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-29 15:22:34,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-29 15:22:34,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-29 15:22:34,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022182471] [2024-10-29 15:22:34,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-29 15:22:34,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-29 15:22:34,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-29 15:22:34,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-29 15:22:34,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-29 15:22:34,318 INFO L87 Difference]: Start difference. First operand 1072 states and 2055 transitions. Second operand has 6 states, 5 states have (on average 8.2) internal successors, (41), 6 states have internal predecessors, (41), 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:22:34,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-29 15:22:34,618 INFO L93 Difference]: Finished difference Result 1847 states and 3519 transitions. [2024-10-29 15:22:34,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-29 15:22:34,618 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.2) internal successors, (41), 6 states have internal predecessors, (41), 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 41 [2024-10-29 15:22:34,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-29 15:22:34,628 INFO L225 Difference]: With dead ends: 1847 [2024-10-29 15:22:34,629 INFO L226 Difference]: Without dead ends: 1813 [2024-10-29 15:22:34,630 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:22:34,631 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 168 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-29 15:22:34,631 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 275 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-29 15:22:34,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1813 states. [2024-10-29 15:22:34,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1813 to 1143. [2024-10-29 15:22:34,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1143 states, 1135 states have (on average 1.93215859030837) internal successors, (2193), 1142 states have internal predecessors, (2193), 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:22:34,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1143 states to 1143 states and 2193 transitions. [2024-10-29 15:22:34,668 INFO L78 Accepts]: Start accepts. Automaton has 1143 states and 2193 transitions. Word has length 41 [2024-10-29 15:22:34,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-29 15:22:34,669 INFO L471 AbstractCegarLoop]: Abstraction has 1143 states and 2193 transitions. [2024-10-29 15:22:34,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.2) internal successors, (41), 6 states have internal predecessors, (41), 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:22:34,669 INFO L276 IsEmpty]: Start isEmpty. Operand 1143 states and 2193 transitions. [2024-10-29 15:22:34,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-10-29 15:22:34,675 INFO L207 NwaCegarLoop]: Found error trace [2024-10-29 15:22:34,675 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] [2024-10-29 15:22:34,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-29 15:22:34,676 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-10-29 15:22:34,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-29 15:22:34,677 INFO L85 PathProgramCache]: Analyzing trace with hash 728298622, now seen corresponding path program 1 times [2024-10-29 15:22:34,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-29 15:22:34,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299925198] [2024-10-29 15:22:34,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-29 15:22:34,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-29 15:22:34,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-29 15:22:34,778 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:22:34,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-29 15:22:34,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299925198] [2024-10-29 15:22:34,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299925198] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-29 15:22:34,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-29 15:22:34,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-29 15:22:34,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981331293] [2024-10-29 15:22:34,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-29 15:22:34,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-29 15:22:34,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-29 15:22:34,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-29 15:22:34,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-29 15:22:34,780 INFO L87 Difference]: Start difference. First operand 1143 states and 2193 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 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:22:34,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-29 15:22:34,809 INFO L93 Difference]: Finished difference Result 1645 states and 3136 transitions. [2024-10-29 15:22:34,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-29 15:22:34,810 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 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 49 [2024-10-29 15:22:34,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-29 15:22:34,817 INFO L225 Difference]: With dead ends: 1645 [2024-10-29 15:22:34,817 INFO L226 Difference]: Without dead ends: 675 [2024-10-29 15:22:34,820 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-29 15:22:34,821 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 46 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-29 15:22:34,822 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 146 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-29 15:22:34,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 675 states. [2024-10-29 15:22:34,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 675 to 675. [2024-10-29 15:22:34,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 675 states, 669 states have (on average 1.8236173393124067) internal successors, (1220), 674 states have internal predecessors, (1220), 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:22:34,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 675 states to 675 states and 1220 transitions. [2024-10-29 15:22:34,841 INFO L78 Accepts]: Start accepts. Automaton has 675 states and 1220 transitions. Word has length 49 [2024-10-29 15:22:34,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-29 15:22:34,842 INFO L471 AbstractCegarLoop]: Abstraction has 675 states and 1220 transitions. [2024-10-29 15:22:34,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 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:22:34,842 INFO L276 IsEmpty]: Start isEmpty. Operand 675 states and 1220 transitions. [2024-10-29 15:22:34,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-10-29 15:22:34,844 INFO L207 NwaCegarLoop]: Found error trace [2024-10-29 15:22:34,844 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-29 15:22:34,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-29 15:22:34,844 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-10-29 15:22:34,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-29 15:22:34,845 INFO L85 PathProgramCache]: Analyzing trace with hash -1313172452, now seen corresponding path program 1 times [2024-10-29 15:22:34,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-29 15:22:34,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984750241] [2024-10-29 15:22:34,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-29 15:22:34,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-29 15:22:34,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-29 15:22:35,125 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:22:35,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-29 15:22:35,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984750241] [2024-10-29 15:22:35,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984750241] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-29 15:22:35,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-29 15:22:35,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-29 15:22:35,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061865823] [2024-10-29 15:22:35,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-29 15:22:35,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-29 15:22:35,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-29 15:22:35,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-29 15:22:35,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-29 15:22:35,132 INFO L87 Difference]: Start difference. First operand 675 states and 1220 transitions. Second operand has 6 states, 5 states have (on average 10.0) internal successors, (50), 6 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-29 15:22:35,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-29 15:22:35,237 INFO L93 Difference]: Finished difference Result 740 states and 1337 transitions. [2024-10-29 15:22:35,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-29 15:22:35,238 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 10.0) internal successors, (50), 6 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2024-10-29 15:22:35,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-29 15:22:35,242 INFO L225 Difference]: With dead ends: 740 [2024-10-29 15:22:35,242 INFO L226 Difference]: Without dead ends: 567 [2024-10-29 15:22:35,243 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:22:35,244 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 54 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-29 15:22:35,246 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 230 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-29 15:22:35,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2024-10-29 15:22:35,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 562. [2024-10-29 15:22:35,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 562 states, 557 states have (on average 1.7666068222621185) internal successors, (984), 561 states have internal predecessors, (984), 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:22:35,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 984 transitions. [2024-10-29 15:22:35,281 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 984 transitions. Word has length 50 [2024-10-29 15:22:35,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-29 15:22:35,281 INFO L471 AbstractCegarLoop]: Abstraction has 562 states and 984 transitions. [2024-10-29 15:22:35,281 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 10.0) internal successors, (50), 6 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-29 15:22:35,281 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 984 transitions. [2024-10-29 15:22:35,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-10-29 15:22:35,282 INFO L207 NwaCegarLoop]: Found error trace [2024-10-29 15:22:35,282 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-29 15:22:35,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-29 15:22:35,283 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-10-29 15:22:35,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-29 15:22:35,284 INFO L85 PathProgramCache]: Analyzing trace with hash 1654409923, now seen corresponding path program 1 times [2024-10-29 15:22:35,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-29 15:22:35,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296717907] [2024-10-29 15:22:35,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-29 15:22:35,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-29 15:22:35,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-29 15:22:35,547 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:22:35,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-29 15:22:35,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296717907] [2024-10-29 15:22:35,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296717907] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-29 15:22:35,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-29 15:22:35,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-29 15:22:35,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368149240] [2024-10-29 15:22:35,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-29 15:22:35,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-29 15:22:35,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-29 15:22:35,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-29 15:22:35,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-29 15:22:35,552 INFO L87 Difference]: Start difference. First operand 562 states and 984 transitions. Second operand has 6 states, 5 states have (on average 10.4) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-29 15:22:35,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-29 15:22:35,711 INFO L93 Difference]: Finished difference Result 718 states and 1261 transitions. [2024-10-29 15:22:35,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-29 15:22:35,712 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 10.4) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2024-10-29 15:22:35,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-29 15:22:35,716 INFO L225 Difference]: With dead ends: 718 [2024-10-29 15:22:35,716 INFO L226 Difference]: Without dead ends: 502 [2024-10-29 15:22:35,718 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:22:35,720 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 96 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-29 15:22:35,721 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 255 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-29 15:22:35,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 502 states. [2024-10-29 15:22:35,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 502 to 462. [2024-10-29 15:22:35,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 462 states, 457 states have (on average 1.7702407002188183) internal successors, (809), 461 states have internal predecessors, (809), 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:22:35,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 462 states to 462 states and 809 transitions. [2024-10-29 15:22:35,734 INFO L78 Accepts]: Start accepts. Automaton has 462 states and 809 transitions. Word has length 52 [2024-10-29 15:22:35,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-29 15:22:35,735 INFO L471 AbstractCegarLoop]: Abstraction has 462 states and 809 transitions. [2024-10-29 15:22:35,735 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 10.4) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-29 15:22:35,735 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 809 transitions. [2024-10-29 15:22:35,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-29 15:22:35,736 INFO L207 NwaCegarLoop]: Found error trace [2024-10-29 15:22:35,736 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] [2024-10-29 15:22:35,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-29 15:22:35,736 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-10-29 15:22:35,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-29 15:22:35,737 INFO L85 PathProgramCache]: Analyzing trace with hash 1810031331, now seen corresponding path program 1 times [2024-10-29 15:22:35,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-29 15:22:35,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511721322] [2024-10-29 15:22:35,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-29 15:22:35,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-29 15:22:35,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-29 15:22:36,415 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:22:36,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-29 15:22:36,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511721322] [2024-10-29 15:22:36,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1511721322] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-29 15:22:36,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-29 15:22:36,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-29 15:22:36,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565166444] [2024-10-29 15:22:36,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-29 15:22:36,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-29 15:22:36,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-29 15:22:36,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-29 15:22:36,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-10-29 15:22:36,417 INFO L87 Difference]: Start difference. First operand 462 states and 809 transitions. Second operand has 10 states, 9 states have (on average 6.666666666666667) internal successors, (60), 10 states have internal predecessors, (60), 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:22:36,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-29 15:22:36,730 INFO L93 Difference]: Finished difference Result 592 states and 1032 transitions. [2024-10-29 15:22:36,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-29 15:22:36,730 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.666666666666667) internal successors, (60), 10 states have internal predecessors, (60), 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 60 [2024-10-29 15:22:36,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-29 15:22:36,734 INFO L225 Difference]: With dead ends: 592 [2024-10-29 15:22:36,734 INFO L226 Difference]: Without dead ends: 539 [2024-10-29 15:22:36,735 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2024-10-29 15:22:36,735 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 218 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 375 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-29 15:22:36,736 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 359 Invalid, 418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 375 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-29 15:22:36,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2024-10-29 15:22:36,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 409. [2024-10-29 15:22:36,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 409 states, 405 states have (on average 1.7580246913580246) internal successors, (712), 408 states have internal predecessors, (712), 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:22:36,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 712 transitions. [2024-10-29 15:22:36,748 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 712 transitions. Word has length 60 [2024-10-29 15:22:36,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-29 15:22:36,748 INFO L471 AbstractCegarLoop]: Abstraction has 409 states and 712 transitions. [2024-10-29 15:22:36,748 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.666666666666667) internal successors, (60), 10 states have internal predecessors, (60), 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:22:36,749 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 712 transitions. [2024-10-29 15:22:36,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-29 15:22:36,749 INFO L207 NwaCegarLoop]: Found error trace [2024-10-29 15:22:36,749 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] [2024-10-29 15:22:36,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-29 15:22:36,750 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-10-29 15:22:36,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-29 15:22:36,751 INFO L85 PathProgramCache]: Analyzing trace with hash -1354786008, now seen corresponding path program 1 times [2024-10-29 15:22:36,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-29 15:22:36,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994786333] [2024-10-29 15:22:36,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-29 15:22:36,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-29 15:22:36,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-29 15:22:37,185 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:22:37,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-29 15:22:37,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994786333] [2024-10-29 15:22:37,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994786333] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-29 15:22:37,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-29 15:22:37,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-29 15:22:37,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3120835] [2024-10-29 15:22:37,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-29 15:22:37,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-29 15:22:37,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-29 15:22:37,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-29 15:22:37,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-10-29 15:22:37,188 INFO L87 Difference]: Start difference. First operand 409 states and 712 transitions. Second operand has 10 states, 9 states have (on average 6.666666666666667) internal successors, (60), 10 states have internal predecessors, (60), 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:22:37,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-29 15:22:37,476 INFO L93 Difference]: Finished difference Result 427 states and 736 transitions. [2024-10-29 15:22:37,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-29 15:22:37,477 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.666666666666667) internal successors, (60), 10 states have internal predecessors, (60), 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 60 [2024-10-29 15:22:37,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-29 15:22:37,479 INFO L225 Difference]: With dead ends: 427 [2024-10-29 15:22:37,479 INFO L226 Difference]: Without dead ends: 416 [2024-10-29 15:22:37,480 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=167, Unknown=0, NotChecked=0, Total=240 [2024-10-29 15:22:37,482 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 160 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-29 15:22:37,482 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 302 Invalid, 292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-29 15:22:37,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2024-10-29 15:22:37,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 408. [2024-10-29 15:22:37,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 408 states, 404 states have (on average 1.7574257425742574) internal successors, (710), 407 states have internal predecessors, (710), 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:22:37,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 710 transitions. [2024-10-29 15:22:37,492 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 710 transitions. Word has length 60 [2024-10-29 15:22:37,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-29 15:22:37,492 INFO L471 AbstractCegarLoop]: Abstraction has 408 states and 710 transitions. [2024-10-29 15:22:37,493 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.666666666666667) internal successors, (60), 10 states have internal predecessors, (60), 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:22:37,493 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 710 transitions. [2024-10-29 15:22:37,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-29 15:22:37,494 INFO L207 NwaCegarLoop]: Found error trace [2024-10-29 15:22:37,494 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] [2024-10-29 15:22:37,494 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-29 15:22:37,495 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-10-29 15:22:37,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-29 15:22:37,498 INFO L85 PathProgramCache]: Analyzing trace with hash -1266306738, now seen corresponding path program 2 times [2024-10-29 15:22:37,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-29 15:22:37,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566614346] [2024-10-29 15:22:37,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-29 15:22:37,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-29 15:22:37,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-29 15:22:37,952 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:22:37,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-29 15:22:37,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566614346] [2024-10-29 15:22:37,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1566614346] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-29 15:22:37,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-29 15:22:37,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-29 15:22:37,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497938318] [2024-10-29 15:22:37,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-29 15:22:37,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-29 15:22:37,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-29 15:22:37,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-29 15:22:37,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-10-29 15:22:37,954 INFO L87 Difference]: Start difference. First operand 408 states and 710 transitions. Second operand has 10 states, 9 states have (on average 6.666666666666667) internal successors, (60), 10 states have internal predecessors, (60), 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:22:38,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-29 15:22:38,226 INFO L93 Difference]: Finished difference Result 416 states and 720 transitions. [2024-10-29 15:22:38,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-29 15:22:38,227 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.666666666666667) internal successors, (60), 10 states have internal predecessors, (60), 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 60 [2024-10-29 15:22:38,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-29 15:22:38,229 INFO L225 Difference]: With dead ends: 416 [2024-10-29 15:22:38,229 INFO L226 Difference]: Without dead ends: 384 [2024-10-29 15:22:38,230 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2024-10-29 15:22:38,230 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 120 mSDsluCounter, 327 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 407 SdHoareTripleChecker+Invalid, 345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-29 15:22:38,231 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 407 Invalid, 345 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-29 15:22:38,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2024-10-29 15:22:38,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 370. [2024-10-29 15:22:38,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 370 states, 366 states have (on average 1.7322404371584699) internal successors, (634), 369 states have internal predecessors, (634), 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:22:38,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 634 transitions. [2024-10-29 15:22:38,239 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 634 transitions. Word has length 60 [2024-10-29 15:22:38,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-29 15:22:38,239 INFO L471 AbstractCegarLoop]: Abstraction has 370 states and 634 transitions. [2024-10-29 15:22:38,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.666666666666667) internal successors, (60), 10 states have internal predecessors, (60), 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:22:38,240 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 634 transitions. [2024-10-29 15:22:38,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-10-29 15:22:38,241 INFO L207 NwaCegarLoop]: Found error trace [2024-10-29 15:22:38,241 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-29 15:22:38,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-29 15:22:38,241 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-10-29 15:22:38,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-29 15:22:38,242 INFO L85 PathProgramCache]: Analyzing trace with hash -70845828, now seen corresponding path program 1 times [2024-10-29 15:22:38,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-29 15:22:38,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325945061] [2024-10-29 15:22:38,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-29 15:22:38,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-29 15:22:38,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-29 15:22:38,751 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:22:38,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-29 15:22:38,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325945061] [2024-10-29 15:22:38,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325945061] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-29 15:22:38,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-29 15:22:38,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-29 15:22:38,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180027689] [2024-10-29 15:22:38,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-29 15:22:38,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-29 15:22:38,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-29 15:22:38,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-29 15:22:38,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-10-29 15:22:38,753 INFO L87 Difference]: Start difference. First operand 370 states and 634 transitions. Second operand has 11 states, 10 states have (on average 6.9) internal successors, (69), 11 states have internal predecessors, (69), 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:22:39,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-29 15:22:39,054 INFO L93 Difference]: Finished difference Result 409 states and 692 transitions. [2024-10-29 15:22:39,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-29 15:22:39,054 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 6.9) internal successors, (69), 11 states have internal predecessors, (69), 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 69 [2024-10-29 15:22:39,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-29 15:22:39,057 INFO L225 Difference]: With dead ends: 409 [2024-10-29 15:22:39,057 INFO L226 Difference]: Without dead ends: 394 [2024-10-29 15:22:39,058 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=119, Invalid=301, Unknown=0, NotChecked=0, Total=420 [2024-10-29 15:22:39,058 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 167 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-29 15:22:39,059 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 228 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-29 15:22:39,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2024-10-29 15:22:39,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 371. [2024-10-29 15:22:39,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 371 states, 367 states have (on average 1.7329700272479565) internal successors, (636), 370 states have internal predecessors, (636), 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:22:39,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 636 transitions. [2024-10-29 15:22:39,067 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 636 transitions. Word has length 69 [2024-10-29 15:22:39,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-29 15:22:39,068 INFO L471 AbstractCegarLoop]: Abstraction has 371 states and 636 transitions. [2024-10-29 15:22:39,068 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 6.9) internal successors, (69), 11 states have internal predecessors, (69), 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:22:39,068 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 636 transitions. [2024-10-29 15:22:39,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-10-29 15:22:39,069 INFO L207 NwaCegarLoop]: Found error trace [2024-10-29 15:22:39,069 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-29 15:22:39,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-29 15:22:39,069 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-10-29 15:22:39,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-29 15:22:39,070 INFO L85 PathProgramCache]: Analyzing trace with hash -1847584784, now seen corresponding path program 2 times [2024-10-29 15:22:39,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-29 15:22:39,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380372295] [2024-10-29 15:22:39,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-29 15:22:39,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-29 15:22:39,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-29 15:22:39,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-29 15:22:39,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-29 15:22:39,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380372295] [2024-10-29 15:22:39,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380372295] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-29 15:22:39,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-29 15:22:39,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-29 15:22:39,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267500669] [2024-10-29 15:22:39,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-29 15:22:39,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-29 15:22:39,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-29 15:22:39,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-29 15:22:39,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-29 15:22:39,604 INFO L87 Difference]: Start difference. First operand 371 states and 636 transitions. Second operand has 11 states, 10 states have (on average 6.9) internal successors, (69), 11 states have internal predecessors, (69), 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:22:39,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-29 15:22:39,859 INFO L93 Difference]: Finished difference Result 371 states and 636 transitions. [2024-10-29 15:22:39,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-29 15:22:39,859 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 6.9) internal successors, (69), 11 states have internal predecessors, (69), 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 69 [2024-10-29 15:22:39,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-29 15:22:39,862 INFO L225 Difference]: With dead ends: 371 [2024-10-29 15:22:39,862 INFO L226 Difference]: Without dead ends: 356 [2024-10-29 15:22:39,863 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2024-10-29 15:22:39,863 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 79 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-29 15:22:39,863 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 317 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-29 15:22:39,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2024-10-29 15:22:39,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 354. [2024-10-29 15:22:39,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 351 states have (on average 1.7492877492877492) internal successors, (614), 353 states have internal predecessors, (614), 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:22:39,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 614 transitions. [2024-10-29 15:22:39,873 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 614 transitions. Word has length 69 [2024-10-29 15:22:39,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-29 15:22:39,873 INFO L471 AbstractCegarLoop]: Abstraction has 354 states and 614 transitions. [2024-10-29 15:22:39,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 6.9) internal successors, (69), 11 states have internal predecessors, (69), 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:22:39,873 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 614 transitions. [2024-10-29 15:22:39,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-10-29 15:22:39,875 INFO L207 NwaCegarLoop]: Found error trace [2024-10-29 15:22:39,877 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-29 15:22:39,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-29 15:22:39,877 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-10-29 15:22:39,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-29 15:22:39,878 INFO L85 PathProgramCache]: Analyzing trace with hash -1438658403, now seen corresponding path program 1 times [2024-10-29 15:22:39,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-29 15:22:39,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676299604] [2024-10-29 15:22:39,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-29 15:22:39,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-29 15:22:39,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-29 15:22:39,900 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-29 15:22:39,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-29 15:22:39,944 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-29 15:22:39,944 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-29 15:22:39,945 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (13 of 14 remaining) [2024-10-29 15:22:39,948 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (12 of 14 remaining) [2024-10-29 15:22:39,948 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (11 of 14 remaining) [2024-10-29 15:22:39,948 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (10 of 14 remaining) [2024-10-29 15:22:39,948 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (9 of 14 remaining) [2024-10-29 15:22:39,948 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 14 remaining) [2024-10-29 15:22:39,949 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (7 of 14 remaining) [2024-10-29 15:22:39,949 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (6 of 14 remaining) [2024-10-29 15:22:39,949 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (5 of 14 remaining) [2024-10-29 15:22:39,949 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (4 of 14 remaining) [2024-10-29 15:22:39,949 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (3 of 14 remaining) [2024-10-29 15:22:39,949 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (2 of 14 remaining) [2024-10-29 15:22:39,949 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (1 of 14 remaining) [2024-10-29 15:22:39,949 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (0 of 14 remaining) [2024-10-29 15:22:39,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-29 15:22:39,953 INFO L407 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-29 15:22:40,013 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-10-29 15:22:40,013 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-10-29 15:22:40,016 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.10 03:22:40 BasicIcfg [2024-10-29 15:22:40,016 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-29 15:22:40,016 INFO L158 Benchmark]: Toolchain (without parser) took 9346.88ms. Allocated memory was 144.7MB in the beginning and 369.1MB in the end (delta: 224.4MB). Free memory was 85.7MB in the beginning and 245.8MB in the end (delta: -160.1MB). Peak memory consumption was 66.4MB. Max. memory is 16.1GB. [2024-10-29 15:22:40,016 INFO L158 Benchmark]: Witness Parser took 0.21ms. Allocated memory is still 144.7MB. Free memory is still 83.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-29 15:22:40,016 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 144.7MB. Free memory was 81.4MB in the beginning and 81.2MB in the end (delta: 209.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-29 15:22:40,017 INFO L158 Benchmark]: CACSL2BoogieTranslator took 816.45ms. Allocated memory was 144.7MB in the beginning and 199.2MB in the end (delta: 54.5MB). Free memory was 85.4MB in the beginning and 166.1MB in the end (delta: -80.7MB). Peak memory consumption was 48.3MB. Max. memory is 16.1GB. [2024-10-29 15:22:40,017 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.29ms. Allocated memory is still 199.2MB. Free memory was 166.1MB in the beginning and 166.5MB in the end (delta: -447.6kB). Peak memory consumption was 7.2MB. Max. memory is 16.1GB. [2024-10-29 15:22:40,018 INFO L158 Benchmark]: Boogie Preprocessor took 33.78ms. Allocated memory is still 199.2MB. Free memory was 166.5MB in the beginning and 164.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-29 15:22:40,018 INFO L158 Benchmark]: RCFGBuilder took 472.14ms. Allocated memory is still 199.2MB. Free memory was 164.4MB in the beginning and 146.6MB in the end (delta: 17.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-29 15:22:40,019 INFO L158 Benchmark]: TraceAbstraction took 7956.57ms. Allocated memory was 199.2MB in the beginning and 369.1MB in the end (delta: 169.9MB). Free memory was 145.6MB in the beginning and 245.8MB in the end (delta: -100.3MB). Peak memory consumption was 69.6MB. Max. memory is 16.1GB. [2024-10-29 15:22:40,021 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Witness Parser took 0.21ms. Allocated memory is still 144.7MB. Free memory is still 83.5MB. There was no memory consumed. Max. memory is 16.1GB. * CDTParser took 0.18ms. Allocated memory is still 144.7MB. Free memory was 81.4MB in the beginning and 81.2MB in the end (delta: 209.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 816.45ms. Allocated memory was 144.7MB in the beginning and 199.2MB in the end (delta: 54.5MB). Free memory was 85.4MB in the beginning and 166.1MB in the end (delta: -80.7MB). Peak memory consumption was 48.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 62.29ms. Allocated memory is still 199.2MB. Free memory was 166.1MB in the beginning and 166.5MB in the end (delta: -447.6kB). Peak memory consumption was 7.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 33.78ms. Allocated memory is still 199.2MB. Free memory was 166.5MB in the beginning and 164.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 472.14ms. Allocated memory is still 199.2MB. Free memory was 164.4MB in the beginning and 146.6MB in the end (delta: 17.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 7956.57ms. Allocated memory was 199.2MB in the beginning and 369.1MB in the end (delta: 169.9MB). Free memory was 145.6MB in the beginning and 245.8MB in the end (delta: -100.3MB). Peak memory consumption was 69.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - DataRaceFoundResult [Line: 1245]: Data race detected Data race detected The following path leads to a data race: [L1227] 0 data *d; VAL [d={0:0}] [L1228] 0 pthread_mutex_t m = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; VAL [d={0:0}, m={1:0}] [L1237] 0 pthread_t id; VAL [d={0:0}, m={1:0}] [L1238] 0 data *z; VAL [d={0:0}, m={1:0}] [L1239] 0 d = malloc(sizeof(data)) VAL [d={-2:0}, m={1:0}] [L1240] 0 z = d VAL [d={-2:0}, m={1:0}, z={-2:0}] [L1241] FCALL, FORK 0 pthread_create(&id, ((void *)0), t_fun, ((void *)0)) VAL [\old(arg)={0:0}, d={-2:0}, id=-1, m={1:0}, z={-2:0}] [L1243] EXPR 0 d->x VAL [\old(arg)={0:0}, d={-2:0}, id=-1, m={1:0}, z={-2:0}] [L1243] 0 printf("%d\n",d->x) VAL [\old(arg)={0:0}, d={-2:0}, id=-1, m={1:0}, z={-2:0}] [L1245] EXPR 0 z->y VAL [\old(arg)={0:0}, arg={0:0}, d={-2:0}, id=-1, m={1:0}, z={-2:0}] [L1231] EXPR 1 d->x VAL [\old(arg)={0:0}, arg={0:0}, d={-2:0}, m={1:0}] [L1231] 1 d->x = 3 VAL [\old(arg)={0:0}, arg={0:0}, d={-2:0}, m={1:0}] [L1232] EXPR 1 d->y VAL [\old(arg)={0:0}, arg={0:0}, d={-2:0}, m={1:0}] [L1232] 1 d->y = 8 VAL [\old(arg)={0:0}, arg={0:0}, d={-2:0}, m={1:0}] [L1245] 0 printf("%d\n",z->y) VAL [\old(arg)={0:0}, arg={0:0}, d={-2:0}, id=-1, m={1:0}, z={-2:0}] Now there is a data race, but we were unable to determine exactly which statements and variables are involved. There could be a race between one of the statements * C: d->x = 3 [1231] * C: d->y = 8 [1232] * C: d->x = 3 [1231] * C: d = malloc(sizeof(data)) [1239] * C: d->x = 3 [1231] * C: d->x = 3 [1231] and C: printf("%d\n",z->y) [1245] - UnprovableResult [Line: 1239]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1240]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1243]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1243]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1241]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 1231]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1231]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1232]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1232]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 129 locations, 14 error locations. Started 1 CEGAR loops. OverallTime: 7.8s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1277 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1277 mSDsluCounter, 3084 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1945 mSDsCounter, 195 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2182 IncrementalHoareTripleChecker+Invalid, 2377 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 195 mSolverCounterUnsat, 1139 mSDtfsCounter, 2182 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 103 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1143occurred in iteration=4, InterpolantAutomatonStates: 89, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 12 MinimizatonAttempts, 973 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 4.1s InterpolantComputationTime, 662 NumberOfCodeBlocks, 662 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 580 ConstructedInterpolants, 0 QuantifiedInterpolants, 3350 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-10-29 15:22:40,053 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE