./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/02-base_25-malloc_race_cp.i --full-output --witness-type violation_witness --validate ../results-verified/LOGDIR/SV-COMP24_no-data-race/02-base_25-malloc_race_cp.yml/witness.graphml --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 194c01fd Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../sv-benchmarks/c/goblint-regression/02-base_25-malloc_race_cp.i ../results-verified/LOGDIR/SV-COMP24_no-data-race/02-base_25-malloc_race_cp.yml/witness.graphml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.positions.where.we.compute.the.hoare.annotation None --- Real Ultimate output --- This is Ultimate 0.2.5-dev-194c01f-m [2024-10-29 15:22:26,990 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-29 15:22:27,062 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-10-29 15:22:27,066 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-29 15:22:27,067 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-29 15:22:27,094 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-29 15:22:27,095 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-29 15:22:27,096 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-29 15:22:27,097 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-29 15:22:27,098 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-29 15:22:27,098 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-29 15:22:27,099 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-29 15:22:27,099 INFO L153 SettingsManager]: * Use SBE=true [2024-10-29 15:22:27,099 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-29 15:22:27,100 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-29 15:22:27,100 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-29 15:22:27,102 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-29 15:22:27,103 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-29 15:22:27,103 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-29 15:22:27,103 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-29 15:22:27,103 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-29 15:22:27,107 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-29 15:22:27,108 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-10-29 15:22:27,108 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-29 15:22:27,108 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-29 15:22:27,108 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-29 15:22:27,108 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-29 15:22:27,109 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-29 15:22:27,109 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-29 15:22:27,109 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-29 15:22:27,109 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-29 15:22:27,110 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-29 15:22:27,110 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-29 15:22:27,110 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-29 15:22:27,110 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-29 15:22:27,111 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-29 15:22:27,111 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-29 15:22:27,113 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-29 15:22:27,113 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-29 15:22:27,114 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-29 15:22:27,114 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-29 15:22:27,115 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> None [2024-10-29 15:22:27,368 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-29 15:22:27,393 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-29 15:22:27,397 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-29 15:22:27,399 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-29 15:22:27,399 INFO L274 PluginConnector]: CDTParser initialized [2024-10-29 15:22:27,400 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/02-base_25-malloc_race_cp.i [2024-10-29 15:22:28,937 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-29 15:22:29,181 INFO L384 CDTParser]: Found 1 translation units. [2024-10-29 15:22:29,182 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/02-base_25-malloc_race_cp.i [2024-10-29 15:22:29,201 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c30bf54a2/dbc3e80560994751941e77cd72a0439c/FLAG5ad262e60 [2024-10-29 15:22:29,517 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c30bf54a2/dbc3e80560994751941e77cd72a0439c [2024-10-29 15:22:29,519 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-10-29 15:22:29,523 INFO L274 PluginConnector]: Witness Parser initialized [2024-10-29 15:22:29,523 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../results-verified/LOGDIR/SV-COMP24_no-data-race/02-base_25-malloc_race_cp.yml/witness.graphml [2024-10-29 15:22:29,580 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-29 15:22:29,581 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-10-29 15:22:29,582 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-29 15:22:29,582 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-29 15:22:29,587 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-29 15:22:29,588 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.10 03:22:29" (1/2) ... [2024-10-29 15:22:29,590 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c4c60c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 03:22:29, skipping insertion in model container [2024-10-29 15:22:29,591 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.10 03:22:29" (1/2) ... [2024-10-29 15:22:29,592 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@42b30757 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 03:22:29, skipping insertion in model container [2024-10-29 15:22:29,592 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.graphml de.uni_freiburg.informatik.ultimate.witnessparser VIOLATION_WITNESS 29.10 03:22:29" (2/2) ... [2024-10-29 15:22:29,593 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c4c60c6 and model type witness.graphml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 29.10 03:22:29, skipping insertion in model container [2024-10-29 15:22:29,593 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.graphml de.uni_freiburg.informatik.ultimate.witnessparser VIOLATION_WITNESS 29.10 03:22:29" (2/2) ... [2024-10-29 15:22:29,656 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-29 15:22:30,119 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-29 15:22:30,133 INFO L200 MainTranslator]: Completed pre-run [2024-10-29 15:22:30,177 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-29 15:22:30,253 INFO L204 MainTranslator]: Completed translation [2024-10-29 15:22:30,254 INFO L201 PluginConnector]: Adding new model witness.graphml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 29.10 03:22:30 WrapperNode [2024-10-29 15:22:30,254 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-29 15:22:30,255 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-29 15:22:30,255 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-29 15:22:30,255 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-29 15:22:30,262 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:22:30" (1/1) ... [2024-10-29 15:22:30,279 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:22:30" (1/1) ... [2024-10-29 15:22:30,302 INFO L138 Inliner]: procedures = 365, calls = 19, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 66 [2024-10-29 15:22:30,303 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-29 15:22:30,304 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-29 15:22:30,304 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-29 15:22:30,304 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-29 15:22:30,313 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:22:30" (1/1) ... [2024-10-29 15:22:30,313 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:22:30" (1/1) ... [2024-10-29 15:22:30,317 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:22:30" (1/1) ... [2024-10-29 15:22:30,320 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:22:30" (1/1) ... [2024-10-29 15:22:30,328 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:22:30" (1/1) ... [2024-10-29 15:22:30,330 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:22:30" (1/1) ... [2024-10-29 15:22:30,335 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:22:30" (1/1) ... [2024-10-29 15:22:30,336 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:22:30" (1/1) ... [2024-10-29 15:22:30,342 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-29 15:22:30,343 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-29 15:22:30,343 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-29 15:22:30,343 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-29 15:22:30,344 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:22:30" (1/1) ... [2024-10-29 15:22:30,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-29 15:22:30,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-29 15:22:30,379 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-29 15:22:30,382 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-29 15:22:30,433 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-10-29 15:22:30,433 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-10-29 15:22:30,434 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-10-29 15:22:30,434 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-10-29 15:22:30,434 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-29 15:22:30,434 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-29 15:22:30,434 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2024-10-29 15:22:30,435 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2024-10-29 15:22:30,435 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-10-29 15:22:30,435 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-29 15:22:30,435 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-29 15:22:30,437 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-29 15:22:30,594 INFO L238 CfgBuilder]: Building ICFG [2024-10-29 15:22:30,596 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-29 15:22:30,861 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-29 15:22:30,861 INFO L287 CfgBuilder]: Performing block encoding [2024-10-29 15:22:30,884 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-29 15:22:30,885 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-29 15:22:30,885 INFO L201 PluginConnector]: Adding new model witness.graphml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.10 03:22:30 BoogieIcfgContainer [2024-10-29 15:22:30,885 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-29 15:22:30,887 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-29 15:22:30,887 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-29 15:22:30,890 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-29 15:22:30,890 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.10 03:22:29" (1/4) ... [2024-10-29 15:22:30,893 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@690fe340 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.10 03:22:30, skipping insertion in model container [2024-10-29 15:22:30,893 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.graphml de.uni_freiburg.informatik.ultimate.witnessparser VIOLATION_WITNESS 29.10 03:22:29" (2/4) ... [2024-10-29 15:22:30,894 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@690fe340 and model type witness.graphml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction VIOLATION_WITNESS 29.10 03:22:30, skipping insertion in model container [2024-10-29 15:22:30,894 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:22:30" (3/4) ... [2024-10-29 15:22:30,894 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@690fe340 and model type witness.graphml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction VIOLATION_WITNESS 29.10 03:22:30, skipping insertion in model container [2024-10-29 15:22:30,894 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:22:30" (4/4) ... [2024-10-29 15:22:30,895 INFO L112 eAbstractionObserver]: Analyzing ICFG 02-base_25-malloc_race_cp.i [2024-10-29 15:22:30,895 WARN L117 eAbstractionObserver]: Found a witness automaton. I will only consider traces that are accepted by the witness automaton [2024-10-29 15:22:30,924 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-29 15:22:30,925 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 10 error locations. [2024-10-29 15:22:30,925 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-29 15:22:30,993 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-29 15:22:31,009 WARN L158 CegarLoopFactory]: Violation witness validation is only supported for CEGAR loops based on FINITE_AUTOMATA. Ignoring concurrency settiong PETRI_NET and switching to FINITE_AUTOMATA. [2024-10-29 15:22:31,021 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 108 places, 104 transitions, 212 flow [2024-10-29 15:22:31,105 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 1085 states, 1063 states have (on average 1.942615239887112) internal successors, (2065), 1084 states have internal predecessors, (2065), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-29 15:22:31,134 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-29 15:22:31,141 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;@7f11040, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-29 15:22:31,141 INFO L334 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2024-10-29 15:22:31,145 INFO L276 IsEmpty]: Start isEmpty. Operand has 1085 states, 1063 states have (on average 1.942615239887112) internal successors, (2065), 1084 states have internal predecessors, (2065), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-29 15:22:31,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-29 15:22:31,151 INFO L207 NwaCegarLoop]: Found error trace [2024-10-29 15:22:31,153 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] [2024-10-29 15:22:31,154 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2024-10-29 15:22:31,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-29 15:22:31,160 INFO L85 PathProgramCache]: Analyzing trace with hash -2046640981, now seen corresponding path program 1 times [2024-10-29 15:22:31,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-29 15:22:31,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104976688] [2024-10-29 15:22:31,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-29 15:22:31,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-29 15:22:31,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-29 15:22:31,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-29 15:22:31,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-29 15:22:31,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104976688] [2024-10-29 15:22:31,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1104976688] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-29 15:22:31,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-29 15:22:31,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-29 15:22:31,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655586402] [2024-10-29 15:22:31,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-29 15:22:31,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-29 15:22:31,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-29 15:22:31,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-29 15:22:31,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-29 15:22:31,426 INFO L87 Difference]: Start difference. First operand has 1085 states, 1063 states have (on average 1.942615239887112) internal successors, (2065), 1084 states have internal predecessors, (2065), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-29 15:22:31,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-29 15:22:31,525 INFO L93 Difference]: Finished difference Result 1085 states and 2065 transitions. [2024-10-29 15:22:31,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-29 15:22:31,528 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 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 20 [2024-10-29 15:22:31,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-29 15:22:31,546 INFO L225 Difference]: With dead ends: 1085 [2024-10-29 15:22:31,547 INFO L226 Difference]: Without dead ends: 1084 [2024-10-29 15:22:31,549 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-29 15:22:31,552 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 2 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-29 15:22:31,553 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 180 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-29 15:22:31,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1084 states. [2024-10-29 15:22:31,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1084 to 1084. [2024-10-29 15:22:31,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1084 states, 1063 states have (on average 1.9416745061147695) internal successors, (2064), 1083 states have internal predecessors, (2064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-29 15:22:31,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1084 states to 1084 states and 2064 transitions. [2024-10-29 15:22:31,636 INFO L78 Accepts]: Start accepts. Automaton has 1084 states and 2064 transitions. Word has length 20 [2024-10-29 15:22:31,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-29 15:22:31,636 INFO L471 AbstractCegarLoop]: Abstraction has 1084 states and 2064 transitions. [2024-10-29 15:22:31,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-29 15:22:31,637 INFO L276 IsEmpty]: Start isEmpty. Operand 1084 states and 2064 transitions. [2024-10-29 15:22:31,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-29 15:22:31,637 INFO L207 NwaCegarLoop]: Found error trace [2024-10-29 15:22:31,637 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] [2024-10-29 15:22:31,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-29 15:22:31,638 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2024-10-29 15:22:31,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-29 15:22:31,639 INFO L85 PathProgramCache]: Analyzing trace with hash 1419190674, now seen corresponding path program 1 times [2024-10-29 15:22:31,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-29 15:22:31,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448529038] [2024-10-29 15:22:31,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-29 15:22:31,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-29 15:22:31,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-29 15:22:31,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-29 15:22:31,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-29 15:22:31,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448529038] [2024-10-29 15:22:31,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448529038] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-29 15:22:31,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-29 15:22:31,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-29 15:22:31,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72080893] [2024-10-29 15:22:31,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-29 15:22:31,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-29 15:22:31,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-29 15:22:31,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-29 15:22:31,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-29 15:22:31,741 INFO L87 Difference]: Start difference. First operand 1084 states and 2064 transitions. Second operand has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-29 15:22:31,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-29 15:22:31,789 INFO L93 Difference]: Finished difference Result 1084 states and 2064 transitions. [2024-10-29 15:22:31,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-29 15:22:31,789 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 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 27 [2024-10-29 15:22:31,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-29 15:22:31,795 INFO L225 Difference]: With dead ends: 1084 [2024-10-29 15:22:31,796 INFO L226 Difference]: Without dead ends: 1083 [2024-10-29 15:22:31,796 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-29 15:22:31,798 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 2 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-29 15:22:31,798 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 178 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-29 15:22:31,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1083 states. [2024-10-29 15:22:31,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1083 to 1083. [2024-10-29 15:22:31,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1083 states, 1063 states have (on average 1.9407337723424272) internal successors, (2063), 1082 states have internal predecessors, (2063), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-29 15:22:31,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1083 states to 1083 states and 2063 transitions. [2024-10-29 15:22:31,829 INFO L78 Accepts]: Start accepts. Automaton has 1083 states and 2063 transitions. Word has length 27 [2024-10-29 15:22:31,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-29 15:22:31,830 INFO L471 AbstractCegarLoop]: Abstraction has 1083 states and 2063 transitions. [2024-10-29 15:22:31,831 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-29 15:22:31,831 INFO L276 IsEmpty]: Start isEmpty. Operand 1083 states and 2063 transitions. [2024-10-29 15:22:31,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-10-29 15:22:31,832 INFO L207 NwaCegarLoop]: Found error trace [2024-10-29 15:22:31,832 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] [2024-10-29 15:22:31,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-29 15:22:31,833 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2024-10-29 15:22:31,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-29 15:22:31,835 INFO L85 PathProgramCache]: Analyzing trace with hash 177711188, now seen corresponding path program 1 times [2024-10-29 15:22:31,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-29 15:22:31,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944476695] [2024-10-29 15:22:31,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-29 15:22:31,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-29 15:22:31,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-29 15:22:31,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-29 15:22:31,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-29 15:22:31,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944476695] [2024-10-29 15:22:31,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944476695] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-29 15:22:31,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-29 15:22:31,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-29 15:22:31,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703811741] [2024-10-29 15:22:31,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-29 15:22:31,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-29 15:22:31,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-29 15:22:31,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-29 15:22:31,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-29 15:22:31,921 INFO L87 Difference]: Start difference. First operand 1083 states and 2063 transitions. Second operand has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-29 15:22:31,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-29 15:22:31,947 INFO L93 Difference]: Finished difference Result 1083 states and 2063 transitions. [2024-10-29 15:22:31,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-29 15:22:31,948 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 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 31 [2024-10-29 15:22:31,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-29 15:22:31,954 INFO L225 Difference]: With dead ends: 1083 [2024-10-29 15:22:31,955 INFO L226 Difference]: Without dead ends: 1048 [2024-10-29 15:22:31,956 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-29 15:22:31,957 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 68 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-29 15:22:31,959 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 119 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-29 15:22:31,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1048 states. [2024-10-29 15:22:31,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1048 to 1048. [2024-10-29 15:22:31,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1048 states, 1033 states have (on average 1.9312681510164569) internal successors, (1995), 1047 states have internal predecessors, (1995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-29 15:22:31,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1048 states to 1048 states and 1995 transitions. [2024-10-29 15:22:31,992 INFO L78 Accepts]: Start accepts. Automaton has 1048 states and 1995 transitions. Word has length 31 [2024-10-29 15:22:31,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-29 15:22:31,993 INFO L471 AbstractCegarLoop]: Abstraction has 1048 states and 1995 transitions. [2024-10-29 15:22:31,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-29 15:22:31,994 INFO L276 IsEmpty]: Start isEmpty. Operand 1048 states and 1995 transitions. [2024-10-29 15:22:31,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-10-29 15:22:31,996 INFO L207 NwaCegarLoop]: Found error trace [2024-10-29 15:22:31,996 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-29 15:22:31,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-29 15:22:31,997 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2024-10-29 15:22:31,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-29 15:22:31,998 INFO L85 PathProgramCache]: Analyzing trace with hash 1291684622, now seen corresponding path program 1 times [2024-10-29 15:22:31,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-29 15:22:31,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419935491] [2024-10-29 15:22:31,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-29 15:22:31,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-29 15:22:32,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-29 15:22:32,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-29 15:22:32,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-29 15:22:32,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419935491] [2024-10-29 15:22:32,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419935491] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-29 15:22:32,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-29 15:22:32,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-29 15:22:32,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985792771] [2024-10-29 15:22:32,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-29 15:22:32,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-29 15:22:32,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-29 15:22:32,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-29 15:22:32,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-29 15:22:32,104 INFO L87 Difference]: Start difference. First operand 1048 states and 1995 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:22:32,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-29 15:22:32,151 INFO L93 Difference]: Finished difference Result 1048 states and 1995 transitions. [2024-10-29 15:22:32,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-29 15:22:32,152 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:22:32,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-29 15:22:32,158 INFO L225 Difference]: With dead ends: 1048 [2024-10-29 15:22:32,158 INFO L226 Difference]: Without dead ends: 984 [2024-10-29 15:22:32,162 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-29 15:22:32,163 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 59 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-29 15:22:32,165 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 137 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-29 15:22:32,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 984 states. [2024-10-29 15:22:32,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 984 to 984. [2024-10-29 15:22:32,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 984 states, 976 states have (on average 1.9149590163934427) internal successors, (1869), 983 states have internal predecessors, (1869), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-29 15:22:32,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 984 states to 984 states and 1869 transitions. [2024-10-29 15:22:32,197 INFO L78 Accepts]: Start accepts. Automaton has 984 states and 1869 transitions. Word has length 41 [2024-10-29 15:22:32,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-29 15:22:32,198 INFO L471 AbstractCegarLoop]: Abstraction has 984 states and 1869 transitions. [2024-10-29 15:22:32,198 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:22:32,198 INFO L276 IsEmpty]: Start isEmpty. Operand 984 states and 1869 transitions. [2024-10-29 15:22:32,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-10-29 15:22:32,201 INFO L207 NwaCegarLoop]: Found error trace [2024-10-29 15:22:32,201 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] [2024-10-29 15:22:32,201 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-29 15:22:32,202 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2024-10-29 15:22:32,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-29 15:22:32,202 INFO L85 PathProgramCache]: Analyzing trace with hash 70069530, now seen corresponding path program 1 times [2024-10-29 15:22:32,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-29 15:22:32,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680288966] [2024-10-29 15:22:32,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-29 15:22:32,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-29 15:22:32,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-29 15:22:32,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-29 15:22:32,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-29 15:22:32,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680288966] [2024-10-29 15:22:32,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680288966] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-29 15:22:32,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-29 15:22:32,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-29 15:22:32,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638642479] [2024-10-29 15:22:32,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-29 15:22:32,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-29 15:22:32,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-29 15:22:32,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-29 15:22:32,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-29 15:22:32,724 INFO L87 Difference]: Start difference. First operand 984 states and 1869 transitions. Second operand has 6 states, 5 states have (on average 9.6) internal successors, (48), 6 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-29 15:22:32,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-29 15:22:32,952 INFO L93 Difference]: Finished difference Result 1194 states and 2276 transitions. [2024-10-29 15:22:32,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-29 15:22:32,952 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.6) internal successors, (48), 6 states have internal predecessors, (48), 0 states have call successors, (0), 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 48 [2024-10-29 15:22:32,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-29 15:22:32,964 INFO L225 Difference]: With dead ends: 1194 [2024-10-29 15:22:32,964 INFO L226 Difference]: Without dead ends: 1161 [2024-10-29 15:22:32,966 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-29 15:22:32,967 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 111 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-29 15:22:32,967 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 271 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-29 15:22:32,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1161 states. [2024-10-29 15:22:32,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1161 to 1080. [2024-10-29 15:22:32,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1080 states, 1072 states have (on average 1.9244402985074627) internal successors, (2063), 1079 states have internal predecessors, (2063), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-29 15:22:32,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1080 states to 1080 states and 2063 transitions. [2024-10-29 15:22:32,993 INFO L78 Accepts]: Start accepts. Automaton has 1080 states and 2063 transitions. Word has length 48 [2024-10-29 15:22:32,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-29 15:22:32,993 INFO L471 AbstractCegarLoop]: Abstraction has 1080 states and 2063 transitions. [2024-10-29 15:22:32,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.6) internal successors, (48), 6 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-29 15:22:32,994 INFO L276 IsEmpty]: Start isEmpty. Operand 1080 states and 2063 transitions. [2024-10-29 15:22:32,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-10-29 15:22:32,995 INFO L207 NwaCegarLoop]: Found error trace [2024-10-29 15:22:32,995 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-29 15:22:32,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-29 15:22:32,996 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2024-10-29 15:22:32,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-29 15:22:32,996 INFO L85 PathProgramCache]: Analyzing trace with hash 87245971, now seen corresponding path program 1 times [2024-10-29 15:22:32,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-29 15:22:32,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085069290] [2024-10-29 15:22:32,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-29 15:22:32,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-29 15:22:33,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-29 15:22:33,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-29 15:22:33,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-29 15:22:33,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085069290] [2024-10-29 15:22:33,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085069290] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-29 15:22:33,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-29 15:22:33,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-29 15:22:33,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758622251] [2024-10-29 15:22:33,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-29 15:22:33,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-29 15:22:33,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-29 15:22:33,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-29 15:22:33,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-29 15:22:33,359 INFO L87 Difference]: Start difference. First operand 1080 states and 2063 transitions. Second operand has 6 states, 5 states have (on average 9.8) internal successors, (49), 6 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-29 15:22:33,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-29 15:22:33,636 INFO L93 Difference]: Finished difference Result 1811 states and 3454 transitions. [2024-10-29 15:22:33,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-29 15:22:33,637 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.8) internal successors, (49), 6 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2024-10-29 15:22:33,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-29 15:22:33,648 INFO L225 Difference]: With dead ends: 1811 [2024-10-29 15:22:33,648 INFO L226 Difference]: Without dead ends: 1777 [2024-10-29 15:22:33,649 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-29 15:22:33,650 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 176 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-29 15:22:33,653 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 291 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-29 15:22:33,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1777 states. [2024-10-29 15:22:33,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1777 to 1151. [2024-10-29 15:22:33,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1151 states, 1143 states have (on average 1.925634295713036) internal successors, (2201), 1150 states have internal predecessors, (2201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-29 15:22:33,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1151 states to 1151 states and 2201 transitions. [2024-10-29 15:22:33,693 INFO L78 Accepts]: Start accepts. Automaton has 1151 states and 2201 transitions. Word has length 49 [2024-10-29 15:22:33,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-29 15:22:33,694 INFO L471 AbstractCegarLoop]: Abstraction has 1151 states and 2201 transitions. [2024-10-29 15:22:33,694 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.8) internal successors, (49), 6 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-29 15:22:33,695 INFO L276 IsEmpty]: Start isEmpty. Operand 1151 states and 2201 transitions. [2024-10-29 15:22:33,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-10-29 15:22:33,697 INFO L207 NwaCegarLoop]: Found error trace [2024-10-29 15:22:33,697 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] [2024-10-29 15:22:33,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-29 15:22:33,697 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2024-10-29 15:22:33,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-29 15:22:33,699 INFO L85 PathProgramCache]: Analyzing trace with hash 325484884, now seen corresponding path program 1 times [2024-10-29 15:22:33,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-29 15:22:33,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899153555] [2024-10-29 15:22:33,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-29 15:22:33,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-29 15:22:33,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-29 15:22:33,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-29 15:22:33,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-29 15:22:33,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899153555] [2024-10-29 15:22:33,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899153555] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-29 15:22:33,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-29 15:22:33,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-29 15:22:33,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586587794] [2024-10-29 15:22:33,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-29 15:22:33,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-29 15:22:33,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-29 15:22:33,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-29 15:22:33,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-29 15:22:33,787 INFO L87 Difference]: Start difference. First operand 1151 states and 2201 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-29 15:22:33,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-29 15:22:33,813 INFO L93 Difference]: Finished difference Result 1653 states and 3144 transitions. [2024-10-29 15:22:33,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-29 15:22:33,813 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 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 57 [2024-10-29 15:22:33,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-29 15:22:33,818 INFO L225 Difference]: With dead ends: 1653 [2024-10-29 15:22:33,818 INFO L226 Difference]: Without dead ends: 683 [2024-10-29 15:22:33,821 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-29 15:22:33,822 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 46 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-29 15:22:33,822 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 162 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-29 15:22:33,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 683 states. [2024-10-29 15:22:33,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 683 to 683. [2024-10-29 15:22:33,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 683 states, 677 states have (on average 1.8138847858197933) internal successors, (1228), 682 states have internal predecessors, (1228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-29 15:22:33,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 683 states to 683 states and 1228 transitions. [2024-10-29 15:22:33,838 INFO L78 Accepts]: Start accepts. Automaton has 683 states and 1228 transitions. Word has length 57 [2024-10-29 15:22:33,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-29 15:22:33,838 INFO L471 AbstractCegarLoop]: Abstraction has 683 states and 1228 transitions. [2024-10-29 15:22:33,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-29 15:22:33,839 INFO L276 IsEmpty]: Start isEmpty. Operand 683 states and 1228 transitions. [2024-10-29 15:22:33,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-29 15:22:33,839 INFO L207 NwaCegarLoop]: Found error trace [2024-10-29 15:22:33,840 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] [2024-10-29 15:22:33,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-29 15:22:33,840 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2024-10-29 15:22:33,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-29 15:22:33,841 INFO L85 PathProgramCache]: Analyzing trace with hash 1489826976, now seen corresponding path program 1 times [2024-10-29 15:22:33,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-29 15:22:33,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171907295] [2024-10-29 15:22:33,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-29 15:22:33,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-29 15:22:33,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-29 15:22:34,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-29 15:22:34,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-29 15:22:34,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171907295] [2024-10-29 15:22:34,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171907295] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-29 15:22:34,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-29 15:22:34,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-29 15:22:34,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662856394] [2024-10-29 15:22:34,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-29 15:22:34,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-29 15:22:34,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-29 15:22:34,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-29 15:22:34,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-29 15:22:34,139 INFO L87 Difference]: Start difference. First operand 683 states and 1228 transitions. Second operand has 6 states, 5 states have (on average 11.6) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-29 15:22:34,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-29 15:22:34,261 INFO L93 Difference]: Finished difference Result 748 states and 1345 transitions. [2024-10-29 15:22:34,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-29 15:22:34,261 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.6) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2024-10-29 15:22:34,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-29 15:22:34,265 INFO L225 Difference]: With dead ends: 748 [2024-10-29 15:22:34,265 INFO L226 Difference]: Without dead ends: 575 [2024-10-29 15:22:34,266 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-29 15:22:34,266 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 55 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-29 15:22:34,267 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 288 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-29 15:22:34,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2024-10-29 15:22:34,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 570. [2024-10-29 15:22:34,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 570 states, 565 states have (on average 1.7557522123893805) internal successors, (992), 569 states have internal predecessors, (992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-29 15:22:34,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 992 transitions. [2024-10-29 15:22:34,279 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 992 transitions. Word has length 58 [2024-10-29 15:22:34,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-29 15:22:34,279 INFO L471 AbstractCegarLoop]: Abstraction has 570 states and 992 transitions. [2024-10-29 15:22:34,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.6) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-29 15:22:34,280 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 992 transitions. [2024-10-29 15:22:34,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-29 15:22:34,281 INFO L207 NwaCegarLoop]: Found error trace [2024-10-29 15:22:34,281 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-29 15:22:34,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-29 15:22:34,281 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2024-10-29 15:22:34,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-29 15:22:34,282 INFO L85 PathProgramCache]: Analyzing trace with hash -1812481170, now seen corresponding path program 1 times [2024-10-29 15:22:34,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-29 15:22:34,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176863167] [2024-10-29 15:22:34,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-29 15:22:34,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-29 15:22:34,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-29 15:22:34,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-29 15:22:34,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-29 15:22:34,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176863167] [2024-10-29 15:22:34,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1176863167] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-29 15:22:34,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-29 15:22:34,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-29 15:22:34,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388276169] [2024-10-29 15:22:34,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-29 15:22:34,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-29 15:22:34,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-29 15:22:34,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-29 15:22:34,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-29 15:22:34,586 INFO L87 Difference]: Start difference. First operand 570 states and 992 transitions. Second operand has 6 states, 5 states have (on average 12.0) internal successors, (60), 6 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-29 15:22:34,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-29 15:22:34,733 INFO L93 Difference]: Finished difference Result 726 states and 1269 transitions. [2024-10-29 15:22:34,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-29 15:22:34,734 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.0) internal successors, (60), 6 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2024-10-29 15:22:34,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-29 15:22:34,737 INFO L225 Difference]: With dead ends: 726 [2024-10-29 15:22:34,738 INFO L226 Difference]: Without dead ends: 510 [2024-10-29 15:22:34,738 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-29 15:22:34,739 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 99 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-29 15:22:34,739 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 269 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-29 15:22:34,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2024-10-29 15:22:34,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 470. [2024-10-29 15:22:34,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 470 states, 465 states have (on average 1.756989247311828) internal successors, (817), 469 states have internal predecessors, (817), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-29 15:22:34,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 817 transitions. [2024-10-29 15:22:34,752 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 817 transitions. Word has length 60 [2024-10-29 15:22:34,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-29 15:22:34,752 INFO L471 AbstractCegarLoop]: Abstraction has 470 states and 817 transitions. [2024-10-29 15:22:34,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.0) internal successors, (60), 6 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-29 15:22:34,753 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 817 transitions. [2024-10-29 15:22:34,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-10-29 15:22:34,753 INFO L207 NwaCegarLoop]: Found error trace [2024-10-29 15:22:34,754 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] [2024-10-29 15:22:34,754 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-29 15:22:34,754 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2024-10-29 15:22:34,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-29 15:22:34,755 INFO L85 PathProgramCache]: Analyzing trace with hash -2081990881, now seen corresponding path program 1 times [2024-10-29 15:22:34,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-29 15:22:34,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885872373] [2024-10-29 15:22:34,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-29 15:22:34,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-29 15:22:34,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-29 15:22:35,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-29 15:22:35,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-29 15:22:35,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885872373] [2024-10-29 15:22:35,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885872373] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-29 15:22:35,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-29 15:22:35,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-29 15:22:35,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745937467] [2024-10-29 15:22:35,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-29 15:22:35,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-29 15:22:35,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-29 15:22:35,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-29 15:22:35,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2024-10-29 15:22:35,289 INFO L87 Difference]: Start difference. First operand 470 states and 817 transitions. Second operand has 12 states, 11 states have (on average 6.181818181818182) internal successors, (68), 12 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-29 15:22:35,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-29 15:22:35,690 INFO L93 Difference]: Finished difference Result 474 states and 821 transitions. [2024-10-29 15:22:35,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-29 15:22:35,690 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 6.181818181818182) internal successors, (68), 12 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2024-10-29 15:22:35,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-29 15:22:35,693 INFO L225 Difference]: With dead ends: 474 [2024-10-29 15:22:35,693 INFO L226 Difference]: Without dead ends: 451 [2024-10-29 15:22:35,694 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=109, Invalid=353, Unknown=0, NotChecked=0, Total=462 [2024-10-29 15:22:35,695 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 248 mSDsluCounter, 395 mSDsCounter, 0 mSdLazyCounter, 381 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-29 15:22:35,695 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 479 Invalid, 401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 381 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-29 15:22:35,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2024-10-29 15:22:35,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 435. [2024-10-29 15:22:35,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 435 states, 431 states have (on average 1.7378190255220418) internal successors, (749), 434 states have internal predecessors, (749), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-29 15:22:35,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 749 transitions. [2024-10-29 15:22:35,706 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 749 transitions. Word has length 68 [2024-10-29 15:22:35,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-29 15:22:35,707 INFO L471 AbstractCegarLoop]: Abstraction has 435 states and 749 transitions. [2024-10-29 15:22:35,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 6.181818181818182) internal successors, (68), 12 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-29 15:22:35,707 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 749 transitions. [2024-10-29 15:22:35,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-10-29 15:22:35,708 INFO L207 NwaCegarLoop]: Found error trace [2024-10-29 15:22:35,708 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] [2024-10-29 15:22:35,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-29 15:22:35,708 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2024-10-29 15:22:35,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-29 15:22:35,709 INFO L85 PathProgramCache]: Analyzing trace with hash -1986973860, now seen corresponding path program 1 times [2024-10-29 15:22:35,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-29 15:22:35,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145912818] [2024-10-29 15:22:35,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-29 15:22:35,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-29 15:22:35,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-29 15:22:36,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-29 15:22:36,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-29 15:22:36,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145912818] [2024-10-29 15:22:36,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145912818] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-29 15:22:36,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-29 15:22:36,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-29 15:22:36,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432352906] [2024-10-29 15:22:36,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-29 15:22:36,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-29 15:22:36,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-29 15:22:36,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-29 15:22:36,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-10-29 15:22:36,138 INFO L87 Difference]: Start difference. First operand 435 states and 749 transitions. Second operand has 12 states, 11 states have (on average 6.181818181818182) internal successors, (68), 12 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-29 15:22:36,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-29 15:22:36,575 INFO L93 Difference]: Finished difference Result 465 states and 793 transitions. [2024-10-29 15:22:36,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-29 15:22:36,576 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 6.181818181818182) internal successors, (68), 12 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2024-10-29 15:22:36,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-29 15:22:36,579 INFO L225 Difference]: With dead ends: 465 [2024-10-29 15:22:36,579 INFO L226 Difference]: Without dead ends: 445 [2024-10-29 15:22:36,580 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2024-10-29 15:22:36,580 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 273 mSDsluCounter, 400 mSDsCounter, 0 mSdLazyCounter, 460 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 273 SdHoareTripleChecker+Valid, 496 SdHoareTripleChecker+Invalid, 482 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 460 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-29 15:22:36,580 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [273 Valid, 496 Invalid, 482 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 460 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-29 15:22:36,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2024-10-29 15:22:36,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 385. [2024-10-29 15:22:36,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 385 states, 381 states have (on average 1.7139107611548556) internal successors, (653), 384 states have internal predecessors, (653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-29 15:22:36,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 653 transitions. [2024-10-29 15:22:36,591 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 653 transitions. Word has length 68 [2024-10-29 15:22:36,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-29 15:22:36,591 INFO L471 AbstractCegarLoop]: Abstraction has 385 states and 653 transitions. [2024-10-29 15:22:36,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 6.181818181818182) internal successors, (68), 12 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-29 15:22:36,592 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 653 transitions. [2024-10-29 15:22:36,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-10-29 15:22:36,594 INFO L207 NwaCegarLoop]: Found error trace [2024-10-29 15:22:36,594 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-29 15:22:36,594 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-29 15:22:36,594 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2024-10-29 15:22:36,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-29 15:22:36,594 INFO L85 PathProgramCache]: Analyzing trace with hash -516341636, now seen corresponding path program 1 times [2024-10-29 15:22:36,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-29 15:22:36,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654168670] [2024-10-29 15:22:36,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-29 15:22:36,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-29 15:22:36,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-29 15:22:37,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-29 15:22:37,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-29 15:22:37,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654168670] [2024-10-29 15:22:37,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654168670] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-29 15:22:37,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-29 15:22:37,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-29 15:22:37,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300846179] [2024-10-29 15:22:37,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-29 15:22:37,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-29 15:22:37,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-29 15:22:37,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-29 15:22:37,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-10-29 15:22:37,128 INFO L87 Difference]: Start difference. First operand 385 states and 653 transitions. Second operand has 12 states, 11 states have (on average 7.0) internal successors, (77), 12 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-29 15:22:37,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-29 15:22:37,479 INFO L93 Difference]: Finished difference Result 391 states and 660 transitions. [2024-10-29 15:22:37,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-29 15:22:37,480 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 7.0) internal successors, (77), 12 states have internal predecessors, (77), 0 states have call successors, (0), 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 77 [2024-10-29 15:22:37,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-29 15:22:37,483 INFO L225 Difference]: With dead ends: 391 [2024-10-29 15:22:37,483 INFO L226 Difference]: Without dead ends: 380 [2024-10-29 15:22:37,484 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=117, Invalid=389, Unknown=0, NotChecked=0, Total=506 [2024-10-29 15:22:37,485 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 232 mSDsluCounter, 347 mSDsCounter, 0 mSdLazyCounter, 328 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 232 SdHoareTripleChecker+Valid, 427 SdHoareTripleChecker+Invalid, 344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-29 15:22:37,485 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [232 Valid, 427 Invalid, 344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 328 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-29 15:22:37,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2024-10-29 15:22:37,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 379. [2024-10-29 15:22:37,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 379 states, 375 states have (on average 1.7093333333333334) internal successors, (641), 378 states have internal predecessors, (641), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-29 15:22:37,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 641 transitions. [2024-10-29 15:22:37,494 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 641 transitions. Word has length 77 [2024-10-29 15:22:37,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-29 15:22:37,494 INFO L471 AbstractCegarLoop]: Abstraction has 379 states and 641 transitions. [2024-10-29 15:22:37,494 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 7.0) internal successors, (77), 12 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-29 15:22:37,494 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 641 transitions. [2024-10-29 15:22:37,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-10-29 15:22:37,495 INFO L207 NwaCegarLoop]: Found error trace [2024-10-29 15:22:37,495 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-29 15:22:37,495 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-29 15:22:37,496 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2024-10-29 15:22:37,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-29 15:22:37,496 INFO L85 PathProgramCache]: Analyzing trace with hash 1997379416, now seen corresponding path program 2 times [2024-10-29 15:22:37,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-29 15:22:37,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872012624] [2024-10-29 15:22:37,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-29 15:22:37,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-29 15:22:37,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-29 15:22:37,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-29 15:22:37,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-29 15:22:37,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872012624] [2024-10-29 15:22:37,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872012624] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-29 15:22:37,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-29 15:22:37,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-29 15:22:37,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51250630] [2024-10-29 15:22:37,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-29 15:22:37,940 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-29 15:22:37,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-29 15:22:37,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-29 15:22:37,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-10-29 15:22:37,941 INFO L87 Difference]: Start difference. First operand 379 states and 641 transitions. Second operand has 12 states, 11 states have (on average 7.0) internal successors, (77), 12 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-29 15:22:38,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-29 15:22:38,315 INFO L93 Difference]: Finished difference Result 387 states and 651 transitions. [2024-10-29 15:22:38,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-29 15:22:38,315 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 7.0) internal successors, (77), 12 states have internal predecessors, (77), 0 states have call successors, (0), 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 77 [2024-10-29 15:22:38,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-29 15:22:38,318 INFO L225 Difference]: With dead ends: 387 [2024-10-29 15:22:38,318 INFO L226 Difference]: Without dead ends: 374 [2024-10-29 15:22:38,318 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=130, Invalid=422, Unknown=0, NotChecked=0, Total=552 [2024-10-29 15:22:38,319 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 230 mSDsluCounter, 394 mSDsCounter, 0 mSdLazyCounter, 355 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 470 SdHoareTripleChecker+Invalid, 373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-29 15:22:38,322 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 470 Invalid, 373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 355 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-29 15:22:38,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2024-10-29 15:22:38,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 373. [2024-10-29 15:22:38,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 373 states, 369 states have (on average 1.7046070460704608) internal successors, (629), 372 states have internal predecessors, (629), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-29 15:22:38,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 629 transitions. [2024-10-29 15:22:38,333 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 629 transitions. Word has length 77 [2024-10-29 15:22:38,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-29 15:22:38,333 INFO L471 AbstractCegarLoop]: Abstraction has 373 states and 629 transitions. [2024-10-29 15:22:38,334 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 7.0) internal successors, (77), 12 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-29 15:22:38,334 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 629 transitions. [2024-10-29 15:22:38,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-10-29 15:22:38,335 INFO L207 NwaCegarLoop]: Found error trace [2024-10-29 15:22:38,335 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-29 15:22:38,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-29 15:22:38,335 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2024-10-29 15:22:38,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-29 15:22:38,336 INFO L85 PathProgramCache]: Analyzing trace with hash -328366690, now seen corresponding path program 3 times [2024-10-29 15:22:38,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-29 15:22:38,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57121686] [2024-10-29 15:22:38,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-29 15:22:38,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-29 15:22:38,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-29 15:22:38,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-29 15:22:38,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-29 15:22:38,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57121686] [2024-10-29 15:22:38,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57121686] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-29 15:22:38,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-29 15:22:38,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-29 15:22:38,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473379849] [2024-10-29 15:22:38,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-29 15:22:38,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-29 15:22:38,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-29 15:22:38,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-29 15:22:38,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-10-29 15:22:38,709 INFO L87 Difference]: Start difference. First operand 373 states and 629 transitions. Second operand has 12 states, 11 states have (on average 7.0) internal successors, (77), 12 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-29 15:22:39,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-29 15:22:39,053 INFO L93 Difference]: Finished difference Result 373 states and 629 transitions. [2024-10-29 15:22:39,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-29 15:22:39,053 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 7.0) internal successors, (77), 12 states have internal predecessors, (77), 0 states have call successors, (0), 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 77 [2024-10-29 15:22:39,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-29 15:22:39,055 INFO L225 Difference]: With dead ends: 373 [2024-10-29 15:22:39,056 INFO L226 Difference]: Without dead ends: 358 [2024-10-29 15:22:39,056 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=148, Invalid=452, Unknown=0, NotChecked=0, Total=600 [2024-10-29 15:22:39,057 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 222 mSDsluCounter, 373 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-29 15:22:39,057 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 444 Invalid, 339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-29 15:22:39,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2024-10-29 15:22:39,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 357. [2024-10-29 15:22:39,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 354 states have (on average 1.7203389830508475) internal successors, (609), 356 states have internal predecessors, (609), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-29 15:22:39,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 609 transitions. [2024-10-29 15:22:39,065 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 609 transitions. Word has length 77 [2024-10-29 15:22:39,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-29 15:22:39,065 INFO L471 AbstractCegarLoop]: Abstraction has 357 states and 609 transitions. [2024-10-29 15:22:39,065 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 7.0) internal successors, (77), 12 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-29 15:22:39,066 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 609 transitions. [2024-10-29 15:22:39,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-10-29 15:22:39,066 INFO L207 NwaCegarLoop]: Found error trace [2024-10-29 15:22:39,067 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-29 15:22:39,067 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-29 15:22:39,067 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2024-10-29 15:22:39,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-29 15:22:39,067 INFO L85 PathProgramCache]: Analyzing trace with hash 1706563874, now seen corresponding path program 1 times [2024-10-29 15:22:39,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-29 15:22:39,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195165805] [2024-10-29 15:22:39,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-29 15:22:39,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-29 15:22:39,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-29 15:22:39,089 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-29 15:22:39,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-29 15:22:39,134 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-29 15:22:39,134 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-29 15:22:39,135 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (14 of 15 remaining) [2024-10-29 15:22:39,137 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (13 of 15 remaining) [2024-10-29 15:22:39,137 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (12 of 15 remaining) [2024-10-29 15:22:39,137 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (11 of 15 remaining) [2024-10-29 15:22:39,137 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (10 of 15 remaining) [2024-10-29 15:22:39,138 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (9 of 15 remaining) [2024-10-29 15:22:39,138 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 15 remaining) [2024-10-29 15:22:39,139 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (7 of 15 remaining) [2024-10-29 15:22:39,139 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (6 of 15 remaining) [2024-10-29 15:22:39,139 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (5 of 15 remaining) [2024-10-29 15:22:39,139 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (4 of 15 remaining) [2024-10-29 15:22:39,139 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (3 of 15 remaining) [2024-10-29 15:22:39,139 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (2 of 15 remaining) [2024-10-29 15:22:39,140 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (1 of 15 remaining) [2024-10-29 15:22:39,140 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (0 of 15 remaining) [2024-10-29 15:22:39,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-29 15:22:39,143 INFO L407 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-29 15:22:39,206 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-10-29 15:22:39,206 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-10-29 15:22:39,209 INFO L201 PluginConnector]: Adding new model witness.graphml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.10 03:22:39 BasicIcfg [2024-10-29 15:22:39,209 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-29 15:22:39,209 INFO L158 Benchmark]: Toolchain (without parser) took 9628.49ms. Allocated memory was 163.6MB in the beginning and 318.8MB in the end (delta: 155.2MB). Free memory was 103.7MB in the beginning and 102.1MB in the end (delta: 1.6MB). Peak memory consumption was 158.4MB. Max. memory is 16.1GB. [2024-10-29 15:22:39,210 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 163.6MB. Free memory was 127.5MB in the beginning and 127.3MB in the end (delta: 243.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-29 15:22:39,210 INFO L158 Benchmark]: Witness Parser took 0.15ms. Allocated memory is still 163.6MB. Free memory is still 105.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-29 15:22:39,210 INFO L158 Benchmark]: CACSL2BoogieTranslator took 671.73ms. Allocated memory is still 163.6MB. Free memory was 103.0MB in the beginning and 62.6MB in the end (delta: 40.5MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. [2024-10-29 15:22:39,210 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.43ms. Allocated memory is still 163.6MB. Free memory was 62.6MB in the beginning and 59.6MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-29 15:22:39,210 INFO L158 Benchmark]: Boogie Preprocessor took 38.98ms. Allocated memory is still 163.6MB. Free memory was 59.6MB in the beginning and 58.2MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-29 15:22:39,211 INFO L158 Benchmark]: RCFGBuilder took 542.15ms. Allocated memory is still 163.6MB. Free memory was 57.5MB in the beginning and 125.9MB in the end (delta: -68.3MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-29 15:22:39,211 INFO L158 Benchmark]: TraceAbstraction took 8322.07ms. Allocated memory was 163.6MB in the beginning and 318.8MB in the end (delta: 155.2MB). Free memory was 125.6MB in the beginning and 102.1MB in the end (delta: 23.5MB). Peak memory consumption was 181.8MB. Max. memory is 16.1GB. [2024-10-29 15:22:39,212 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23ms. Allocated memory is still 163.6MB. Free memory was 127.5MB in the beginning and 127.3MB in the end (delta: 243.4kB). There was no memory consumed. Max. memory is 16.1GB. * Witness Parser took 0.15ms. Allocated memory is still 163.6MB. Free memory is still 105.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 671.73ms. Allocated memory is still 163.6MB. Free memory was 103.0MB in the beginning and 62.6MB in the end (delta: 40.5MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.43ms. Allocated memory is still 163.6MB. Free memory was 62.6MB in the beginning and 59.6MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 38.98ms. Allocated memory is still 163.6MB. Free memory was 59.6MB in the beginning and 58.2MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 542.15ms. Allocated memory is still 163.6MB. Free memory was 57.5MB in the beginning and 125.9MB in the end (delta: -68.3MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 8322.07ms. Allocated memory was 163.6MB in the beginning and 318.8MB in the end (delta: 155.2MB). Free memory was 125.6MB in the beginning and 102.1MB in the end (delta: 23.5MB). Peak memory consumption was 181.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - DataRaceFoundResult [Line: 1243]: Data race detected Data race detected The following path leads to a data race: [L1223] 0 int *x; VAL [x={0:0}] [L1224] 0 int *y; VAL [x={0:0}, y={0:0}] [L1225] 0 pthread_mutex_t m = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; VAL [m={1:0}, x={0:0}, y={0:0}] [L1234] 0 pthread_t id; VAL [m={1:0}, x={0:0}, y={0:0}] [L1235] 0 int *z; VAL [m={1:0}, x={0:0}, y={0:0}] [L1236] 0 x = malloc(sizeof(int)) VAL [m={1:0}, x={-2:0}, y={0:0}] [L1237] 0 y = malloc(sizeof(int)) VAL [m={1:0}, x={-2:0}, y={-3:0}] [L1238] 0 z = y VAL [m={1:0}, x={-2:0}, y={-3:0}, z={-3:0}] [L1239] FCALL, FORK 0 pthread_create(&id, ((void *)0), t_fun, ((void *)0)) VAL [\old(arg)={0:0}, id=-1, m={1:0}, x={-2:0}, y={-3:0}, z={-3:0}] [L1241] EXPR 0 *x VAL [\old(arg)={0:0}, arg={0:0}, id=-1, m={1:0}, x={-2:0}, y={-3:0}, z={-3:0}] [L1241] EXPR 0 \read(*x) VAL [\old(arg)={0:0}, arg={0:0}, id=-1, m={1:0}, x={-2:0}, y={-3:0}, z={-3:0}] [L1241] 0 printf("%d\n",*x) VAL [\old(arg)={0:0}, arg={0:0}, id=-1, m={1:0}, x={-2:0}, y={-3:0}, z={-3:0}] [L1228] EXPR 1 *x VAL [\old(arg)={0:0}, arg={0:0}, m={1:0}, x={-2:0}, y={-3:0}] [L1228] 1 *x = 3 VAL [\old(arg)={0:0}, arg={0:0}, m={1:0}, x={-2:0}, y={-3:0}] [L1243] EXPR 0 \read(*z) VAL [\old(arg)={0:0}, arg={0:0}, id=-1, m={1:0}, x={-2:0}, y={-3:0}, z={-3:0}] [L1228] 1 *x = 3 VAL [\old(arg)={0:0}, arg={0:0}, m={1:0}, x={-2:0}, y={-3:0}] [L1229] EXPR 1 *y VAL [\old(arg)={0:0}, arg={0:0}, m={1:0}, x={-2:0}, y={-3:0}] [L1229] 1 *y = 8 VAL [\old(arg)={0:0}, arg={0:0}, m={1:0}, x={-2:0}, y={-3:0}] [L1243] 0 printf("%d\n",*z) VAL [\old(arg)={0:0}, arg={0:0}, id=-1, m={1:0}, x={-2:0}, y={-3:0}, z={-3:0}] Now there is a data race, but we were unable to determine exactly which statements and variables are involved. There could be a race between one of the statements * C: *x = 3 [1228] * C: y = malloc(sizeof(int)) [1237] * C: *y = 8 [1229] * C: x = malloc(sizeof(int)) [1236] * C: *x = 3 [1228] * C: *x = 3 [1228] * C: *x = 3 [1228] and C: printf("%d\n",*z) [1243] - UnprovableResult [Line: 1236]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1237]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1238]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1241]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1241]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1239]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 1228]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1228]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1229]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1229]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 138 locations, 15 error locations. Started 1 CEGAR loops. OverallTime: 8.1s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 3.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1823 SdHoareTripleChecker+Valid, 2.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1823 mSDsluCounter, 4211 SdHoareTripleChecker+Invalid, 1.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2766 mSDsCounter, 161 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2602 IncrementalHoareTripleChecker+Invalid, 2763 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 161 mSolverCounterUnsat, 1445 mSDtfsCounter, 2602 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 155 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 357 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1151occurred in iteration=6, InterpolantAutomatonStates: 114, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 14 MinimizatonAttempts, 831 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 3.9s InterpolantComputationTime, 836 NumberOfCodeBlocks, 836 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 744 ConstructedInterpolants, 0 QuantifiedInterpolants, 3148 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-10-29 15:22:39,236 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE