./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/rfi009_rmo.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92e71ee7-586f-4a34-b66f-61cc459df7c4/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92e71ee7-586f-4a34-b66f-61cc459df7c4/bin/uautomizer-uyxdKDjOR8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92e71ee7-586f-4a34-b66f-61cc459df7c4/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92e71ee7-586f-4a34-b66f-61cc459df7c4/bin/uautomizer-uyxdKDjOR8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/rfi009_rmo.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92e71ee7-586f-4a34-b66f-61cc459df7c4/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92e71ee7-586f-4a34-b66f-61cc459df7c4/bin/uautomizer-uyxdKDjOR8 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6efd977ba774fd706e089a911dcd82549d76c764859cf8b84047b990ab28d067 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-2329fc7 [2022-12-13 22:24:38,319 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 22:24:38,320 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 22:24:38,332 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 22:24:38,332 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 22:24:38,333 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 22:24:38,334 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 22:24:38,335 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 22:24:38,336 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 22:24:38,336 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 22:24:38,337 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 22:24:38,338 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 22:24:38,338 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 22:24:38,338 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 22:24:38,339 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 22:24:38,340 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 22:24:38,340 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 22:24:38,341 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 22:24:38,342 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 22:24:38,343 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 22:24:38,343 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 22:24:38,344 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 22:24:38,345 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 22:24:38,345 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 22:24:38,347 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 22:24:38,347 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 22:24:38,348 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 22:24:38,348 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 22:24:38,348 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 22:24:38,349 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 22:24:38,349 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 22:24:38,349 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 22:24:38,350 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 22:24:38,350 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 22:24:38,351 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 22:24:38,351 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 22:24:38,351 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 22:24:38,352 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 22:24:38,352 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 22:24:38,352 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 22:24:38,353 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 22:24:38,353 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92e71ee7-586f-4a34-b66f-61cc459df7c4/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-12-13 22:24:38,367 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 22:24:38,367 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 22:24:38,367 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 22:24:38,367 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 22:24:38,368 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 22:24:38,372 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 22:24:38,373 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 22:24:38,373 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 22:24:38,373 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 22:24:38,373 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 22:24:38,374 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 22:24:38,374 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 22:24:38,374 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 22:24:38,374 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 22:24:38,374 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 22:24:38,374 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 22:24:38,375 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 22:24:38,375 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 22:24:38,375 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 22:24:38,375 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 22:24:38,375 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 22:24:38,376 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 22:24:38,376 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 22:24:38,376 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 22:24:38,376 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 22:24:38,376 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 22:24:38,377 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 22:24:38,377 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 22:24:38,377 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 22:24:38,377 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 22:24:38,377 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 22:24:38,377 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-13 22:24:38,378 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 22:24:38,378 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 22:24:38,378 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 22:24:38,378 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92e71ee7-586f-4a34-b66f-61cc459df7c4/bin/uautomizer-uyxdKDjOR8/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92e71ee7-586f-4a34-b66f-61cc459df7c4/bin/uautomizer-uyxdKDjOR8 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 -> Automizer 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 -> 6efd977ba774fd706e089a911dcd82549d76c764859cf8b84047b990ab28d067 [2022-12-13 22:24:38,598 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 22:24:38,615 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 22:24:38,618 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 22:24:38,618 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 22:24:38,619 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 22:24:38,620 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92e71ee7-586f-4a34-b66f-61cc459df7c4/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/pthread-wmm/rfi009_rmo.oepc.i [2022-12-13 22:24:41,281 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 22:24:41,455 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 22:24:41,455 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92e71ee7-586f-4a34-b66f-61cc459df7c4/sv-benchmarks/c/pthread-wmm/rfi009_rmo.oepc.i [2022-12-13 22:24:41,466 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92e71ee7-586f-4a34-b66f-61cc459df7c4/bin/uautomizer-uyxdKDjOR8/data/018a757c1/f05fdba3281146798bc51d7bce4b9254/FLAG2ffa2d6f9 [2022-12-13 22:24:41,476 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92e71ee7-586f-4a34-b66f-61cc459df7c4/bin/uautomizer-uyxdKDjOR8/data/018a757c1/f05fdba3281146798bc51d7bce4b9254 [2022-12-13 22:24:41,478 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 22:24:41,479 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 22:24:41,480 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 22:24:41,480 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 22:24:41,483 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 22:24:41,484 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 10:24:41" (1/1) ... [2022-12-13 22:24:41,485 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4795b864 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:24:41, skipping insertion in model container [2022-12-13 22:24:41,485 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 10:24:41" (1/1) ... [2022-12-13 22:24:41,490 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 22:24:41,519 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 22:24:41,629 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92e71ee7-586f-4a34-b66f-61cc459df7c4/sv-benchmarks/c/pthread-wmm/rfi009_rmo.oepc.i[992,1005] [2022-12-13 22:24:41,724 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:24:41,732 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:24:41,732 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:24:41,732 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:24:41,732 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:24:41,732 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:24:41,732 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:24:41,733 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:24:41,733 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:24:41,734 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:24:41,734 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:24:41,734 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:24:41,734 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:24:41,740 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:24:41,740 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:24:41,740 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:24:41,741 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:24:41,741 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:24:41,741 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:24:41,742 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:24:41,742 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:24:41,744 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:24:41,744 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:24:41,744 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:24:41,748 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:24:41,749 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:24:41,749 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:24:41,751 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:24:41,751 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:24:41,752 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:24:41,753 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 22:24:41,761 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 22:24:41,769 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92e71ee7-586f-4a34-b66f-61cc459df7c4/sv-benchmarks/c/pthread-wmm/rfi009_rmo.oepc.i[992,1005] [2022-12-13 22:24:41,785 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:24:41,791 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:24:41,791 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:24:41,791 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:24:41,791 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:24:41,791 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:24:41,792 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:24:41,792 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:24:41,792 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:24:41,793 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:24:41,793 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:24:41,793 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:24:41,793 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:24:41,798 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:24:41,798 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:24:41,798 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:24:41,798 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:24:41,799 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:24:41,799 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:24:41,799 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:24:41,800 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:24:41,801 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:24:41,801 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:24:41,801 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:24:41,804 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:24:41,804 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:24:41,804 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:24:41,806 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:24:41,806 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:24:41,807 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:24:41,807 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 22:24:41,851 INFO L208 MainTranslator]: Completed translation [2022-12-13 22:24:41,851 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:24:41 WrapperNode [2022-12-13 22:24:41,851 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 22:24:41,852 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 22:24:41,853 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 22:24:41,853 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 22:24:41,859 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:24:41" (1/1) ... [2022-12-13 22:24:41,873 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:24:41" (1/1) ... [2022-12-13 22:24:41,889 INFO L138 Inliner]: procedures = 176, calls = 73, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 137 [2022-12-13 22:24:41,889 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 22:24:41,889 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 22:24:41,889 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 22:24:41,890 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 22:24:41,897 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:24:41" (1/1) ... [2022-12-13 22:24:41,897 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:24:41" (1/1) ... [2022-12-13 22:24:41,900 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:24:41" (1/1) ... [2022-12-13 22:24:41,900 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:24:41" (1/1) ... [2022-12-13 22:24:41,906 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:24:41" (1/1) ... [2022-12-13 22:24:41,907 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:24:41" (1/1) ... [2022-12-13 22:24:41,909 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:24:41" (1/1) ... [2022-12-13 22:24:41,910 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:24:41" (1/1) ... [2022-12-13 22:24:41,913 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 22:24:41,914 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 22:24:41,914 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 22:24:41,914 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 22:24:41,914 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:24:41" (1/1) ... [2022-12-13 22:24:41,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 22:24:41,929 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92e71ee7-586f-4a34-b66f-61cc459df7c4/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 22:24:41,939 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92e71ee7-586f-4a34-b66f-61cc459df7c4/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 22:24:41,940 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92e71ee7-586f-4a34-b66f-61cc459df7c4/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 22:24:41,969 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 22:24:41,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 22:24:41,970 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 22:24:41,970 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 22:24:41,970 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 22:24:41,970 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 22:24:41,970 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 22:24:41,970 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 22:24:41,970 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 22:24:41,970 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 22:24:41,970 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-13 22:24:41,971 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-13 22:24:41,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 22:24:41,971 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 22:24:41,971 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 22:24:41,971 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 22:24:41,972 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-12-13 22:24:42,097 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 22:24:42,099 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 22:24:42,414 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 22:24:42,561 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 22:24:42,561 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 22:24:42,564 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 10:24:42 BoogieIcfgContainer [2022-12-13 22:24:42,564 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 22:24:42,566 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 22:24:42,566 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 22:24:42,569 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 22:24:42,570 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 10:24:41" (1/3) ... [2022-12-13 22:24:42,570 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e340d17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 10:24:42, skipping insertion in model container [2022-12-13 22:24:42,570 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:24:41" (2/3) ... [2022-12-13 22:24:42,571 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e340d17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 10:24:42, skipping insertion in model container [2022-12-13 22:24:42,571 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 10:24:42" (3/3) ... [2022-12-13 22:24:42,572 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi009_rmo.oepc.i [2022-12-13 22:24:42,581 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-12-13 22:24:42,591 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 22:24:42,591 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-13 22:24:42,591 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 22:24:42,644 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 22:24:42,680 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 140 places, 132 transitions, 279 flow [2022-12-13 22:24:42,717 INFO L130 PetriNetUnfolder]: 2/129 cut-off events. [2022-12-13 22:24:42,717 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 22:24:42,721 INFO L83 FinitePrefix]: Finished finitePrefix Result has 139 conditions, 129 events. 2/129 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 46 event pairs, 0 based on Foata normal form. 0/126 useless extension candidates. Maximal degree in co-relation 70. Up to 2 conditions per place. [2022-12-13 22:24:42,722 INFO L82 GeneralOperation]: Start removeDead. Operand has 140 places, 132 transitions, 279 flow [2022-12-13 22:24:42,724 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 124 places, 115 transitions, 239 flow [2022-12-13 22:24:42,727 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-12-13 22:24:42,734 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 124 places, 115 transitions, 239 flow [2022-12-13 22:24:42,736 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 124 places, 115 transitions, 239 flow [2022-12-13 22:24:42,737 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 124 places, 115 transitions, 239 flow [2022-12-13 22:24:42,756 INFO L130 PetriNetUnfolder]: 1/115 cut-off events. [2022-12-13 22:24:42,756 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 22:24:42,757 INFO L83 FinitePrefix]: Finished finitePrefix Result has 125 conditions, 115 events. 1/115 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 37 event pairs, 0 based on Foata normal form. 0/114 useless extension candidates. Maximal degree in co-relation 56. Up to 2 conditions per place. [2022-12-13 22:24:42,757 INFO L119 LiptonReduction]: Number of co-enabled transitions 1228 [2022-12-13 22:24:46,920 INFO L134 LiptonReduction]: Checked pairs total: 3493 [2022-12-13 22:24:46,920 INFO L136 LiptonReduction]: Total number of compositions: 98 [2022-12-13 22:24:46,930 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 22:24:46,935 INFO L357 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, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@51b3f2d4, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 22:24:46,935 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-12-13 22:24:46,942 INFO L130 PetriNetUnfolder]: 1/21 cut-off events. [2022-12-13 22:24:46,943 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 22:24:46,943 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 22:24:46,943 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 22:24:46,944 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 22:24:46,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:24:46,948 INFO L85 PathProgramCache]: Analyzing trace with hash 760941801, now seen corresponding path program 1 times [2022-12-13 22:24:46,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:24:46,955 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639250286] [2022-12-13 22:24:46,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:24:46,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:24:47,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:24:47,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 22:24:47,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:24:47,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639250286] [2022-12-13 22:24:47,143 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639250286] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:24:47,143 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 22:24:47,143 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 22:24:47,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468261710] [2022-12-13 22:24:47,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:24:47,151 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-13 22:24:47,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:24:47,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-13 22:24:47,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-13 22:24:47,169 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 230 [2022-12-13 22:24:47,170 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 22 transitions, 53 flow. Second operand has 2 states, 2 states have (on average 126.0) internal successors, (252), 2 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:24:47,171 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 22:24:47,171 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 230 [2022-12-13 22:24:47,171 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 22:24:47,347 INFO L130 PetriNetUnfolder]: 615/939 cut-off events. [2022-12-13 22:24:47,347 INFO L131 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2022-12-13 22:24:47,349 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1910 conditions, 939 events. 615/939 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 4015 event pairs, 615 based on Foata normal form. 48/935 useless extension candidates. Maximal degree in co-relation 1899. Up to 935 conditions per place. [2022-12-13 22:24:47,353 INFO L137 encePairwiseOnDemand]: 229/230 looper letters, 18 selfloop transitions, 0 changer transitions 1/21 dead transitions. [2022-12-13 22:24:47,353 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 21 transitions, 89 flow [2022-12-13 22:24:47,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 22:24:47,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-12-13 22:24:47,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 262 transitions. [2022-12-13 22:24:47,363 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5695652173913044 [2022-12-13 22:24:47,363 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 262 transitions. [2022-12-13 22:24:47,363 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 262 transitions. [2022-12-13 22:24:47,364 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 22:24:47,366 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 262 transitions. [2022-12-13 22:24:47,368 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 131.0) internal successors, (262), 2 states have internal predecessors, (262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:24:47,371 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 230.0) internal successors, (690), 3 states have internal predecessors, (690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:24:47,372 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 230.0) internal successors, (690), 3 states have internal predecessors, (690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:24:47,373 INFO L175 Difference]: Start difference. First operand has 31 places, 22 transitions, 53 flow. Second operand 2 states and 262 transitions. [2022-12-13 22:24:47,374 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 21 transitions, 89 flow [2022-12-13 22:24:47,376 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 21 transitions, 86 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-13 22:24:47,376 INFO L231 Difference]: Finished difference. Result has 29 places, 20 transitions, 46 flow [2022-12-13 22:24:47,378 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=230, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=46, PETRI_PLACES=29, PETRI_TRANSITIONS=20} [2022-12-13 22:24:47,381 INFO L288 CegarLoopForPetriNet]: 31 programPoint places, -2 predicate places. [2022-12-13 22:24:47,381 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 20 transitions, 46 flow [2022-12-13 22:24:47,381 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 126.0) internal successors, (252), 2 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:24:47,381 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 22:24:47,381 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 22:24:47,381 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 22:24:47,382 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 22:24:47,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:24:47,386 INFO L85 PathProgramCache]: Analyzing trace with hash 761395393, now seen corresponding path program 1 times [2022-12-13 22:24:47,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:24:47,386 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809650732] [2022-12-13 22:24:47,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:24:47,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:24:47,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:24:47,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 22:24:47,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:24:47,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809650732] [2022-12-13 22:24:47,601 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809650732] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:24:47,601 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 22:24:47,601 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 22:24:47,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398806250] [2022-12-13 22:24:47,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:24:47,602 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 22:24:47,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:24:47,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 22:24:47,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 22:24:47,611 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 230 [2022-12-13 22:24:47,612 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 20 transitions, 46 flow. Second operand has 4 states, 4 states have (on average 120.5) internal successors, (482), 4 states have internal predecessors, (482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:24:47,612 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 22:24:47,612 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 230 [2022-12-13 22:24:47,612 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 22:24:47,864 INFO L130 PetriNetUnfolder]: 635/986 cut-off events. [2022-12-13 22:24:47,864 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 22:24:47,865 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2011 conditions, 986 events. 635/986 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 4329 event pairs, 181 based on Foata normal form. 60/1045 useless extension candidates. Maximal degree in co-relation 2008. Up to 604 conditions per place. [2022-12-13 22:24:47,868 INFO L137 encePairwiseOnDemand]: 226/230 looper letters, 26 selfloop transitions, 2 changer transitions 15/44 dead transitions. [2022-12-13 22:24:47,868 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 44 transitions, 182 flow [2022-12-13 22:24:47,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 22:24:47,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 22:24:47,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 635 transitions. [2022-12-13 22:24:47,870 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5521739130434783 [2022-12-13 22:24:47,870 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 635 transitions. [2022-12-13 22:24:47,871 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 635 transitions. [2022-12-13 22:24:47,871 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 22:24:47,871 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 635 transitions. [2022-12-13 22:24:47,873 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 127.0) internal successors, (635), 5 states have internal predecessors, (635), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:24:47,874 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 230.0) internal successors, (1380), 6 states have internal predecessors, (1380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:24:47,875 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 230.0) internal successors, (1380), 6 states have internal predecessors, (1380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:24:47,875 INFO L175 Difference]: Start difference. First operand has 29 places, 20 transitions, 46 flow. Second operand 5 states and 635 transitions. [2022-12-13 22:24:47,875 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 44 transitions, 182 flow [2022-12-13 22:24:47,875 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 44 transitions, 182 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-13 22:24:47,876 INFO L231 Difference]: Finished difference. Result has 35 places, 20 transitions, 58 flow [2022-12-13 22:24:47,876 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=230, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=58, PETRI_PLACES=35, PETRI_TRANSITIONS=20} [2022-12-13 22:24:47,876 INFO L288 CegarLoopForPetriNet]: 31 programPoint places, 4 predicate places. [2022-12-13 22:24:47,877 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 20 transitions, 58 flow [2022-12-13 22:24:47,877 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 120.5) internal successors, (482), 4 states have internal predecessors, (482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:24:47,877 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 22:24:47,877 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 22:24:47,877 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 22:24:47,877 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 22:24:47,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:24:47,878 INFO L85 PathProgramCache]: Analyzing trace with hash -1230616547, now seen corresponding path program 1 times [2022-12-13 22:24:47,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:24:47,878 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627174241] [2022-12-13 22:24:47,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:24:47,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:24:47,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:24:48,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 22:24:48,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:24:48,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627174241] [2022-12-13 22:24:48,066 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627174241] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:24:48,066 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 22:24:48,066 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 22:24:48,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558229390] [2022-12-13 22:24:48,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:24:48,067 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 22:24:48,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:24:48,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 22:24:48,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 22:24:48,077 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 230 [2022-12-13 22:24:48,078 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 20 transitions, 58 flow. Second operand has 4 states, 4 states have (on average 122.75) internal successors, (491), 4 states have internal predecessors, (491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:24:48,078 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 22:24:48,078 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 230 [2022-12-13 22:24:48,078 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 22:24:48,294 INFO L130 PetriNetUnfolder]: 446/748 cut-off events. [2022-12-13 22:24:48,294 INFO L131 PetriNetUnfolder]: For 135/135 co-relation queries the response was YES. [2022-12-13 22:24:48,295 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1579 conditions, 748 events. 446/748 cut-off events. For 135/135 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 3247 event pairs, 147 based on Foata normal form. 36/783 useless extension candidates. Maximal degree in co-relation 1572. Up to 497 conditions per place. [2022-12-13 22:24:48,300 INFO L137 encePairwiseOnDemand]: 226/230 looper letters, 28 selfloop transitions, 2 changer transitions 13/45 dead transitions. [2022-12-13 22:24:48,300 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 45 transitions, 200 flow [2022-12-13 22:24:48,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 22:24:48,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 22:24:48,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 645 transitions. [2022-12-13 22:24:48,303 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5608695652173913 [2022-12-13 22:24:48,303 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 645 transitions. [2022-12-13 22:24:48,303 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 645 transitions. [2022-12-13 22:24:48,304 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 22:24:48,304 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 645 transitions. [2022-12-13 22:24:48,307 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 129.0) internal successors, (645), 5 states have internal predecessors, (645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:24:48,312 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 230.0) internal successors, (1380), 6 states have internal predecessors, (1380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:24:48,314 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 230.0) internal successors, (1380), 6 states have internal predecessors, (1380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:24:48,314 INFO L175 Difference]: Start difference. First operand has 35 places, 20 transitions, 58 flow. Second operand 5 states and 645 transitions. [2022-12-13 22:24:48,314 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 45 transitions, 200 flow [2022-12-13 22:24:48,317 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 45 transitions, 192 flow, removed 2 selfloop flow, removed 4 redundant places. [2022-12-13 22:24:48,318 INFO L231 Difference]: Finished difference. Result has 36 places, 20 transitions, 62 flow [2022-12-13 22:24:48,319 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=230, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=62, PETRI_PLACES=36, PETRI_TRANSITIONS=20} [2022-12-13 22:24:48,319 INFO L288 CegarLoopForPetriNet]: 31 programPoint places, 5 predicate places. [2022-12-13 22:24:48,320 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 20 transitions, 62 flow [2022-12-13 22:24:48,320 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 122.75) internal successors, (491), 4 states have internal predecessors, (491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:24:48,320 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 22:24:48,321 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 22:24:48,321 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 22:24:48,321 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 22:24:48,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:24:48,321 INFO L85 PathProgramCache]: Analyzing trace with hash -1092516153, now seen corresponding path program 1 times [2022-12-13 22:24:48,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:24:48,322 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835486990] [2022-12-13 22:24:48,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:24:48,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:24:48,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:24:49,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 22:24:49,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:24:49,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835486990] [2022-12-13 22:24:49,075 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835486990] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:24:49,075 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 22:24:49,075 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 22:24:49,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212705419] [2022-12-13 22:24:49,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:24:49,076 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 22:24:49,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:24:49,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 22:24:49,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-13 22:24:49,144 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 230 [2022-12-13 22:24:49,145 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 20 transitions, 62 flow. Second operand has 7 states, 7 states have (on average 110.71428571428571) internal successors, (775), 7 states have internal predecessors, (775), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:24:49,145 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 22:24:49,145 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 230 [2022-12-13 22:24:49,145 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 22:24:49,437 INFO L130 PetriNetUnfolder]: 490/804 cut-off events. [2022-12-13 22:24:49,437 INFO L131 PetriNetUnfolder]: For 213/213 co-relation queries the response was YES. [2022-12-13 22:24:49,438 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1871 conditions, 804 events. 490/804 cut-off events. For 213/213 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 3709 event pairs, 90 based on Foata normal form. 24/827 useless extension candidates. Maximal degree in co-relation 1863. Up to 472 conditions per place. [2022-12-13 22:24:49,440 INFO L137 encePairwiseOnDemand]: 223/230 looper letters, 32 selfloop transitions, 6 changer transitions 10/50 dead transitions. [2022-12-13 22:24:49,441 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 50 transitions, 237 flow [2022-12-13 22:24:49,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 22:24:49,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 22:24:49,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 704 transitions. [2022-12-13 22:24:49,442 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5101449275362319 [2022-12-13 22:24:49,442 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 704 transitions. [2022-12-13 22:24:49,442 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 704 transitions. [2022-12-13 22:24:49,443 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 22:24:49,443 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 704 transitions. [2022-12-13 22:24:49,444 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 117.33333333333333) internal successors, (704), 6 states have internal predecessors, (704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:24:49,445 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 230.0) internal successors, (1610), 7 states have internal predecessors, (1610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:24:49,446 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 230.0) internal successors, (1610), 7 states have internal predecessors, (1610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:24:49,446 INFO L175 Difference]: Start difference. First operand has 36 places, 20 transitions, 62 flow. Second operand 6 states and 704 transitions. [2022-12-13 22:24:49,446 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 50 transitions, 237 flow [2022-12-13 22:24:49,447 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 50 transitions, 223 flow, removed 4 selfloop flow, removed 4 redundant places. [2022-12-13 22:24:49,448 INFO L231 Difference]: Finished difference. Result has 39 places, 24 transitions, 96 flow [2022-12-13 22:24:49,448 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=230, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=96, PETRI_PLACES=39, PETRI_TRANSITIONS=24} [2022-12-13 22:24:49,448 INFO L288 CegarLoopForPetriNet]: 31 programPoint places, 8 predicate places. [2022-12-13 22:24:49,448 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 24 transitions, 96 flow [2022-12-13 22:24:49,449 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 110.71428571428571) internal successors, (775), 7 states have internal predecessors, (775), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:24:49,449 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 22:24:49,449 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 22:24:49,449 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 22:24:49,449 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 22:24:49,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:24:49,449 INFO L85 PathProgramCache]: Analyzing trace with hash -1505911437, now seen corresponding path program 2 times [2022-12-13 22:24:49,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:24:49,450 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040697384] [2022-12-13 22:24:49,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:24:49,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:24:49,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:24:50,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 22:24:50,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:24:50,121 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040697384] [2022-12-13 22:24:50,122 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040697384] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:24:50,122 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 22:24:50,122 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 22:24:50,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468259067] [2022-12-13 22:24:50,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:24:50,122 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 22:24:50,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:24:50,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 22:24:50,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-12-13 22:24:50,330 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 230 [2022-12-13 22:24:50,331 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 24 transitions, 96 flow. Second operand has 8 states, 8 states have (on average 111.5) internal successors, (892), 8 states have internal predecessors, (892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:24:50,331 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 22:24:50,331 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 230 [2022-12-13 22:24:50,331 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 22:24:50,677 INFO L130 PetriNetUnfolder]: 476/777 cut-off events. [2022-12-13 22:24:50,677 INFO L131 PetriNetUnfolder]: For 392/392 co-relation queries the response was YES. [2022-12-13 22:24:50,678 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2040 conditions, 777 events. 476/777 cut-off events. For 392/392 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 3403 event pairs, 93 based on Foata normal form. 24/799 useless extension candidates. Maximal degree in co-relation 2030. Up to 604 conditions per place. [2022-12-13 22:24:50,681 INFO L137 encePairwiseOnDemand]: 224/230 looper letters, 34 selfloop transitions, 7 changer transitions 10/53 dead transitions. [2022-12-13 22:24:50,681 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 53 transitions, 296 flow [2022-12-13 22:24:50,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 22:24:50,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 22:24:50,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 708 transitions. [2022-12-13 22:24:50,683 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5130434782608696 [2022-12-13 22:24:50,683 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 708 transitions. [2022-12-13 22:24:50,683 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 708 transitions. [2022-12-13 22:24:50,684 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 22:24:50,684 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 708 transitions. [2022-12-13 22:24:50,685 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 118.0) internal successors, (708), 6 states have internal predecessors, (708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:24:50,687 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 230.0) internal successors, (1610), 7 states have internal predecessors, (1610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:24:50,688 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 230.0) internal successors, (1610), 7 states have internal predecessors, (1610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:24:50,688 INFO L175 Difference]: Start difference. First operand has 39 places, 24 transitions, 96 flow. Second operand 6 states and 708 transitions. [2022-12-13 22:24:50,688 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 53 transitions, 296 flow [2022-12-13 22:24:50,690 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 53 transitions, 284 flow, removed 2 selfloop flow, removed 3 redundant places. [2022-12-13 22:24:50,691 INFO L231 Difference]: Finished difference. Result has 43 places, 30 transitions, 148 flow [2022-12-13 22:24:50,691 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=230, PETRI_DIFFERENCE_MINUEND_FLOW=89, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=148, PETRI_PLACES=43, PETRI_TRANSITIONS=30} [2022-12-13 22:24:50,692 INFO L288 CegarLoopForPetriNet]: 31 programPoint places, 12 predicate places. [2022-12-13 22:24:50,692 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 30 transitions, 148 flow [2022-12-13 22:24:50,693 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 111.5) internal successors, (892), 8 states have internal predecessors, (892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:24:50,693 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 22:24:50,693 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 22:24:50,693 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 22:24:50,694 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 22:24:50,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:24:50,694 INFO L85 PathProgramCache]: Analyzing trace with hash 921166650, now seen corresponding path program 1 times [2022-12-13 22:24:50,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:24:50,695 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27087306] [2022-12-13 22:24:50,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:24:50,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:24:50,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:24:50,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 22:24:50,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:24:50,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27087306] [2022-12-13 22:24:50,823 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [27087306] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:24:50,823 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 22:24:50,823 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 22:24:50,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542793455] [2022-12-13 22:24:50,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:24:50,824 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 22:24:50,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:24:50,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 22:24:50,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 22:24:50,829 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 230 [2022-12-13 22:24:50,829 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 30 transitions, 148 flow. Second operand has 3 states, 3 states have (on average 121.33333333333333) internal successors, (364), 3 states have internal predecessors, (364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:24:50,829 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 22:24:50,830 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 230 [2022-12-13 22:24:50,830 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 22:24:50,950 INFO L130 PetriNetUnfolder]: 296/513 cut-off events. [2022-12-13 22:24:50,950 INFO L131 PetriNetUnfolder]: For 484/484 co-relation queries the response was YES. [2022-12-13 22:24:50,950 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1523 conditions, 513 events. 296/513 cut-off events. For 484/484 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 2070 event pairs, 60 based on Foata normal form. 21/529 useless extension candidates. Maximal degree in co-relation 1511. Up to 423 conditions per place. [2022-12-13 22:24:50,952 INFO L137 encePairwiseOnDemand]: 225/230 looper letters, 42 selfloop transitions, 4 changer transitions 0/48 dead transitions. [2022-12-13 22:24:50,952 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 48 transitions, 323 flow [2022-12-13 22:24:50,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 22:24:50,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 22:24:50,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 382 transitions. [2022-12-13 22:24:50,953 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.553623188405797 [2022-12-13 22:24:50,953 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 382 transitions. [2022-12-13 22:24:50,953 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 382 transitions. [2022-12-13 22:24:50,953 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 22:24:50,953 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 382 transitions. [2022-12-13 22:24:50,954 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 127.33333333333333) internal successors, (382), 3 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:24:50,954 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 230.0) internal successors, (920), 4 states have internal predecessors, (920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:24:50,955 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 230.0) internal successors, (920), 4 states have internal predecessors, (920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:24:50,955 INFO L175 Difference]: Start difference. First operand has 43 places, 30 transitions, 148 flow. Second operand 3 states and 382 transitions. [2022-12-13 22:24:50,955 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 48 transitions, 323 flow [2022-12-13 22:24:50,956 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 48 transitions, 319 flow, removed 2 selfloop flow, removed 2 redundant places. [2022-12-13 22:24:50,956 INFO L231 Difference]: Finished difference. Result has 42 places, 33 transitions, 170 flow [2022-12-13 22:24:50,957 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=230, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=170, PETRI_PLACES=42, PETRI_TRANSITIONS=33} [2022-12-13 22:24:50,957 INFO L288 CegarLoopForPetriNet]: 31 programPoint places, 11 predicate places. [2022-12-13 22:24:50,957 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 33 transitions, 170 flow [2022-12-13 22:24:50,957 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 121.33333333333333) internal successors, (364), 3 states have internal predecessors, (364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:24:50,957 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 22:24:50,957 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 22:24:50,957 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 22:24:50,958 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 22:24:50,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:24:50,958 INFO L85 PathProgramCache]: Analyzing trace with hash 78589847, now seen corresponding path program 1 times [2022-12-13 22:24:50,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:24:50,958 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041652748] [2022-12-13 22:24:50,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:24:50,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:24:50,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:24:51,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 22:24:51,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:24:51,771 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041652748] [2022-12-13 22:24:51,771 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041652748] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:24:51,771 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 22:24:51,771 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 22:24:51,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025724077] [2022-12-13 22:24:51,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:24:51,772 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 22:24:51,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:24:51,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 22:24:51,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-12-13 22:24:51,974 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 230 [2022-12-13 22:24:51,975 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 33 transitions, 170 flow. Second operand has 9 states, 9 states have (on average 110.55555555555556) internal successors, (995), 9 states have internal predecessors, (995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:24:51,975 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 22:24:51,975 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 230 [2022-12-13 22:24:51,975 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 22:24:52,620 INFO L130 PetriNetUnfolder]: 481/855 cut-off events. [2022-12-13 22:24:52,620 INFO L131 PetriNetUnfolder]: For 880/885 co-relation queries the response was YES. [2022-12-13 22:24:52,621 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2775 conditions, 855 events. 481/855 cut-off events. For 880/885 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 4297 event pairs, 109 based on Foata normal form. 29/882 useless extension candidates. Maximal degree in co-relation 2763. Up to 359 conditions per place. [2022-12-13 22:24:52,623 INFO L137 encePairwiseOnDemand]: 223/230 looper letters, 61 selfloop transitions, 15 changer transitions 19/97 dead transitions. [2022-12-13 22:24:52,623 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 97 transitions, 639 flow [2022-12-13 22:24:52,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 22:24:52,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-13 22:24:52,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1277 transitions. [2022-12-13 22:24:52,626 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5047430830039525 [2022-12-13 22:24:52,626 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1277 transitions. [2022-12-13 22:24:52,626 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1277 transitions. [2022-12-13 22:24:52,626 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 22:24:52,626 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1277 transitions. [2022-12-13 22:24:52,628 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 116.0909090909091) internal successors, (1277), 11 states have internal predecessors, (1277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:24:52,630 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 230.0) internal successors, (2760), 12 states have internal predecessors, (2760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:24:52,630 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 230.0) internal successors, (2760), 12 states have internal predecessors, (2760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:24:52,630 INFO L175 Difference]: Start difference. First operand has 42 places, 33 transitions, 170 flow. Second operand 11 states and 1277 transitions. [2022-12-13 22:24:52,630 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 97 transitions, 639 flow [2022-12-13 22:24:52,632 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 97 transitions, 624 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 22:24:52,632 INFO L231 Difference]: Finished difference. Result has 59 places, 39 transitions, 271 flow [2022-12-13 22:24:52,633 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=230, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=271, PETRI_PLACES=59, PETRI_TRANSITIONS=39} [2022-12-13 22:24:52,633 INFO L288 CegarLoopForPetriNet]: 31 programPoint places, 28 predicate places. [2022-12-13 22:24:52,633 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 39 transitions, 271 flow [2022-12-13 22:24:52,633 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 110.55555555555556) internal successors, (995), 9 states have internal predecessors, (995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:24:52,633 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 22:24:52,634 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 22:24:52,634 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 22:24:52,634 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 22:24:52,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:24:52,634 INFO L85 PathProgramCache]: Analyzing trace with hash -254879151, now seen corresponding path program 1 times [2022-12-13 22:24:52,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:24:52,634 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609711016] [2022-12-13 22:24:52,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:24:52,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:24:52,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:24:52,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 22:24:52,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:24:52,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609711016] [2022-12-13 22:24:52,723 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [609711016] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:24:52,723 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 22:24:52,723 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 22:24:52,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744537488] [2022-12-13 22:24:52,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:24:52,724 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 22:24:52,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:24:52,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 22:24:52,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 22:24:52,733 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 230 [2022-12-13 22:24:52,734 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 39 transitions, 271 flow. Second operand has 5 states, 5 states have (on average 119.0) internal successors, (595), 5 states have internal predecessors, (595), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:24:52,734 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 22:24:52,734 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 230 [2022-12-13 22:24:52,734 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 22:24:53,077 INFO L130 PetriNetUnfolder]: 923/1645 cut-off events. [2022-12-13 22:24:53,077 INFO L131 PetriNetUnfolder]: For 4130/4130 co-relation queries the response was YES. [2022-12-13 22:24:53,079 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5853 conditions, 1645 events. 923/1645 cut-off events. For 4130/4130 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 9247 event pairs, 137 based on Foata normal form. 14/1659 useless extension candidates. Maximal degree in co-relation 5833. Up to 792 conditions per place. [2022-12-13 22:24:53,083 INFO L137 encePairwiseOnDemand]: 226/230 looper letters, 58 selfloop transitions, 2 changer transitions 24/85 dead transitions. [2022-12-13 22:24:53,083 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 85 transitions, 733 flow [2022-12-13 22:24:53,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 22:24:53,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 22:24:53,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 627 transitions. [2022-12-13 22:24:53,084 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5452173913043479 [2022-12-13 22:24:53,084 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 627 transitions. [2022-12-13 22:24:53,084 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 627 transitions. [2022-12-13 22:24:53,084 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 22:24:53,085 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 627 transitions. [2022-12-13 22:24:53,085 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 125.4) internal successors, (627), 5 states have internal predecessors, (627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:24:53,086 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 230.0) internal successors, (1380), 6 states have internal predecessors, (1380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:24:53,086 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 230.0) internal successors, (1380), 6 states have internal predecessors, (1380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:24:53,086 INFO L175 Difference]: Start difference. First operand has 59 places, 39 transitions, 271 flow. Second operand 5 states and 627 transitions. [2022-12-13 22:24:53,086 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 85 transitions, 733 flow [2022-12-13 22:24:53,090 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 85 transitions, 687 flow, removed 20 selfloop flow, removed 5 redundant places. [2022-12-13 22:24:53,091 INFO L231 Difference]: Finished difference. Result has 57 places, 40 transitions, 264 flow [2022-12-13 22:24:53,091 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=230, PETRI_DIFFERENCE_MINUEND_FLOW=247, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=264, PETRI_PLACES=57, PETRI_TRANSITIONS=40} [2022-12-13 22:24:53,092 INFO L288 CegarLoopForPetriNet]: 31 programPoint places, 26 predicate places. [2022-12-13 22:24:53,092 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 40 transitions, 264 flow [2022-12-13 22:24:53,092 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 119.0) internal successors, (595), 5 states have internal predecessors, (595), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:24:53,092 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 22:24:53,092 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 22:24:53,092 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 22:24:53,092 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 22:24:53,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:24:53,093 INFO L85 PathProgramCache]: Analyzing trace with hash 449334637, now seen corresponding path program 2 times [2022-12-13 22:24:53,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:24:53,093 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901677273] [2022-12-13 22:24:53,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:24:53,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:24:53,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:24:53,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 22:24:53,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:24:53,236 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901677273] [2022-12-13 22:24:53,236 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901677273] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:24:53,236 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 22:24:53,236 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 22:24:53,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610914157] [2022-12-13 22:24:53,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:24:53,237 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 22:24:53,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:24:53,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 22:24:53,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 22:24:53,244 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 230 [2022-12-13 22:24:53,245 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 40 transitions, 264 flow. Second operand has 4 states, 4 states have (on average 120.5) internal successors, (482), 4 states have internal predecessors, (482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:24:53,245 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 22:24:53,245 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 230 [2022-12-13 22:24:53,245 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 22:24:53,428 INFO L130 PetriNetUnfolder]: 360/731 cut-off events. [2022-12-13 22:24:53,428 INFO L131 PetriNetUnfolder]: For 1504/1505 co-relation queries the response was YES. [2022-12-13 22:24:53,429 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2633 conditions, 731 events. 360/731 cut-off events. For 1504/1505 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 4000 event pairs, 53 based on Foata normal form. 72/785 useless extension candidates. Maximal degree in co-relation 2614. Up to 339 conditions per place. [2022-12-13 22:24:53,431 INFO L137 encePairwiseOnDemand]: 225/230 looper letters, 63 selfloop transitions, 7 changer transitions 3/76 dead transitions. [2022-12-13 22:24:53,431 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 76 transitions, 646 flow [2022-12-13 22:24:53,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 22:24:53,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 22:24:53,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 509 transitions. [2022-12-13 22:24:53,432 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5532608695652174 [2022-12-13 22:24:53,432 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 509 transitions. [2022-12-13 22:24:53,432 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 509 transitions. [2022-12-13 22:24:53,433 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 22:24:53,433 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 509 transitions. [2022-12-13 22:24:53,433 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 127.25) internal successors, (509), 4 states have internal predecessors, (509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:24:53,434 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 230.0) internal successors, (1150), 5 states have internal predecessors, (1150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:24:53,434 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 230.0) internal successors, (1150), 5 states have internal predecessors, (1150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:24:53,434 INFO L175 Difference]: Start difference. First operand has 57 places, 40 transitions, 264 flow. Second operand 4 states and 509 transitions. [2022-12-13 22:24:53,434 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 76 transitions, 646 flow [2022-12-13 22:24:53,437 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 76 transitions, 639 flow, removed 2 selfloop flow, removed 2 redundant places. [2022-12-13 22:24:53,438 INFO L231 Difference]: Finished difference. Result has 58 places, 43 transitions, 299 flow [2022-12-13 22:24:53,438 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=230, PETRI_DIFFERENCE_MINUEND_FLOW=259, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=299, PETRI_PLACES=58, PETRI_TRANSITIONS=43} [2022-12-13 22:24:53,438 INFO L288 CegarLoopForPetriNet]: 31 programPoint places, 27 predicate places. [2022-12-13 22:24:53,438 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 43 transitions, 299 flow [2022-12-13 22:24:53,439 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 120.5) internal successors, (482), 4 states have internal predecessors, (482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:24:53,439 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 22:24:53,439 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 22:24:53,439 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 22:24:53,439 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 22:24:53,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:24:53,439 INFO L85 PathProgramCache]: Analyzing trace with hash -911371687, now seen corresponding path program 1 times [2022-12-13 22:24:53,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:24:53,440 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986863560] [2022-12-13 22:24:53,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:24:53,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:24:53,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:24:53,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 22:24:53,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:24:53,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986863560] [2022-12-13 22:24:53,554 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [986863560] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:24:53,554 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 22:24:53,554 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 22:24:53,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103610127] [2022-12-13 22:24:53,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:24:53,554 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 22:24:53,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:24:53,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 22:24:53,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-13 22:24:53,561 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 230 [2022-12-13 22:24:53,562 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 43 transitions, 299 flow. Second operand has 5 states, 5 states have (on average 120.2) internal successors, (601), 5 states have internal predecessors, (601), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:24:53,562 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 22:24:53,562 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 230 [2022-12-13 22:24:53,563 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 22:24:53,701 INFO L130 PetriNetUnfolder]: 269/551 cut-off events. [2022-12-13 22:24:53,701 INFO L131 PetriNetUnfolder]: For 1501/1502 co-relation queries the response was YES. [2022-12-13 22:24:53,702 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2352 conditions, 551 events. 269/551 cut-off events. For 1501/1502 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 2969 event pairs, 38 based on Foata normal form. 37/570 useless extension candidates. Maximal degree in co-relation 2333. Up to 236 conditions per place. [2022-12-13 22:24:53,703 INFO L137 encePairwiseOnDemand]: 225/230 looper letters, 50 selfloop transitions, 10 changer transitions 14/76 dead transitions. [2022-12-13 22:24:53,703 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 76 transitions, 667 flow [2022-12-13 22:24:53,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 22:24:53,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 22:24:53,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 626 transitions. [2022-12-13 22:24:53,704 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5443478260869565 [2022-12-13 22:24:53,705 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 626 transitions. [2022-12-13 22:24:53,705 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 626 transitions. [2022-12-13 22:24:53,705 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 22:24:53,705 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 626 transitions. [2022-12-13 22:24:53,706 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 125.2) internal successors, (626), 5 states have internal predecessors, (626), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:24:53,707 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 230.0) internal successors, (1380), 6 states have internal predecessors, (1380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:24:53,707 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 230.0) internal successors, (1380), 6 states have internal predecessors, (1380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:24:53,707 INFO L175 Difference]: Start difference. First operand has 58 places, 43 transitions, 299 flow. Second operand 5 states and 626 transitions. [2022-12-13 22:24:53,707 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 76 transitions, 667 flow [2022-12-13 22:24:53,709 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 76 transitions, 609 flow, removed 9 selfloop flow, removed 6 redundant places. [2022-12-13 22:24:53,710 INFO L231 Difference]: Finished difference. Result has 57 places, 37 transitions, 239 flow [2022-12-13 22:24:53,710 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=230, PETRI_DIFFERENCE_MINUEND_FLOW=257, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=239, PETRI_PLACES=57, PETRI_TRANSITIONS=37} [2022-12-13 22:24:53,710 INFO L288 CegarLoopForPetriNet]: 31 programPoint places, 26 predicate places. [2022-12-13 22:24:53,710 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 37 transitions, 239 flow [2022-12-13 22:24:53,711 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 120.2) internal successors, (601), 5 states have internal predecessors, (601), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:24:53,711 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 22:24:53,711 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 22:24:53,711 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 22:24:53,711 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 22:24:53,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:24:53,712 INFO L85 PathProgramCache]: Analyzing trace with hash 1336754173, now seen corresponding path program 1 times [2022-12-13 22:24:53,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:24:53,712 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018434935] [2022-12-13 22:24:53,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:24:53,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:24:53,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:24:54,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 22:24:54,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:24:54,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018434935] [2022-12-13 22:24:54,006 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018434935] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:24:54,006 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 22:24:54,006 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 22:24:54,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337983317] [2022-12-13 22:24:54,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:24:54,007 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 22:24:54,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:24:54,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 22:24:54,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-13 22:24:54,030 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 230 [2022-12-13 22:24:54,031 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 37 transitions, 239 flow. Second operand has 7 states, 7 states have (on average 113.57142857142857) internal successors, (795), 7 states have internal predecessors, (795), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:24:54,031 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 22:24:54,031 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 230 [2022-12-13 22:24:54,031 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 22:24:54,217 INFO L130 PetriNetUnfolder]: 189/425 cut-off events. [2022-12-13 22:24:54,217 INFO L131 PetriNetUnfolder]: For 1095/1095 co-relation queries the response was YES. [2022-12-13 22:24:54,218 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1748 conditions, 425 events. 189/425 cut-off events. For 1095/1095 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2080 event pairs, 81 based on Foata normal form. 1/409 useless extension candidates. Maximal degree in co-relation 1732. Up to 285 conditions per place. [2022-12-13 22:24:54,219 INFO L137 encePairwiseOnDemand]: 224/230 looper letters, 32 selfloop transitions, 5 changer transitions 26/65 dead transitions. [2022-12-13 22:24:54,219 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 65 transitions, 553 flow [2022-12-13 22:24:54,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 22:24:54,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 22:24:54,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 812 transitions. [2022-12-13 22:24:54,221 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5043478260869565 [2022-12-13 22:24:54,221 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 812 transitions. [2022-12-13 22:24:54,221 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 812 transitions. [2022-12-13 22:24:54,222 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 22:24:54,222 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 812 transitions. [2022-12-13 22:24:54,224 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 116.0) internal successors, (812), 7 states have internal predecessors, (812), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:24:54,225 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 230.0) internal successors, (1840), 8 states have internal predecessors, (1840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:24:54,226 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 230.0) internal successors, (1840), 8 states have internal predecessors, (1840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:24:54,226 INFO L175 Difference]: Start difference. First operand has 57 places, 37 transitions, 239 flow. Second operand 7 states and 812 transitions. [2022-12-13 22:24:54,226 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 65 transitions, 553 flow [2022-12-13 22:24:54,229 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 65 transitions, 469 flow, removed 16 selfloop flow, removed 8 redundant places. [2022-12-13 22:24:54,230 INFO L231 Difference]: Finished difference. Result has 57 places, 33 transitions, 189 flow [2022-12-13 22:24:54,231 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=230, PETRI_DIFFERENCE_MINUEND_FLOW=195, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=189, PETRI_PLACES=57, PETRI_TRANSITIONS=33} [2022-12-13 22:24:54,231 INFO L288 CegarLoopForPetriNet]: 31 programPoint places, 26 predicate places. [2022-12-13 22:24:54,231 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 33 transitions, 189 flow [2022-12-13 22:24:54,232 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 113.57142857142857) internal successors, (795), 7 states have internal predecessors, (795), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:24:54,232 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 22:24:54,232 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 22:24:54,232 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 22:24:54,232 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 22:24:54,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:24:54,233 INFO L85 PathProgramCache]: Analyzing trace with hash 52395313, now seen corresponding path program 2 times [2022-12-13 22:24:54,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:24:54,233 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280623216] [2022-12-13 22:24:54,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:24:54,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:24:54,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 22:24:54,295 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 22:24:54,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 22:24:54,372 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 22:24:54,372 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 22:24:54,373 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2022-12-13 22:24:54,375 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2022-12-13 22:24:54,376 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2022-12-13 22:24:54,376 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2022-12-13 22:24:54,376 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 22:24:54,376 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-12-13 22:24:54,382 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 22:24:54,382 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 22:24:54,443 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 10:24:54 BasicIcfg [2022-12-13 22:24:54,443 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 22:24:54,444 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-13 22:24:54,444 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-13 22:24:54,444 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-13 22:24:54,445 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 10:24:42" (3/4) ... [2022-12-13 22:24:54,446 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-12-13 22:24:54,523 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92e71ee7-586f-4a34-b66f-61cc459df7c4/bin/uautomizer-uyxdKDjOR8/witness.graphml [2022-12-13 22:24:54,523 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-13 22:24:54,524 INFO L158 Benchmark]: Toolchain (without parser) took 13044.26ms. Allocated memory was 111.1MB in the beginning and 308.3MB in the end (delta: 197.1MB). Free memory was 68.7MB in the beginning and 117.9MB in the end (delta: -49.2MB). Peak memory consumption was 150.9MB. Max. memory is 16.1GB. [2022-12-13 22:24:54,524 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 111.1MB. Free memory is still 82.4MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 22:24:54,524 INFO L158 Benchmark]: CACSL2BoogieTranslator took 371.46ms. Allocated memory was 111.1MB in the beginning and 146.8MB in the end (delta: 35.7MB). Free memory was 68.7MB in the beginning and 117.2MB in the end (delta: -48.5MB). Peak memory consumption was 35.2MB. Max. memory is 16.1GB. [2022-12-13 22:24:54,524 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.49ms. Allocated memory is still 146.8MB. Free memory was 117.2MB in the beginning and 115.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 22:24:54,525 INFO L158 Benchmark]: Boogie Preprocessor took 23.80ms. Allocated memory is still 146.8MB. Free memory was 114.4MB in the beginning and 112.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 22:24:54,525 INFO L158 Benchmark]: RCFGBuilder took 650.36ms. Allocated memory is still 146.8MB. Free memory was 112.3MB in the beginning and 103.6MB in the end (delta: 8.7MB). Peak memory consumption was 47.1MB. Max. memory is 16.1GB. [2022-12-13 22:24:54,525 INFO L158 Benchmark]: TraceAbstraction took 11877.27ms. Allocated memory was 146.8MB in the beginning and 308.3MB in the end (delta: 161.5MB). Free memory was 102.6MB in the beginning and 132.5MB in the end (delta: -30.0MB). Peak memory consumption was 131.5MB. Max. memory is 16.1GB. [2022-12-13 22:24:54,525 INFO L158 Benchmark]: Witness Printer took 79.06ms. Allocated memory is still 308.3MB. Free memory was 132.5MB in the beginning and 117.9MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-12-13 22:24:54,527 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 111.1MB. Free memory is still 82.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 371.46ms. Allocated memory was 111.1MB in the beginning and 146.8MB in the end (delta: 35.7MB). Free memory was 68.7MB in the beginning and 117.2MB in the end (delta: -48.5MB). Peak memory consumption was 35.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.49ms. Allocated memory is still 146.8MB. Free memory was 117.2MB in the beginning and 115.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 23.80ms. Allocated memory is still 146.8MB. Free memory was 114.4MB in the beginning and 112.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 650.36ms. Allocated memory is still 146.8MB. Free memory was 112.3MB in the beginning and 103.6MB in the end (delta: 8.7MB). Peak memory consumption was 47.1MB. Max. memory is 16.1GB. * TraceAbstraction took 11877.27ms. Allocated memory was 146.8MB in the beginning and 308.3MB in the end (delta: 161.5MB). Free memory was 102.6MB in the beginning and 132.5MB in the end (delta: -30.0MB). Peak memory consumption was 131.5MB. Max. memory is 16.1GB. * Witness Printer took 79.06ms. Allocated memory is still 308.3MB. Free memory was 132.5MB in the beginning and 117.9MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.2s, 124 PlacesBefore, 31 PlacesAfterwards, 115 TransitionsBefore, 22 TransitionsAfterwards, 1228 CoEnabledTransitionPairs, 7 FixpointIterations, 61 TrivialSequentialCompositions, 34 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 98 TotalNumberOfCompositions, 3493 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1432, independent: 1261, independent conditional: 0, independent unconditional: 1261, dependent: 171, dependent conditional: 0, dependent unconditional: 171, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 639, independent: 605, independent conditional: 0, independent unconditional: 605, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1432, independent: 656, independent conditional: 0, independent unconditional: 656, dependent: 137, dependent conditional: 0, dependent unconditional: 137, unknown: 639, unknown conditional: 0, unknown unconditional: 639] , Statistics on independence cache: Total cache size (in pairs): 76, Positive cache size: 58, Positive conditional cache size: 0, Positive unconditional cache size: 58, Negative cache size: 18, Negative conditional cache size: 0, Negative unconditional cache size: 18, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L713] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L714] 0 int __unbuffered_p0_EAX$mem_tmp; [L715] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd3; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L720] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L721] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L722] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd3; [L723] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L724] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L725] 0 int __unbuffered_p0_EAX$w_buff0; [L726] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L727] 0 int __unbuffered_p0_EAX$w_buff1; [L728] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L730] 0 int __unbuffered_p0_EBX = 0; [L732] 0 int __unbuffered_p1_EAX = 0; [L734] 0 int __unbuffered_p1_EBX = 0; [L735] 0 _Bool main$tmp_guard0; [L736] 0 _Bool main$tmp_guard1; [L738] 0 int x = 0; [L739] 0 _Bool x$flush_delayed; [L740] 0 int x$mem_tmp; [L741] 0 _Bool x$r_buff0_thd0; [L742] 0 _Bool x$r_buff0_thd1; [L743] 0 _Bool x$r_buff0_thd2; [L744] 0 _Bool x$r_buff0_thd3; [L745] 0 _Bool x$r_buff1_thd0; [L746] 0 _Bool x$r_buff1_thd1; [L747] 0 _Bool x$r_buff1_thd2; [L748] 0 _Bool x$r_buff1_thd3; [L749] 0 _Bool x$read_delayed; [L750] 0 int *x$read_delayed_var; [L751] 0 int x$w_buff0; [L752] 0 _Bool x$w_buff0_used; [L753] 0 int x$w_buff1; [L754] 0 _Bool x$w_buff1_used; [L756] 0 int y = 0; [L757] 0 _Bool weak$$choice0; [L758] 0 _Bool weak$$choice1; [L759] 0 _Bool weak$$choice2; [L849] 0 pthread_t t1749; [L850] FCALL, FORK 0 pthread_create(&t1749, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1749, ((void *)0), P0, ((void *)0))=-3, t1749={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L851] 0 pthread_t t1750; [L852] FCALL, FORK 0 pthread_create(&t1750, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1750, ((void *)0), P1, ((void *)0))=-2, t1749={7:0}, t1750={8:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L853] 0 pthread_t t1751; [L763] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L764] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L765] 1 x$flush_delayed = weak$$choice2 [L766] EXPR 1 \read(x) [L766] 1 x$mem_tmp = x [L767] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L767] EXPR 1 \read(x) [L767] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L767] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L768] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L769] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L770] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L771] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L772] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L773] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L774] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L775] 1 __unbuffered_p0_EAX$read_delayed_var = &x [L776] EXPR 1 \read(x) [L776] 1 __unbuffered_p0_EAX = x [L777] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L777] 1 x = x$flush_delayed ? x$mem_tmp : x [L778] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice1=0, weak$$choice2=255, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L781] 1 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice1=0, weak$$choice2=255, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L786] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L788] 1 return 0; [L793] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice1=0, weak$$choice2=255, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L796] 2 __unbuffered_p1_EAX = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice1=0, weak$$choice2=255, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L799] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L800] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L801] 2 x$flush_delayed = weak$$choice2 [L802] EXPR 2 \read(x) [L802] 2 x$mem_tmp = x [L803] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L803] EXPR 2 \read(x) [L803] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L803] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L804] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L805] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L806] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L807] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L808] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L809] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L810] EXPR 2 \read(x) [L810] 2 __unbuffered_p1_EBX = x [L811] EXPR 2 x$flush_delayed ? x$mem_tmp : x [L811] 2 x = x$flush_delayed ? x$mem_tmp : x [L812] 2 x$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice1=0, weak$$choice2=255, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L854] FCALL, FORK 0 pthread_create(&t1751, ((void *)0), P2, ((void *)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1751, ((void *)0), P2, ((void *)0))=-1, t1749={7:0}, t1750={8:0}, t1751={5:0}, weak$$choice0=49, weak$$choice1=0, weak$$choice2=255, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L817] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L819] 2 return 0; [L824] 3 x = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice1=0, weak$$choice2=255, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L827] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L827] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L827] EXPR 3 \read(x) [L827] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L827] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L827] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L828] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L829] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L830] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L831] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice1=0, weak$$choice2=255, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L834] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L836] 3 return 0; [L856] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L858] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) VAL [\old(cond)=1, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice1=0, weak$$choice2=255, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L858] RET 0 assume_abort_if_not(main$tmp_guard0) [L860] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L860] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L860] EXPR 0 \read(x) [L860] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L860] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L860] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L861] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L862] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L863] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L864] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1749={7:0}, t1750={8:0}, t1751={5:0}, weak$$choice0=49, weak$$choice1=0, weak$$choice2=255, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L867] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L868] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L868] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L868] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L868] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L868] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L868] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L869] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) [L871] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice1=255, weak$$choice2=255, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] - UnprovableResult [Line: 854]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 850]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 852]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 156 locations, 4 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 11.7s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 3.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 731 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 555 mSDsluCounter, 602 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 499 mSDsCounter, 174 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1890 IncrementalHoareTripleChecker+Invalid, 2064 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 174 mSolverCounterUnsat, 103 mSDtfsCounter, 1890 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 62 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=299occurred in iteration=9, 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.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.2s InterpolantComputationTime, 177 NumberOfCodeBlocks, 177 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 146 ConstructedInterpolants, 0 QuantifiedInterpolants, 1467 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-13 22:24:54,544 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92e71ee7-586f-4a34-b66f-61cc459df7c4/bin/uautomizer-uyxdKDjOR8/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 Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE