./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread/fib_unsafe-11-racy.i --full-output --witness-type violation_witness --validate ../results-verified/LOGDIR/SV-COMP24_no-data-race/fib_unsafe-11-racy.yml/witness.graphml --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 194c01fd Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../sv-benchmarks/c/pthread/fib_unsafe-11-racy.i ../results-verified/LOGDIR/SV-COMP24_no-data-race/fib_unsafe-11-racy.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:19:01,515 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-29 15:19:01,589 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-10-29 15:19:01,593 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-29 15:19:01,593 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-29 15:19:01,622 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-29 15:19:01,622 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-29 15:19:01,622 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-29 15:19:01,623 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-29 15:19:01,623 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-29 15:19:01,624 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-29 15:19:01,626 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-29 15:19:01,627 INFO L153 SettingsManager]: * Use SBE=true [2024-10-29 15:19:01,628 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-29 15:19:01,628 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-29 15:19:01,630 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-29 15:19:01,630 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-29 15:19:01,631 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-29 15:19:01,631 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-29 15:19:01,631 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-29 15:19:01,631 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-29 15:19:01,635 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-29 15:19:01,636 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-10-29 15:19:01,636 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-29 15:19:01,636 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-29 15:19:01,636 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-29 15:19:01,636 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-29 15:19:01,637 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-29 15:19:01,637 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-29 15:19:01,637 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-29 15:19:01,637 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-29 15:19:01,637 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-29 15:19:01,638 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-29 15:19:01,638 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-29 15:19:01,638 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-29 15:19:01,638 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-29 15:19:01,638 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-29 15:19:01,638 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-29 15:19:01,639 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-29 15:19:01,639 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-29 15:19:01,639 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-29 15:19:01,640 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:19:01,881 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-29 15:19:01,902 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-29 15:19:01,904 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-29 15:19:01,905 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-29 15:19:01,906 INFO L274 PluginConnector]: CDTParser initialized [2024-10-29 15:19:01,906 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread/fib_unsafe-11-racy.i [2024-10-29 15:19:03,295 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-29 15:19:03,497 INFO L384 CDTParser]: Found 1 translation units. [2024-10-29 15:19:03,498 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/fib_unsafe-11-racy.i [2024-10-29 15:19:03,508 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b1c20ea2/a0139439fd7748b082b378f4001932fa/FLAG694ac2b05 [2024-10-29 15:19:03,849 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b1c20ea2/a0139439fd7748b082b378f4001932fa [2024-10-29 15:19:03,851 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-10-29 15:19:03,851 INFO L274 PluginConnector]: Witness Parser initialized [2024-10-29 15:19:03,852 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../results-verified/LOGDIR/SV-COMP24_no-data-race/fib_unsafe-11-racy.yml/witness.graphml [2024-10-29 15:19:03,925 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-29 15:19:03,926 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-10-29 15:19:03,927 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-29 15:19:03,927 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-29 15:19:03,931 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-29 15:19:03,931 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.10 03:19:03" (1/2) ... [2024-10-29 15:19:03,932 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26e2b625 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 03:19:03, skipping insertion in model container [2024-10-29 15:19:03,932 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.10 03:19:03" (1/2) ... [2024-10-29 15:19:03,933 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@715690a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 03:19:03, skipping insertion in model container [2024-10-29 15:19:03,933 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.graphml de.uni_freiburg.informatik.ultimate.witnessparser VIOLATION_WITNESS 29.10 03:19:03" (2/2) ... [2024-10-29 15:19:03,933 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26e2b625 and model type witness.graphml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 29.10 03:19:03, skipping insertion in model container [2024-10-29 15:19:03,933 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.graphml de.uni_freiburg.informatik.ultimate.witnessparser VIOLATION_WITNESS 29.10 03:19:03" (2/2) ... [2024-10-29 15:19:03,960 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-29 15:19:04,202 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-29 15:19:04,211 INFO L200 MainTranslator]: Completed pre-run [2024-10-29 15:19:04,260 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-29 15:19:04,312 INFO L204 MainTranslator]: Completed translation [2024-10-29 15:19:04,313 INFO L201 PluginConnector]: Adding new model witness.graphml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 29.10 03:19:04 WrapperNode [2024-10-29 15:19:04,313 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-29 15:19:04,314 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-29 15:19:04,314 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-29 15:19:04,314 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-29 15:19:04,325 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "witness.graphml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 29.10 03:19:04" (1/1) ... [2024-10-29 15:19:04,342 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "witness.graphml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 29.10 03:19:04" (1/1) ... [2024-10-29 15:19:04,359 INFO L138 Inliner]: procedures = 163, calls = 19, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 114 [2024-10-29 15:19:04,360 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-29 15:19:04,363 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-29 15:19:04,363 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-29 15:19:04,363 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-29 15:19:04,371 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.graphml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 29.10 03:19:04" (1/1) ... [2024-10-29 15:19:04,371 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.graphml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 29.10 03:19:04" (1/1) ... [2024-10-29 15:19:04,378 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.graphml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 29.10 03:19:04" (1/1) ... [2024-10-29 15:19:04,379 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.graphml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 29.10 03:19:04" (1/1) ... [2024-10-29 15:19:04,390 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.graphml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 29.10 03:19:04" (1/1) ... [2024-10-29 15:19:04,401 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.graphml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 29.10 03:19:04" (1/1) ... [2024-10-29 15:19:04,402 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.graphml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 29.10 03:19:04" (1/1) ... [2024-10-29 15:19:04,407 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.graphml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 29.10 03:19:04" (1/1) ... [2024-10-29 15:19:04,409 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-29 15:19:04,410 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-29 15:19:04,410 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-29 15:19:04,410 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-29 15:19:04,414 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.graphml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 29.10 03:19:04" (1/1) ... [2024-10-29 15:19:04,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-29 15:19:04,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-29 15:19:04,441 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:19:04,444 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:19:04,483 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2024-10-29 15:19:04,483 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2024-10-29 15:19:04,483 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2024-10-29 15:19:04,483 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2024-10-29 15:19:04,483 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-10-29 15:19:04,483 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-29 15:19:04,484 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-10-29 15:19:04,484 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-10-29 15:19:04,484 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-29 15:19:04,484 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-29 15:19:04,485 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:19:04,583 INFO L238 CfgBuilder]: Building ICFG [2024-10-29 15:19:04,584 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-29 15:19:04,741 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-29 15:19:04,741 INFO L287 CfgBuilder]: Performing block encoding [2024-10-29 15:19:04,805 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-29 15:19:04,809 INFO L316 CfgBuilder]: Removed 3 assume(true) statements. [2024-10-29 15:19:04,809 INFO L201 PluginConnector]: Adding new model witness.graphml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.10 03:19:04 BoogieIcfgContainer [2024-10-29 15:19:04,809 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-29 15:19:04,811 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-29 15:19:04,811 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-29 15:19:04,813 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-29 15:19:04,814 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.10 03:19:03" (1/4) ... [2024-10-29 15:19:04,814 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51e18f3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.10 03:19:04, skipping insertion in model container [2024-10-29 15:19:04,814 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.graphml de.uni_freiburg.informatik.ultimate.witnessparser VIOLATION_WITNESS 29.10 03:19:03" (2/4) ... [2024-10-29 15:19:04,814 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51e18f3b and model type witness.graphml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction VIOLATION_WITNESS 29.10 03:19:04, skipping insertion in model container [2024-10-29 15:19:04,814 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.graphml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 29.10 03:19:04" (3/4) ... [2024-10-29 15:19:04,818 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51e18f3b and model type witness.graphml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction VIOLATION_WITNESS 29.10 03:19:04, skipping insertion in model container [2024-10-29 15:19:04,818 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.graphml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.10 03:19:04" (4/4) ... [2024-10-29 15:19:04,819 INFO L112 eAbstractionObserver]: Analyzing ICFG fib_unsafe-11-racy.i [2024-10-29 15:19:04,819 WARN L117 eAbstractionObserver]: Found a witness automaton. I will only consider traces that are accepted by the witness automaton [2024-10-29 15:19:04,856 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-29 15:19:04,857 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 30 error locations. [2024-10-29 15:19:04,857 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-29 15:19:04,919 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-29 15:19:04,930 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:19:04,939 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 186 places, 188 transitions, 384 flow [2024-10-29 15:19:07,061 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 73235 states, 72274 states have (on average 3.1515067659185876) internal successors, (227772), 73234 states have internal predecessors, (227772), 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:19:07,105 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-29 15:19:07,112 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;@34d3bd2a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-29 15:19:07,112 INFO L334 AbstractCegarLoop]: Starting to check reachability of 46 error locations. [2024-10-29 15:19:07,276 INFO L276 IsEmpty]: Start isEmpty. Operand has 73235 states, 72274 states have (on average 3.1515067659185876) internal successors, (227772), 73234 states have internal predecessors, (227772), 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:19:07,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-29 15:19:07,281 INFO L207 NwaCegarLoop]: Found error trace [2024-10-29 15:19:07,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] [2024-10-29 15:19:07,284 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2024-10-29 15:19:07,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-29 15:19:07,291 INFO L85 PathProgramCache]: Analyzing trace with hash 959234546, now seen corresponding path program 1 times [2024-10-29 15:19:07,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-29 15:19:07,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781960072] [2024-10-29 15:19:07,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-29 15:19:07,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-29 15:19:07,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-29 15:19:07,542 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:19:07,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-29 15:19:07,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781960072] [2024-10-29 15:19:07,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [781960072] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-29 15:19:07,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-29 15:19:07,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-29 15:19:07,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355176492] [2024-10-29 15:19:07,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-29 15:19:07,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-29 15:19:07,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-29 15:19:07,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-29 15:19:07,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-29 15:19:07,774 INFO L87 Difference]: Start difference. First operand has 73235 states, 72274 states have (on average 3.1515067659185876) internal successors, (227772), 73234 states have internal predecessors, (227772), 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 2 states, 1 states have (on average 22.0) internal successors, (22), 2 states have internal predecessors, (22), 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:19:09,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-29 15:19:09,706 INFO L93 Difference]: Finished difference Result 101501 states and 319117 transitions. [2024-10-29 15:19:09,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-29 15:19:09,709 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 22.0) internal successors, (22), 2 states have internal predecessors, (22), 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 22 [2024-10-29 15:19:09,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-29 15:19:10,378 INFO L225 Difference]: With dead ends: 101501 [2024-10-29 15:19:10,379 INFO L226 Difference]: Without dead ends: 57526 [2024-10-29 15:19:10,468 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-29 15:19:10,471 INFO L432 NwaCegarLoop]: 165 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-29 15:19:10,472 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 165 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-29 15:19:10,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57526 states. [2024-10-29 15:19:12,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57526 to 57526. [2024-10-29 15:19:12,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57526 states, 57128 states have (on average 3.028900014003641) internal successors, (173035), 57525 states have internal predecessors, (173035), 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:19:13,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57526 states to 57526 states and 173035 transitions. [2024-10-29 15:19:13,120 INFO L78 Accepts]: Start accepts. Automaton has 57526 states and 173035 transitions. Word has length 22 [2024-10-29 15:19:13,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-29 15:19:13,121 INFO L471 AbstractCegarLoop]: Abstraction has 57526 states and 173035 transitions. [2024-10-29 15:19:13,122 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 22.0) internal successors, (22), 2 states have internal predecessors, (22), 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:19:13,122 INFO L276 IsEmpty]: Start isEmpty. Operand 57526 states and 173035 transitions. [2024-10-29 15:19:13,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-10-29 15:19:13,123 INFO L207 NwaCegarLoop]: Found error trace [2024-10-29 15:19:13,123 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] [2024-10-29 15:19:13,123 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-29 15:19:13,123 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2024-10-29 15:19:13,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-29 15:19:13,124 INFO L85 PathProgramCache]: Analyzing trace with hash -529477545, now seen corresponding path program 1 times [2024-10-29 15:19:13,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-29 15:19:13,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220437206] [2024-10-29 15:19:13,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-29 15:19:13,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-29 15:19:13,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-29 15:19:13,225 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:19:13,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-29 15:19:13,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220437206] [2024-10-29 15:19:13,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220437206] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-29 15:19:13,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-29 15:19:13,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-29 15:19:13,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111635292] [2024-10-29 15:19:13,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-29 15:19:13,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-29 15:19:13,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-29 15:19:13,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-29 15:19:13,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-29 15:19:13,230 INFO L87 Difference]: Start difference. First operand 57526 states and 173035 transitions. Second operand has 3 states, 2 states have (on average 16.0) internal successors, (32), 3 states have internal predecessors, (32), 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:19:13,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-29 15:19:13,916 INFO L93 Difference]: Finished difference Result 57526 states and 173035 transitions. [2024-10-29 15:19:13,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-29 15:19:13,917 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 16.0) internal successors, (32), 3 states have internal predecessors, (32), 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 32 [2024-10-29 15:19:13,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-29 15:19:14,448 INFO L225 Difference]: With dead ends: 57526 [2024-10-29 15:19:14,448 INFO L226 Difference]: Without dead ends: 55310 [2024-10-29 15:19:14,469 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:19:14,470 INFO L432 NwaCegarLoop]: 279 mSDtfsCounter, 119 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-29 15:19:14,471 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 430 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-29 15:19:14,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55310 states. [2024-10-29 15:19:15,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55310 to 55310. [2024-10-29 15:19:15,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55310 states, 54992 states have (on average 3.0252945883037534) internal successors, (166367), 55309 states have internal predecessors, (166367), 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:19:15,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55310 states to 55310 states and 166367 transitions. [2024-10-29 15:19:15,983 INFO L78 Accepts]: Start accepts. Automaton has 55310 states and 166367 transitions. Word has length 32 [2024-10-29 15:19:15,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-29 15:19:15,984 INFO L471 AbstractCegarLoop]: Abstraction has 55310 states and 166367 transitions. [2024-10-29 15:19:15,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 16.0) internal successors, (32), 3 states have internal predecessors, (32), 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:19:15,985 INFO L276 IsEmpty]: Start isEmpty. Operand 55310 states and 166367 transitions. [2024-10-29 15:19:15,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-10-29 15:19:15,986 INFO L207 NwaCegarLoop]: Found error trace [2024-10-29 15:19:15,986 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-29 15:19:15,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-29 15:19:15,987 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2024-10-29 15:19:15,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-29 15:19:15,988 INFO L85 PathProgramCache]: Analyzing trace with hash 1749844589, now seen corresponding path program 1 times [2024-10-29 15:19:15,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-29 15:19:15,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657374039] [2024-10-29 15:19:15,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-29 15:19:15,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-29 15:19:16,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-29 15:19:16,047 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:19:16,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-29 15:19:16,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657374039] [2024-10-29 15:19:16,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657374039] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-29 15:19:16,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-29 15:19:16,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-29 15:19:16,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142029719] [2024-10-29 15:19:16,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-29 15:19:16,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-29 15:19:16,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-29 15:19:16,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-29 15:19:16,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-29 15:19:16,049 INFO L87 Difference]: Start difference. First operand 55310 states and 166367 transitions. Second operand has 3 states, 2 states have (on average 17.5) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-29 15:19:16,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-29 15:19:16,737 INFO L93 Difference]: Finished difference Result 55310 states and 166367 transitions. [2024-10-29 15:19:16,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-29 15:19:16,738 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 17.5) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2024-10-29 15:19:16,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-29 15:19:16,990 INFO L225 Difference]: With dead ends: 55310 [2024-10-29 15:19:16,991 INFO L226 Difference]: Without dead ends: 50878 [2024-10-29 15:19:17,035 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:19:17,037 INFO L432 NwaCegarLoop]: 276 mSDtfsCounter, 128 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 422 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-29 15:19:17,037 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 422 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-29 15:19:17,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50878 states. [2024-10-29 15:19:18,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50878 to 50878. [2024-10-29 15:19:18,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50878 states, 50720 states have (on average 3.0171727129337538) internal successors, (153031), 50877 states have internal predecessors, (153031), 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:19:18,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50878 states to 50878 states and 153031 transitions. [2024-10-29 15:19:18,871 INFO L78 Accepts]: Start accepts. Automaton has 50878 states and 153031 transitions. Word has length 35 [2024-10-29 15:19:18,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-29 15:19:18,872 INFO L471 AbstractCegarLoop]: Abstraction has 50878 states and 153031 transitions. [2024-10-29 15:19:18,872 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 17.5) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-29 15:19:18,872 INFO L276 IsEmpty]: Start isEmpty. Operand 50878 states and 153031 transitions. [2024-10-29 15:19:18,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-29 15:19:18,874 INFO L207 NwaCegarLoop]: Found error trace [2024-10-29 15:19:18,874 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] [2024-10-29 15:19:18,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-29 15:19:18,874 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t2Err0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2024-10-29 15:19:18,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-29 15:19:18,875 INFO L85 PathProgramCache]: Analyzing trace with hash -934832415, now seen corresponding path program 1 times [2024-10-29 15:19:18,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-29 15:19:18,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377621000] [2024-10-29 15:19:18,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-29 15:19:18,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-29 15:19:18,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-29 15:19:18,926 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:19:18,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-29 15:19:18,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377621000] [2024-10-29 15:19:18,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [377621000] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-29 15:19:18,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-29 15:19:18,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-29 15:19:18,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972653818] [2024-10-29 15:19:18,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-29 15:19:18,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-29 15:19:18,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-29 15:19:18,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-29 15:19:18,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-29 15:19:18,929 INFO L87 Difference]: Start difference. First operand 50878 states and 153031 transitions. Second operand has 3 states, 2 states have (on average 19.0) internal successors, (38), 3 states have internal predecessors, (38), 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:19:19,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-29 15:19:19,239 INFO L93 Difference]: Finished difference Result 50878 states and 153031 transitions. [2024-10-29 15:19:19,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-29 15:19:19,240 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 19.0) internal successors, (38), 3 states have internal predecessors, (38), 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 38 [2024-10-29 15:19:19,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-29 15:19:19,492 INFO L225 Difference]: With dead ends: 50878 [2024-10-29 15:19:19,492 INFO L226 Difference]: Without dead ends: 48923 [2024-10-29 15:19:19,522 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:19:19,523 INFO L432 NwaCegarLoop]: 268 mSDtfsCounter, 110 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 416 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-29 15:19:19,524 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 416 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-29 15:19:19,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48923 states. [2024-10-29 15:19:20,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48923 to 48923. [2024-10-29 15:19:20,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48923 states, 48797 states have (on average 3.015410783449802) internal successors, (147143), 48922 states have internal predecessors, (147143), 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:19:21,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48923 states to 48923 states and 147143 transitions. [2024-10-29 15:19:21,104 INFO L78 Accepts]: Start accepts. Automaton has 48923 states and 147143 transitions. Word has length 38 [2024-10-29 15:19:21,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-29 15:19:21,105 INFO L471 AbstractCegarLoop]: Abstraction has 48923 states and 147143 transitions. [2024-10-29 15:19:21,105 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 19.0) internal successors, (38), 3 states have internal predecessors, (38), 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:19:21,105 INFO L276 IsEmpty]: Start isEmpty. Operand 48923 states and 147143 transitions. [2024-10-29 15:19:21,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-10-29 15:19:21,109 INFO L207 NwaCegarLoop]: Found error trace [2024-10-29 15:19:21,109 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:19:21,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-29 15:19:21,109 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2024-10-29 15:19:21,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-29 15:19:21,109 INFO L85 PathProgramCache]: Analyzing trace with hash 1890395950, now seen corresponding path program 1 times [2024-10-29 15:19:21,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-29 15:19:21,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673057747] [2024-10-29 15:19:21,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-29 15:19:21,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-29 15:19:21,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-29 15:19:21,148 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:19:21,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-29 15:19:21,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673057747] [2024-10-29 15:19:21,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673057747] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-29 15:19:21,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-29 15:19:21,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-29 15:19:21,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591609269] [2024-10-29 15:19:21,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-29 15:19:21,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-29 15:19:21,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-29 15:19:21,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-29 15:19:21,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-29 15:19:21,150 INFO L87 Difference]: Start difference. First operand 48923 states and 147143 transitions. Second operand has 3 states, 2 states have (on average 20.5) internal successors, (41), 3 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:19:21,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-29 15:19:21,807 INFO L93 Difference]: Finished difference Result 48923 states and 147143 transitions. [2024-10-29 15:19:21,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-29 15:19:21,807 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 20.5) internal successors, (41), 3 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:19:21,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-29 15:19:22,087 INFO L225 Difference]: With dead ends: 48923 [2024-10-29 15:19:22,088 INFO L226 Difference]: Without dead ends: 48348 [2024-10-29 15:19:22,105 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:19:22,106 INFO L432 NwaCegarLoop]: 205 mSDtfsCounter, 49 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-29 15:19:22,106 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 350 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-29 15:19:22,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48348 states. [2024-10-29 15:19:23,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48348 to 48348. [2024-10-29 15:19:23,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48348 states, 48230 states have (on average 3.0150943396226415) internal successors, (145418), 48347 states have internal predecessors, (145418), 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:19:23,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48348 states to 48348 states and 145418 transitions. [2024-10-29 15:19:23,458 INFO L78 Accepts]: Start accepts. Automaton has 48348 states and 145418 transitions. Word has length 41 [2024-10-29 15:19:23,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-29 15:19:23,459 INFO L471 AbstractCegarLoop]: Abstraction has 48348 states and 145418 transitions. [2024-10-29 15:19:23,459 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 20.5) internal successors, (41), 3 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:19:23,459 INFO L276 IsEmpty]: Start isEmpty. Operand 48348 states and 145418 transitions. [2024-10-29 15:19:23,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-10-29 15:19:23,461 INFO L207 NwaCegarLoop]: Found error trace [2024-10-29 15:19:23,461 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:19:23,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-29 15:19:23,462 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t2Err1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2024-10-29 15:19:23,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-29 15:19:23,462 INFO L85 PathProgramCache]: Analyzing trace with hash -1023988735, now seen corresponding path program 1 times [2024-10-29 15:19:23,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-29 15:19:23,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922477450] [2024-10-29 15:19:23,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-29 15:19:23,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-29 15:19:23,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-29 15:19:23,507 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:19:23,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-29 15:19:23,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922477450] [2024-10-29 15:19:23,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [922477450] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-29 15:19:23,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-29 15:19:23,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-29 15:19:23,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061385909] [2024-10-29 15:19:23,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-29 15:19:23,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-29 15:19:23,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-29 15:19:23,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-29 15:19:23,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-29 15:19:23,509 INFO L87 Difference]: Start difference. First operand 48348 states and 145418 transitions. Second operand has 3 states, 2 states have (on average 20.5) internal successors, (41), 3 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:19:23,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-29 15:19:23,732 INFO L93 Difference]: Finished difference Result 48348 states and 145418 transitions. [2024-10-29 15:19:23,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-29 15:19:23,733 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 20.5) internal successors, (41), 3 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:19:23,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-29 15:19:23,939 INFO L225 Difference]: With dead ends: 48348 [2024-10-29 15:19:23,939 INFO L226 Difference]: Without dead ends: 44484 [2024-10-29 15:19:23,965 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:19:23,966 INFO L432 NwaCegarLoop]: 263 mSDtfsCounter, 118 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 405 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-29 15:19:23,966 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 405 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-29 15:19:24,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44484 states. [2024-10-29 15:19:25,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44484 to 44484. [2024-10-29 15:19:25,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44484 states, 44426 states have (on average 3.011299689371089) internal successors, (133780), 44483 states have internal predecessors, (133780), 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:19:25,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44484 states to 44484 states and 133780 transitions. [2024-10-29 15:19:25,475 INFO L78 Accepts]: Start accepts. Automaton has 44484 states and 133780 transitions. Word has length 41 [2024-10-29 15:19:25,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-29 15:19:25,476 INFO L471 AbstractCegarLoop]: Abstraction has 44484 states and 133780 transitions. [2024-10-29 15:19:25,476 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 20.5) internal successors, (41), 3 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:19:25,476 INFO L276 IsEmpty]: Start isEmpty. Operand 44484 states and 133780 transitions. [2024-10-29 15:19:25,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-10-29 15:19:25,478 INFO L207 NwaCegarLoop]: Found error trace [2024-10-29 15:19:25,478 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] [2024-10-29 15:19:25,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-29 15:19:25,479 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2024-10-29 15:19:25,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-29 15:19:25,479 INFO L85 PathProgramCache]: Analyzing trace with hash 1174888269, now seen corresponding path program 1 times [2024-10-29 15:19:25,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-29 15:19:25,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810007229] [2024-10-29 15:19:25,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-29 15:19:25,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-29 15:19:25,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-29 15:19:25,507 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:19:25,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-29 15:19:25,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810007229] [2024-10-29 15:19:25,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [810007229] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-29 15:19:25,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-29 15:19:25,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-29 15:19:25,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109604080] [2024-10-29 15:19:25,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-29 15:19:25,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-29 15:19:25,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-29 15:19:25,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-29 15:19:25,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-29 15:19:25,509 INFO L87 Difference]: Start difference. First operand 44484 states and 133780 transitions. Second operand has 3 states, 2 states have (on average 22.0) internal successors, (44), 3 states have internal predecessors, (44), 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:19:25,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-29 15:19:25,761 INFO L93 Difference]: Finished difference Result 44484 states and 133780 transitions. [2024-10-29 15:19:25,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-29 15:19:25,762 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 22.0) internal successors, (44), 3 states have internal predecessors, (44), 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 44 [2024-10-29 15:19:25,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-29 15:19:25,988 INFO L225 Difference]: With dead ends: 44484 [2024-10-29 15:19:25,988 INFO L226 Difference]: Without dead ends: 43426 [2024-10-29 15:19:26,012 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:19:26,013 INFO L432 NwaCegarLoop]: 198 mSDtfsCounter, 113 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-29 15:19:26,013 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 280 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-29 15:19:26,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43426 states. [2024-10-29 15:19:27,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43426 to 43426. [2024-10-29 15:19:27,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43426 states, 43376 states have (on average 3.0110199188491333) internal successors, (130606), 43425 states have internal predecessors, (130606), 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:19:27,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43426 states to 43426 states and 130606 transitions. [2024-10-29 15:19:27,431 INFO L78 Accepts]: Start accepts. Automaton has 43426 states and 130606 transitions. Word has length 44 [2024-10-29 15:19:27,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-29 15:19:27,432 INFO L471 AbstractCegarLoop]: Abstraction has 43426 states and 130606 transitions. [2024-10-29 15:19:27,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 22.0) internal successors, (44), 3 states have internal predecessors, (44), 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:19:27,432 INFO L276 IsEmpty]: Start isEmpty. Operand 43426 states and 130606 transitions. [2024-10-29 15:19:27,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-10-29 15:19:27,433 INFO L207 NwaCegarLoop]: Found error trace [2024-10-29 15:19:27,433 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] [2024-10-29 15:19:27,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-29 15:19:27,435 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t1Err6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2024-10-29 15:19:27,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-29 15:19:27,437 INFO L85 PathProgramCache]: Analyzing trace with hash -1742870495, now seen corresponding path program 1 times [2024-10-29 15:19:27,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-29 15:19:27,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144805743] [2024-10-29 15:19:27,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-29 15:19:27,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-29 15:19:27,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-29 15:19:27,476 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:19:27,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-29 15:19:27,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144805743] [2024-10-29 15:19:27,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144805743] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-29 15:19:27,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-29 15:19:27,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-29 15:19:27,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184004855] [2024-10-29 15:19:27,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-29 15:19:27,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-29 15:19:27,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-29 15:19:27,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-29 15:19:27,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-29 15:19:27,477 INFO L87 Difference]: Start difference. First operand 43426 states and 130606 transitions. Second operand has 3 states, 2 states have (on average 22.0) internal successors, (44), 3 states have internal predecessors, (44), 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:19:28,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-29 15:19:28,122 INFO L93 Difference]: Finished difference Result 43426 states and 130606 transitions. [2024-10-29 15:19:28,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-29 15:19:28,123 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 22.0) internal successors, (44), 3 states have internal predecessors, (44), 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 44 [2024-10-29 15:19:28,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-29 15:19:28,301 INFO L225 Difference]: With dead ends: 43426 [2024-10-29 15:19:28,301 INFO L226 Difference]: Without dead ends: 40793 [2024-10-29 15:19:28,320 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:19:28,321 INFO L432 NwaCegarLoop]: 264 mSDtfsCounter, 114 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-29 15:19:28,321 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 408 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-29 15:19:28,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40793 states. [2024-10-29 15:19:28,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40793 to 40793. [2024-10-29 15:19:29,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40793 states, 40769 states have (on average 3.0079962716770097) internal successors, (122633), 40792 states have internal predecessors, (122633), 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:19:29,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40793 states to 40793 states and 122633 transitions. [2024-10-29 15:19:29,241 INFO L78 Accepts]: Start accepts. Automaton has 40793 states and 122633 transitions. Word has length 44 [2024-10-29 15:19:29,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-29 15:19:29,242 INFO L471 AbstractCegarLoop]: Abstraction has 40793 states and 122633 transitions. [2024-10-29 15:19:29,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 22.0) internal successors, (44), 3 states have internal predecessors, (44), 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:19:29,242 INFO L276 IsEmpty]: Start isEmpty. Operand 40793 states and 122633 transitions. [2024-10-29 15:19:29,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-10-29 15:19:29,245 INFO L207 NwaCegarLoop]: Found error trace [2024-10-29 15:19:29,245 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] [2024-10-29 15:19:29,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-29 15:19:29,245 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2024-10-29 15:19:29,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-29 15:19:29,246 INFO L85 PathProgramCache]: Analyzing trace with hash 1408284112, now seen corresponding path program 1 times [2024-10-29 15:19:29,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-29 15:19:29,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021828057] [2024-10-29 15:19:29,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-29 15:19:29,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-29 15:19:29,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-29 15:19:29,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-29 15:19:29,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-29 15:19:29,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021828057] [2024-10-29 15:19:29,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2021828057] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-29 15:19:29,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-29 15:19:29,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-29 15:19:29,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206654283] [2024-10-29 15:19:29,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-29 15:19:29,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-29 15:19:29,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-29 15:19:29,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-29 15:19:29,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-29 15:19:29,275 INFO L87 Difference]: Start difference. First operand 40793 states and 122633 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 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:19:30,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-29 15:19:30,009 INFO L93 Difference]: Finished difference Result 73837 states and 222205 transitions. [2024-10-29 15:19:30,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-29 15:19:30,010 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 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 47 [2024-10-29 15:19:30,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-29 15:19:30,294 INFO L225 Difference]: With dead ends: 73837 [2024-10-29 15:19:30,294 INFO L226 Difference]: Without dead ends: 59515 [2024-10-29 15:19:30,353 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:19:30,353 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 101 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-29 15:19:30,354 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 280 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-29 15:19:30,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59515 states. [2024-10-29 15:19:31,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59515 to 42311. [2024-10-29 15:19:31,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42311 states, 42287 states have (on average 3.0077092250573463) internal successors, (127187), 42310 states have internal predecessors, (127187), 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:19:31,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42311 states to 42311 states and 127187 transitions. [2024-10-29 15:19:31,990 INFO L78 Accepts]: Start accepts. Automaton has 42311 states and 127187 transitions. Word has length 47 [2024-10-29 15:19:31,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-29 15:19:31,990 INFO L471 AbstractCegarLoop]: Abstraction has 42311 states and 127187 transitions. [2024-10-29 15:19:31,990 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 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:19:31,990 INFO L276 IsEmpty]: Start isEmpty. Operand 42311 states and 127187 transitions. [2024-10-29 15:19:31,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-10-29 15:19:31,993 INFO L207 NwaCegarLoop]: Found error trace [2024-10-29 15:19:31,993 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] [2024-10-29 15:19:31,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-29 15:19:31,994 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2024-10-29 15:19:31,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-29 15:19:31,994 INFO L85 PathProgramCache]: Analyzing trace with hash 1408283567, now seen corresponding path program 1 times [2024-10-29 15:19:31,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-29 15:19:31,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601561512] [2024-10-29 15:19:31,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-29 15:19:31,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-29 15:19:32,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-29 15:19:32,018 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:19:32,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-29 15:19:32,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601561512] [2024-10-29 15:19:32,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601561512] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-29 15:19:32,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-29 15:19:32,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-29 15:19:32,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523309031] [2024-10-29 15:19:32,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-29 15:19:32,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-29 15:19:32,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-29 15:19:32,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-29 15:19:32,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-29 15:19:32,019 INFO L87 Difference]: Start difference. First operand 42311 states and 127187 transitions. Second operand has 3 states, 2 states have (on average 23.5) internal successors, (47), 3 states have internal predecessors, (47), 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:19:32,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-29 15:19:32,253 INFO L93 Difference]: Finished difference Result 42311 states and 127187 transitions. [2024-10-29 15:19:32,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-29 15:19:32,254 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 23.5) internal successors, (47), 3 states have internal predecessors, (47), 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 47 [2024-10-29 15:19:32,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-29 15:19:32,470 INFO L225 Difference]: With dead ends: 42311 [2024-10-29 15:19:32,470 INFO L226 Difference]: Without dead ends: 41299 [2024-10-29 15:19:32,491 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:19:32,492 INFO L432 NwaCegarLoop]: 194 mSDtfsCounter, 88 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-29 15:19:32,492 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 299 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-29 15:19:32,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41299 states. [2024-10-29 15:19:33,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41299 to 41299. [2024-10-29 15:19:33,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41299 states, 41279 states have (on average 3.007606773419899) internal successors, (124151), 41298 states have internal predecessors, (124151), 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:19:33,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41299 states to 41299 states and 124151 transitions. [2024-10-29 15:19:33,844 INFO L78 Accepts]: Start accepts. Automaton has 41299 states and 124151 transitions. Word has length 47 [2024-10-29 15:19:33,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-29 15:19:33,844 INFO L471 AbstractCegarLoop]: Abstraction has 41299 states and 124151 transitions. [2024-10-29 15:19:33,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 23.5) internal successors, (47), 3 states have internal predecessors, (47), 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:19:33,844 INFO L276 IsEmpty]: Start isEmpty. Operand 41299 states and 124151 transitions. [2024-10-29 15:19:33,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-10-29 15:19:33,847 INFO L207 NwaCegarLoop]: Found error trace [2024-10-29 15:19:33,847 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:19:33,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-29 15:19:33,848 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2024-10-29 15:19:33,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-29 15:19:33,848 INFO L85 PathProgramCache]: Analyzing trace with hash 445824893, now seen corresponding path program 1 times [2024-10-29 15:19:33,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-29 15:19:33,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619094086] [2024-10-29 15:19:33,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-29 15:19:33,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-29 15:19:33,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-29 15:19:33,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-29 15:19:33,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-29 15:19:33,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619094086] [2024-10-29 15:19:33,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619094086] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-29 15:19:33,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-29 15:19:33,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-29 15:19:33,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282148409] [2024-10-29 15:19:33,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-29 15:19:33,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-29 15:19:33,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-29 15:19:33,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-29 15:19:33,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-29 15:19:33,868 INFO L87 Difference]: Start difference. First operand 41299 states and 124151 transitions. Second operand has 3 states, 2 states have (on average 24.5) 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:19:34,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-29 15:19:34,044 INFO L93 Difference]: Finished difference Result 41299 states and 124151 transitions. [2024-10-29 15:19:34,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-29 15:19:34,045 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 24.5) 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:19:34,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-29 15:19:34,233 INFO L225 Difference]: With dead ends: 41299 [2024-10-29 15:19:34,233 INFO L226 Difference]: Without dead ends: 40287 [2024-10-29 15:19:34,252 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:19:34,253 INFO L432 NwaCegarLoop]: 192 mSDtfsCounter, 64 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-29 15:19:34,253 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 319 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-29 15:19:34,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40287 states. [2024-10-29 15:19:35,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40287 to 40287. [2024-10-29 15:19:35,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40287 states, 40271 states have (on average 3.0074991929676442) internal successors, (121115), 40286 states have internal predecessors, (121115), 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:19:35,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40287 states to 40287 states and 121115 transitions. [2024-10-29 15:19:35,519 INFO L78 Accepts]: Start accepts. Automaton has 40287 states and 121115 transitions. Word has length 49 [2024-10-29 15:19:35,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-29 15:19:35,520 INFO L471 AbstractCegarLoop]: Abstraction has 40287 states and 121115 transitions. [2024-10-29 15:19:35,520 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 24.5) 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:19:35,520 INFO L276 IsEmpty]: Start isEmpty. Operand 40287 states and 121115 transitions. [2024-10-29 15:19:35,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-10-29 15:19:35,524 INFO L207 NwaCegarLoop]: Found error trace [2024-10-29 15:19:35,524 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:19:35,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-29 15:19:35,524 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting t2Err6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2024-10-29 15:19:35,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-29 15:19:35,525 INFO L85 PathProgramCache]: Analyzing trace with hash 1193293355, now seen corresponding path program 1 times [2024-10-29 15:19:35,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-29 15:19:35,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799412034] [2024-10-29 15:19:35,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-29 15:19:35,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-29 15:19:35,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-29 15:19:35,543 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:19:35,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-29 15:19:35,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799412034] [2024-10-29 15:19:35,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799412034] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-29 15:19:35,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-29 15:19:35,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-29 15:19:35,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311976924] [2024-10-29 15:19:35,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-29 15:19:35,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-29 15:19:35,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-29 15:19:35,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-29 15:19:35,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-29 15:19:35,545 INFO L87 Difference]: Start difference. First operand 40287 states and 121115 transitions. Second operand has 3 states, 2 states have (on average 25.0) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-29 15:19:35,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-29 15:19:35,700 INFO L93 Difference]: Finished difference Result 40287 states and 121115 transitions. [2024-10-29 15:19:35,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-29 15:19:35,701 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 25.0) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2024-10-29 15:19:35,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-29 15:19:35,866 INFO L225 Difference]: With dead ends: 40287 [2024-10-29 15:19:35,867 INFO L226 Difference]: Without dead ends: 33071 [2024-10-29 15:19:35,891 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:19:35,892 INFO L432 NwaCegarLoop]: 249 mSDtfsCounter, 103 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-29 15:19:35,892 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 388 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-29 15:19:35,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33071 states. [2024-10-29 15:19:36,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33071 to 33071. [2024-10-29 15:19:36,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33071 states, 33064 states have (on average 2.995009678199855) internal successors, (99027), 33070 states have internal predecessors, (99027), 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:19:36,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33071 states to 33071 states and 99027 transitions. [2024-10-29 15:19:36,980 INFO L78 Accepts]: Start accepts. Automaton has 33071 states and 99027 transitions. Word has length 50 [2024-10-29 15:19:36,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-29 15:19:36,981 INFO L471 AbstractCegarLoop]: Abstraction has 33071 states and 99027 transitions. [2024-10-29 15:19:36,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 25.0) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-29 15:19:36,981 INFO L276 IsEmpty]: Start isEmpty. Operand 33071 states and 99027 transitions. [2024-10-29 15:19:36,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-10-29 15:19:36,986 INFO L207 NwaCegarLoop]: Found error trace [2024-10-29 15:19:36,986 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-29 15:19:36,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-29 15:19:36,986 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2024-10-29 15:19:36,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-29 15:19:36,987 INFO L85 PathProgramCache]: Analyzing trace with hash 215393162, now seen corresponding path program 1 times [2024-10-29 15:19:36,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-29 15:19:36,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215018969] [2024-10-29 15:19:36,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-29 15:19:36,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-29 15:19:36,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-29 15:19:37,021 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:19:37,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-29 15:19:37,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215018969] [2024-10-29 15:19:37,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215018969] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-29 15:19:37,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-29 15:19:37,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-29 15:19:37,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733598584] [2024-10-29 15:19:37,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-29 15:19:37,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-29 15:19:37,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-29 15:19:37,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-29 15:19:37,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-29 15:19:37,023 INFO L87 Difference]: Start difference. First operand 33071 states and 99027 transitions. Second operand has 3 states, 2 states have (on average 26.5) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-29 15:19:37,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-29 15:19:37,154 INFO L93 Difference]: Finished difference Result 33071 states and 99027 transitions. [2024-10-29 15:19:37,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-29 15:19:37,154 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 26.5) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2024-10-29 15:19:37,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-29 15:19:37,292 INFO L225 Difference]: With dead ends: 33071 [2024-10-29 15:19:37,293 INFO L226 Difference]: Without dead ends: 32587 [2024-10-29 15:19:37,305 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:19:37,306 INFO L432 NwaCegarLoop]: 176 mSDtfsCounter, 45 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-29 15:19:37,306 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 302 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-29 15:19:37,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32587 states. [2024-10-29 15:19:37,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32587 to 32587. [2024-10-29 15:19:37,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32587 states, 32581 states have (on average 2.994843620515024) internal successors, (97575), 32586 states have internal predecessors, (97575), 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:19:38,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32587 states to 32587 states and 97575 transitions. [2024-10-29 15:19:38,468 INFO L78 Accepts]: Start accepts. Automaton has 32587 states and 97575 transitions. Word has length 53 [2024-10-29 15:19:38,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-29 15:19:38,468 INFO L471 AbstractCegarLoop]: Abstraction has 32587 states and 97575 transitions. [2024-10-29 15:19:38,468 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 26.5) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-29 15:19:38,469 INFO L276 IsEmpty]: Start isEmpty. Operand 32587 states and 97575 transitions. [2024-10-29 15:19:38,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-29 15:19:38,479 INFO L207 NwaCegarLoop]: Found error trace [2024-10-29 15:19:38,479 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:19:38,480 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-29 15:19:38,480 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2024-10-29 15:19:38,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-29 15:19:38,480 INFO L85 PathProgramCache]: Analyzing trace with hash -800692820, now seen corresponding path program 1 times [2024-10-29 15:19:38,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-29 15:19:38,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682285413] [2024-10-29 15:19:38,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-29 15:19:38,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-29 15:19:38,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-29 15:19:38,557 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:19:38,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-29 15:19:38,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682285413] [2024-10-29 15:19:38,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682285413] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-29 15:19:38,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-29 15:19:38,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-29 15:19:38,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930695292] [2024-10-29 15:19:38,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-29 15:19:38,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-29 15:19:38,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-29 15:19:38,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-29 15:19:38,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-29 15:19:38,558 INFO L87 Difference]: Start difference. First operand 32587 states and 97575 transitions. Second operand has 3 states, 2 states have (on average 30.0) internal successors, (60), 3 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:19:38,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-29 15:19:38,838 INFO L93 Difference]: Finished difference Result 32587 states and 97575 transitions. [2024-10-29 15:19:38,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-29 15:19:38,839 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 30.0) internal successors, (60), 3 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:19:38,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-29 15:19:38,998 INFO L225 Difference]: With dead ends: 32587 [2024-10-29 15:19:38,999 INFO L226 Difference]: Without dead ends: 32103 [2024-10-29 15:19:39,014 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:19:39,014 INFO L432 NwaCegarLoop]: 175 mSDtfsCounter, 45 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-29 15:19:39,015 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 299 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-29 15:19:39,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32103 states. [2024-10-29 15:19:39,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32103 to 32103. [2024-10-29 15:19:39,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32103 states, 32098 states have (on average 2.994672565268864) internal successors, (96123), 32102 states have internal predecessors, (96123), 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:19:39,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32103 states to 32103 states and 96123 transitions. [2024-10-29 15:19:39,926 INFO L78 Accepts]: Start accepts. Automaton has 32103 states and 96123 transitions. Word has length 60 [2024-10-29 15:19:39,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-29 15:19:39,926 INFO L471 AbstractCegarLoop]: Abstraction has 32103 states and 96123 transitions. [2024-10-29 15:19:39,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 30.0) internal successors, (60), 3 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:19:39,927 INFO L276 IsEmpty]: Start isEmpty. Operand 32103 states and 96123 transitions. [2024-10-29 15:19:39,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-10-29 15:19:39,940 INFO L207 NwaCegarLoop]: Found error trace [2024-10-29 15:19:39,940 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-29 15:19:39,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-29 15:19:39,940 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2024-10-29 15:19:39,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-29 15:19:39,941 INFO L85 PathProgramCache]: Analyzing trace with hash 809008106, now seen corresponding path program 1 times [2024-10-29 15:19:39,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-29 15:19:39,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819037938] [2024-10-29 15:19:39,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-29 15:19:39,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-29 15:19:39,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-29 15:19:39,966 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:19:39,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-29 15:19:39,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819037938] [2024-10-29 15:19:39,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819037938] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-29 15:19:39,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-29 15:19:39,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-29 15:19:39,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692067415] [2024-10-29 15:19:39,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-29 15:19:39,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-29 15:19:39,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-29 15:19:39,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-29 15:19:39,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-29 15:19:39,968 INFO L87 Difference]: Start difference. First operand 32103 states and 96123 transitions. Second operand has 3 states, 2 states have (on average 31.5) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-29 15:19:40,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-29 15:19:40,153 INFO L93 Difference]: Finished difference Result 35491 states and 106287 transitions. [2024-10-29 15:19:40,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-29 15:19:40,154 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 31.5) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2024-10-29 15:19:40,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-29 15:19:40,748 INFO L225 Difference]: With dead ends: 35491 [2024-10-29 15:19:40,748 INFO L226 Difference]: Without dead ends: 35007 [2024-10-29 15:19:40,755 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:19:40,755 INFO L432 NwaCegarLoop]: 184 mSDtfsCounter, 86 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-29 15:19:40,756 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 281 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-29 15:19:40,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35007 states. [2024-10-29 15:19:41,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35007 to 31619. [2024-10-29 15:19:41,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31619 states, 31615 states have (on average 2.9944962834097737) internal successors, (94671), 31618 states have internal predecessors, (94671), 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:19:41,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31619 states to 31619 states and 94671 transitions. [2024-10-29 15:19:41,386 INFO L78 Accepts]: Start accepts. Automaton has 31619 states and 94671 transitions. Word has length 63 [2024-10-29 15:19:41,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-29 15:19:41,386 INFO L471 AbstractCegarLoop]: Abstraction has 31619 states and 94671 transitions. [2024-10-29 15:19:41,387 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 31.5) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-29 15:19:41,387 INFO L276 IsEmpty]: Start isEmpty. Operand 31619 states and 94671 transitions. [2024-10-29 15:19:41,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-10-29 15:19:41,400 INFO L207 NwaCegarLoop]: Found error trace [2024-10-29 15:19:41,401 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] [2024-10-29 15:19:41,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-29 15:19:41,401 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2024-10-29 15:19:41,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-29 15:19:41,401 INFO L85 PathProgramCache]: Analyzing trace with hash 654170415, now seen corresponding path program 1 times [2024-10-29 15:19:41,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-29 15:19:41,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317739257] [2024-10-29 15:19:41,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-29 15:19:41,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-29 15:19:41,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-29 15:19:41,436 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:19:41,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-29 15:19:41,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317739257] [2024-10-29 15:19:41,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1317739257] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-29 15:19:41,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-29 15:19:41,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-29 15:19:41,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089074587] [2024-10-29 15:19:41,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-29 15:19:41,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-29 15:19:41,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-29 15:19:41,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-29 15:19:41,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-29 15:19:41,438 INFO L87 Difference]: Start difference. First operand 31619 states and 94671 transitions. Second operand has 3 states, 2 states have (on average 33.5) internal successors, (67), 3 states have internal predecessors, (67), 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:19:41,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-29 15:19:41,595 INFO L93 Difference]: Finished difference Result 31619 states and 94671 transitions. [2024-10-29 15:19:41,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-29 15:19:41,595 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 33.5) internal successors, (67), 3 states have internal predecessors, (67), 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 67 [2024-10-29 15:19:41,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-29 15:19:41,753 INFO L225 Difference]: With dead ends: 31619 [2024-10-29 15:19:41,753 INFO L226 Difference]: Without dead ends: 31135 [2024-10-29 15:19:41,771 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:19:41,772 INFO L432 NwaCegarLoop]: 173 mSDtfsCounter, 45 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-29 15:19:41,772 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 295 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-29 15:19:41,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31135 states. [2024-10-29 15:19:42,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31135 to 31135. [2024-10-29 15:19:42,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31135 states, 31132 states have (on average 2.994314531671592) internal successors, (93219), 31134 states have internal predecessors, (93219), 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:19:42,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31135 states to 31135 states and 93219 transitions. [2024-10-29 15:19:42,704 INFO L78 Accepts]: Start accepts. Automaton has 31135 states and 93219 transitions. Word has length 67 [2024-10-29 15:19:42,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-29 15:19:42,705 INFO L471 AbstractCegarLoop]: Abstraction has 31135 states and 93219 transitions. [2024-10-29 15:19:42,705 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 33.5) internal successors, (67), 3 states have internal predecessors, (67), 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:19:42,705 INFO L276 IsEmpty]: Start isEmpty. Operand 31135 states and 93219 transitions. [2024-10-29 15:19:42,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-10-29 15:19:42,726 INFO L207 NwaCegarLoop]: Found error trace [2024-10-29 15:19:42,726 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-29 15:19:42,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-29 15:19:42,727 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2024-10-29 15:19:42,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-29 15:19:42,728 INFO L85 PathProgramCache]: Analyzing trace with hash 308719358, now seen corresponding path program 1 times [2024-10-29 15:19:42,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-29 15:19:42,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308692689] [2024-10-29 15:19:42,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-29 15:19:42,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-29 15:19:42,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-29 15:19:42,771 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:19:42,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-29 15:19:42,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308692689] [2024-10-29 15:19:42,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308692689] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-29 15:19:42,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-29 15:19:42,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-29 15:19:42,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904946533] [2024-10-29 15:19:42,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-29 15:19:42,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-29 15:19:42,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-29 15:19:42,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-29 15:19:42,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-29 15:19:42,772 INFO L87 Difference]: Start difference. First operand 31135 states and 93219 transitions. Second operand has 3 states, 2 states have (on average 37.5) internal successors, (75), 3 states have internal predecessors, (75), 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:19:42,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-29 15:19:42,908 INFO L93 Difference]: Finished difference Result 31135 states and 93219 transitions. [2024-10-29 15:19:42,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-29 15:19:42,908 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 37.5) internal successors, (75), 3 states have internal predecessors, (75), 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 75 [2024-10-29 15:19:42,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-29 15:19:43,060 INFO L225 Difference]: With dead ends: 31135 [2024-10-29 15:19:43,060 INFO L226 Difference]: Without dead ends: 30651 [2024-10-29 15:19:43,074 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:19:43,075 INFO L432 NwaCegarLoop]: 172 mSDtfsCounter, 46 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-29 15:19:43,075 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 290 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-29 15:19:43,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30651 states. [2024-10-29 15:19:43,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30651 to 30651. [2024-10-29 15:19:43,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30651 states, 30649 states have (on average 2.994127051453555) internal successors, (91767), 30650 states have internal predecessors, (91767), 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:19:44,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30651 states to 30651 states and 91767 transitions. [2024-10-29 15:19:44,087 INFO L78 Accepts]: Start accepts. Automaton has 30651 states and 91767 transitions. Word has length 75 [2024-10-29 15:19:44,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-29 15:19:44,087 INFO L471 AbstractCegarLoop]: Abstraction has 30651 states and 91767 transitions. [2024-10-29 15:19:44,088 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 37.5) internal successors, (75), 3 states have internal predecessors, (75), 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:19:44,088 INFO L276 IsEmpty]: Start isEmpty. Operand 30651 states and 91767 transitions. [2024-10-29 15:19:44,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-10-29 15:19:44,122 INFO L207 NwaCegarLoop]: Found error trace [2024-10-29 15:19:44,122 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:44,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-29 15:19:44,122 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2024-10-29 15:19:44,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-29 15:19:44,123 INFO L85 PathProgramCache]: Analyzing trace with hash 2042320711, now seen corresponding path program 1 times [2024-10-29 15:19:44,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-29 15:19:44,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545654656] [2024-10-29 15:19:44,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-29 15:19:44,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-29 15:19:44,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-29 15:19:44,308 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-29 15:19:44,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-29 15:19:44,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545654656] [2024-10-29 15:19:44,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545654656] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-29 15:19:44,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1001049453] [2024-10-29 15:19:44,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-29 15:19:44,308 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-29 15:19:44,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-29 15:19:44,313 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-29 15:19:44,318 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-29 15:19:44,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-29 15:19:44,396 INFO L255 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-29 15:19:44,402 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-29 15:19:44,419 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-29 15:19:44,419 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-29 15:19:44,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1001049453] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-29 15:19:44,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-29 15:19:44,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2024-10-29 15:19:44,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804068630] [2024-10-29 15:19:44,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-29 15:19:44,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-29 15:19:44,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-29 15:19:44,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-29 15:19:44,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-29 15:19:44,421 INFO L87 Difference]: Start difference. First operand 30651 states and 91767 transitions. Second operand has 3 states, 2 states have (on average 44.0) internal successors, (88), 3 states have internal predecessors, (88), 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:19:44,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-29 15:19:44,657 INFO L93 Difference]: Finished difference Result 50059 states and 149681 transitions. [2024-10-29 15:19:44,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-29 15:19:44,658 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 44.0) internal successors, (88), 3 states have internal predecessors, (88), 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 90 [2024-10-29 15:19:44,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-29 15:19:44,856 INFO L225 Difference]: With dead ends: 50059 [2024-10-29 15:19:44,857 INFO L226 Difference]: Without dead ends: 49575 [2024-10-29 15:19:44,879 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-29 15:19:44,880 INFO L432 NwaCegarLoop]: 217 mSDtfsCounter, 100 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-29 15:19:44,880 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 345 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-29 15:19:44,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49575 states. [2024-10-29 15:19:45,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49575 to 30871.