./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/libvsync/rwlock.i --full-output --traceabstraction.dfs.order.used.in.por LOOP_LOCKSTEP -tc /storage/repos/ultimate/releaseScripts/default/benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5dad65ad Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/GemCutterReach.xml -i ../../../trunk/examples/svcomp/libvsync/rwlock.i -s /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer GemCutter --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash fd8ac353802a2e1d548b78214c4e90430a3b2551f535af0ed9cab2c49366d321 --traceabstraction.dfs.order.used.in.por LOOP_LOCKSTEP -tc /storage/repos/ultimate/releaseScripts/default/benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml --- Real Ultimate output --- This is Ultimate 0.2.5-dev-5dad65a-m [2024-10-22 13:03:05,115 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-22 13:03:05,181 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf [2024-10-22 13:03:05,185 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-22 13:03:05,185 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-22 13:03:05,202 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-22 13:03:05,203 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-22 13:03:05,203 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-22 13:03:05,204 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-22 13:03:05,204 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-22 13:03:05,205 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-22 13:03:05,205 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-22 13:03:05,205 INFO L153 SettingsManager]: * Use SBE=true [2024-10-22 13:03:05,206 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-22 13:03:05,206 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-22 13:03:05,206 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-22 13:03:05,207 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-22 13:03:05,207 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-22 13:03:05,207 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-22 13:03:05,208 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-22 13:03:05,213 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-22 13:03:05,214 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-22 13:03:05,214 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-22 13:03:05,214 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-22 13:03:05,214 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-22 13:03:05,215 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-22 13:03:05,215 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-22 13:03:05,215 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-22 13:03:05,215 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-22 13:03:05,215 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-22 13:03:05,215 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-10-22 13:03:05,216 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-22 13:03:05,216 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-22 13:03:05,216 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-22 13:03:05,216 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-22 13:03:05,216 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2024-10-22 13:03:05,217 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-22 13:03:05,217 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-22 13:03:05,217 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-10-22 13:03:05,219 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-10-22 13:03:05,219 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-10-22 13:03:05,219 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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/UGemCutter-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.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> GemCutter Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> fd8ac353802a2e1d548b78214c4e90430a3b2551f535af0ed9cab2c49366d321 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: DFS Order used in POR -> LOOP_LOCKSTEP [2024-10-22 13:03:05,472 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-22 13:03:05,494 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-22 13:03:05,497 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-22 13:03:05,498 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-22 13:03:05,498 INFO L274 PluginConnector]: CDTParser initialized [2024-10-22 13:03:05,499 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/libvsync/rwlock.i [2024-10-22 13:03:06,908 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-22 13:03:07,348 INFO L384 CDTParser]: Found 1 translation units. [2024-10-22 13:03:07,349 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/libvsync/rwlock.i [2024-10-22 13:03:07,386 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/38f82fb50/a800ce5420a1477983823e28bde10483/FLAG1c154f24c [2024-10-22 13:03:07,490 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/38f82fb50/a800ce5420a1477983823e28bde10483 [2024-10-22 13:03:07,492 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-22 13:03:07,494 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-22 13:03:07,495 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-22 13:03:07,495 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-22 13:03:07,500 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-22 13:03:07,501 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 01:03:07" (1/1) ... [2024-10-22 13:03:07,504 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35882612 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 01:03:07, skipping insertion in model container [2024-10-22 13:03:07,504 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 01:03:07" (1/1) ... [2024-10-22 13:03:07,600 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-22 13:03:09,386 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/libvsync/rwlock.i[195762,195775] [2024-10-22 13:03:09,392 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/libvsync/rwlock.i[195845,195858] [2024-10-22 13:03:09,393 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/libvsync/rwlock.i[195902,195915] [2024-10-22 13:03:09,410 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-22 13:03:09,418 INFO L200 MainTranslator]: Completed pre-run [2024-10-22 13:03:09,494 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3755] [2024-10-22 13:03:09,496 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3757] [2024-10-22 13:03:09,496 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3762] [2024-10-22 13:03:09,497 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3764] [2024-10-22 13:03:09,497 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3770] [2024-10-22 13:03:09,498 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3772] [2024-10-22 13:03:09,498 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3778] [2024-10-22 13:03:09,499 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3780] [2024-10-22 13:03:09,499 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3786] [2024-10-22 13:03:09,499 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3788] [2024-10-22 13:03:09,500 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3794] [2024-10-22 13:03:09,500 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3796] [2024-10-22 13:03:09,500 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3802] [2024-10-22 13:03:09,501 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3804] [2024-10-22 13:03:09,501 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3810] [2024-10-22 13:03:09,501 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3812] [2024-10-22 13:03:09,502 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3817] [2024-10-22 13:03:09,502 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3819] [2024-10-22 13:03:09,503 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3824] [2024-10-22 13:03:09,503 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3826] [2024-10-22 13:03:09,503 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3831] [2024-10-22 13:03:09,504 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3833] [2024-10-22 13:03:09,504 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3838] [2024-10-22 13:03:09,504 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3840] [2024-10-22 13:03:09,504 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3845] [2024-10-22 13:03:09,505 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3847] [2024-10-22 13:03:09,505 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3852] [2024-10-22 13:03:09,506 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3855] [2024-10-22 13:03:09,506 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3861] [2024-10-22 13:03:09,506 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3864] [2024-10-22 13:03:09,507 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3870] [2024-10-22 13:03:09,507 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3873] [2024-10-22 13:03:09,507 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3879] [2024-10-22 13:03:09,508 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3882] [2024-10-22 13:03:09,508 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3888] [2024-10-22 13:03:09,508 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3891] [2024-10-22 13:03:09,509 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3897] [2024-10-22 13:03:09,509 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3900] [2024-10-22 13:03:09,510 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3907] [2024-10-22 13:03:09,510 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3910] [2024-10-22 13:03:09,511 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3917] [2024-10-22 13:03:09,511 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3920] [2024-10-22 13:03:09,512 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3927] [2024-10-22 13:03:09,512 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3930] [2024-10-22 13:03:09,512 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3937] [2024-10-22 13:03:09,512 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3940] [2024-10-22 13:03:09,513 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3947] [2024-10-22 13:03:09,513 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3950] [2024-10-22 13:03:09,513 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3957] [2024-10-22 13:03:09,514 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3960] [2024-10-22 13:03:09,515 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3966] [2024-10-22 13:03:09,515 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3969] [2024-10-22 13:03:09,516 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3975] [2024-10-22 13:03:09,516 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3978] [2024-10-22 13:03:09,516 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3984] [2024-10-22 13:03:09,517 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3987] [2024-10-22 13:03:09,517 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3993] [2024-10-22 13:03:09,517 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3996] [2024-10-22 13:03:09,518 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4002] [2024-10-22 13:03:09,518 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4005] [2024-10-22 13:03:09,519 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4011] [2024-10-22 13:03:09,520 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4014] [2024-10-22 13:03:09,521 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4020] [2024-10-22 13:03:09,522 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4023] [2024-10-22 13:03:09,522 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4029] [2024-10-22 13:03:09,523 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4032] [2024-10-22 13:03:09,523 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4038] [2024-10-22 13:03:09,523 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4041] [2024-10-22 13:03:09,524 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4047] [2024-10-22 13:03:09,524 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4050] [2024-10-22 13:03:09,525 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4056] [2024-10-22 13:03:09,525 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4059] [2024-10-22 13:03:09,525 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4065] [2024-10-22 13:03:09,526 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4068] [2024-10-22 13:03:09,528 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4074] [2024-10-22 13:03:09,528 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4077] [2024-10-22 13:03:09,529 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4083] [2024-10-22 13:03:09,529 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4086] [2024-10-22 13:03:09,529 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4092] [2024-10-22 13:03:09,530 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4095] [2024-10-22 13:03:09,530 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4101] [2024-10-22 13:03:09,530 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4103] [2024-10-22 13:03:09,531 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4109] [2024-10-22 13:03:09,531 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4111] [2024-10-22 13:03:09,532 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4117] [2024-10-22 13:03:09,533 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4119] [2024-10-22 13:03:09,533 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4125] [2024-10-22 13:03:09,534 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4127] [2024-10-22 13:03:09,535 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4133] [2024-10-22 13:03:09,535 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4135] [2024-10-22 13:03:09,535 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4141] [2024-10-22 13:03:09,536 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4143] [2024-10-22 13:03:09,536 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4149] [2024-10-22 13:03:09,536 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4151] [2024-10-22 13:03:09,537 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4157] [2024-10-22 13:03:09,538 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4159] [2024-10-22 13:03:09,538 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4165] [2024-10-22 13:03:09,538 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4167] [2024-10-22 13:03:09,539 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4173] [2024-10-22 13:03:09,539 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4175] [2024-10-22 13:03:09,601 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/libvsync/rwlock.i[195762,195775] [2024-10-22 13:03:09,602 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/libvsync/rwlock.i[195845,195858] [2024-10-22 13:03:09,603 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/libvsync/rwlock.i[195902,195915] [2024-10-22 13:03:09,609 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-22 13:03:09,886 INFO L204 MainTranslator]: Completed translation [2024-10-22 13:03:09,887 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 01:03:09 WrapperNode [2024-10-22 13:03:09,887 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-22 13:03:09,888 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-22 13:03:09,888 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-22 13:03:09,888 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-22 13:03:09,895 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 01:03:09" (1/1) ... [2024-10-22 13:03:09,998 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 01:03:09" (1/1) ... [2024-10-22 13:03:10,078 INFO L138 Inliner]: procedures = 930, calls = 928, calls flagged for inlining = 832, calls inlined = 67, statements flattened = 681 [2024-10-22 13:03:10,085 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-22 13:03:10,086 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-22 13:03:10,086 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-22 13:03:10,086 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-22 13:03:10,098 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 01:03:09" (1/1) ... [2024-10-22 13:03:10,099 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 01:03:09" (1/1) ... [2024-10-22 13:03:10,104 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 01:03:09" (1/1) ... [2024-10-22 13:03:10,104 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 01:03:09" (1/1) ... [2024-10-22 13:03:10,123 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 01:03:09" (1/1) ... [2024-10-22 13:03:10,142 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 01:03:09" (1/1) ... [2024-10-22 13:03:10,148 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 01:03:09" (1/1) ... [2024-10-22 13:03:10,155 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 01:03:09" (1/1) ... [2024-10-22 13:03:10,164 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-22 13:03:10,169 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-22 13:03:10,169 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-22 13:03:10,169 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-22 13:03:10,170 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 01:03:09" (1/1) ... [2024-10-22 13:03:10,177 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-10-22 13:03:10,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-22 13:03:10,203 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-10-22 13:03:10,205 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-10-22 13:03:10,250 INFO L130 BoogieDeclarations]: Found specification of procedure reader [2024-10-22 13:03:10,251 INFO L138 BoogieDeclarations]: Found implementation of procedure reader [2024-10-22 13:03:10,251 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-10-22 13:03:10,251 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-22 13:03:10,251 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-22 13:03:10,251 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-22 13:03:10,251 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-22 13:03:10,252 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-10-22 13:03:10,252 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-22 13:03:10,252 INFO L130 BoogieDeclarations]: Found specification of procedure writer [2024-10-22 13:03:10,252 INFO L138 BoogieDeclarations]: Found implementation of procedure writer [2024-10-22 13:03:10,252 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-10-22 13:03:10,256 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-22 13:03:10,471 INFO L238 CfgBuilder]: Building ICFG [2024-10-22 13:03:10,473 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-22 13:03:11,186 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-22 13:03:11,186 INFO L287 CfgBuilder]: Performing block encoding [2024-10-22 13:03:11,526 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-22 13:03:11,527 INFO L314 CfgBuilder]: Removed 131 assume(true) statements. [2024-10-22 13:03:11,527 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 01:03:11 BoogieIcfgContainer [2024-10-22 13:03:11,527 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-22 13:03:11,529 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-22 13:03:11,530 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-22 13:03:11,533 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-22 13:03:11,534 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 01:03:07" (1/3) ... [2024-10-22 13:03:11,534 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20661c47 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 01:03:11, skipping insertion in model container [2024-10-22 13:03:11,535 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 01:03:09" (2/3) ... [2024-10-22 13:03:11,535 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20661c47 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 01:03:11, skipping insertion in model container [2024-10-22 13:03:11,535 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 01:03:11" (3/3) ... [2024-10-22 13:03:11,537 INFO L112 eAbstractionObserver]: Analyzing ICFG rwlock.i [2024-10-22 13:03:11,554 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-22 13:03:11,554 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2024-10-22 13:03:11,554 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-22 13:03:11,670 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-10-22 13:03:11,721 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-22 13:03:11,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-22 13:03:11,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-22 13:03:11,724 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-10-22 13:03:11,725 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2024-10-22 13:03:11,759 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-22 13:03:11,802 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == readerThread1of1ForFork0 ======== [2024-10-22 13:03:11,808 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=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@35cbda5f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-22 13:03:11,809 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-22 13:03:19,523 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting readerErr1ASSERT_VIOLATIONERROR_FUNCTION === [readerErr0ASSERT_VIOLATIONUNKNOWN, readerErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-22 13:03:19,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-22 13:03:19,528 INFO L85 PathProgramCache]: Analyzing trace with hash 1775026034, now seen corresponding path program 1 times [2024-10-22 13:03:19,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-22 13:03:19,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742392216] [2024-10-22 13:03:19,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-22 13:03:19,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-22 13:03:19,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-22 13:03:19,775 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-22 13:03:19,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-22 13:03:19,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742392216] [2024-10-22 13:03:19,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1742392216] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-22 13:03:19,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-22 13:03:19,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-22 13:03:19,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623673345] [2024-10-22 13:03:19,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-22 13:03:19,785 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-22 13:03:19,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-22 13:03:19,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-22 13:03:19,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-22 13:03:19,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-22 13:03:19,812 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-22 13:03:19,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-22 13:03:19,813 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-22 13:03:20,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-22 13:03:20,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-22 13:03:20,720 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting readerErr0ASSERT_VIOLATIONUNKNOWN === [readerErr0ASSERT_VIOLATIONUNKNOWN, readerErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-22 13:03:20,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-22 13:03:20,721 INFO L85 PathProgramCache]: Analyzing trace with hash 813614189, now seen corresponding path program 1 times [2024-10-22 13:03:20,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-22 13:03:20,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080693361] [2024-10-22 13:03:20,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-22 13:03:20,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-22 13:03:20,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-22 13:03:20,921 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-22 13:03:20,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-22 13:03:20,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080693361] [2024-10-22 13:03:20,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080693361] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-22 13:03:20,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-22 13:03:20,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-22 13:03:20,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295400188] [2024-10-22 13:03:20,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-22 13:03:20,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-22 13:03:20,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-22 13:03:20,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-22 13:03:20,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-22 13:03:20,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-22 13:03:20,927 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-22 13:03:20,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 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-22 13:03:20,927 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-22 13:03:20,928 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-22 13:03:21,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-22 13:03:21,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-22 13:03:21,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-22 13:03:21,045 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting readerErr0ASSERT_VIOLATIONUNKNOWN === [readerErr0ASSERT_VIOLATIONUNKNOWN, readerErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-22 13:03:21,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-22 13:03:21,045 INFO L85 PathProgramCache]: Analyzing trace with hash -142567206, now seen corresponding path program 1 times [2024-10-22 13:03:21,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-22 13:03:21,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449953687] [2024-10-22 13:03:21,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-22 13:03:21,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-22 13:03:21,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-22 13:03:21,253 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-22 13:03:21,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-22 13:03:21,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449953687] [2024-10-22 13:03:21,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449953687] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-22 13:03:21,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2054799600] [2024-10-22 13:03:21,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-22 13:03:21,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-22 13:03:21,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-22 13:03:21,273 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-22 13:03:21,275 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-22 13:03:21,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-22 13:03:21,475 INFO L255 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-22 13:03:21,483 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-22 13:03:21,504 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-22 13:03:21,506 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-22 13:03:21,550 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-22 13:03:21,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2054799600] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-22 13:03:21,551 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-22 13:03:21,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2024-10-22 13:03:21,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864436247] [2024-10-22 13:03:21,552 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-22 13:03:21,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-22 13:03:21,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-22 13:03:21,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-22 13:03:21,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-22 13:03:21,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-22 13:03:21,555 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-22 13:03:21,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-22 13:03:21,555 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-22 13:03:21,555 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-22 13:03:21,556 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-22 13:03:22,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-22 13:03:22,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-22 13:03:22,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-22 13:03:22,270 INFO L782 garLoopResultBuilder]: Registering result SAFE for location readerErr0ASSERT_VIOLATIONUNKNOWN (1 of 2 remaining) [2024-10-22 13:03:22,271 INFO L782 garLoopResultBuilder]: Registering result SAFE for location readerErr1ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-10-22 13:03:22,289 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-22 13:03:22,471 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2024-10-22 13:03:22,476 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-10-22 13:03:22,478 INFO L312 ceAbstractionStarter]: Result for error location readerThread1of1ForFork0 was SAFE,SAFE (1/3) [2024-10-22 13:03:22,483 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-22 13:03:22,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-22 13:03:22,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-22 13:03:22,485 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-10-22 13:03:22,487 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (4)] Waiting until timeout for monitored process [2024-10-22 13:03:22,489 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-22 13:03:22,490 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-10-22 13:03:22,490 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=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@35cbda5f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-22 13:03:22,491 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-10-22 13:03:22,987 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-10-22 13:03:22,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-22 13:03:22,987 INFO L85 PathProgramCache]: Analyzing trace with hash -1736557884, now seen corresponding path program 1 times [2024-10-22 13:03:22,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-22 13:03:22,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066987803] [2024-10-22 13:03:22,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-22 13:03:22,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-22 13:03:22,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-22 13:03:23,009 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-22 13:03:23,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-22 13:03:23,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066987803] [2024-10-22 13:03:23,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066987803] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-22 13:03:23,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-22 13:03:23,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-22 13:03:23,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631250323] [2024-10-22 13:03:23,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-22 13:03:23,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-22 13:03:23,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-22 13:03:23,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-22 13:03:23,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-22 13:03:23,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-22 13:03:23,011 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-22 13:03:23,011 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 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-22 13:03:23,011 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-22 13:03:23,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-22 13:03:23,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-22 13:03:23,214 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-10-22 13:03:23,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-22 13:03:23,215 INFO L85 PathProgramCache]: Analyzing trace with hash 1005193596, now seen corresponding path program 1 times [2024-10-22 13:03:23,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-22 13:03:23,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12110339] [2024-10-22 13:03:23,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-22 13:03:23,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-22 13:03:23,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-22 13:03:23,239 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-22 13:03:23,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-22 13:03:23,281 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-22 13:03:23,283 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-22 13:03:23,284 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 4 remaining) [2024-10-22 13:03:23,284 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2024-10-22 13:03:23,284 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2024-10-22 13:03:23,284 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2024-10-22 13:03:23,284 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-22 13:03:23,288 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1] [2024-10-22 13:03:23,288 INFO L312 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN,UNKNOWN,UNKNOWN (2/3) [2024-10-22 13:03:23,289 WARN L239 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-22 13:03:23,290 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-10-22 13:03:23,414 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-10-22 13:03:23,428 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-22 13:03:23,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-22 13:03:23,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-22 13:03:23,434 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-10-22 13:03:23,436 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (5)] Waiting until timeout for monitored process [2024-10-22 13:03:23,438 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-22 13:03:23,438 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == readerThread1of2ForFork0 ======== [2024-10-22 13:03:23,438 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=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@35cbda5f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-22 13:03:23,439 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-22 13:03:42,742 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting readerErr1ASSERT_VIOLATIONERROR_FUNCTION === [readerErr0ASSERT_VIOLATIONUNKNOWN, readerErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-22 13:03:42,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-22 13:03:42,743 INFO L85 PathProgramCache]: Analyzing trace with hash -1978014210, now seen corresponding path program 1 times [2024-10-22 13:03:42,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-22 13:03:42,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345321038] [2024-10-22 13:03:42,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-22 13:03:42,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-22 13:03:42,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-22 13:03:42,830 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-10-22 13:03:42,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-22 13:03:42,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345321038] [2024-10-22 13:03:42,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345321038] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-22 13:03:42,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-22 13:03:42,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-22 13:03:42,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000712546] [2024-10-22 13:03:42,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-22 13:03:42,832 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-22 13:03:42,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-22 13:03:42,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-22 13:03:42,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-22 13:03:42,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-22 13:03:42,835 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-22 13:03:42,836 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 41.0) internal successors, (82), 2 states have internal predecessors, (82), 0 states have call successors, (0), 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-22 13:03:42,836 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-22 13:03:45,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-22 13:03:45,595 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-22 13:03:45,595 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting readerErr0ASSERT_VIOLATIONUNKNOWN === [readerErr0ASSERT_VIOLATIONUNKNOWN, readerErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-22 13:03:45,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-22 13:03:45,595 INFO L85 PathProgramCache]: Analyzing trace with hash -1577629048, now seen corresponding path program 1 times [2024-10-22 13:03:45,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-22 13:03:45,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753845432] [2024-10-22 13:03:45,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-22 13:03:45,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-22 13:03:45,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-22 13:03:45,795 INFO L134 CoverageAnalysis]: Checked inductivity of 233 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2024-10-22 13:03:45,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-22 13:03:45,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753845432] [2024-10-22 13:03:45,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753845432] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-22 13:03:45,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-22 13:03:45,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-22 13:03:45,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266693747] [2024-10-22 13:03:45,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-22 13:03:45,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-22 13:03:45,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-22 13:03:45,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-22 13:03:45,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-22 13:03:45,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-22 13:03:45,801 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-22 13:03:45,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 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-22 13:03:45,802 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-22 13:03:45,802 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-22 13:03:46,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-22 13:03:46,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-22 13:03:46,172 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-22 13:03:46,172 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting readerErr0ASSERT_VIOLATIONUNKNOWN === [readerErr0ASSERT_VIOLATIONUNKNOWN, readerErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-22 13:03:46,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-22 13:03:46,173 INFO L85 PathProgramCache]: Analyzing trace with hash -1255214790, now seen corresponding path program 1 times [2024-10-22 13:03:46,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-22 13:03:46,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598865414] [2024-10-22 13:03:46,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-22 13:03:46,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-22 13:03:46,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-22 13:03:46,288 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2024-10-22 13:03:46,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-22 13:03:46,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598865414] [2024-10-22 13:03:46,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598865414] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-22 13:03:46,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-22 13:03:46,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-22 13:03:46,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479638731] [2024-10-22 13:03:46,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-22 13:03:46,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-22 13:03:46,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-22 13:03:46,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-22 13:03:46,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-22 13:03:46,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-22 13:03:46,293 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-22 13:03:46,293 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 0 states have call successors, (0), 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-22 13:03:46,293 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-22 13:03:46,293 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-22 13:03:46,294 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-22 13:03:46,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-22 13:03:46,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-22 13:03:46,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-22 13:03:46,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-22 13:03:46,522 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting readerErr0ASSERT_VIOLATIONUNKNOWN === [readerErr0ASSERT_VIOLATIONUNKNOWN, readerErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-22 13:03:46,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-22 13:03:46,523 INFO L85 PathProgramCache]: Analyzing trace with hash 336011476, now seen corresponding path program 1 times [2024-10-22 13:03:46,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-22 13:03:46,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989208889] [2024-10-22 13:03:46,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-22 13:03:46,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-22 13:03:46,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-22 13:03:46,613 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-22 13:03:46,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-22 13:03:46,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989208889] [2024-10-22 13:03:46,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989208889] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-22 13:03:46,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-22 13:03:46,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-22 13:03:46,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952311942] [2024-10-22 13:03:46,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-22 13:03:46,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-22 13:03:46,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-22 13:03:46,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-22 13:03:46,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-22 13:03:46,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-22 13:03:46,617 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-22 13:03:46,617 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 0 states have call successors, (0), 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-22 13:03:46,617 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-22 13:03:46,617 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-22 13:03:46,618 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-22 13:03:46,618 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-22 13:03:46,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-22 13:03:46,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-22 13:03:46,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-22 13:03:46,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-22 13:03:46,961 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-22 13:03:46,963 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting readerErr0ASSERT_VIOLATIONUNKNOWN === [readerErr0ASSERT_VIOLATIONUNKNOWN, readerErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-22 13:03:46,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-22 13:03:46,963 INFO L85 PathProgramCache]: Analyzing trace with hash -1997108383, now seen corresponding path program 1 times [2024-10-22 13:03:46,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-22 13:03:46,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707479376] [2024-10-22 13:03:46,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-22 13:03:46,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-22 13:03:47,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-22 13:03:47,093 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2024-10-22 13:03:47,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-22 13:03:47,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707479376] [2024-10-22 13:03:47,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707479376] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-22 13:03:47,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-22 13:03:47,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-22 13:03:47,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443199937] [2024-10-22 13:03:47,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-22 13:03:47,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-22 13:03:47,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-22 13:03:47,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-22 13:03:47,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-22 13:03:47,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-22 13:03:47,097 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-22 13:03:47,097 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 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-22 13:03:47,097 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-22 13:03:47,097 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-22 13:03:47,097 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-22 13:03:47,097 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-22 13:03:47,097 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-22 13:03:47,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-22 13:03:47,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-22 13:03:47,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-22 13:03:47,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-22 13:03:47,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-22 13:03:47,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-22 13:03:47,318 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting readerErr0ASSERT_VIOLATIONUNKNOWN === [readerErr0ASSERT_VIOLATIONUNKNOWN, readerErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-22 13:03:47,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-22 13:03:47,319 INFO L85 PathProgramCache]: Analyzing trace with hash 144007930, now seen corresponding path program 1 times [2024-10-22 13:03:47,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-22 13:03:47,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131915156] [2024-10-22 13:03:47,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-22 13:03:47,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-22 13:03:47,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-22 13:03:47,440 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-22 13:03:47,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-22 13:03:47,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131915156] [2024-10-22 13:03:47,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131915156] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-22 13:03:47,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-22 13:03:47,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-22 13:03:47,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419475045] [2024-10-22 13:03:47,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-22 13:03:47,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-22 13:03:47,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-22 13:03:47,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-22 13:03:47,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-22 13:03:47,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-22 13:03:47,443 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-22 13:03:47,443 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 0 states have call successors, (0), 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-22 13:03:47,443 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-22 13:03:47,444 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-22 13:03:47,444 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-22 13:03:47,444 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-22 13:03:47,444 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-22 13:03:47,444 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-22 13:03:47,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-22 13:03:47,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-22 13:03:47,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-22 13:03:47,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-22 13:03:47,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-22 13:03:47,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-22 13:03:47,704 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-22 13:03:47,704 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting readerErr0ASSERT_VIOLATIONUNKNOWN === [readerErr0ASSERT_VIOLATIONUNKNOWN, readerErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-22 13:03:47,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-22 13:03:47,705 INFO L85 PathProgramCache]: Analyzing trace with hash 389447631, now seen corresponding path program 1 times [2024-10-22 13:03:47,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-22 13:03:47,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761165070] [2024-10-22 13:03:47,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-22 13:03:47,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-22 13:03:47,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-22 13:03:47,866 INFO L134 CoverageAnalysis]: Checked inductivity of 665 backedges. 156 proven. 0 refuted. 0 times theorem prover too weak. 509 trivial. 0 not checked. [2024-10-22 13:03:47,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-22 13:03:47,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761165070] [2024-10-22 13:03:47,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1761165070] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-22 13:03:47,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-22 13:03:47,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-22 13:03:47,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604425436] [2024-10-22 13:03:47,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-22 13:03:47,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-22 13:03:47,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-22 13:03:47,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-22 13:03:47,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-22 13:03:47,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-22 13:03:47,869 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-22 13:03:47,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 0 states have call successors, (0), 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-22 13:03:47,870 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-22 13:03:47,870 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-22 13:03:47,870 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-22 13:03:47,870 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-22 13:03:47,870 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-22 13:03:47,870 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-22 13:03:47,870 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-22 13:03:48,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-22 13:03:48,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-22 13:03:48,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-22 13:03:48,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-22 13:03:48,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-22 13:03:48,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-22 13:03:48,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-22 13:03:48,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-22 13:03:48,106 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting readerErr0ASSERT_VIOLATIONUNKNOWN === [readerErr0ASSERT_VIOLATIONUNKNOWN, readerErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-22 13:03:48,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-22 13:03:48,107 INFO L85 PathProgramCache]: Analyzing trace with hash -999632459, now seen corresponding path program 1 times [2024-10-22 13:03:48,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-22 13:03:48,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192075756] [2024-10-22 13:03:48,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-22 13:03:48,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-22 13:03:48,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-22 13:03:48,359 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-10-22 13:03:48,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-22 13:03:48,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192075756] [2024-10-22 13:03:48,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192075756] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-22 13:03:48,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1986054845] [2024-10-22 13:03:48,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-22 13:03:48,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-22 13:03:48,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-22 13:03:48,362 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-22 13:03:48,364 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-22 13:03:48,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-22 13:03:48,688 INFO L255 TraceCheckSpWp]: Trace formula consists of 897 conjuncts, 133 conjuncts are in the unsatisfiable core [2024-10-22 13:03:48,694 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-22 13:03:49,289 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-10-22 13:03:49,324 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-10-22 13:03:49,325 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-22 13:03:49,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1986054845] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-22 13:03:49,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-22 13:03:49,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [5] total 18 [2024-10-22 13:03:49,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52979980] [2024-10-22 13:03:49,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-22 13:03:49,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-22 13:03:49,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-22 13:03:49,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-22 13:03:49,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=269, Unknown=0, NotChecked=0, Total=306 [2024-10-22 13:03:49,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-22 13:03:49,327 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-22 13:03:49,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 9.466666666666667) internal successors, (142), 14 states have internal predecessors, (142), 0 states have call successors, (0), 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-22 13:03:49,328 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-22 13:03:49,328 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-22 13:03:49,328 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-22 13:03:49,328 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-22 13:03:49,328 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-22 13:03:49,328 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-22 13:03:49,328 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-22 13:03:49,329 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-22 13:03:50,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-22 13:03:50,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-22 13:03:50,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-22 13:03:50,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-22 13:03:50,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-22 13:03:50,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-22 13:03:50,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-22 13:03:50,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-22 13:03:50,331 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-22 13:03:50,517 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-10-22 13:03:50,518 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting readerErr0ASSERT_VIOLATIONUNKNOWN === [readerErr0ASSERT_VIOLATIONUNKNOWN, readerErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-22 13:03:50,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-22 13:03:50,518 INFO L85 PathProgramCache]: Analyzing trace with hash -1601763506, now seen corresponding path program 1 times [2024-10-22 13:03:50,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-22 13:03:50,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059215479] [2024-10-22 13:03:50,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-22 13:03:50,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-22 13:03:50,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-22 13:03:50,729 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-10-22 13:03:50,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-22 13:03:50,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059215479] [2024-10-22 13:03:50,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059215479] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-22 13:03:50,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [220703619] [2024-10-22 13:03:50,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-22 13:03:50,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-22 13:03:50,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-22 13:03:50,732 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-22 13:03:50,734 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-22 13:03:51,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-22 13:03:51,089 INFO L255 TraceCheckSpWp]: Trace formula consists of 908 conjuncts, 133 conjuncts are in the unsatisfiable core [2024-10-22 13:03:51,100 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-22 13:03:51,660 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-10-22 13:03:51,683 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-10-22 13:03:51,683 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-22 13:03:51,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [220703619] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-22 13:03:51,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-22 13:03:51,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [5] total 18 [2024-10-22 13:03:51,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705404912] [2024-10-22 13:03:51,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-22 13:03:51,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-22 13:03:51,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-22 13:03:51,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-22 13:03:51,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=269, Unknown=0, NotChecked=0, Total=306 [2024-10-22 13:03:51,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-22 13:03:51,685 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-22 13:03:51,685 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 9.466666666666667) internal successors, (142), 14 states have internal predecessors, (142), 0 states have call successors, (0), 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-22 13:03:51,686 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-22 13:03:51,686 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-22 13:03:51,686 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-22 13:03:51,686 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-22 13:03:51,686 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-22 13:03:51,686 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-22 13:03:51,686 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-22 13:03:51,686 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2024-10-22 13:03:51,686 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-22 13:03:52,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-22 13:03:52,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-22 13:03:52,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-22 13:03:52,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-22 13:03:52,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-22 13:03:52,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-22 13:03:52,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-22 13:03:52,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-22 13:03:52,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-22 13:03:52,553 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-22 13:03:52,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-10-22 13:03:52,740 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting readerErr0ASSERT_VIOLATIONUNKNOWN === [readerErr0ASSERT_VIOLATIONUNKNOWN, readerErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-22 13:03:52,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-22 13:03:52,740 INFO L85 PathProgramCache]: Analyzing trace with hash -1953591723, now seen corresponding path program 1 times [2024-10-22 13:03:52,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-22 13:03:52,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159288462] [2024-10-22 13:03:52,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-22 13:03:52,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-22 13:03:52,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-22 13:03:52,876 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2024-10-22 13:03:52,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-22 13:03:52,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159288462] [2024-10-22 13:03:52,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159288462] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-22 13:03:52,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [259588363] [2024-10-22 13:03:52,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-22 13:03:52,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-22 13:03:52,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-22 13:03:52,879 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-22 13:03:52,880 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-22 13:03:53,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-22 13:03:53,196 INFO L255 TraceCheckSpWp]: Trace formula consists of 913 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-22 13:03:53,199 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-22 13:03:53,211 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-10-22 13:03:53,212 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-22 13:03:53,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [259588363] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-22 13:03:53,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-22 13:03:53,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2024-10-22 13:03:53,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670158839] [2024-10-22 13:03:53,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-22 13:03:53,212 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-22 13:03:53,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-22 13:03:53,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-22 13:03:53,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-10-22 13:03:53,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-22 13:03:53,213 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-22 13:03:53,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 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-22 13:03:53,214 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-22 13:03:53,214 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-22 13:03:53,214 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-22 13:03:53,214 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-22 13:03:53,214 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-22 13:03:53,214 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-22 13:03:53,214 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-22 13:03:53,214 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2024-10-22 13:03:53,214 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-10-22 13:03:53,214 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-22 13:03:53,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-22 13:03:53,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-22 13:03:53,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-22 13:03:53,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-22 13:03:53,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-22 13:03:53,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-22 13:03:53,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-22 13:03:53,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-22 13:03:53,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-22 13:03:53,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-22 13:03:53,599 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-10-22 13:03:53,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-10-22 13:03:53,782 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting readerErr0ASSERT_VIOLATIONUNKNOWN === [readerErr0ASSERT_VIOLATIONUNKNOWN, readerErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-22 13:03:53,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-22 13:03:53,783 INFO L85 PathProgramCache]: Analyzing trace with hash -493687195, now seen corresponding path program 1 times [2024-10-22 13:03:53,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-22 13:03:53,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769823753] [2024-10-22 13:03:53,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-22 13:03:53,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-22 13:03:53,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-22 13:03:53,945 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-22 13:03:53,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-22 13:03:53,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769823753] [2024-10-22 13:03:53,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769823753] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-22 13:03:53,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1541785071] [2024-10-22 13:03:53,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-22 13:03:53,947 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-22 13:03:53,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-22 13:03:53,949 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-22 13:03:53,950 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-22 13:03:54,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-22 13:03:54,252 INFO L255 TraceCheckSpWp]: Trace formula consists of 754 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-22 13:03:54,254 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-22 13:03:54,278 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-22 13:03:54,278 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-22 13:03:54,348 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-22 13:03:54,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1541785071] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-22 13:03:54,349 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-22 13:03:54,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2024-10-22 13:03:54,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74146301] [2024-10-22 13:03:54,349 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-22 13:03:54,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-22 13:03:54,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-22 13:03:54,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-22 13:03:54,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-10-22 13:03:54,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-22 13:03:54,350 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-22 13:03:54,351 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 16.666666666666668) internal successors, (150), 9 states have internal predecessors, (150), 0 states have call successors, (0), 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-22 13:03:54,351 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-22 13:03:54,351 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-22 13:03:54,351 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-22 13:03:54,351 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-22 13:03:54,351 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-22 13:03:54,351 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-22 13:03:54,351 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-22 13:03:54,352 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2024-10-22 13:03:54,352 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-10-22 13:03:54,352 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-22 13:03:54,352 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-22 13:03:55,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-22 13:03:55,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-22 13:03:55,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-22 13:03:55,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-22 13:03:55,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-22 13:03:55,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-22 13:03:55,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-22 13:03:55,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-22 13:03:55,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-22 13:03:55,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-22 13:03:55,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-22 13:03:55,027 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-10-22 13:03:55,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,9 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-22 13:03:55,209 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting readerErr0ASSERT_VIOLATIONUNKNOWN === [readerErr0ASSERT_VIOLATIONUNKNOWN, readerErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-22 13:03:55,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-22 13:03:55,209 INFO L85 PathProgramCache]: Analyzing trace with hash 2000551087, now seen corresponding path program 1 times [2024-10-22 13:03:55,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-22 13:03:55,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164386149] [2024-10-22 13:03:55,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-22 13:03:55,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-22 13:03:55,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-22 13:03:55,279 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-22 13:03:55,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-22 13:03:55,430 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-22 13:03:55,430 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-22 13:03:55,431 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location readerErr0ASSERT_VIOLATIONUNKNOWN (1 of 2 remaining) [2024-10-22 13:03:55,431 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr1ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-10-22 13:03:55,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-22 13:03:55,433 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-22 13:03:55,433 INFO L312 ceAbstractionStarter]: Result for error location readerThread1of2ForFork0 was UNSAFE,UNKNOWN (1/5) [2024-10-22 13:03:56,299 INFO L234 ceAbstractionStarter]: Analysis of concurrent program completed with 2 thread instances [2024-10-22 13:03:56,300 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-22 13:03:56,304 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.10 01:03:56 BasicIcfg [2024-10-22 13:03:56,304 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-22 13:03:56,305 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-22 13:03:56,305 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-22 13:03:56,305 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-22 13:03:56,306 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 01:03:11" (3/4) ... [2024-10-22 13:03:56,307 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-22 13:03:56,309 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-22 13:03:56,309 INFO L158 Benchmark]: Toolchain (without parser) took 48815.57ms. Allocated memory was 169.9MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 129.3MB in the beginning and 992.9MB in the end (delta: -863.7MB). Peak memory consumption was 458.4MB. Max. memory is 16.1GB. [2024-10-22 13:03:56,309 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 125.8MB. Free memory is still 98.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-22 13:03:56,310 INFO L158 Benchmark]: CACSL2BoogieTranslator took 2392.23ms. Allocated memory was 169.9MB in the beginning and 253.8MB in the end (delta: 83.9MB). Free memory was 129.3MB in the beginning and 172.2MB in the end (delta: -42.9MB). Peak memory consumption was 100.5MB. Max. memory is 16.1GB. [2024-10-22 13:03:56,310 INFO L158 Benchmark]: Boogie Procedure Inliner took 197.94ms. Allocated memory is still 253.8MB. Free memory was 172.2MB in the beginning and 162.7MB in the end (delta: 9.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-22 13:03:56,310 INFO L158 Benchmark]: Boogie Preprocessor took 82.00ms. Allocated memory is still 253.8MB. Free memory was 162.7MB in the beginning and 158.6MB in the end (delta: 4.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-22 13:03:56,310 INFO L158 Benchmark]: RCFGBuilder took 1358.94ms. Allocated memory is still 253.8MB. Free memory was 158.6MB in the beginning and 113.0MB in the end (delta: 45.6MB). Peak memory consumption was 54.5MB. Max. memory is 16.1GB. [2024-10-22 13:03:56,311 INFO L158 Benchmark]: TraceAbstraction took 44775.30ms. Allocated memory was 253.8MB in the beginning and 1.5GB in the end (delta: 1.2GB). Free memory was 112.0MB in the beginning and 994.0MB in the end (delta: -882.0MB). Peak memory consumption was 856.5MB. Max. memory is 16.1GB. [2024-10-22 13:03:56,311 INFO L158 Benchmark]: Witness Printer took 3.79ms. Allocated memory is still 1.5GB. Free memory was 994.0MB in the beginning and 992.9MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-22 13:03:56,312 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.18ms. Allocated memory is still 125.8MB. Free memory is still 98.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 2392.23ms. Allocated memory was 169.9MB in the beginning and 253.8MB in the end (delta: 83.9MB). Free memory was 129.3MB in the beginning and 172.2MB in the end (delta: -42.9MB). Peak memory consumption was 100.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 197.94ms. Allocated memory is still 253.8MB. Free memory was 172.2MB in the beginning and 162.7MB in the end (delta: 9.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Preprocessor took 82.00ms. Allocated memory is still 253.8MB. Free memory was 162.7MB in the beginning and 158.6MB in the end (delta: 4.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1358.94ms. Allocated memory is still 253.8MB. Free memory was 158.6MB in the beginning and 113.0MB in the end (delta: 45.6MB). Peak memory consumption was 54.5MB. Max. memory is 16.1GB. * TraceAbstraction took 44775.30ms. Allocated memory was 253.8MB in the beginning and 1.5GB in the end (delta: 1.2GB). Free memory was 112.0MB in the beginning and 994.0MB in the end (delta: -882.0MB). Peak memory consumption was 856.5MB. Max. memory is 16.1GB. * Witness Printer took 3.79ms. Allocated memory is still 1.5GB. Free memory was 994.0MB in the beginning and 992.9MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 3755]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3755] - GenericResultAtLocation [Line: 3757]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3757] - GenericResultAtLocation [Line: 3762]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3762] - GenericResultAtLocation [Line: 3764]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3764] - GenericResultAtLocation [Line: 3770]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3770] - GenericResultAtLocation [Line: 3772]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3772] - GenericResultAtLocation [Line: 3778]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3778] - GenericResultAtLocation [Line: 3780]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3780] - GenericResultAtLocation [Line: 3786]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3786] - GenericResultAtLocation [Line: 3788]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3788] - GenericResultAtLocation [Line: 3794]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3794] - GenericResultAtLocation [Line: 3796]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3796] - GenericResultAtLocation [Line: 3802]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3802] - GenericResultAtLocation [Line: 3804]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3804] - GenericResultAtLocation [Line: 3810]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3810] - GenericResultAtLocation [Line: 3812]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3812] - GenericResultAtLocation [Line: 3817]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3817] - GenericResultAtLocation [Line: 3819]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3819] - GenericResultAtLocation [Line: 3824]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3824] - GenericResultAtLocation [Line: 3826]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3826] - GenericResultAtLocation [Line: 3831]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3831] - GenericResultAtLocation [Line: 3833]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3833] - GenericResultAtLocation [Line: 3838]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3838] - GenericResultAtLocation [Line: 3840]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3840] - GenericResultAtLocation [Line: 3845]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3845] - GenericResultAtLocation [Line: 3847]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3847] - GenericResultAtLocation [Line: 3852]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3852] - GenericResultAtLocation [Line: 3855]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3855] - GenericResultAtLocation [Line: 3861]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3861] - GenericResultAtLocation [Line: 3864]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3864] - GenericResultAtLocation [Line: 3870]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3870] - GenericResultAtLocation [Line: 3873]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3873] - GenericResultAtLocation [Line: 3879]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3879] - GenericResultAtLocation [Line: 3882]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3882] - GenericResultAtLocation [Line: 3888]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3888] - GenericResultAtLocation [Line: 3891]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3891] - GenericResultAtLocation [Line: 3897]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3897] - GenericResultAtLocation [Line: 3900]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3900] - GenericResultAtLocation [Line: 3907]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3907] - GenericResultAtLocation [Line: 3910]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3910] - GenericResultAtLocation [Line: 3917]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3917] - GenericResultAtLocation [Line: 3920]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3920] - GenericResultAtLocation [Line: 3927]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3927] - GenericResultAtLocation [Line: 3930]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3930] - GenericResultAtLocation [Line: 3937]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3937] - GenericResultAtLocation [Line: 3940]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3940] - GenericResultAtLocation [Line: 3947]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3947] - GenericResultAtLocation [Line: 3950]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3950] - GenericResultAtLocation [Line: 3957]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3957] - GenericResultAtLocation [Line: 3960]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3960] - GenericResultAtLocation [Line: 3966]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3966] - GenericResultAtLocation [Line: 3969]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3969] - GenericResultAtLocation [Line: 3975]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3975] - GenericResultAtLocation [Line: 3978]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3978] - GenericResultAtLocation [Line: 3984]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3984] - GenericResultAtLocation [Line: 3987]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3987] - GenericResultAtLocation [Line: 3993]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3993] - GenericResultAtLocation [Line: 3996]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3996] - GenericResultAtLocation [Line: 4002]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4002] - GenericResultAtLocation [Line: 4005]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4005] - GenericResultAtLocation [Line: 4011]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4011] - GenericResultAtLocation [Line: 4014]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4014] - GenericResultAtLocation [Line: 4020]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4020] - GenericResultAtLocation [Line: 4023]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4023] - GenericResultAtLocation [Line: 4029]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4029] - GenericResultAtLocation [Line: 4032]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4032] - GenericResultAtLocation [Line: 4038]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4038] - GenericResultAtLocation [Line: 4041]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4041] - GenericResultAtLocation [Line: 4047]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4047] - GenericResultAtLocation [Line: 4050]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4050] - GenericResultAtLocation [Line: 4056]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4056] - GenericResultAtLocation [Line: 4059]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4059] - GenericResultAtLocation [Line: 4065]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4065] - GenericResultAtLocation [Line: 4068]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4068] - GenericResultAtLocation [Line: 4074]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4074] - GenericResultAtLocation [Line: 4077]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4077] - GenericResultAtLocation [Line: 4083]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4083] - GenericResultAtLocation [Line: 4086]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4086] - GenericResultAtLocation [Line: 4092]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4092] - GenericResultAtLocation [Line: 4095]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4095] - GenericResultAtLocation [Line: 4101]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4101] - GenericResultAtLocation [Line: 4103]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4103] - GenericResultAtLocation [Line: 4109]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4109] - GenericResultAtLocation [Line: 4111]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4111] - GenericResultAtLocation [Line: 4117]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4117] - GenericResultAtLocation [Line: 4119]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4119] - GenericResultAtLocation [Line: 4125]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4125] - GenericResultAtLocation [Line: 4127]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4127] - GenericResultAtLocation [Line: 4133]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4133] - GenericResultAtLocation [Line: 4135]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4135] - GenericResultAtLocation [Line: 4141]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4141] - GenericResultAtLocation [Line: 4143]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4143] - GenericResultAtLocation [Line: 4149]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4149] - GenericResultAtLocation [Line: 4151]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4151] - GenericResultAtLocation [Line: 4157]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4157] - GenericResultAtLocation [Line: 4159]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4159] - GenericResultAtLocation [Line: 4165]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4165] - GenericResultAtLocation [Line: 4167]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4167] - GenericResultAtLocation [Line: 4173]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4173] - GenericResultAtLocation [Line: 4175]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4175] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Partial order reduction statistics Independence relation #1 benchmarks: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 34342, independent: 33895, independent conditional: 622, independent unconditional: 33273, dependent: 447, dependent conditional: 382, dependent unconditional: 65, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 33963, independent: 33895, independent conditional: 622, independent unconditional: 33273, dependent: 68, dependent conditional: 3, dependent unconditional: 65, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 33963, independent: 33895, independent conditional: 622, independent unconditional: 33273, dependent: 68, dependent conditional: 3, dependent unconditional: 65, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 33966, independent: 33895, independent conditional: 622, independent unconditional: 33273, dependent: 71, dependent conditional: 6, dependent unconditional: 65, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 33966, independent: 33895, independent conditional: 0, independent unconditional: 33895, dependent: 71, dependent conditional: 1, dependent unconditional: 70, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 33966, independent: 33895, independent conditional: 0, independent unconditional: 33895, dependent: 71, dependent conditional: 1, dependent unconditional: 70, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 30031, independent: 29965, independent conditional: 0, independent unconditional: 29965, dependent: 66, dependent conditional: 1, dependent unconditional: 65, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 30031, independent: 29931, independent conditional: 0, independent unconditional: 29931, dependent: 100, dependent conditional: 0, dependent unconditional: 100, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 100, independent: 34, independent conditional: 0, independent unconditional: 34, dependent: 66, dependent conditional: 1, dependent unconditional: 65, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 100, independent: 34, independent conditional: 0, independent unconditional: 34, dependent: 66, dependent conditional: 1, dependent unconditional: 65, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 8850, independent: 2257, independent conditional: 0, independent unconditional: 2257, dependent: 6593, dependent conditional: 55, dependent unconditional: 6539, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 33966, independent: 3930, independent conditional: 0, independent unconditional: 3930, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 30031, unknown conditional: 1, unknown unconditional: 30030] , Statistics on independence cache: Total cache size (in pairs): 30031, Positive cache size: 29965, Positive conditional cache size: 0, Positive unconditional cache size: 29965, Negative cache size: 66, Negative conditional cache size: 1, Negative unconditional cache size: 65, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 627, Maximal queried relation: 1, Independence queries for same thread: 379, Persistent sets #1 benchmarks: Persistent set computation time: 9.0s, Number of persistent set computation: 276, Number of trivial persistent sets: 226, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 33338, independent: 33273, independent conditional: 0, independent unconditional: 33273, dependent: 65, dependent conditional: 0, dependent unconditional: 65, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 34342, independent: 33895, independent conditional: 622, independent unconditional: 33273, dependent: 447, dependent conditional: 382, dependent unconditional: 65, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 33963, independent: 33895, independent conditional: 622, independent unconditional: 33273, dependent: 68, dependent conditional: 3, dependent unconditional: 65, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 33963, independent: 33895, independent conditional: 622, independent unconditional: 33273, dependent: 68, dependent conditional: 3, dependent unconditional: 65, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 33966, independent: 33895, independent conditional: 622, independent unconditional: 33273, dependent: 71, dependent conditional: 6, dependent unconditional: 65, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 33966, independent: 33895, independent conditional: 0, independent unconditional: 33895, dependent: 71, dependent conditional: 1, dependent unconditional: 70, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 33966, independent: 33895, independent conditional: 0, independent unconditional: 33895, dependent: 71, dependent conditional: 1, dependent unconditional: 70, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 30031, independent: 29965, independent conditional: 0, independent unconditional: 29965, dependent: 66, dependent conditional: 1, dependent unconditional: 65, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 30031, independent: 29931, independent conditional: 0, independent unconditional: 29931, dependent: 100, dependent conditional: 0, dependent unconditional: 100, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 100, independent: 34, independent conditional: 0, independent unconditional: 34, dependent: 66, dependent conditional: 1, dependent unconditional: 65, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 100, independent: 34, independent conditional: 0, independent unconditional: 34, dependent: 66, dependent conditional: 1, dependent unconditional: 65, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 8850, independent: 2257, independent conditional: 0, independent unconditional: 2257, dependent: 6593, dependent conditional: 55, dependent unconditional: 6539, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 33966, independent: 3930, independent conditional: 0, independent unconditional: 3930, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 30031, unknown conditional: 1, unknown unconditional: 30030] , Statistics on independence cache: Total cache size (in pairs): 30031, Positive cache size: 29965, Positive conditional cache size: 0, Positive unconditional cache size: 29965, Negative cache size: 66, Negative conditional cache size: 1, Negative unconditional cache size: 65, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 627, Maximal queried relation: 1, Independence queries for same thread: 379 - StatisticsResult: Partial order reduction statistics Independence relation #1 benchmarks: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 2384, independent: 2361, independent conditional: 24, independent unconditional: 2337, dependent: 23, dependent conditional: 19, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2365, independent: 2361, independent conditional: 24, independent unconditional: 2337, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2365, independent: 2361, independent conditional: 24, independent unconditional: 2337, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2365, independent: 2361, independent conditional: 24, independent unconditional: 2337, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2365, independent: 2361, independent conditional: 0, independent unconditional: 2361, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2365, independent: 2361, independent conditional: 0, independent unconditional: 2361, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2302, independent: 2298, independent conditional: 0, independent unconditional: 2298, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2302, independent: 2294, independent conditional: 0, independent unconditional: 2294, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 8, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 8, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 666, independent: 326, independent conditional: 0, independent unconditional: 326, dependent: 340, dependent conditional: 0, dependent unconditional: 340, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 2365, independent: 63, independent conditional: 0, independent unconditional: 63, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2302, unknown conditional: 0, unknown unconditional: 2302] , Statistics on independence cache: Total cache size (in pairs): 2302, Positive cache size: 2298, Positive conditional cache size: 0, Positive unconditional cache size: 2298, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 24, Maximal queried relation: 0, Independence queries for same thread: 19, Persistent sets #1 benchmarks: Persistent set computation time: 0.7s, Number of persistent set computation: 17, Number of trivial persistent sets: 17, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2341, independent: 2337, independent conditional: 0, independent unconditional: 2337, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 2384, independent: 2361, independent conditional: 24, independent unconditional: 2337, dependent: 23, dependent conditional: 19, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2365, independent: 2361, independent conditional: 24, independent unconditional: 2337, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2365, independent: 2361, independent conditional: 24, independent unconditional: 2337, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2365, independent: 2361, independent conditional: 24, independent unconditional: 2337, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2365, independent: 2361, independent conditional: 0, independent unconditional: 2361, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2365, independent: 2361, independent conditional: 0, independent unconditional: 2361, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2302, independent: 2298, independent conditional: 0, independent unconditional: 2298, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2302, independent: 2294, independent conditional: 0, independent unconditional: 2294, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 8, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 8, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 666, independent: 326, independent conditional: 0, independent unconditional: 326, dependent: 340, dependent conditional: 0, dependent unconditional: 340, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 2365, independent: 63, independent conditional: 0, independent unconditional: 63, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2302, unknown conditional: 0, unknown unconditional: 2302] , Statistics on independence cache: Total cache size (in pairs): 2302, Positive cache size: 2298, Positive conditional cache size: 0, Positive unconditional cache size: 2298, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 24, Maximal queried relation: 0, Independence queries for same thread: 19 - StatisticsResult: Partial order reduction statistics Independence relation #1 benchmarks: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 333658, independent: 311023, independent conditional: 87321, independent unconditional: 223702, dependent: 22635, dependent conditional: 22425, dependent unconditional: 210, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 311290, independent: 311023, independent conditional: 87321, independent unconditional: 223702, dependent: 267, dependent conditional: 57, dependent unconditional: 210, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 311290, independent: 311023, independent conditional: 87321, independent unconditional: 223702, dependent: 267, dependent conditional: 57, dependent unconditional: 210, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 311305, independent: 311023, independent conditional: 87321, independent unconditional: 223702, dependent: 282, dependent conditional: 72, dependent unconditional: 210, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 311305, independent: 311023, independent conditional: 0, independent unconditional: 311023, dependent: 282, dependent conditional: 1, dependent unconditional: 281, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 311305, independent: 311023, independent conditional: 0, independent unconditional: 311023, dependent: 282, dependent conditional: 1, dependent unconditional: 281, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 161039, independent: 160828, independent conditional: 0, independent unconditional: 160828, dependent: 211, dependent conditional: 1, dependent unconditional: 210, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 161039, independent: 160756, independent conditional: 0, independent unconditional: 160756, dependent: 283, dependent conditional: 0, dependent unconditional: 283, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 283, independent: 72, independent conditional: 0, independent unconditional: 72, dependent: 211, dependent conditional: 1, dependent unconditional: 210, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 283, independent: 72, independent conditional: 0, independent unconditional: 72, dependent: 211, dependent conditional: 1, dependent unconditional: 210, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 20606, independent: 3251, independent conditional: 0, independent unconditional: 3251, dependent: 17356, dependent conditional: 45, dependent unconditional: 17311, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 311305, independent: 150195, independent conditional: 0, independent unconditional: 150195, dependent: 71, dependent conditional: 0, dependent unconditional: 71, unknown: 161039, unknown conditional: 1, unknown unconditional: 161038] , Statistics on independence cache: Total cache size (in pairs): 161039, Positive cache size: 160828, Positive conditional cache size: 0, Positive unconditional cache size: 160828, Negative cache size: 211, Negative conditional cache size: 1, Negative unconditional cache size: 210, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 87392, Maximal queried relation: 3, Independence queries for same thread: 22368, Persistent sets #1 benchmarks: Persistent set computation time: 21.3s, Number of persistent set computation: 8374, Number of trivial persistent sets: 7825, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 223912, independent: 223702, independent conditional: 0, independent unconditional: 223702, dependent: 210, dependent conditional: 0, dependent unconditional: 210, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 333658, independent: 311023, independent conditional: 87321, independent unconditional: 223702, dependent: 22635, dependent conditional: 22425, dependent unconditional: 210, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 311290, independent: 311023, independent conditional: 87321, independent unconditional: 223702, dependent: 267, dependent conditional: 57, dependent unconditional: 210, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 311290, independent: 311023, independent conditional: 87321, independent unconditional: 223702, dependent: 267, dependent conditional: 57, dependent unconditional: 210, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 311305, independent: 311023, independent conditional: 87321, independent unconditional: 223702, dependent: 282, dependent conditional: 72, dependent unconditional: 210, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 311305, independent: 311023, independent conditional: 0, independent unconditional: 311023, dependent: 282, dependent conditional: 1, dependent unconditional: 281, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 311305, independent: 311023, independent conditional: 0, independent unconditional: 311023, dependent: 282, dependent conditional: 1, dependent unconditional: 281, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 161039, independent: 160828, independent conditional: 0, independent unconditional: 160828, dependent: 211, dependent conditional: 1, dependent unconditional: 210, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 161039, independent: 160756, independent conditional: 0, independent unconditional: 160756, dependent: 283, dependent conditional: 0, dependent unconditional: 283, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 283, independent: 72, independent conditional: 0, independent unconditional: 72, dependent: 211, dependent conditional: 1, dependent unconditional: 210, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 283, independent: 72, independent conditional: 0, independent unconditional: 72, dependent: 211, dependent conditional: 1, dependent unconditional: 210, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 20606, independent: 3251, independent conditional: 0, independent unconditional: 3251, dependent: 17356, dependent conditional: 45, dependent unconditional: 17311, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 311305, independent: 150195, independent conditional: 0, independent unconditional: 150195, dependent: 71, dependent conditional: 0, dependent unconditional: 71, unknown: 161039, unknown conditional: 1, unknown unconditional: 161038] , Statistics on independence cache: Total cache size (in pairs): 161039, Positive cache size: 160828, Positive conditional cache size: 0, Positive unconditional cache size: 160828, Negative cache size: 211, Negative conditional cache size: 1, Negative unconditional cache size: 210, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 87392, Maximal queried relation: 3, Independence queries for same thread: 22368 - UnprovableResult [Line: 3928]: Unable to prove that unknown kind of specification holds Unable to prove that unknown kind of specification holds Reason: overapproximation of __atomic_compare_exchange_n at line 3928. Possible FailurePath: [L6033] 0 static vuint32_t g_cs_x = 0; [L6034] 0 static vuint32_t g_cs_y = 0; [L6095] 0 rwlock_t lock = { .n = ((1U << 30U)), .wb = { ._v = 0 }, .rs = { .s = { ._v = ((1U << 30U)) } }, }; [L6076] 0 pthread_t t[(2 + 2)]; [L6077] FCALL 0 init() [L6078] FCALL 0 verification_loop_bound(2 + 1) [L6079] 0 vuintptr_t i = 0; VAL [g_cs_x=0, g_cs_y=0, i=0, lock={4:0}, t={6:0}] [L6079] COND TRUE 0 i < 2 [L6080] FCALL, FORK 0 pthread_create(&t[i], 0, writer, (void *)i) VAL [g_cs_x=0, g_cs_y=0, i=0, lock={4:0}, t={6:0}] [L6058] 1 vuint32_t tid = (vuint32_t)(vuintptr_t)arg; [L6059] CALL 1 writer_acquire(tid) [L6079] 0 i++ VAL [g_cs_x=0, g_cs_y=0, i=1, lock={4:0}, t={6:0}] [L6079] COND TRUE 0 i < 2 [L6080] FCALL, FORK 0 pthread_create(&t[i], 0, writer, (void *)i) VAL [g_cs_x=0, g_cs_y=0, i=1, lock={4:0}, t={6:0}] [L6058] 2 vuint32_t tid = (vuint32_t)(vuintptr_t)arg; [L6059] CALL 2 writer_acquire(tid) [L6079] 0 i++ VAL [g_cs_x=0, g_cs_y=0, i=2, lock={4:0}, t={6:0}] [L6079] COND FALSE 0 !(i < 2) [L6082] CALL 0 verification_loop_bound((2 + 2) + 1) [L6100] CALL 1 rwlock_write_acquire(&lock) [L5413] CALL 1 vatomic32_await_eq_set_rlx(&l->wb, 0, 1U) [L2570] CALL 1 vatomic32_await_eq_set(a, c, v) [L5335] CALL 1 vatomic32_await_eq(a, c) [L4838] 1 vuint32_t ret = c; [L4839] 1 vuint32_t o = 0; [L4840] FCALL 1 verification_loop_begin() [L6100] CALL 2 rwlock_write_acquire(&lock) [L5413] CALL 2 vatomic32_await_eq_set_rlx(&l->wb, 0, 1U) [L2570] CALL 2 vatomic32_await_eq_set(a, c, v) [L4840] EXPR, FCALL 1 verification_spin_start() [L4840] CALL, EXPR 1 vatomic32_read(a) [L3779] EXPR 1 a->_v VAL [\old(a)={4:4}, a={4:4}, g_cs_x=0, g_cs_y=0, lock={4:0}] [L3779] 1 vuint32_t tmp = (vuint32_t)__atomic_load_n(&a->_v, 5); [L3781] 1 return tmp; [L4840] RET, EXPR 1 vatomic32_read(a) [L4840] EXPR 1 o = vatomic32_read(a) VAL [\old(a)={4:4}, \old(c)=0, a={4:4}, c=0, g_cs_x=0, g_cs_y=0, lock={4:0}, o=0, ret=0] [L4840] EXPR 1 ((o = vatomic32_read(a)) != c) ? 1 : (verification_spin_end(1), 0) [L4840] CALL 1 verification_spin_end(1) [L5335] CALL 2 vatomic32_await_eq(a, c) [L4838] 2 vuint32_t ret = c; [L4839] 2 vuint32_t o = 0; [L4840] FCALL 2 verification_loop_begin() [L6082] RET 0 verification_loop_bound((2 + 2) + 1) [L6083] 0 vuintptr_t i = 2; VAL [g_cs_x=0, g_cs_y=0, i=2, lock={4:0}, t={6:0}] [L4840] FCALL 2 verification_spin_start() [L4840] CALL, EXPR 2 vatomic32_read(a) [L3779] EXPR 2 a->_v VAL [\old(a)={4:4}, \result=0, a={4:4}, g_cs_x=0, g_cs_y=0, lock={4:0}] [L3779] 2 vuint32_t tmp = (vuint32_t)__atomic_load_n(&a->_v, 5); [L3781] 2 return tmp; [L4840] RET, EXPR 2 vatomic32_read(a) [L4840] EXPR 2 o = vatomic32_read(a) VAL [\old(a)={4:4}, \old(c)=0, a={4:4}, c=0, g_cs_x=0, g_cs_y=0, lock={4:0}, o=0, ret=0] [L4840] 2 ((o = vatomic32_read(a)) != c) ? 1 : (verification_spin_end(1), 0) [L4840] CALL 2 verification_spin_end(1) [L6083] COND TRUE 0 i < (2 + 2) [L6084] FCALL, FORK 0 pthread_create(&t[i], 0, reader, (void *)i) VAL [g_cs_x=0, g_cs_y=0, i=2, lock={4:0}, t={6:0}] [L6083] 0 i++ VAL [g_cs_x=0, g_cs_y=0, i=3, lock={4:0}, t={6:0}] [L6067] 3 vuint32_t tid = (vuint32_t)(vuintptr_t)arg; [L6068] CALL 3 reader_acquire(tid) [L6083] COND TRUE 0 i < (2 + 2) [L6084] FCALL, FORK 0 pthread_create(&t[i], 0, reader, (void *)i) VAL [g_cs_x=0, g_cs_y=0, i=3, lock={4:0}, t={6:0}] [L6083] 0 i++ VAL [g_cs_x=0, g_cs_y=0, i=4, lock={4:0}, t={6:0}] [L6067] 4 vuint32_t tid = (vuint32_t)(vuintptr_t)arg; [L6068] CALL 4 reader_acquire(tid) [L4840] RET, EXPR 1 verification_spin_end(1) [L4840] EXPR 1 ((o = vatomic32_read(a)) != c) ? 1 : (verification_spin_end(1), 0) VAL [\old(a)={4:4}, \old(c)=0, a={4:4}, c=0, g_cs_x=0, g_cs_y=0, lock={4:0}, o=0, ret=0] [L4840] COND FALSE 1 !((verification_spin_start(), ((o = vatomic32_read(a)) != c) ? 1 : (verification_spin_end(1), 0))) [L4844] 1 return ret; [L5335] RET 1 vatomic32_await_eq(a, c) [L5336] CALL 1 vatomic32_cmpxchg(a, c, v) [L3926] 1 vuint32_t exp = (vuint32_t)e; VAL [\old(a)={4:4}, \old(e)=0, \old(v)=1, a={4:4}, e=0, exp=0, g_cs_x=0, g_cs_y=0, lock={4:0}, v=1] [L6083] COND FALSE 0 !(i < (2 + 2)) [L6086] FCALL 0 post() [L6087] CALL 0 verification_loop_bound((2 + 2) + 1) [L3928-L3929] 1 __atomic_compare_exchange_n(&a->_v, &exp, (vuint32_t)v, 0, 5, 5) VAL [\old(a)={4:4}, \old(e)=0, \old(v)=1, a={4:4}, e=0, exp=0, g_cs_x=0, g_cs_y=0, lock={4:0}, v=1] [L4840] RET, EXPR 2 verification_spin_end(1) [L4840] EXPR 2 ((o = vatomic32_read(a)) != c) ? 1 : (verification_spin_end(1), 0) VAL [\old(a)={4:4}, \old(c)=0, \result=0, a={4:4}, c=0, g_cs_x=0, g_cs_y=0, lock={4:0}, o=0, ret=0] [L4840] COND FALSE 2 !((verification_spin_start(), ((o = vatomic32_read(a)) != c) ? 1 : (verification_spin_end(1), 0))) [L4844] 2 return ret; [L5335] RET 2 vatomic32_await_eq(a, c) [L5336] CALL 2 vatomic32_cmpxchg(a, c, v) [L3926] 2 vuint32_t exp = (vuint32_t)e; VAL [\old(a)={4:4}, \old(e)=0, \old(v)=1, a={4:4}, e=0, exp=0, g_cs_x=0, g_cs_y=0, lock={4:0}, v=1] [L6112] CALL 3 rwlock_read_acquire(&lock) [L5437] CALL 3 vatomic32_await_eq_rlx(&l->wb, 0) [L2255] CALL, EXPR 3 vatomic32_await_eq(a, v) [L4838] 3 vuint32_t ret = c; [L4839] 3 vuint32_t o = 0; [L4840] FCALL 3 verification_loop_begin() [L3928-L3929] 2 __atomic_compare_exchange_n(&a->_v, &exp, (vuint32_t)v, 0, 5, 5) VAL [\old(a)={4:4}, \old(e)=0, \old(v)=1, a={4:4}, e=0, exp=0, g_cs_x=0, g_cs_y=0, lock={4:0}, v=1] [L4840] EXPR, FCALL 3 verification_spin_start() [L4840] CALL, EXPR 3 vatomic32_read(a) [L3779] EXPR 3 a->_v VAL [\old(a)={4:4}, \result=0, a={4:4}, g_cs_x=0, g_cs_y=0, lock={4:0}] [L3779] 3 vuint32_t tmp = (vuint32_t)__atomic_load_n(&a->_v, 5); [L3781] 3 return tmp; [L4840] RET, EXPR 3 vatomic32_read(a) [L4840] EXPR 3 o = vatomic32_read(a) VAL [\old(a)={4:4}, \old(c)=0, \result=0, a={4:4}, c=0, g_cs_x=0, g_cs_y=0, lock={4:0}, o=0, ret=0] [L4840] EXPR 3 ((o = vatomic32_read(a)) != c) ? 1 : (verification_spin_end(1), 0) [L4840] CALL 3 verification_spin_end(1) [L6112] CALL 4 rwlock_read_acquire(&lock) [L5437] CALL 4 vatomic32_await_eq_rlx(&l->wb, 0) [L2255] CALL 4 vatomic32_await_eq(a, v) [L4838] 4 vuint32_t ret = c; [L4839] 4 vuint32_t o = 0; [L4840] FCALL 4 verification_loop_begin() [L6087] RET 0 verification_loop_bound((2 + 2) + 1) [L6088] 0 vuintptr_t i = 0; VAL [g_cs_x=0, g_cs_y=0, i=0, lock={4:0}, t={6:0}] [L4840] FCALL 4 verification_spin_start() [L4840] CALL, EXPR 4 vatomic32_read(a) [L3779] EXPR 4 a->_v VAL [\old(a)={4:4}, \result=0, \result=0, a={4:4}, g_cs_x=0, g_cs_y=0, lock={4:0}] [L3779] 4 vuint32_t tmp = (vuint32_t)__atomic_load_n(&a->_v, 5); [L3781] 4 return tmp; [L4840] RET, EXPR 4 vatomic32_read(a) [L4840] EXPR 4 o = vatomic32_read(a) VAL [\old(a)={4:4}, \old(c)=0, \result=0, a={4:4}, c=0, g_cs_x=0, g_cs_y=0, lock={4:0}, o=0, ret=0] [L4840] 4 ((o = vatomic32_read(a)) != c) ? 1 : (verification_spin_end(1), 0) [L4840] CALL 4 verification_spin_end(1) [L6088] COND TRUE 0 i < (2 + 2) [L6089] 0 t[i] VAL [g_cs_x=0, g_cs_y=0, i=0, lock={4:0}, t={6:0}] [L4840] RET, EXPR 3 verification_spin_end(1) [L4840] EXPR 3 ((o = vatomic32_read(a)) != c) ? 1 : (verification_spin_end(1), 0) VAL [\old(a)={4:4}, \old(c)=0, \result=0, a={4:4}, c=0, g_cs_x=0, g_cs_y=0, lock={4:0}, o=0, ret=0] [L4840] COND FALSE 3 !((verification_spin_start(), ((o = vatomic32_read(a)) != c) ? 1 : (verification_spin_end(1), 0))) [L4844] 3 return ret; [L2255] RET, EXPR 3 vatomic32_await_eq(a, v) [L2255] 3 return vatomic32_await_eq(a, v); [L5437] RET 3 vatomic32_await_eq_rlx(&l->wb, 0) [L5438] CALL 3 semaphore_acquire(&l->rs, 1U) [L5382] CALL 3 vatomic32_await_ge_sub_acq(&s->s, i, i) [L2425] CALL 3 vatomic32_await_ge_sub(a, c, v) [L5034] 3 vuint32_t cur = 0; [L5035] CALL, EXPR 3 vatomic32_read(a) [L3779] EXPR 3 a->_v VAL [\old(a)={4:8}, \result=0, \result=0, a={4:8}, g_cs_x=0, g_cs_y=0, lock={4:0}] [L3779] 3 vuint32_t tmp = (vuint32_t)__atomic_load_n(&a->_v, 5); [L3781] 3 return tmp; [L5035] RET, EXPR 3 vatomic32_read(a) [L5035] 3 vuint32_t old = vatomic32_read(a); [L5037] 3 cur = old VAL [\old(a)={4:8}, \old(c)=1, \old(v)=1, a={4:8}, c=1, cur=1073741824, g_cs_x=0, g_cs_y=0, lock={4:0}, old=1073741824, v=1] [L4840] RET, EXPR 4 verification_spin_end(1) [L4840] EXPR 4 ((o = vatomic32_read(a)) != c) ? 1 : (verification_spin_end(1), 0) VAL [\old(a)={4:4}, \old(c)=0, \result=0, \result=0, a={4:4}, c=0, g_cs_x=0, g_cs_y=0, lock={4:0}, o=0, ret=0] [L4840] COND FALSE 4 !((verification_spin_start(), ((o = vatomic32_read(a)) != c) ? 1 : (verification_spin_end(1), 0))) [L4844] 4 return ret; [L2255] RET, EXPR 4 vatomic32_await_eq(a, v) [L2255] 4 return vatomic32_await_eq(a, v); [L5437] RET 4 vatomic32_await_eq_rlx(&l->wb, 0) [L5438] CALL 4 semaphore_acquire(&l->rs, 1U) [L5382] CALL 4 vatomic32_await_ge_sub_acq(&s->s, i, i) [L2425] CALL 4 vatomic32_await_ge_sub(a, c, v) [L5034] 4 vuint32_t cur = 0; [L5035] CALL, EXPR 4 vatomic32_read(a) [L3779] EXPR 4 a->_v VAL [\old(a)={4:8}, \result=0, \result=1073741824, a={4:8}, g_cs_x=0, g_cs_y=0, lock={4:0}] [L3779] 4 vuint32_t tmp = (vuint32_t)__atomic_load_n(&a->_v, 5); [L3781] 4 return tmp; [L5035] RET, EXPR 4 vatomic32_read(a) [L5035] 4 vuint32_t old = vatomic32_read(a); [L5038] COND FALSE 3 !(!(cur >= c)) [L5041] CALL 3 vatomic32_cmpxchg(a, cur, cur - v) [L3926] 3 vuint32_t exp = (vuint32_t)e; VAL [\old(a)={4:4}, \old(a)={4:8}, \old(e)=0, \old(e)=1073741824, \old(v)=1, \old(v)=1073741823, a={4:4}, a={4:8}, e=0, e=1073741824, exp=0, exp=1073741824, g_cs_x=0, g_cs_y=0, lock={4:0}, v=1, v=1073741823] [L5037] 4 cur = old VAL [\old(a)={4:8}, \old(c)=1, \old(v)=1, a={4:8}, c=1, cur=1073741824, g_cs_x=0, g_cs_y=0, lock={4:0}, old=1073741824, v=1] [L3928-L3929] 3 __atomic_compare_exchange_n(&a->_v, &exp, (vuint32_t)v, 0, 5, 5) VAL [\old(a)={4:4}, \old(a)={4:8}, \old(e)=0, \old(e)=1073741824, \old(v)=1, \old(v)=1073741823, a={4:4}, a={4:8}, e=0, e=1073741824, exp=0, exp=1073741824, g_cs_x=0, g_cs_y=0, lock={4:0}, v=1, v=1073741823] - UnprovableResult [Line: 6047]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: readerThread1of1ForFork0 with 1 thread instances CFG has 5 procedures, 336 locations, 12 error locations. Started 1 CEGAR loops. OverallTime: 10.7s, OverallIterations: 3, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 9.4s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 281 NumberOfCodeBlocks, 281 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 343 ConstructedInterpolants, 0 QuantifiedInterpolants, 413 SizeOfPredicates, 0 NumberOfNonLiveVariables, 433 ConjunctsInSsa, 5 ConjunctsInUnsatCore, 5 InterpolantComputations, 2 PerfectInterpolantSequences, 34/37 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: ULTIMATE.start with 1 thread instances CFG has 5 procedures, 336 locations, 12 error locations. Started 1 CEGAR loops. OverallTime: 0.8s, OverallIterations: 2, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.7s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 25 NumberOfCodeBlocks, 25 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 10 ConstructedInterpolants, 0 QuantifiedInterpolants, 10 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 2/2 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: readerThread1of2ForFork0 with 1 thread instances CFG has 7 procedures, 484 locations, 16 error locations. Started 1 CEGAR loops. OverallTime: 32.0s, OverallIterations: 12, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 26.6s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 59, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 2666 NumberOfCodeBlocks, 2666 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 2644 ConstructedInterpolants, 0 QuantifiedInterpolants, 5143 SizeOfPredicates, 130 NumberOfNonLiveVariables, 3472 ConjunctsInSsa, 275 ConjunctsInUnsatCore, 16 InterpolantComputations, 10 PerfectInterpolantSequences, 1319/1346 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 could not prove your program: unable to determine feasibility of some traces [2024-10-22 13:03:56,351 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (5)] Ended with exit code 0 [2024-10-22 13:03:56,544 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (4)] Forceful destruction successful, exit code 0 [2024-10-22 13:03:56,745 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2024-10-22 13:03:56,945 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/GemCutterReach.xml -i ../../../trunk/examples/svcomp/libvsync/rwlock.i -s /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer GemCutter --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash fd8ac353802a2e1d548b78214c4e90430a3b2551f535af0ed9cab2c49366d321 --traceabstraction.dfs.order.used.in.por LOOP_LOCKSTEP -tc /storage/repos/ultimate/releaseScripts/default/benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml --- Real Ultimate output --- This is Ultimate 0.2.5-dev-5dad65a-m [2024-10-22 13:03:59,160 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-22 13:03:59,234 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Bitvector.epf [2024-10-22 13:03:59,240 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-22 13:03:59,241 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-22 13:03:59,275 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-22 13:03:59,276 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-22 13:03:59,276 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-22 13:03:59,279 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-22 13:03:59,279 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-22 13:03:59,280 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-22 13:03:59,280 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-22 13:03:59,281 INFO L153 SettingsManager]: * Use SBE=true [2024-10-22 13:03:59,281 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-22 13:03:59,283 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-22 13:03:59,284 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-22 13:03:59,284 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-22 13:03:59,284 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-22 13:03:59,284 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-22 13:03:59,285 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-22 13:03:59,285 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-22 13:03:59,288 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-22 13:03:59,289 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-22 13:03:59,289 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-22 13:03:59,289 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-22 13:03:59,289 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-22 13:03:59,289 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-22 13:03:59,290 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-22 13:03:59,290 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-22 13:03:59,290 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-22 13:03:59,290 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-22 13:03:59,291 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-10-22 13:03:59,291 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-22 13:03:59,291 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-22 13:03:59,291 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-22 13:03:59,292 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-22 13:03:59,292 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2024-10-22 13:03:59,292 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-22 13:03:59,298 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-22 13:03:59,298 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-10-22 13:03:59,299 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-10-22 13:03:59,300 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-10-22 13:03:59,300 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-22 13:03:59,300 INFO L153 SettingsManager]: * Logic for external solver=AUFBV 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/UGemCutter-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.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> GemCutter Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> fd8ac353802a2e1d548b78214c4e90430a3b2551f535af0ed9cab2c49366d321 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: DFS Order used in POR -> LOOP_LOCKSTEP [2024-10-22 13:03:59,591 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-22 13:03:59,613 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-22 13:03:59,618 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-22 13:03:59,619 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-22 13:03:59,620 INFO L274 PluginConnector]: CDTParser initialized [2024-10-22 13:03:59,621 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/libvsync/rwlock.i [2024-10-22 13:04:01,113 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-22 13:04:01,556 INFO L384 CDTParser]: Found 1 translation units. [2024-10-22 13:04:01,557 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/libvsync/rwlock.i [2024-10-22 13:04:01,605 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/5ca4de215/c7fea8b0112946d8b1daf4196810355a/FLAGc4d3f7644 [2024-10-22 13:04:01,621 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/5ca4de215/c7fea8b0112946d8b1daf4196810355a [2024-10-22 13:04:01,623 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-22 13:04:01,624 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-22 13:04:01,626 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-22 13:04:01,627 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-22 13:04:01,632 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-22 13:04:01,633 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 01:04:01" (1/1) ... [2024-10-22 13:04:01,634 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@101c492a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 01:04:01, skipping insertion in model container [2024-10-22 13:04:01,634 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 01:04:01" (1/1) ... [2024-10-22 13:04:01,754 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-22 13:04:03,310 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/libvsync/rwlock.i[195762,195775] [2024-10-22 13:04:03,314 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/libvsync/rwlock.i[195845,195858] [2024-10-22 13:04:03,316 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/libvsync/rwlock.i[195902,195915] [2024-10-22 13:04:03,331 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-22 13:04:03,364 INFO L200 MainTranslator]: Completed pre-run [2024-10-22 13:04:03,444 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3755] [2024-10-22 13:04:03,446 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3757] [2024-10-22 13:04:03,447 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3762] [2024-10-22 13:04:03,447 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3764] [2024-10-22 13:04:03,448 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3770] [2024-10-22 13:04:03,450 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3772] [2024-10-22 13:04:03,450 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3778] [2024-10-22 13:04:03,451 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3780] [2024-10-22 13:04:03,451 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3786] [2024-10-22 13:04:03,451 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3788] [2024-10-22 13:04:03,452 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3794] [2024-10-22 13:04:03,453 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3796] [2024-10-22 13:04:03,453 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3802] [2024-10-22 13:04:03,454 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3804] [2024-10-22 13:04:03,454 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3810] [2024-10-22 13:04:03,454 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3812] [2024-10-22 13:04:03,455 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3817] [2024-10-22 13:04:03,455 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3819] [2024-10-22 13:04:03,455 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3824] [2024-10-22 13:04:03,455 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3826] [2024-10-22 13:04:03,456 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3831] [2024-10-22 13:04:03,456 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3833] [2024-10-22 13:04:03,457 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3838] [2024-10-22 13:04:03,458 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3840] [2024-10-22 13:04:03,458 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3845] [2024-10-22 13:04:03,459 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3847] [2024-10-22 13:04:03,459 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3852] [2024-10-22 13:04:03,460 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3855] [2024-10-22 13:04:03,460 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3861] [2024-10-22 13:04:03,460 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3864] [2024-10-22 13:04:03,461 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3870] [2024-10-22 13:04:03,461 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3873] [2024-10-22 13:04:03,462 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3879] [2024-10-22 13:04:03,462 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3882] [2024-10-22 13:04:03,462 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3888] [2024-10-22 13:04:03,463 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3891] [2024-10-22 13:04:03,463 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3897] [2024-10-22 13:04:03,463 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3900] [2024-10-22 13:04:03,464 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3907] [2024-10-22 13:04:03,464 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3910] [2024-10-22 13:04:03,464 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3917] [2024-10-22 13:04:03,465 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3920] [2024-10-22 13:04:03,465 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3927] [2024-10-22 13:04:03,465 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3930] [2024-10-22 13:04:03,466 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3937] [2024-10-22 13:04:03,466 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3940] [2024-10-22 13:04:03,466 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3947] [2024-10-22 13:04:03,467 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3950] [2024-10-22 13:04:03,467 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3957] [2024-10-22 13:04:03,468 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3960] [2024-10-22 13:04:03,469 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3966] [2024-10-22 13:04:03,469 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3969] [2024-10-22 13:04:03,470 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3975] [2024-10-22 13:04:03,470 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3978] [2024-10-22 13:04:03,470 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3984] [2024-10-22 13:04:03,471 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3987] [2024-10-22 13:04:03,471 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3993] [2024-10-22 13:04:03,471 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3996] [2024-10-22 13:04:03,471 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4002] [2024-10-22 13:04:03,472 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4005] [2024-10-22 13:04:03,473 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4011] [2024-10-22 13:04:03,474 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4014] [2024-10-22 13:04:03,474 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4020] [2024-10-22 13:04:03,475 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4023] [2024-10-22 13:04:03,475 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4029] [2024-10-22 13:04:03,478 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4032] [2024-10-22 13:04:03,479 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4038] [2024-10-22 13:04:03,479 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4041] [2024-10-22 13:04:03,480 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4047] [2024-10-22 13:04:03,480 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4050] [2024-10-22 13:04:03,480 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4056] [2024-10-22 13:04:03,481 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4059] [2024-10-22 13:04:03,483 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4065] [2024-10-22 13:04:03,483 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4068] [2024-10-22 13:04:03,483 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4074] [2024-10-22 13:04:03,484 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4077] [2024-10-22 13:04:03,484 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4083] [2024-10-22 13:04:03,486 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4086] [2024-10-22 13:04:03,486 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4092] [2024-10-22 13:04:03,487 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4095] [2024-10-22 13:04:03,487 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4101] [2024-10-22 13:04:03,487 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4103] [2024-10-22 13:04:03,488 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4109] [2024-10-22 13:04:03,488 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4111] [2024-10-22 13:04:03,488 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4117] [2024-10-22 13:04:03,488 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4119] [2024-10-22 13:04:03,489 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4125] [2024-10-22 13:04:03,489 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4127] [2024-10-22 13:04:03,489 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4133] [2024-10-22 13:04:03,489 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4135] [2024-10-22 13:04:03,490 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4141] [2024-10-22 13:04:03,490 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4143] [2024-10-22 13:04:03,491 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4149] [2024-10-22 13:04:03,492 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4151] [2024-10-22 13:04:03,492 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4157] [2024-10-22 13:04:03,493 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4159] [2024-10-22 13:04:03,493 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4165] [2024-10-22 13:04:03,493 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4167] [2024-10-22 13:04:03,494 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4173] [2024-10-22 13:04:03,494 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4175] [2024-10-22 13:04:03,568 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/libvsync/rwlock.i[195762,195775] [2024-10-22 13:04:03,569 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/libvsync/rwlock.i[195845,195858] [2024-10-22 13:04:03,569 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/libvsync/rwlock.i[195902,195915] [2024-10-22 13:04:03,574 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-22 13:04:03,852 INFO L204 MainTranslator]: Completed translation [2024-10-22 13:04:03,853 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 01:04:03 WrapperNode [2024-10-22 13:04:03,853 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-22 13:04:03,854 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-22 13:04:03,854 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-22 13:04:03,854 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-22 13:04:03,861 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 01:04:03" (1/1) ... [2024-10-22 13:04:03,948 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 01:04:03" (1/1) ... [2024-10-22 13:04:04,010 INFO L138 Inliner]: procedures = 938, calls = 928, calls flagged for inlining = 832, calls inlined = 67, statements flattened = 682 [2024-10-22 13:04:04,010 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-22 13:04:04,011 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-22 13:04:04,011 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-22 13:04:04,011 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-22 13:04:04,020 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 01:04:03" (1/1) ... [2024-10-22 13:04:04,020 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 01:04:03" (1/1) ... [2024-10-22 13:04:04,025 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 01:04:03" (1/1) ... [2024-10-22 13:04:04,026 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 01:04:03" (1/1) ... [2024-10-22 13:04:04,055 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 01:04:03" (1/1) ... [2024-10-22 13:04:04,071 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 01:04:03" (1/1) ... [2024-10-22 13:04:04,082 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 01:04:03" (1/1) ... [2024-10-22 13:04:04,090 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 01:04:03" (1/1) ... [2024-10-22 13:04:04,102 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-22 13:04:04,103 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-22 13:04:04,103 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-22 13:04:04,103 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-22 13:04:04,104 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 01:04:03" (1/1) ... [2024-10-22 13:04:04,112 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-10-22 13:04:04,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-22 13:04:04,137 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-10-22 13:04:04,143 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-10-22 13:04:04,182 INFO L130 BoogieDeclarations]: Found specification of procedure reader [2024-10-22 13:04:04,182 INFO L138 BoogieDeclarations]: Found implementation of procedure reader [2024-10-22 13:04:04,183 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-22 13:04:04,183 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-22 13:04:04,183 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-22 13:04:04,183 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-22 13:04:04,183 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-22 13:04:04,183 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2024-10-22 13:04:04,184 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2024-10-22 13:04:04,184 INFO L130 BoogieDeclarations]: Found specification of procedure writer [2024-10-22 13:04:04,184 INFO L138 BoogieDeclarations]: Found implementation of procedure writer [2024-10-22 13:04:04,185 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2024-10-22 13:04:04,185 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2024-10-22 13:04:04,187 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-22 13:04:04,408 INFO L238 CfgBuilder]: Building ICFG [2024-10-22 13:04:04,410 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-22 13:04:05,204 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-22 13:04:05,205 INFO L287 CfgBuilder]: Performing block encoding [2024-10-22 13:04:05,596 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-22 13:04:05,596 INFO L314 CfgBuilder]: Removed 131 assume(true) statements. [2024-10-22 13:04:05,597 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 01:04:05 BoogieIcfgContainer [2024-10-22 13:04:05,597 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-22 13:04:05,599 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-22 13:04:05,599 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-22 13:04:05,602 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-22 13:04:05,603 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 01:04:01" (1/3) ... [2024-10-22 13:04:05,603 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@152f9258 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 01:04:05, skipping insertion in model container [2024-10-22 13:04:05,604 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 01:04:03" (2/3) ... [2024-10-22 13:04:05,604 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@152f9258 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 01:04:05, skipping insertion in model container [2024-10-22 13:04:05,604 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 01:04:05" (3/3) ... [2024-10-22 13:04:05,605 INFO L112 eAbstractionObserver]: Analyzing ICFG rwlock.i [2024-10-22 13:04:05,621 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-22 13:04:05,621 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2024-10-22 13:04:05,622 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-22 13:04:05,768 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-10-22 13:04:05,819 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-22 13:04:05,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-22 13:04:05,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-22 13:04:05,822 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-10-22 13:04:05,840 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2024-10-22 13:04:05,876 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-22 13:04:05,888 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == readerThread1of1ForFork0 ======== [2024-10-22 13:04:05,894 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=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@4d0594a2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-22 13:04:05,895 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-22 13:04:17,022 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting readerErr1ASSERT_VIOLATIONERROR_FUNCTION === [readerErr0ASSERT_VIOLATIONUNKNOWN, readerErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-22 13:04:17,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-22 13:04:17,027 INFO L85 PathProgramCache]: Analyzing trace with hash 229987570, now seen corresponding path program 1 times [2024-10-22 13:04:17,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-22 13:04:17,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1470249380] [2024-10-22 13:04:17,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-22 13:04:17,044 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-22 13:04:17,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-10-22 13:04:17,063 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-22 13:04:17,064 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-22 13:04:17,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-22 13:04:17,347 INFO L255 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-22 13:04:17,353 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-22 13:04:17,362 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-22 13:04:17,362 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-22 13:04:17,363 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-22 13:04:17,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1470249380] [2024-10-22 13:04:17,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1470249380] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-22 13:04:17,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-22 13:04:17,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-22 13:04:17,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666693525] [2024-10-22 13:04:17,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-22 13:04:17,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-22 13:04:17,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-22 13:04:17,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-22 13:04:17,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-22 13:04:17,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-22 13:04:17,399 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-22 13:04:17,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-22 13:04:17,401 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-22 13:04:19,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-22 13:04:19,173 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-22 13:04:19,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-22 13:04:19,363 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting readerErr0ASSERT_VIOLATIONUNKNOWN === [readerErr0ASSERT_VIOLATIONUNKNOWN, readerErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-22 13:04:19,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-22 13:04:19,363 INFO L85 PathProgramCache]: Analyzing trace with hash -858062929, now seen corresponding path program 1 times [2024-10-22 13:04:19,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-22 13:04:19,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1452650062] [2024-10-22 13:04:19,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-22 13:04:19,364 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-22 13:04:19,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-10-22 13:04:19,371 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-22 13:04:19,372 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-22 13:04:19,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-22 13:04:19,588 INFO L255 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-22 13:04:19,593 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-22 13:04:19,622 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-22 13:04:19,624 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-22 13:04:19,650 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-22 13:04:19,651 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-22 13:04:19,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1452650062] [2024-10-22 13:04:19,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1452650062] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-22 13:04:19,652 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-22 13:04:19,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2024-10-22 13:04:19,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550841530] [2024-10-22 13:04:19,653 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-22 13:04:19,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-22 13:04:19,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-22 13:04:19,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-22 13:04:19,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-22 13:04:19,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-22 13:04:19,657 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-22 13:04:19,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 6 states have internal predecessors, (89), 0 states have call successors, (0), 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-22 13:04:19,658 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-22 13:04:19,658 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-22 13:04:20,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-22 13:04:20,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-22 13:04:20,767 INFO L782 garLoopResultBuilder]: Registering result SAFE for location readerErr0ASSERT_VIOLATIONUNKNOWN (1 of 2 remaining) [2024-10-22 13:04:20,767 INFO L782 garLoopResultBuilder]: Registering result SAFE for location readerErr1ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-10-22 13:04:20,775 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-10-22 13:04:20,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-22 13:04:20,978 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1] [2024-10-22 13:04:20,979 INFO L312 ceAbstractionStarter]: Result for error location readerThread1of1ForFork0 was SAFE,SAFE (1/3) [2024-10-22 13:04:20,987 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-22 13:04:20,987 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-22 13:04:20,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-22 13:04:20,989 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-10-22 13:04:20,990 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (5)] Waiting until timeout for monitored process [2024-10-22 13:04:20,994 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-22 13:04:20,994 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-10-22 13:04:20,995 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=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@4d0594a2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-22 13:04:20,995 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-10-22 13:04:21,592 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-10-22 13:04:21,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-22 13:04:21,593 INFO L85 PathProgramCache]: Analyzing trace with hash 276365702, now seen corresponding path program 1 times [2024-10-22 13:04:21,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-22 13:04:21,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1830991457] [2024-10-22 13:04:21,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-22 13:04:21,593 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-22 13:04:21,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-10-22 13:04:21,597 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-22 13:04:21,598 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-10-22 13:04:21,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-22 13:04:21,699 INFO L255 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-22 13:04:21,700 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-22 13:04:21,700 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-22 13:04:21,700 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-22 13:04:21,700 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-22 13:04:21,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1830991457] [2024-10-22 13:04:21,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1830991457] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-22 13:04:21,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-22 13:04:21,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-22 13:04:21,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896236938] [2024-10-22 13:04:21,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-22 13:04:21,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-22 13:04:21,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-22 13:04:21,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-22 13:04:21,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-22 13:04:21,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-22 13:04:21,703 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-22 13:04:21,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 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-22 13:04:21,703 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-22 13:04:21,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-22 13:04:21,834 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-10-22 13:04:22,029 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-22 13:04:22,030 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-10-22 13:04:22,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-22 13:04:22,030 INFO L85 PathProgramCache]: Analyzing trace with hash 1678359356, now seen corresponding path program 1 times [2024-10-22 13:04:22,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-22 13:04:22,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1858368567] [2024-10-22 13:04:22,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-22 13:04:22,031 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-22 13:04:22,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-10-22 13:04:22,033 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-22 13:04:22,034 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-10-22 13:04:22,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-22 13:04:22,141 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-22 13:04:22,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-22 13:04:22,226 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-10-22 13:04:22,226 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-22 13:04:22,227 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 4 remaining) [2024-10-22 13:04:22,227 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2024-10-22 13:04:22,227 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2024-10-22 13:04:22,227 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2024-10-22 13:04:22,233 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2024-10-22 13:04:22,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-22 13:04:22,430 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1] [2024-10-22 13:04:22,430 INFO L312 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN,UNKNOWN,UNKNOWN (2/3) [2024-10-22 13:04:22,431 WARN L239 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-22 13:04:22,431 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-10-22 13:04:22,553 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-10-22 13:04:22,559 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-22 13:04:22,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-22 13:04:22,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-22 13:04:22,561 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-10-22 13:04:22,566 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-22 13:04:22,567 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (8)] Waiting until timeout for monitored process [2024-10-22 13:04:22,567 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == readerThread1of2ForFork0 ======== [2024-10-22 13:04:22,568 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=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@4d0594a2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-22 13:04:22,568 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-22 13:05:05,401 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting readerErr1ASSERT_VIOLATIONERROR_FUNCTION === [readerErr0ASSERT_VIOLATIONUNKNOWN, readerErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-22 13:05:05,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-22 13:05:05,401 INFO L85 PathProgramCache]: Analyzing trace with hash 1170678464, now seen corresponding path program 1 times [2024-10-22 13:05:05,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-22 13:05:05,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [584184105] [2024-10-22 13:05:05,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-22 13:05:05,403 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-22 13:05:05,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-10-22 13:05:05,404 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-22 13:05:05,406 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-10-22 13:05:05,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-22 13:05:05,745 INFO L255 TraceCheckSpWp]: Trace formula consists of 566 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-22 13:05:05,750 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-22 13:05:05,754 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-10-22 13:05:05,755 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-22 13:05:05,755 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-22 13:05:05,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [584184105] [2024-10-22 13:05:05,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [584184105] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-22 13:05:05,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-22 13:05:05,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-22 13:05:05,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700639642] [2024-10-22 13:05:05,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-22 13:05:05,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-22 13:05:05,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-22 13:05:05,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-22 13:05:05,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-22 13:05:05,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-22 13:05:05,757 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-22 13:05:05,758 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 41.0) internal successors, (82), 2 states have internal predecessors, (82), 0 states have call successors, (0), 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-22 13:05:05,758 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-22 13:05:10,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-22 13:05:10,578 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2024-10-22 13:05:10,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-22 13:05:10,770 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting readerErr0ASSERT_VIOLATIONUNKNOWN === [readerErr0ASSERT_VIOLATIONUNKNOWN, readerErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-22 13:05:10,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-22 13:05:10,770 INFO L85 PathProgramCache]: Analyzing trace with hash -1545319926, now seen corresponding path program 1 times [2024-10-22 13:05:10,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-22 13:05:10,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [281263911] [2024-10-22 13:05:10,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-22 13:05:10,771 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-22 13:05:10,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-10-22 13:05:10,774 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-22 13:05:10,775 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-10-22 13:05:11,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-22 13:05:11,074 INFO L255 TraceCheckSpWp]: Trace formula consists of 603 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-22 13:05:11,078 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-22 13:05:11,092 INFO L134 CoverageAnalysis]: Checked inductivity of 233 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2024-10-22 13:05:11,092 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-22 13:05:11,092 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-22 13:05:11,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [281263911] [2024-10-22 13:05:11,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [281263911] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-22 13:05:11,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-22 13:05:11,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-22 13:05:11,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967257802] [2024-10-22 13:05:11,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-22 13:05:11,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-22 13:05:11,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-22 13:05:11,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-22 13:05:11,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-22 13:05:11,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-22 13:05:11,095 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-22 13:05:11,096 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 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-22 13:05:11,096 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-22 13:05:11,096 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-22 13:05:11,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-22 13:05:11,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-22 13:05:11,403 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2024-10-22 13:05:11,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-22 13:05:11,593 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting readerErr0ASSERT_VIOLATIONUNKNOWN === [readerErr0ASSERT_VIOLATIONUNKNOWN, readerErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-22 13:05:11,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-22 13:05:11,593 INFO L85 PathProgramCache]: Analyzing trace with hash 1878653372, now seen corresponding path program 1 times [2024-10-22 13:05:11,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-22 13:05:11,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [354997767] [2024-10-22 13:05:11,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-22 13:05:11,594 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-22 13:05:11,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-10-22 13:05:11,595 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-22 13:05:11,596 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-10-22 13:05:11,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-22 13:05:11,880 INFO L255 TraceCheckSpWp]: Trace formula consists of 502 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-22 13:05:11,884 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-22 13:05:11,932 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 14 proven. 5 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2024-10-22 13:05:11,936 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-22 13:05:11,994 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 14 proven. 5 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2024-10-22 13:05:11,995 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-22 13:05:11,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [354997767] [2024-10-22 13:05:11,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [354997767] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-22 13:05:11,995 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-22 13:05:11,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-10-22 13:05:11,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214775525] [2024-10-22 13:05:11,996 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-22 13:05:11,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-22 13:05:11,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-22 13:05:11,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-22 13:05:11,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-10-22 13:05:11,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-22 13:05:11,998 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-22 13:05:11,998 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 20.0) internal successors, (160), 8 states have internal predecessors, (160), 0 states have call successors, (0), 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-22 13:05:11,998 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-22 13:05:11,999 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-22 13:05:11,999 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-22 13:05:12,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-22 13:05:12,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-22 13:05:12,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-22 13:05:12,991 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2024-10-22 13:05:13,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-22 13:05:13,183 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting readerErr0ASSERT_VIOLATIONUNKNOWN === [readerErr0ASSERT_VIOLATIONUNKNOWN, readerErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-22 13:05:13,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-22 13:05:13,183 INFO L85 PathProgramCache]: Analyzing trace with hash 530137752, now seen corresponding path program 1 times [2024-10-22 13:05:13,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-22 13:05:13,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [241710975] [2024-10-22 13:05:13,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-22 13:05:13,184 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-22 13:05:13,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-10-22 13:05:13,187 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-22 13:05:13,188 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-10-22 13:05:13,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-22 13:05:13,541 INFO L255 TraceCheckSpWp]: Trace formula consists of 565 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-22 13:05:13,545 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-22 13:05:13,556 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 163 trivial. 0 not checked. [2024-10-22 13:05:13,556 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-22 13:05:13,556 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-22 13:05:13,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [241710975] [2024-10-22 13:05:13,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [241710975] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-22 13:05:13,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-22 13:05:13,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-22 13:05:13,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69688629] [2024-10-22 13:05:13,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-22 13:05:13,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-22 13:05:13,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-22 13:05:13,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-22 13:05:13,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-22 13:05:13,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-22 13:05:13,560 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-22 13:05:13,560 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 0 states have call successors, (0), 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-22 13:05:13,560 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-22 13:05:13,560 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-22 13:05:13,560 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-10-22 13:05:13,560 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-22 13:05:13,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-22 13:05:13,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-22 13:05:13,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-22 13:05:13,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-22 13:05:13,895 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2024-10-22 13:05:14,085 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-22 13:05:14,086 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting readerErr0ASSERT_VIOLATIONUNKNOWN === [readerErr0ASSERT_VIOLATIONUNKNOWN, readerErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-22 13:05:14,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-22 13:05:14,087 INFO L85 PathProgramCache]: Analyzing trace with hash -213857826, now seen corresponding path program 1 times [2024-10-22 13:05:14,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-22 13:05:14,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1511469536] [2024-10-22 13:05:14,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-22 13:05:14,088 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-22 13:05:14,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-10-22 13:05:14,089 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-22 13:05:14,091 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-10-22 13:05:14,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-22 13:05:14,387 INFO L255 TraceCheckSpWp]: Trace formula consists of 491 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-22 13:05:14,391 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-22 13:05:14,403 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2024-10-22 13:05:14,403 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-22 13:05:14,403 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-22 13:05:14,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1511469536] [2024-10-22 13:05:14,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1511469536] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-22 13:05:14,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-22 13:05:14,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-22 13:05:14,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128604201] [2024-10-22 13:05:14,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-22 13:05:14,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-22 13:05:14,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-22 13:05:14,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-22 13:05:14,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-22 13:05:14,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-22 13:05:14,406 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-22 13:05:14,406 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 0 states have call successors, (0), 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-22 13:05:14,406 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-22 13:05:14,406 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-22 13:05:14,406 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-10-22 13:05:14,407 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-22 13:05:14,407 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-22 13:05:14,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-22 13:05:14,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-22 13:05:14,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-22 13:05:14,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-22 13:05:14,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-22 13:05:14,942 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2024-10-22 13:05:15,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-22 13:05:15,137 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting readerErr0ASSERT_VIOLATIONUNKNOWN === [readerErr0ASSERT_VIOLATIONUNKNOWN, readerErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-22 13:05:15,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-22 13:05:15,137 INFO L85 PathProgramCache]: Analyzing trace with hash 847113625, now seen corresponding path program 1 times [2024-10-22 13:05:15,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-22 13:05:15,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1107220889] [2024-10-22 13:05:15,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-22 13:05:15,138 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-22 13:05:15,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-10-22 13:05:15,139 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-22 13:05:15,140 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-10-22 13:05:15,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-22 13:05:15,446 INFO L255 TraceCheckSpWp]: Trace formula consists of 565 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-22 13:05:15,449 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-22 13:05:15,459 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2024-10-22 13:05:15,459 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-22 13:05:15,459 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-22 13:05:15,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1107220889] [2024-10-22 13:05:15,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1107220889] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-22 13:05:15,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-22 13:05:15,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-22 13:05:15,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035910692] [2024-10-22 13:05:15,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-22 13:05:15,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-22 13:05:15,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-22 13:05:15,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-22 13:05:15,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-22 13:05:15,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-22 13:05:15,461 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-22 13:05:15,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.333333333333336) internal successors, (175), 3 states have internal predecessors, (175), 0 states have call successors, (0), 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-22 13:05:15,461 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-22 13:05:15,462 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-22 13:05:15,462 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-10-22 13:05:15,462 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-22 13:05:15,462 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-22 13:05:15,462 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-22 13:05:15,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-22 13:05:15,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-22 13:05:15,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-22 13:05:15,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-22 13:05:15,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-22 13:05:15,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-22 13:05:15,714 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2024-10-22 13:05:15,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-22 13:05:15,907 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting readerErr0ASSERT_VIOLATIONUNKNOWN === [readerErr0ASSERT_VIOLATIONUNKNOWN, readerErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-22 13:05:15,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-22 13:05:15,907 INFO L85 PathProgramCache]: Analyzing trace with hash -965882702, now seen corresponding path program 1 times [2024-10-22 13:05:15,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-22 13:05:15,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [807920743] [2024-10-22 13:05:15,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-22 13:05:15,908 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-22 13:05:15,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-10-22 13:05:15,911 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-22 13:05:15,913 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-10-22 13:05:16,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-22 13:05:16,203 INFO L255 TraceCheckSpWp]: Trace formula consists of 512 conjuncts, 42 conjuncts are in the unsatisfiable core [2024-10-22 13:05:16,207 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-22 13:05:16,393 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-10-22 13:05:16,440 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-10-22 13:05:16,440 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-22 13:05:16,440 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-22 13:05:16,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [807920743] [2024-10-22 13:05:16,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [807920743] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-22 13:05:16,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-22 13:05:16,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-22 13:05:16,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649305994] [2024-10-22 13:05:16,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-22 13:05:16,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-22 13:05:16,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-22 13:05:16,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-22 13:05:16,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2024-10-22 13:05:16,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-22 13:05:16,442 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-22 13:05:16,442 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 14.636363636363637) internal successors, (161), 11 states have internal predecessors, (161), 0 states have call successors, (0), 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-22 13:05:16,443 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-22 13:05:16,443 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-22 13:05:16,443 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-10-22 13:05:16,443 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-22 13:05:16,443 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-22 13:05:16,443 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-22 13:05:16,443 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-22 13:05:17,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-22 13:05:17,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-22 13:05:17,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-22 13:05:17,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-22 13:05:17,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-22 13:05:17,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-22 13:05:17,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-22 13:05:17,578 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2024-10-22 13:05:17,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-22 13:05:17,771 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting readerErr0ASSERT_VIOLATIONUNKNOWN === [readerErr0ASSERT_VIOLATIONUNKNOWN, readerErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-22 13:05:17,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-22 13:05:17,771 INFO L85 PathProgramCache]: Analyzing trace with hash 587777920, now seen corresponding path program 1 times [2024-10-22 13:05:17,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-22 13:05:17,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [455331888] [2024-10-22 13:05:17,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-22 13:05:17,772 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-22 13:05:17,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-10-22 13:05:17,773 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-22 13:05:17,774 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2024-10-22 13:05:18,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-22 13:05:18,133 INFO L255 TraceCheckSpWp]: Trace formula consists of 754 conjuncts, 76 conjuncts are in the unsatisfiable core [2024-10-22 13:05:18,141 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-22 13:05:18,688 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-22 13:05:18,750 INFO L134 CoverageAnalysis]: Checked inductivity of 664 backedges. 70 proven. 0 refuted. 0 times theorem prover too weak. 594 trivial. 0 not checked. [2024-10-22 13:05:18,751 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-22 13:05:18,751 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-22 13:05:18,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [455331888] [2024-10-22 13:05:18,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [455331888] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-22 13:05:18,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-22 13:05:18,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2024-10-22 13:05:18,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428967368] [2024-10-22 13:05:18,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-22 13:05:18,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-10-22 13:05:18,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-22 13:05:18,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-10-22 13:05:18,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=272, Unknown=0, NotChecked=0, Total=306 [2024-10-22 13:05:18,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-22 13:05:18,753 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-22 13:05:18,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 9.0) internal successors, (162), 18 states have internal predecessors, (162), 0 states have call successors, (0), 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-22 13:05:18,753 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-22 13:05:18,753 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-22 13:05:18,753 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-10-22 13:05:18,753 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-22 13:05:18,753 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-22 13:05:18,753 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-22 13:05:18,753 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-10-22 13:05:18,753 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-22 13:05:20,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-22 13:05:20,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-22 13:05:20,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-22 13:05:20,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-22 13:05:20,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-22 13:05:20,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-22 13:05:20,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-22 13:05:20,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-22 13:05:20,810 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2024-10-22 13:05:21,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-22 13:05:21,002 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting readerErr0ASSERT_VIOLATIONUNKNOWN === [readerErr0ASSERT_VIOLATIONUNKNOWN, readerErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-22 13:05:21,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-22 13:05:21,002 INFO L85 PathProgramCache]: Analyzing trace with hash -112860349, now seen corresponding path program 1 times [2024-10-22 13:05:21,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-22 13:05:21,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1272754417] [2024-10-22 13:05:21,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-22 13:05:21,003 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-22 13:05:21,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-10-22 13:05:21,006 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-22 13:05:21,007 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2024-10-22 13:05:21,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-22 13:05:21,313 INFO L255 TraceCheckSpWp]: Trace formula consists of 510 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-22 13:05:21,316 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-22 13:05:21,323 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-22 13:05:21,323 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-22 13:05:21,323 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-22 13:05:21,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1272754417] [2024-10-22 13:05:21,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1272754417] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-22 13:05:21,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-22 13:05:21,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-22 13:05:21,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283307014] [2024-10-22 13:05:21,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-22 13:05:21,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-22 13:05:21,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-22 13:05:21,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-22 13:05:21,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-22 13:05:21,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-22 13:05:21,325 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-22 13:05:21,325 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 0 states have call successors, (0), 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-22 13:05:21,325 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-22 13:05:21,325 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-22 13:05:21,325 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-10-22 13:05:21,325 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-22 13:05:21,325 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-22 13:05:21,325 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-22 13:05:21,325 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-10-22 13:05:21,325 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2024-10-22 13:05:21,325 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-22 13:05:21,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-22 13:05:21,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-22 13:05:21,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-22 13:05:21,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-22 13:05:21,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-22 13:05:21,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-22 13:05:21,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-22 13:05:21,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-22 13:05:21,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-22 13:05:21,680 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2024-10-22 13:05:21,871 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-22 13:05:21,871 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting readerErr0ASSERT_VIOLATIONUNKNOWN === [readerErr0ASSERT_VIOLATIONUNKNOWN, readerErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-22 13:05:21,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-22 13:05:21,872 INFO L85 PathProgramCache]: Analyzing trace with hash -834032657, now seen corresponding path program 1 times [2024-10-22 13:05:21,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-22 13:05:21,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1185074560] [2024-10-22 13:05:21,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-22 13:05:21,872 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-22 13:05:21,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-10-22 13:05:21,874 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-22 13:05:21,875 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2024-10-22 13:05:22,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-22 13:05:22,187 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-22 13:05:22,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-22 13:05:22,518 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-10-22 13:05:22,518 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-22 13:05:22,518 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location readerErr0ASSERT_VIOLATIONUNKNOWN (1 of 2 remaining) [2024-10-22 13:05:22,518 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr1ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-10-22 13:05:22,528 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2024-10-22 13:05:22,719 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-22 13:05:22,720 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-22 13:05:22,721 INFO L312 ceAbstractionStarter]: Result for error location readerThread1of2ForFork0 was UNSAFE,UNKNOWN (1/5) [2024-10-22 13:05:23,479 INFO L234 ceAbstractionStarter]: Analysis of concurrent program completed with 2 thread instances [2024-10-22 13:05:23,479 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-22 13:05:23,482 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.10 01:05:23 BasicIcfg [2024-10-22 13:05:23,482 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-22 13:05:23,483 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-22 13:05:23,483 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-22 13:05:23,483 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-22 13:05:23,483 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 01:04:05" (3/4) ... [2024-10-22 13:05:23,485 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-22 13:05:23,486 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-22 13:05:23,487 INFO L158 Benchmark]: Toolchain (without parser) took 81862.64ms. Allocated memory was 73.4MB in the beginning and 926.9MB in the end (delta: 853.5MB). Free memory was 34.7MB in the beginning and 541.7MB in the end (delta: -507.1MB). Peak memory consumption was 344.8MB. Max. memory is 16.1GB. [2024-10-22 13:05:23,487 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 54.5MB. Free memory is still 29.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-22 13:05:23,487 INFO L158 Benchmark]: CACSL2BoogieTranslator took 2226.91ms. Allocated memory was 73.4MB in the beginning and 144.7MB in the end (delta: 71.3MB). Free memory was 34.5MB in the beginning and 76.5MB in the end (delta: -42.0MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2024-10-22 13:05:23,487 INFO L158 Benchmark]: Boogie Procedure Inliner took 156.50ms. Allocated memory is still 144.7MB. Free memory was 76.5MB in the beginning and 66.0MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-22 13:05:23,488 INFO L158 Benchmark]: Boogie Preprocessor took 91.68ms. Allocated memory is still 144.7MB. Free memory was 66.0MB in the beginning and 61.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-22 13:05:23,488 INFO L158 Benchmark]: RCFGBuilder took 1493.91ms. Allocated memory is still 144.7MB. Free memory was 61.8MB in the beginning and 69.5MB in the end (delta: -7.6MB). Peak memory consumption was 40.6MB. Max. memory is 16.1GB. [2024-10-22 13:05:23,488 INFO L158 Benchmark]: TraceAbstraction took 77883.47ms. Allocated memory was 144.7MB in the beginning and 926.9MB in the end (delta: 782.2MB). Free memory was 68.4MB in the beginning and 541.7MB in the end (delta: -473.3MB). Peak memory consumption was 600.4MB. Max. memory is 16.1GB. [2024-10-22 13:05:23,489 INFO L158 Benchmark]: Witness Printer took 3.76ms. Allocated memory is still 926.9MB. Free memory is still 541.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-22 13:05:23,490 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.21ms. Allocated memory is still 54.5MB. Free memory is still 29.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 2226.91ms. Allocated memory was 73.4MB in the beginning and 144.7MB in the end (delta: 71.3MB). Free memory was 34.5MB in the beginning and 76.5MB in the end (delta: -42.0MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 156.50ms. Allocated memory is still 144.7MB. Free memory was 76.5MB in the beginning and 66.0MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Preprocessor took 91.68ms. Allocated memory is still 144.7MB. Free memory was 66.0MB in the beginning and 61.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1493.91ms. Allocated memory is still 144.7MB. Free memory was 61.8MB in the beginning and 69.5MB in the end (delta: -7.6MB). Peak memory consumption was 40.6MB. Max. memory is 16.1GB. * TraceAbstraction took 77883.47ms. Allocated memory was 144.7MB in the beginning and 926.9MB in the end (delta: 782.2MB). Free memory was 68.4MB in the beginning and 541.7MB in the end (delta: -473.3MB). Peak memory consumption was 600.4MB. Max. memory is 16.1GB. * Witness Printer took 3.76ms. Allocated memory is still 926.9MB. Free memory is still 541.7MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 3755]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3755] - GenericResultAtLocation [Line: 3757]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3757] - GenericResultAtLocation [Line: 3762]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3762] - GenericResultAtLocation [Line: 3764]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3764] - GenericResultAtLocation [Line: 3770]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3770] - GenericResultAtLocation [Line: 3772]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3772] - GenericResultAtLocation [Line: 3778]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3778] - GenericResultAtLocation [Line: 3780]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3780] - GenericResultAtLocation [Line: 3786]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3786] - GenericResultAtLocation [Line: 3788]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3788] - GenericResultAtLocation [Line: 3794]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3794] - GenericResultAtLocation [Line: 3796]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3796] - GenericResultAtLocation [Line: 3802]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3802] - GenericResultAtLocation [Line: 3804]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3804] - GenericResultAtLocation [Line: 3810]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3810] - GenericResultAtLocation [Line: 3812]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3812] - GenericResultAtLocation [Line: 3817]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3817] - GenericResultAtLocation [Line: 3819]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3819] - GenericResultAtLocation [Line: 3824]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3824] - GenericResultAtLocation [Line: 3826]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3826] - GenericResultAtLocation [Line: 3831]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3831] - GenericResultAtLocation [Line: 3833]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3833] - GenericResultAtLocation [Line: 3838]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3838] - GenericResultAtLocation [Line: 3840]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3840] - GenericResultAtLocation [Line: 3845]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3845] - GenericResultAtLocation [Line: 3847]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3847] - GenericResultAtLocation [Line: 3852]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3852] - GenericResultAtLocation [Line: 3855]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3855] - GenericResultAtLocation [Line: 3861]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3861] - GenericResultAtLocation [Line: 3864]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3864] - GenericResultAtLocation [Line: 3870]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3870] - GenericResultAtLocation [Line: 3873]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3873] - GenericResultAtLocation [Line: 3879]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3879] - GenericResultAtLocation [Line: 3882]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3882] - GenericResultAtLocation [Line: 3888]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3888] - GenericResultAtLocation [Line: 3891]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3891] - GenericResultAtLocation [Line: 3897]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3897] - GenericResultAtLocation [Line: 3900]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3900] - GenericResultAtLocation [Line: 3907]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3907] - GenericResultAtLocation [Line: 3910]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3910] - GenericResultAtLocation [Line: 3917]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3917] - GenericResultAtLocation [Line: 3920]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3920] - GenericResultAtLocation [Line: 3927]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3927] - GenericResultAtLocation [Line: 3930]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3930] - GenericResultAtLocation [Line: 3937]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3937] - GenericResultAtLocation [Line: 3940]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3940] - GenericResultAtLocation [Line: 3947]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3947] - GenericResultAtLocation [Line: 3950]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3950] - GenericResultAtLocation [Line: 3957]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3957] - GenericResultAtLocation [Line: 3960]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3960] - GenericResultAtLocation [Line: 3966]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3966] - GenericResultAtLocation [Line: 3969]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3969] - GenericResultAtLocation [Line: 3975]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3975] - GenericResultAtLocation [Line: 3978]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3978] - GenericResultAtLocation [Line: 3984]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3984] - GenericResultAtLocation [Line: 3987]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3987] - GenericResultAtLocation [Line: 3993]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3993] - GenericResultAtLocation [Line: 3996]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3996] - GenericResultAtLocation [Line: 4002]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4002] - GenericResultAtLocation [Line: 4005]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4005] - GenericResultAtLocation [Line: 4011]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4011] - GenericResultAtLocation [Line: 4014]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4014] - GenericResultAtLocation [Line: 4020]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4020] - GenericResultAtLocation [Line: 4023]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4023] - GenericResultAtLocation [Line: 4029]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4029] - GenericResultAtLocation [Line: 4032]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4032] - GenericResultAtLocation [Line: 4038]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4038] - GenericResultAtLocation [Line: 4041]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4041] - GenericResultAtLocation [Line: 4047]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4047] - GenericResultAtLocation [Line: 4050]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4050] - GenericResultAtLocation [Line: 4056]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4056] - GenericResultAtLocation [Line: 4059]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4059] - GenericResultAtLocation [Line: 4065]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4065] - GenericResultAtLocation [Line: 4068]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4068] - GenericResultAtLocation [Line: 4074]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4074] - GenericResultAtLocation [Line: 4077]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4077] - GenericResultAtLocation [Line: 4083]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4083] - GenericResultAtLocation [Line: 4086]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4086] - GenericResultAtLocation [Line: 4092]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4092] - GenericResultAtLocation [Line: 4095]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4095] - GenericResultAtLocation [Line: 4101]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4101] - GenericResultAtLocation [Line: 4103]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4103] - GenericResultAtLocation [Line: 4109]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4109] - GenericResultAtLocation [Line: 4111]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4111] - GenericResultAtLocation [Line: 4117]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4117] - GenericResultAtLocation [Line: 4119]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4119] - GenericResultAtLocation [Line: 4125]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4125] - GenericResultAtLocation [Line: 4127]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4127] - GenericResultAtLocation [Line: 4133]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4133] - GenericResultAtLocation [Line: 4135]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4135] - GenericResultAtLocation [Line: 4141]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4141] - GenericResultAtLocation [Line: 4143]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4143] - GenericResultAtLocation [Line: 4149]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4149] - GenericResultAtLocation [Line: 4151]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4151] - GenericResultAtLocation [Line: 4157]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4157] - GenericResultAtLocation [Line: 4159]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4159] - GenericResultAtLocation [Line: 4165]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4165] - GenericResultAtLocation [Line: 4167]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4167] - GenericResultAtLocation [Line: 4173]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4173] - GenericResultAtLocation [Line: 4175]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4175] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Partial order reduction statistics Independence relation #1 benchmarks: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 33931, independent: 33581, independent conditional: 503, independent unconditional: 33078, dependent: 350, dependent conditional: 285, dependent unconditional: 65, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 33648, independent: 33581, independent conditional: 503, independent unconditional: 33078, dependent: 67, dependent conditional: 2, dependent unconditional: 65, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 33648, independent: 33581, independent conditional: 503, independent unconditional: 33078, dependent: 67, dependent conditional: 2, dependent unconditional: 65, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 33650, independent: 33581, independent conditional: 503, independent unconditional: 33078, dependent: 69, dependent conditional: 4, dependent unconditional: 65, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 33650, independent: 33581, independent conditional: 0, independent unconditional: 33581, dependent: 69, dependent conditional: 1, dependent unconditional: 68, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 33650, independent: 33581, independent conditional: 0, independent unconditional: 33581, dependent: 69, dependent conditional: 1, dependent unconditional: 68, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 30031, independent: 29965, independent conditional: 0, independent unconditional: 29965, dependent: 66, dependent conditional: 1, dependent unconditional: 65, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 30031, independent: 29931, independent conditional: 0, independent unconditional: 29931, dependent: 100, dependent conditional: 0, dependent unconditional: 100, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 100, independent: 34, independent conditional: 0, independent unconditional: 34, dependent: 66, dependent conditional: 1, dependent unconditional: 65, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 100, independent: 34, independent conditional: 0, independent unconditional: 34, dependent: 66, dependent conditional: 1, dependent unconditional: 65, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 13464, independent: 1837, independent conditional: 0, independent unconditional: 1837, dependent: 11627, dependent conditional: 121, dependent unconditional: 11506, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 33650, independent: 3616, independent conditional: 0, independent unconditional: 3616, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 30031, unknown conditional: 1, unknown unconditional: 30030] , Statistics on independence cache: Total cache size (in pairs): 30031, Positive cache size: 29965, Positive conditional cache size: 0, Positive unconditional cache size: 29965, Negative cache size: 66, Negative conditional cache size: 1, Negative unconditional cache size: 65, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 506, Maximal queried relation: 1, Independence queries for same thread: 283, Persistent sets #1 benchmarks: Persistent set computation time: 13.5s, Number of persistent set computation: 271, Number of trivial persistent sets: 225, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 33143, independent: 33078, independent conditional: 0, independent unconditional: 33078, dependent: 65, dependent conditional: 0, dependent unconditional: 65, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 33931, independent: 33581, independent conditional: 503, independent unconditional: 33078, dependent: 350, dependent conditional: 285, dependent unconditional: 65, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 33648, independent: 33581, independent conditional: 503, independent unconditional: 33078, dependent: 67, dependent conditional: 2, dependent unconditional: 65, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 33648, independent: 33581, independent conditional: 503, independent unconditional: 33078, dependent: 67, dependent conditional: 2, dependent unconditional: 65, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 33650, independent: 33581, independent conditional: 503, independent unconditional: 33078, dependent: 69, dependent conditional: 4, dependent unconditional: 65, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 33650, independent: 33581, independent conditional: 0, independent unconditional: 33581, dependent: 69, dependent conditional: 1, dependent unconditional: 68, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 33650, independent: 33581, independent conditional: 0, independent unconditional: 33581, dependent: 69, dependent conditional: 1, dependent unconditional: 68, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 30031, independent: 29965, independent conditional: 0, independent unconditional: 29965, dependent: 66, dependent conditional: 1, dependent unconditional: 65, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 30031, independent: 29931, independent conditional: 0, independent unconditional: 29931, dependent: 100, dependent conditional: 0, dependent unconditional: 100, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 100, independent: 34, independent conditional: 0, independent unconditional: 34, dependent: 66, dependent conditional: 1, dependent unconditional: 65, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 100, independent: 34, independent conditional: 0, independent unconditional: 34, dependent: 66, dependent conditional: 1, dependent unconditional: 65, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 13464, independent: 1837, independent conditional: 0, independent unconditional: 1837, dependent: 11627, dependent conditional: 121, dependent unconditional: 11506, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 33650, independent: 3616, independent conditional: 0, independent unconditional: 3616, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 30031, unknown conditional: 1, unknown unconditional: 30030] , Statistics on independence cache: Total cache size (in pairs): 30031, Positive cache size: 29965, Positive conditional cache size: 0, Positive unconditional cache size: 29965, Negative cache size: 66, Negative conditional cache size: 1, Negative unconditional cache size: 65, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 506, Maximal queried relation: 1, Independence queries for same thread: 283 - StatisticsResult: Partial order reduction statistics Independence relation #1 benchmarks: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 2384, independent: 2361, independent conditional: 24, independent unconditional: 2337, dependent: 23, dependent conditional: 19, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2365, independent: 2361, independent conditional: 24, independent unconditional: 2337, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2365, independent: 2361, independent conditional: 24, independent unconditional: 2337, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2365, independent: 2361, independent conditional: 24, independent unconditional: 2337, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2365, independent: 2361, independent conditional: 0, independent unconditional: 2361, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2365, independent: 2361, independent conditional: 0, independent unconditional: 2361, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2302, independent: 2298, independent conditional: 0, independent unconditional: 2298, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2302, independent: 2294, independent conditional: 0, independent unconditional: 2294, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 8, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 8, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 697, independent: 312, independent conditional: 0, independent unconditional: 312, dependent: 385, dependent conditional: 0, dependent unconditional: 385, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 2365, independent: 63, independent conditional: 0, independent unconditional: 63, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2302, unknown conditional: 0, unknown unconditional: 2302] , Statistics on independence cache: Total cache size (in pairs): 2302, Positive cache size: 2298, Positive conditional cache size: 0, Positive unconditional cache size: 2298, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 24, Maximal queried relation: 0, Independence queries for same thread: 19, Persistent sets #1 benchmarks: Persistent set computation time: 0.7s, Number of persistent set computation: 17, Number of trivial persistent sets: 17, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2341, independent: 2337, independent conditional: 0, independent unconditional: 2337, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 2384, independent: 2361, independent conditional: 24, independent unconditional: 2337, dependent: 23, dependent conditional: 19, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2365, independent: 2361, independent conditional: 24, independent unconditional: 2337, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2365, independent: 2361, independent conditional: 24, independent unconditional: 2337, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2365, independent: 2361, independent conditional: 24, independent unconditional: 2337, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2365, independent: 2361, independent conditional: 0, independent unconditional: 2361, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2365, independent: 2361, independent conditional: 0, independent unconditional: 2361, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2302, independent: 2298, independent conditional: 0, independent unconditional: 2298, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2302, independent: 2294, independent conditional: 0, independent unconditional: 2294, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 8, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 8, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 697, independent: 312, independent conditional: 0, independent unconditional: 312, dependent: 385, dependent conditional: 0, dependent unconditional: 385, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 2365, independent: 63, independent conditional: 0, independent unconditional: 63, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2302, unknown conditional: 0, unknown unconditional: 2302] , Statistics on independence cache: Total cache size (in pairs): 2302, Positive cache size: 2298, Positive conditional cache size: 0, Positive unconditional cache size: 2298, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 24, Maximal queried relation: 0, Independence queries for same thread: 19 - StatisticsResult: Partial order reduction statistics Independence relation #1 benchmarks: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 339716, independent: 318316, independent conditional: 88985, independent unconditional: 229331, dependent: 21400, dependent conditional: 21189, dependent unconditional: 211, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 318582, independent: 318316, independent conditional: 88985, independent unconditional: 229331, dependent: 266, dependent conditional: 55, dependent unconditional: 211, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 318582, independent: 318316, independent conditional: 88985, independent unconditional: 229331, dependent: 266, dependent conditional: 55, dependent unconditional: 211, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 318591, independent: 318316, independent conditional: 88985, independent unconditional: 229331, dependent: 275, dependent conditional: 64, dependent unconditional: 211, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 318591, independent: 318316, independent conditional: 0, independent unconditional: 318316, dependent: 275, dependent conditional: 7, dependent unconditional: 268, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 318591, independent: 318316, independent conditional: 0, independent unconditional: 318316, dependent: 275, dependent conditional: 7, dependent unconditional: 268, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 163043, independent: 162831, independent conditional: 0, independent unconditional: 162831, dependent: 212, dependent conditional: 1, dependent unconditional: 211, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 163043, independent: 162759, independent conditional: 0, independent unconditional: 162759, dependent: 284, dependent conditional: 0, dependent unconditional: 284, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 284, independent: 72, independent conditional: 0, independent unconditional: 72, dependent: 212, dependent conditional: 1, dependent unconditional: 211, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 284, independent: 72, independent conditional: 0, independent unconditional: 72, dependent: 212, dependent conditional: 1, dependent unconditional: 211, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 46494, independent: 2805, independent conditional: 0, independent unconditional: 2805, dependent: 43689, dependent conditional: 146, dependent unconditional: 43543, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 318591, independent: 155485, independent conditional: 0, independent unconditional: 155485, dependent: 63, dependent conditional: 6, dependent unconditional: 57, unknown: 163043, unknown conditional: 1, unknown unconditional: 163042] , Statistics on independence cache: Total cache size (in pairs): 163043, Positive cache size: 162831, Positive conditional cache size: 0, Positive unconditional cache size: 162831, Negative cache size: 212, Negative conditional cache size: 1, Negative unconditional cache size: 211, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 89042, Maximal queried relation: 1, Independence queries for same thread: 21134, Persistent sets #1 benchmarks: Persistent set computation time: 47.1s, Number of persistent set computation: 8170, Number of trivial persistent sets: 7655, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 229542, independent: 229331, independent conditional: 0, independent unconditional: 229331, dependent: 211, dependent conditional: 0, dependent unconditional: 211, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 339716, independent: 318316, independent conditional: 88985, independent unconditional: 229331, dependent: 21400, dependent conditional: 21189, dependent unconditional: 211, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 318582, independent: 318316, independent conditional: 88985, independent unconditional: 229331, dependent: 266, dependent conditional: 55, dependent unconditional: 211, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 318582, independent: 318316, independent conditional: 88985, independent unconditional: 229331, dependent: 266, dependent conditional: 55, dependent unconditional: 211, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 318591, independent: 318316, independent conditional: 88985, independent unconditional: 229331, dependent: 275, dependent conditional: 64, dependent unconditional: 211, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 318591, independent: 318316, independent conditional: 0, independent unconditional: 318316, dependent: 275, dependent conditional: 7, dependent unconditional: 268, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 318591, independent: 318316, independent conditional: 0, independent unconditional: 318316, dependent: 275, dependent conditional: 7, dependent unconditional: 268, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 163043, independent: 162831, independent conditional: 0, independent unconditional: 162831, dependent: 212, dependent conditional: 1, dependent unconditional: 211, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 163043, independent: 162759, independent conditional: 0, independent unconditional: 162759, dependent: 284, dependent conditional: 0, dependent unconditional: 284, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 284, independent: 72, independent conditional: 0, independent unconditional: 72, dependent: 212, dependent conditional: 1, dependent unconditional: 211, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 284, independent: 72, independent conditional: 0, independent unconditional: 72, dependent: 212, dependent conditional: 1, dependent unconditional: 211, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 46494, independent: 2805, independent conditional: 0, independent unconditional: 2805, dependent: 43689, dependent conditional: 146, dependent unconditional: 43543, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 318591, independent: 155485, independent conditional: 0, independent unconditional: 155485, dependent: 63, dependent conditional: 6, dependent unconditional: 57, unknown: 163043, unknown conditional: 1, unknown unconditional: 163042] , Statistics on independence cache: Total cache size (in pairs): 163043, Positive cache size: 162831, Positive conditional cache size: 0, Positive unconditional cache size: 162831, Negative cache size: 212, Negative conditional cache size: 1, Negative unconditional cache size: 211, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 89042, Maximal queried relation: 1, Independence queries for same thread: 21134 - UnprovableResult [Line: 3928]: Unable to prove that unknown kind of specification holds Unable to prove that unknown kind of specification holds Reason: overapproximation of __atomic_compare_exchange_n at line 3928. Possible FailurePath: [L6033] 0 static vuint32_t g_cs_x = 0; [L6034] 0 static vuint32_t g_cs_y = 0; [L6095] 0 rwlock_t lock = { .n = ((1U << 30U)), .wb = { ._v = 0 }, .rs = { .s = { ._v = ((1U << 30U)) } }, }; [L6076] 0 pthread_t t[(2 + 2)]; [L6077] FCALL 0 init() [L6078] FCALL 0 verification_loop_bound(2 + 1) [L6079] 0 vuintptr_t i = 0; VAL [g_cs_x=0, g_cs_y=0, i=0, lock={4:0}, t={6:0}] [L6079] COND TRUE 0 i < 2 [L6080] FCALL, FORK 0 pthread_create(&t[i], 0, writer, (void *)i) VAL [g_cs_x=0, g_cs_y=0, i=0, lock={4:0}, t={6:0}] [L6058] 1 vuint32_t tid = (vuint32_t)(vuintptr_t)arg; [L6059] CALL 1 writer_acquire(tid) [L6079] 0 i++ VAL [g_cs_x=0, g_cs_y=0, i=1, lock={4:0}, t={6:0}] [L6079] COND TRUE 0 i < 2 [L6080] FCALL, FORK 0 pthread_create(&t[i], 0, writer, (void *)i) VAL [g_cs_x=0, g_cs_y=0, i=1, lock={4:0}, t={6:0}] [L6058] 2 vuint32_t tid = (vuint32_t)(vuintptr_t)arg; [L6059] CALL 2 writer_acquire(tid) [L6079] 0 i++ VAL [g_cs_x=0, g_cs_y=0, i=2, lock={4:0}, t={6:0}] [L6079] COND FALSE 0 !(i < 2) [L6082] CALL 0 verification_loop_bound((2 + 2) + 1) [L6100] CALL 1 rwlock_write_acquire(&lock) [L5413] CALL 1 vatomic32_await_eq_set_rlx(&l->wb, 0, 1U) [L2570] CALL 1 vatomic32_await_eq_set(a, c, v) [L5335] CALL 1 vatomic32_await_eq(a, c) [L4838] 1 vuint32_t ret = c; [L4839] 1 vuint32_t o = 0; [L4840] FCALL 1 verification_loop_begin() [L6100] CALL 2 rwlock_write_acquire(&lock) [L5413] CALL 2 vatomic32_await_eq_set_rlx(&l->wb, 0, 1U) [L2570] CALL 2 vatomic32_await_eq_set(a, c, v) [L4840] EXPR, FCALL 1 verification_spin_start() [L4840] CALL, EXPR 1 vatomic32_read(a) [L3779] EXPR 1 a->_v VAL [\old(a)={4:4}, a={4:4}, g_cs_x=0, g_cs_y=0, lock={4:0}] [L3779] 1 vuint32_t tmp = (vuint32_t)__atomic_load_n(&a->_v, 5); [L3781] 1 return tmp; [L4840] RET, EXPR 1 vatomic32_read(a) [L4840] EXPR 1 o = vatomic32_read(a) VAL [\old(a)={4:4}, \old(c)=0, a={4:4}, c=0, g_cs_x=0, g_cs_y=0, lock={4:0}, o=0, ret=0] [L4840] EXPR 1 ((o = vatomic32_read(a)) != c) ? 1 : (verification_spin_end(1), 0) [L4840] CALL 1 verification_spin_end(1) [L5335] CALL 2 vatomic32_await_eq(a, c) [L4838] 2 vuint32_t ret = c; [L4839] 2 vuint32_t o = 0; [L4840] FCALL 2 verification_loop_begin() [L6082] RET 0 verification_loop_bound((2 + 2) + 1) [L6083] 0 vuintptr_t i = 2; VAL [g_cs_x=0, g_cs_y=0, i=2, lock={4:0}, t={6:0}] [L4840] FCALL 2 verification_spin_start() [L4840] CALL, EXPR 2 vatomic32_read(a) [L3779] EXPR 2 a->_v VAL [\old(a)={4:4}, \result=0, a={4:4}, g_cs_x=0, g_cs_y=0, lock={4:0}] [L3779] 2 vuint32_t tmp = (vuint32_t)__atomic_load_n(&a->_v, 5); [L3781] 2 return tmp; [L4840] RET, EXPR 2 vatomic32_read(a) [L4840] EXPR 2 o = vatomic32_read(a) VAL [\old(a)={4:4}, \old(c)=0, a={4:4}, c=0, g_cs_x=0, g_cs_y=0, lock={4:0}, o=0, ret=0] [L4840] 2 ((o = vatomic32_read(a)) != c) ? 1 : (verification_spin_end(1), 0) [L4840] CALL 2 verification_spin_end(1) [L6083] COND TRUE 0 i < (2 + 2) [L6084] FCALL, FORK 0 pthread_create(&t[i], 0, reader, (void *)i) VAL [g_cs_x=0, g_cs_y=0, i=2, lock={4:0}, t={6:0}] [L6083] 0 i++ VAL [g_cs_x=0, g_cs_y=0, i=3, lock={4:0}, t={6:0}] [L6067] 3 vuint32_t tid = (vuint32_t)(vuintptr_t)arg; [L6068] CALL 3 reader_acquire(tid) [L6083] COND TRUE 0 i < (2 + 2) [L6084] FCALL, FORK 0 pthread_create(&t[i], 0, reader, (void *)i) VAL [g_cs_x=0, g_cs_y=0, i=3, lock={4:0}, t={6:0}] [L6083] 0 i++ VAL [g_cs_x=0, g_cs_y=0, i=4, lock={4:0}, t={6:0}] [L6067] 4 vuint32_t tid = (vuint32_t)(vuintptr_t)arg; [L6068] CALL 4 reader_acquire(tid) [L4840] RET, EXPR 1 verification_spin_end(1) [L4840] EXPR 1 ((o = vatomic32_read(a)) != c) ? 1 : (verification_spin_end(1), 0) VAL [\old(a)={4:4}, \old(c)=0, a={4:4}, c=0, g_cs_x=0, g_cs_y=0, lock={4:0}, o=0, ret=0] [L4840] COND FALSE 1 !((verification_spin_start(), ((o = vatomic32_read(a)) != c) ? 1 : (verification_spin_end(1), 0))) [L4844] 1 return ret; [L5335] RET 1 vatomic32_await_eq(a, c) [L5336] CALL 1 vatomic32_cmpxchg(a, c, v) [L3926] 1 vuint32_t exp = (vuint32_t)e; VAL [\old(a)={4:4}, \old(e)=0, \old(v)=1, a={4:4}, e=0, exp=0, g_cs_x=0, g_cs_y=0, lock={4:0}, v=1] [L6083] COND FALSE 0 !(i < (2 + 2)) [L6086] FCALL 0 post() [L6087] CALL 0 verification_loop_bound((2 + 2) + 1) [L3928-L3929] 1 __atomic_compare_exchange_n(&a->_v, &exp, (vuint32_t)v, 0, 5, 5) VAL [\old(a)={4:4}, \old(e)=0, \old(v)=1, a={4:4}, e=0, exp=0, g_cs_x=0, g_cs_y=0, lock={4:0}, v=1] [L4840] RET, EXPR 2 verification_spin_end(1) [L4840] EXPR 2 ((o = vatomic32_read(a)) != c) ? 1 : (verification_spin_end(1), 0) VAL [\old(a)={4:4}, \old(c)=0, \result=0, a={4:4}, c=0, g_cs_x=0, g_cs_y=0, lock={4:0}, o=0, ret=0] [L4840] COND FALSE 2 !((verification_spin_start(), ((o = vatomic32_read(a)) != c) ? 1 : (verification_spin_end(1), 0))) [L4844] 2 return ret; [L5335] RET 2 vatomic32_await_eq(a, c) [L5336] CALL 2 vatomic32_cmpxchg(a, c, v) [L3926] 2 vuint32_t exp = (vuint32_t)e; VAL [\old(a)={4:4}, \old(e)=0, \old(v)=1, a={4:4}, e=0, exp=0, g_cs_x=0, g_cs_y=0, lock={4:0}, v=1] [L6112] CALL 3 rwlock_read_acquire(&lock) [L5437] CALL 3 vatomic32_await_eq_rlx(&l->wb, 0) [L2255] CALL, EXPR 3 vatomic32_await_eq(a, v) [L4838] 3 vuint32_t ret = c; [L4839] 3 vuint32_t o = 0; [L4840] FCALL 3 verification_loop_begin() [L3928-L3929] 2 __atomic_compare_exchange_n(&a->_v, &exp, (vuint32_t)v, 0, 5, 5) VAL [\old(a)={4:4}, \old(e)=0, \old(v)=1, a={4:4}, e=0, exp=0, g_cs_x=0, g_cs_y=0, lock={4:0}, v=1] [L4840] EXPR, FCALL 3 verification_spin_start() [L4840] CALL, EXPR 3 vatomic32_read(a) [L3779] EXPR 3 a->_v VAL [\old(a)={4:4}, \result=0, a={4:4}, g_cs_x=0, g_cs_y=0, lock={4:0}] [L3779] 3 vuint32_t tmp = (vuint32_t)__atomic_load_n(&a->_v, 5); [L3781] 3 return tmp; [L4840] RET, EXPR 3 vatomic32_read(a) [L4840] EXPR 3 o = vatomic32_read(a) VAL [\old(a)={4:4}, \old(c)=0, \result=0, a={4:4}, c=0, g_cs_x=0, g_cs_y=0, lock={4:0}, o=0, ret=0] [L4840] EXPR 3 ((o = vatomic32_read(a)) != c) ? 1 : (verification_spin_end(1), 0) [L4840] CALL 3 verification_spin_end(1) [L6112] CALL 4 rwlock_read_acquire(&lock) [L5437] CALL 4 vatomic32_await_eq_rlx(&l->wb, 0) [L2255] CALL 4 vatomic32_await_eq(a, v) [L4838] 4 vuint32_t ret = c; [L4839] 4 vuint32_t o = 0; [L4840] FCALL 4 verification_loop_begin() [L6087] RET 0 verification_loop_bound((2 + 2) + 1) [L6088] 0 vuintptr_t i = 0; VAL [g_cs_x=0, g_cs_y=0, i=0, lock={4:0}, t={6:0}] [L4840] FCALL 4 verification_spin_start() [L4840] CALL, EXPR 4 vatomic32_read(a) [L3779] EXPR 4 a->_v VAL [\old(a)={4:4}, \result=0, \result=0, a={4:4}, g_cs_x=0, g_cs_y=0, lock={4:0}] [L3779] 4 vuint32_t tmp = (vuint32_t)__atomic_load_n(&a->_v, 5); [L3781] 4 return tmp; [L4840] RET, EXPR 4 vatomic32_read(a) [L4840] EXPR 4 o = vatomic32_read(a) VAL [\old(a)={4:4}, \old(c)=0, \result=0, a={4:4}, c=0, g_cs_x=0, g_cs_y=0, lock={4:0}, o=0, ret=0] [L4840] 4 ((o = vatomic32_read(a)) != c) ? 1 : (verification_spin_end(1), 0) [L4840] CALL 4 verification_spin_end(1) [L6088] COND TRUE 0 i < (2 + 2) [L6089] 0 t[i] VAL [g_cs_x=0, g_cs_y=0, i=0, lock={4:0}, t={6:0}] [L4840] RET, EXPR 3 verification_spin_end(1) [L4840] EXPR 3 ((o = vatomic32_read(a)) != c) ? 1 : (verification_spin_end(1), 0) VAL [\old(a)={4:4}, \old(c)=0, \result=0, a={4:4}, c=0, g_cs_x=0, g_cs_y=0, lock={4:0}, o=0, ret=0] [L4840] COND FALSE 3 !((verification_spin_start(), ((o = vatomic32_read(a)) != c) ? 1 : (verification_spin_end(1), 0))) [L4844] 3 return ret; [L2255] RET, EXPR 3 vatomic32_await_eq(a, v) [L2255] 3 return vatomic32_await_eq(a, v); [L5437] RET 3 vatomic32_await_eq_rlx(&l->wb, 0) [L5438] CALL 3 semaphore_acquire(&l->rs, 1U) [L5382] CALL 3 vatomic32_await_ge_sub_acq(&s->s, i, i) [L2425] CALL 3 vatomic32_await_ge_sub(a, c, v) [L5034] 3 vuint32_t cur = 0; [L5035] CALL, EXPR 3 vatomic32_read(a) [L3779] EXPR 3 a->_v VAL [\old(a)={4:8}, \result=0, \result=0, a={4:8}, g_cs_x=0, g_cs_y=0, lock={4:0}] [L3779] 3 vuint32_t tmp = (vuint32_t)__atomic_load_n(&a->_v, 5); [L3781] 3 return tmp; [L5035] RET, EXPR 3 vatomic32_read(a) [L5035] 3 vuint32_t old = vatomic32_read(a); [L5037] 3 cur = old VAL [\old(a)={4:8}, \old(c)=1, \old(v)=1, a={4:8}, c=1, cur=1073741824, g_cs_x=0, g_cs_y=0, lock={4:0}, old=1073741824, v=1] [L4840] RET, EXPR 4 verification_spin_end(1) [L4840] EXPR 4 ((o = vatomic32_read(a)) != c) ? 1 : (verification_spin_end(1), 0) VAL [\old(a)={4:4}, \old(c)=0, \result=0, \result=0, a={4:4}, c=0, g_cs_x=0, g_cs_y=0, lock={4:0}, o=0, ret=0] [L4840] COND FALSE 4 !((verification_spin_start(), ((o = vatomic32_read(a)) != c) ? 1 : (verification_spin_end(1), 0))) [L4844] 4 return ret; [L2255] RET, EXPR 4 vatomic32_await_eq(a, v) [L2255] 4 return vatomic32_await_eq(a, v); [L5437] RET 4 vatomic32_await_eq_rlx(&l->wb, 0) [L5438] CALL 4 semaphore_acquire(&l->rs, 1U) [L5382] CALL 4 vatomic32_await_ge_sub_acq(&s->s, i, i) [L2425] CALL 4 vatomic32_await_ge_sub(a, c, v) [L5034] 4 vuint32_t cur = 0; [L5035] CALL, EXPR 4 vatomic32_read(a) [L3779] EXPR 4 a->_v VAL [\old(a)={4:8}, \result=0, \result=1073741824, a={4:8}, g_cs_x=0, g_cs_y=0, lock={4:0}] [L3779] 4 vuint32_t tmp = (vuint32_t)__atomic_load_n(&a->_v, 5); [L3781] 4 return tmp; [L5035] RET, EXPR 4 vatomic32_read(a) [L5035] 4 vuint32_t old = vatomic32_read(a); [L5038] COND FALSE 3 !(!(cur >= c)) [L5041] CALL 3 vatomic32_cmpxchg(a, cur, cur - v) [L3926] 3 vuint32_t exp = (vuint32_t)e; VAL [\old(a)={4:4}, \old(a)={4:8}, \old(e)=0, \old(e)=1073741824, \old(v)=1, \old(v)=1073741823, a={4:4}, a={4:8}, e=0, e=1073741824, exp=0, exp=1073741824, g_cs_x=0, g_cs_y=0, lock={4:0}, v=1, v=1073741823] [L5037] 4 cur = old VAL [\old(a)={4:8}, \old(c)=1, \old(v)=1, a={4:8}, c=1, cur=1073741824, g_cs_x=0, g_cs_y=0, lock={4:0}, old=1073741824, v=1] [L3928-L3929] 3 __atomic_compare_exchange_n(&a->_v, &exp, (vuint32_t)v, 0, 5, 5) VAL [\old(a)={4:4}, \old(a)={4:8}, \old(e)=0, \old(e)=1073741824, \old(v)=1, \old(v)=1073741823, a={4:4}, a={4:8}, e=0, e=1073741824, exp=0, exp=1073741824, g_cs_x=0, g_cs_y=0, lock={4:0}, v=1, v=1073741823] - UnprovableResult [Line: 6047]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: readerThread1of1ForFork0 with 1 thread instances CFG has 5 procedures, 336 locations, 12 error locations. Started 1 CEGAR loops. OverallTime: 15.1s, OverallIterations: 2, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 14.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 147 NumberOfCodeBlocks, 147 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 247 ConstructedInterpolants, 0 QuantifiedInterpolants, 279 SizeOfPredicates, 0 NumberOfNonLiveVariables, 587 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 3 InterpolantComputations, 1 PerfectInterpolantSequences, 51/53 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: ULTIMATE.start with 1 thread instances CFG has 5 procedures, 336 locations, 12 error locations. Started 1 CEGAR loops. OverallTime: 1.4s, OverallIterations: 2, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.7s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 25 NumberOfCodeBlocks, 25 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 10 ConstructedInterpolants, 0 QuantifiedInterpolants, 10 SizeOfPredicates, 0 NumberOfNonLiveVariables, 89 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 2/2 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: readerThread1of2ForFork0 with 1 thread instances CFG has 7 procedures, 484 locations, 16 error locations. Started 1 CEGAR loops. OverallTime: 60.2s, OverallIterations: 10, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 53.5s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 51, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.7s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 1951 NumberOfCodeBlocks, 1951 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 2008 ConstructedInterpolants, 0 QuantifiedInterpolants, 2869 SizeOfPredicates, 111 NumberOfNonLiveVariables, 5068 ConjunctsInSsa, 133 ConjunctsInUnsatCore, 10 InterpolantComputations, 8 PerfectInterpolantSequences, 1462/1472 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 could not prove your program: unable to determine feasibility of some traces [2024-10-22 13:05:23,536 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (8)] Forceful destruction successful, exit code 0 [2024-10-22 13:05:23,724 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (5)] Forceful destruction successful, exit code 0 [2024-10-22 13:05:23,927 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 [2024-10-22 13:05:24,126 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample