./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe016_power.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55411a4a-af07-4a1a-be84-cc9b95b8bd2c/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55411a4a-af07-4a1a-be84-cc9b95b8bd2c/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_55411a4a-af07-4a1a-be84-cc9b95b8bd2c/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55411a4a-af07-4a1a-be84-cc9b95b8bd2c/bin/uautomizer-uyxdKDjOR8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe016_power.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55411a4a-af07-4a1a-be84-cc9b95b8bd2c/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_55411a4a-af07-4a1a-be84-cc9b95b8bd2c/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 a45428c1422efa85fd947d764edf0847add56b17c38e18f54072b18b642fedaf --- 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 21:53:38,565 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 21:53:38,566 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 21:53:38,578 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 21:53:38,578 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 21:53:38,579 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 21:53:38,579 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 21:53:38,580 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 21:53:38,581 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 21:53:38,582 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 21:53:38,582 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 21:53:38,583 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 21:53:38,583 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 21:53:38,584 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 21:53:38,585 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 21:53:38,585 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 21:53:38,586 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 21:53:38,586 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 21:53:38,587 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 21:53:38,589 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 21:53:38,590 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 21:53:38,590 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 21:53:38,591 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 21:53:38,592 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 21:53:38,594 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 21:53:38,594 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 21:53:38,594 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 21:53:38,595 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 21:53:38,595 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 21:53:38,596 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 21:53:38,596 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 21:53:38,596 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 21:53:38,597 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 21:53:38,597 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 21:53:38,598 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 21:53:38,598 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 21:53:38,599 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 21:53:38,599 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 21:53:38,599 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 21:53:38,600 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 21:53:38,600 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 21:53:38,601 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55411a4a-af07-4a1a-be84-cc9b95b8bd2c/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-12-13 21:53:38,614 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 21:53:38,614 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 21:53:38,614 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 21:53:38,614 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 21:53:38,615 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 21:53:38,615 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 21:53:38,615 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 21:53:38,615 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 21:53:38,616 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 21:53:38,616 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 21:53:38,616 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 21:53:38,616 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 21:53:38,616 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 21:53:38,616 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 21:53:38,616 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 21:53:38,616 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 21:53:38,616 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 21:53:38,616 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 21:53:38,617 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 21:53:38,617 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 21:53:38,617 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 21:53:38,617 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 21:53:38,617 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 21:53:38,617 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 21:53:38,617 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 21:53:38,617 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 21:53:38,617 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 21:53:38,617 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 21:53:38,617 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 21:53:38,618 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 21:53:38,618 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 21:53:38,618 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-13 21:53:38,618 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 21:53:38,618 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 21:53:38,618 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 21:53:38,618 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_55411a4a-af07-4a1a-be84-cc9b95b8bd2c/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_55411a4a-af07-4a1a-be84-cc9b95b8bd2c/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 -> a45428c1422efa85fd947d764edf0847add56b17c38e18f54072b18b642fedaf [2022-12-13 21:53:38,782 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 21:53:38,799 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 21:53:38,801 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 21:53:38,802 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 21:53:38,802 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 21:53:38,803 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55411a4a-af07-4a1a-be84-cc9b95b8bd2c/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/pthread-wmm/safe016_power.oepc.i [2022-12-13 21:53:41,355 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 21:53:41,545 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 21:53:41,545 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55411a4a-af07-4a1a-be84-cc9b95b8bd2c/sv-benchmarks/c/pthread-wmm/safe016_power.oepc.i [2022-12-13 21:53:41,555 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55411a4a-af07-4a1a-be84-cc9b95b8bd2c/bin/uautomizer-uyxdKDjOR8/data/c070e9391/f6be930a07564ef784ae85d2960ef65c/FLAG4e30a93c6 [2022-12-13 21:53:41,954 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55411a4a-af07-4a1a-be84-cc9b95b8bd2c/bin/uautomizer-uyxdKDjOR8/data/c070e9391/f6be930a07564ef784ae85d2960ef65c [2022-12-13 21:53:41,959 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 21:53:41,960 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 21:53:41,962 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 21:53:41,962 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 21:53:41,967 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 21:53:41,967 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 09:53:41" (1/1) ... [2022-12-13 21:53:41,968 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50c82549 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:53:41, skipping insertion in model container [2022-12-13 21:53:41,969 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 09:53:41" (1/1) ... [2022-12-13 21:53:41,975 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 21:53:42,004 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 21:53:42,112 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_55411a4a-af07-4a1a-be84-cc9b95b8bd2c/sv-benchmarks/c/pthread-wmm/safe016_power.oepc.i[995,1008] [2022-12-13 21:53:42,219 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:53:42,231 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:53:42,231 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:53:42,231 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:53:42,231 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:53:42,232 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:53:42,232 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:53:42,232 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:53:42,233 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:53:42,233 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:53:42,233 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:53:42,233 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:53:42,233 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:53:42,234 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:53:42,234 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:53:42,234 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:53:42,234 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:53:42,235 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:53:42,235 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:53:42,237 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:53:42,237 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:53:42,237 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:53:42,238 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:53:42,238 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:53:42,238 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:53:42,240 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:53:42,240 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:53:42,240 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:53:42,245 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:53:42,245 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:53:42,246 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:53:42,248 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:53:42,248 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:53:42,254 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:53:42,255 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 21:53:42,263 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 21:53:42,272 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_55411a4a-af07-4a1a-be84-cc9b95b8bd2c/sv-benchmarks/c/pthread-wmm/safe016_power.oepc.i[995,1008] [2022-12-13 21:53:42,286 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:53:42,293 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:53:42,294 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:53:42,294 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:53:42,294 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:53:42,294 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:53:42,294 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:53:42,294 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:53:42,295 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:53:42,295 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:53:42,295 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:53:42,295 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:53:42,295 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:53:42,296 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:53:42,296 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:53:42,296 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:53:42,296 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:53:42,297 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:53:42,297 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:53:42,298 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:53:42,298 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:53:42,299 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:53:42,299 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:53:42,299 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:53:42,300 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:53:42,301 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:53:42,301 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:53:42,302 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:53:42,304 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:53:42,305 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:53:42,305 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:53:42,306 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:53:42,306 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:53:42,311 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:53:42,311 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 21:53:42,332 INFO L208 MainTranslator]: Completed translation [2022-12-13 21:53:42,332 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:53:42 WrapperNode [2022-12-13 21:53:42,332 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 21:53:42,333 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 21:53:42,333 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 21:53:42,333 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 21:53:42,339 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:53:42" (1/1) ... [2022-12-13 21:53:42,351 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:53:42" (1/1) ... [2022-12-13 21:53:42,371 INFO L138 Inliner]: procedures = 177, calls = 87, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 185 [2022-12-13 21:53:42,371 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 21:53:42,372 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 21:53:42,372 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 21:53:42,372 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 21:53:42,380 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:53:42" (1/1) ... [2022-12-13 21:53:42,381 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:53:42" (1/1) ... [2022-12-13 21:53:42,385 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:53:42" (1/1) ... [2022-12-13 21:53:42,386 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:53:42" (1/1) ... [2022-12-13 21:53:42,396 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:53:42" (1/1) ... [2022-12-13 21:53:42,399 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:53:42" (1/1) ... [2022-12-13 21:53:42,402 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:53:42" (1/1) ... [2022-12-13 21:53:42,404 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:53:42" (1/1) ... [2022-12-13 21:53:42,408 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 21:53:42,409 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 21:53:42,409 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 21:53:42,409 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 21:53:42,410 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:53:42" (1/1) ... [2022-12-13 21:53:42,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 21:53:42,425 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55411a4a-af07-4a1a-be84-cc9b95b8bd2c/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 21:53:42,436 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55411a4a-af07-4a1a-be84-cc9b95b8bd2c/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 21:53:42,438 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55411a4a-af07-4a1a-be84-cc9b95b8bd2c/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 21:53:42,473 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 21:53:42,473 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 21:53:42,473 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 21:53:42,473 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 21:53:42,473 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 21:53:42,473 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 21:53:42,473 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 21:53:42,474 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 21:53:42,474 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 21:53:42,474 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 21:53:42,474 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-13 21:53:42,474 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-13 21:53:42,474 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-12-13 21:53:42,474 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-12-13 21:53:42,474 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 21:53:42,475 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 21:53:42,475 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 21:53:42,475 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 21:53:42,476 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 21:53:42,600 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 21:53:42,602 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 21:53:42,986 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 21:53:43,179 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 21:53:43,179 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 21:53:43,181 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 09:53:43 BoogieIcfgContainer [2022-12-13 21:53:43,181 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 21:53:43,183 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 21:53:43,183 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 21:53:43,185 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 21:53:43,185 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 09:53:41" (1/3) ... [2022-12-13 21:53:43,186 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d8e6a17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 09:53:43, skipping insertion in model container [2022-12-13 21:53:43,186 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:53:42" (2/3) ... [2022-12-13 21:53:43,186 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d8e6a17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 09:53:43, skipping insertion in model container [2022-12-13 21:53:43,186 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 09:53:43" (3/3) ... [2022-12-13 21:53:43,187 INFO L112 eAbstractionObserver]: Analyzing ICFG safe016_power.oepc.i [2022-12-13 21:53:43,194 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-12-13 21:53:43,202 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 21:53:43,202 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-13 21:53:43,202 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 21:53:43,255 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 21:53:43,281 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 160 places, 149 transitions, 318 flow [2022-12-13 21:53:43,327 INFO L130 PetriNetUnfolder]: 2/145 cut-off events. [2022-12-13 21:53:43,327 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 21:53:43,332 INFO L83 FinitePrefix]: Finished finitePrefix Result has 158 conditions, 145 events. 2/145 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 56 event pairs, 0 based on Foata normal form. 0/142 useless extension candidates. Maximal degree in co-relation 86. Up to 2 conditions per place. [2022-12-13 21:53:43,332 INFO L82 GeneralOperation]: Start removeDead. Operand has 160 places, 149 transitions, 318 flow [2022-12-13 21:53:43,335 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 141 places, 129 transitions, 270 flow [2022-12-13 21:53:43,338 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-12-13 21:53:43,345 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 141 places, 129 transitions, 270 flow [2022-12-13 21:53:43,347 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 141 places, 129 transitions, 270 flow [2022-12-13 21:53:43,348 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 141 places, 129 transitions, 270 flow [2022-12-13 21:53:43,369 INFO L130 PetriNetUnfolder]: 1/129 cut-off events. [2022-12-13 21:53:43,369 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 21:53:43,369 INFO L83 FinitePrefix]: Finished finitePrefix Result has 142 conditions, 129 events. 1/129 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 47 event pairs, 0 based on Foata normal form. 0/128 useless extension candidates. Maximal degree in co-relation 70. Up to 2 conditions per place. [2022-12-13 21:53:43,370 INFO L119 LiptonReduction]: Number of co-enabled transitions 1832 [2022-12-13 21:53:52,363 INFO L134 LiptonReduction]: Checked pairs total: 3818 [2022-12-13 21:53:52,363 INFO L136 LiptonReduction]: Total number of compositions: 109 [2022-12-13 21:53:52,375 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 21:53:52,381 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;@b276e0c, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 21:53:52,382 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-12-13 21:53:52,390 INFO L130 PetriNetUnfolder]: 0/22 cut-off events. [2022-12-13 21:53:52,390 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 21:53:52,391 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 21:53:52,391 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:53:52,392 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 2 more)] === [2022-12-13 21:53:52,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:53:52,396 INFO L85 PathProgramCache]: Analyzing trace with hash 1939507271, now seen corresponding path program 1 times [2022-12-13 21:53:52,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:53:52,405 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956482573] [2022-12-13 21:53:52,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:53:52,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:53:52,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:53:52,729 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 21:53:52,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:53:52,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956482573] [2022-12-13 21:53:52,730 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956482573] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:53:52,730 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:53:52,730 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 21:53:52,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380682573] [2022-12-13 21:53:52,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:53:52,737 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 21:53:52,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:53:52,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 21:53:52,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 21:53:52,762 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 258 [2022-12-13 21:53:52,765 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 23 transitions, 58 flow. Second operand has 3 states, 3 states have (on average 137.66666666666666) internal successors, (413), 3 states have internal predecessors, (413), 0 states have call successors, (0), 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 21:53:52,765 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 21:53:52,765 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 258 [2022-12-13 21:53:52,765 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 21:53:53,437 INFO L130 PetriNetUnfolder]: 2185/3054 cut-off events. [2022-12-13 21:53:53,437 INFO L131 PetriNetUnfolder]: For 59/59 co-relation queries the response was YES. [2022-12-13 21:53:53,441 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6240 conditions, 3054 events. 2185/3054 cut-off events. For 59/59 co-relation queries the response was YES. Maximal size of possible extension queue 150. Compared 14067 event pairs, 445 based on Foata normal form. 32/3082 useless extension candidates. Maximal degree in co-relation 6228. Up to 2745 conditions per place. [2022-12-13 21:53:53,450 INFO L137 encePairwiseOnDemand]: 254/258 looper letters, 36 selfloop transitions, 3 changer transitions 0/40 dead transitions. [2022-12-13 21:53:53,451 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 40 transitions, 179 flow [2022-12-13 21:53:53,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 21:53:53,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 21:53:53,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 442 transitions. [2022-12-13 21:53:53,461 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5710594315245479 [2022-12-13 21:53:53,462 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 442 transitions. [2022-12-13 21:53:53,462 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 442 transitions. [2022-12-13 21:53:53,463 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 21:53:53,465 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 442 transitions. [2022-12-13 21:53:53,468 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 147.33333333333334) internal successors, (442), 3 states have internal predecessors, (442), 0 states have call successors, (0), 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 21:53:53,475 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 258.0) internal successors, (1032), 4 states have internal predecessors, (1032), 0 states have call successors, (0), 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 21:53:53,476 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 258.0) internal successors, (1032), 4 states have internal predecessors, (1032), 0 states have call successors, (0), 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 21:53:53,477 INFO L175 Difference]: Start difference. First operand has 36 places, 23 transitions, 58 flow. Second operand 3 states and 442 transitions. [2022-12-13 21:53:53,478 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 40 transitions, 179 flow [2022-12-13 21:53:53,481 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 40 transitions, 172 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-13 21:53:53,482 INFO L231 Difference]: Finished difference. Result has 35 places, 25 transitions, 73 flow [2022-12-13 21:53:53,484 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=258, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=73, PETRI_PLACES=35, PETRI_TRANSITIONS=25} [2022-12-13 21:53:53,488 INFO L288 CegarLoopForPetriNet]: 36 programPoint places, -1 predicate places. [2022-12-13 21:53:53,488 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 25 transitions, 73 flow [2022-12-13 21:53:53,488 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 137.66666666666666) internal successors, (413), 3 states have internal predecessors, (413), 0 states have call successors, (0), 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 21:53:53,488 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 21:53:53,488 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:53:53,489 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 21:53:53,489 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 2 more)] === [2022-12-13 21:53:53,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:53:53,490 INFO L85 PathProgramCache]: Analyzing trace with hash -4818601, now seen corresponding path program 1 times [2022-12-13 21:53:53,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:53:53,490 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605226784] [2022-12-13 21:53:53,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:53:53,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:53:53,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:53:53,671 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 21:53:53,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:53:53,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605226784] [2022-12-13 21:53:53,672 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605226784] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:53:53,672 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:53:53,672 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 21:53:53,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429952735] [2022-12-13 21:53:53,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:53:53,673 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 21:53:53,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:53:53,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 21:53:53,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 21:53:53,677 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 258 [2022-12-13 21:53:53,678 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 25 transitions, 73 flow. Second operand has 3 states, 3 states have (on average 139.0) internal successors, (417), 3 states have internal predecessors, (417), 0 states have call successors, (0), 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 21:53:53,678 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 21:53:53,678 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 258 [2022-12-13 21:53:53,679 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 21:53:54,155 INFO L130 PetriNetUnfolder]: 1827/2748 cut-off events. [2022-12-13 21:53:54,156 INFO L131 PetriNetUnfolder]: For 359/360 co-relation queries the response was YES. [2022-12-13 21:53:54,158 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5959 conditions, 2748 events. 1827/2748 cut-off events. For 359/360 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 13424 event pairs, 364 based on Foata normal form. 40/2787 useless extension candidates. Maximal degree in co-relation 5948. Up to 2100 conditions per place. [2022-12-13 21:53:54,166 INFO L137 encePairwiseOnDemand]: 255/258 looper letters, 32 selfloop transitions, 2 changer transitions 0/37 dead transitions. [2022-12-13 21:53:54,166 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 37 transitions, 172 flow [2022-12-13 21:53:54,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 21:53:54,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 21:53:54,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 438 transitions. [2022-12-13 21:53:54,168 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5658914728682171 [2022-12-13 21:53:54,168 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 438 transitions. [2022-12-13 21:53:54,168 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 438 transitions. [2022-12-13 21:53:54,169 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 21:53:54,169 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 438 transitions. [2022-12-13 21:53:54,170 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 146.0) internal successors, (438), 3 states have internal predecessors, (438), 0 states have call successors, (0), 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 21:53:54,171 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 258.0) internal successors, (1032), 4 states have internal predecessors, (1032), 0 states have call successors, (0), 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 21:53:54,171 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 258.0) internal successors, (1032), 4 states have internal predecessors, (1032), 0 states have call successors, (0), 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 21:53:54,171 INFO L175 Difference]: Start difference. First operand has 35 places, 25 transitions, 73 flow. Second operand 3 states and 438 transitions. [2022-12-13 21:53:54,172 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 37 transitions, 172 flow [2022-12-13 21:53:54,172 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 37 transitions, 168 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 21:53:54,173 INFO L231 Difference]: Finished difference. Result has 37 places, 25 transitions, 78 flow [2022-12-13 21:53:54,173 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=258, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=78, PETRI_PLACES=37, PETRI_TRANSITIONS=25} [2022-12-13 21:53:54,173 INFO L288 CegarLoopForPetriNet]: 36 programPoint places, 1 predicate places. [2022-12-13 21:53:54,174 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 25 transitions, 78 flow [2022-12-13 21:53:54,174 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 139.0) internal successors, (417), 3 states have internal predecessors, (417), 0 states have call successors, (0), 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 21:53:54,174 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 21:53:54,174 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:53:54,174 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 21:53:54,174 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 2 more)] === [2022-12-13 21:53:54,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:53:54,175 INFO L85 PathProgramCache]: Analyzing trace with hash 137265358, now seen corresponding path program 1 times [2022-12-13 21:53:54,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:53:54,175 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877670877] [2022-12-13 21:53:54,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:53:54,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:53:54,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:53:54,403 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 21:53:54,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:53:54,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877670877] [2022-12-13 21:53:54,404 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1877670877] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:53:54,404 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:53:54,404 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 21:53:54,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622651604] [2022-12-13 21:53:54,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:53:54,405 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 21:53:54,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:53:54,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 21:53:54,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 21:53:54,410 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 258 [2022-12-13 21:53:54,410 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 25 transitions, 78 flow. Second operand has 3 states, 3 states have (on average 141.33333333333334) internal successors, (424), 3 states have internal predecessors, (424), 0 states have call successors, (0), 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 21:53:54,411 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 21:53:54,411 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 258 [2022-12-13 21:53:54,411 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 21:53:54,854 INFO L130 PetriNetUnfolder]: 1871/2678 cut-off events. [2022-12-13 21:53:54,854 INFO L131 PetriNetUnfolder]: For 671/671 co-relation queries the response was YES. [2022-12-13 21:53:54,857 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6231 conditions, 2678 events. 1871/2678 cut-off events. For 671/671 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 12466 event pairs, 503 based on Foata normal form. 24/2699 useless extension candidates. Maximal degree in co-relation 6218. Up to 1993 conditions per place. [2022-12-13 21:53:54,871 INFO L137 encePairwiseOnDemand]: 255/258 looper letters, 36 selfloop transitions, 2 changer transitions 0/41 dead transitions. [2022-12-13 21:53:54,871 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 41 transitions, 197 flow [2022-12-13 21:53:54,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 21:53:54,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 21:53:54,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 449 transitions. [2022-12-13 21:53:54,873 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5801033591731266 [2022-12-13 21:53:54,873 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 449 transitions. [2022-12-13 21:53:54,873 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 449 transitions. [2022-12-13 21:53:54,874 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 21:53:54,874 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 449 transitions. [2022-12-13 21:53:54,875 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 149.66666666666666) internal successors, (449), 3 states have internal predecessors, (449), 0 states have call successors, (0), 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 21:53:54,877 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 258.0) internal successors, (1032), 4 states have internal predecessors, (1032), 0 states have call successors, (0), 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 21:53:54,878 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 258.0) internal successors, (1032), 4 states have internal predecessors, (1032), 0 states have call successors, (0), 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 21:53:54,878 INFO L175 Difference]: Start difference. First operand has 37 places, 25 transitions, 78 flow. Second operand 3 states and 449 transitions. [2022-12-13 21:53:54,878 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 41 transitions, 197 flow [2022-12-13 21:53:54,879 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 41 transitions, 191 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 21:53:54,880 INFO L231 Difference]: Finished difference. Result has 38 places, 25 transitions, 82 flow [2022-12-13 21:53:54,880 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=258, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=82, PETRI_PLACES=38, PETRI_TRANSITIONS=25} [2022-12-13 21:53:54,881 INFO L288 CegarLoopForPetriNet]: 36 programPoint places, 2 predicate places. [2022-12-13 21:53:54,881 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 25 transitions, 82 flow [2022-12-13 21:53:54,881 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 141.33333333333334) internal successors, (424), 3 states have internal predecessors, (424), 0 states have call successors, (0), 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 21:53:54,881 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 21:53:54,881 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:53:54,882 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 21:53:54,882 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 2 more)] === [2022-12-13 21:53:54,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:53:54,882 INFO L85 PathProgramCache]: Analyzing trace with hash -1723252392, now seen corresponding path program 1 times [2022-12-13 21:53:54,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:53:54,883 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592948193] [2022-12-13 21:53:54,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:53:54,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:53:54,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:53:54,947 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 21:53:54,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:53:54,947 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592948193] [2022-12-13 21:53:54,947 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [592948193] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:53:54,947 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:53:54,947 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 21:53:54,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921136481] [2022-12-13 21:53:54,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:53:54,948 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 21:53:54,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:53:54,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 21:53:54,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 21:53:54,952 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 258 [2022-12-13 21:53:54,953 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 25 transitions, 82 flow. Second operand has 3 states, 3 states have (on average 138.66666666666666) internal successors, (416), 3 states have internal predecessors, (416), 0 states have call successors, (0), 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 21:53:54,953 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 21:53:54,953 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 258 [2022-12-13 21:53:54,953 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 21:53:55,517 INFO L130 PetriNetUnfolder]: 2471/3548 cut-off events. [2022-12-13 21:53:55,517 INFO L131 PetriNetUnfolder]: For 1167/1167 co-relation queries the response was YES. [2022-12-13 21:53:55,520 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8478 conditions, 3548 events. 2471/3548 cut-off events. For 1167/1167 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 17040 event pairs, 1399 based on Foata normal form. 72/3610 useless extension candidates. Maximal degree in co-relation 8464. Up to 2197 conditions per place. [2022-12-13 21:53:55,526 INFO L137 encePairwiseOnDemand]: 255/258 looper letters, 37 selfloop transitions, 3 changer transitions 0/41 dead transitions. [2022-12-13 21:53:55,526 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 41 transitions, 201 flow [2022-12-13 21:53:55,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 21:53:55,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 21:53:55,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 442 transitions. [2022-12-13 21:53:55,528 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5710594315245479 [2022-12-13 21:53:55,528 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 442 transitions. [2022-12-13 21:53:55,528 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 442 transitions. [2022-12-13 21:53:55,528 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 21:53:55,528 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 442 transitions. [2022-12-13 21:53:55,529 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 147.33333333333334) internal successors, (442), 3 states have internal predecessors, (442), 0 states have call successors, (0), 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 21:53:55,530 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 258.0) internal successors, (1032), 4 states have internal predecessors, (1032), 0 states have call successors, (0), 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 21:53:55,530 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 258.0) internal successors, (1032), 4 states have internal predecessors, (1032), 0 states have call successors, (0), 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 21:53:55,530 INFO L175 Difference]: Start difference. First operand has 38 places, 25 transitions, 82 flow. Second operand 3 states and 442 transitions. [2022-12-13 21:53:55,530 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 41 transitions, 201 flow [2022-12-13 21:53:55,531 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 41 transitions, 197 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 21:53:55,532 INFO L231 Difference]: Finished difference. Result has 39 places, 25 transitions, 89 flow [2022-12-13 21:53:55,532 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=258, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=89, PETRI_PLACES=39, PETRI_TRANSITIONS=25} [2022-12-13 21:53:55,532 INFO L288 CegarLoopForPetriNet]: 36 programPoint places, 3 predicate places. [2022-12-13 21:53:55,532 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 25 transitions, 89 flow [2022-12-13 21:53:55,533 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 138.66666666666666) internal successors, (416), 3 states have internal predecessors, (416), 0 states have call successors, (0), 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 21:53:55,533 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 21:53:55,533 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:53:55,533 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 21:53:55,533 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 2 more)] === [2022-12-13 21:53:55,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:53:55,533 INFO L85 PathProgramCache]: Analyzing trace with hash -1937113050, now seen corresponding path program 1 times [2022-12-13 21:53:55,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:53:55,534 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114063080] [2022-12-13 21:53:55,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:53:55,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:53:55,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:53:56,481 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 21:53:56,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:53:56,481 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114063080] [2022-12-13 21:53:56,482 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2114063080] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:53:56,482 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:53:56,482 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 21:53:56,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887319891] [2022-12-13 21:53:56,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:53:56,483 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 21:53:56,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:53:56,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 21:53:56,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-13 21:53:56,621 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 258 [2022-12-13 21:53:56,623 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 25 transitions, 89 flow. Second operand has 6 states, 6 states have (on average 125.33333333333333) internal successors, (752), 6 states have internal predecessors, (752), 0 states have call successors, (0), 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 21:53:56,623 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 21:53:56,623 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 258 [2022-12-13 21:53:56,623 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 21:53:57,173 INFO L130 PetriNetUnfolder]: 2548/3645 cut-off events. [2022-12-13 21:53:57,173 INFO L131 PetriNetUnfolder]: For 1749/1798 co-relation queries the response was YES. [2022-12-13 21:53:57,176 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8832 conditions, 3645 events. 2548/3645 cut-off events. For 1749/1798 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 16967 event pairs, 634 based on Foata normal form. 22/3663 useless extension candidates. Maximal degree in co-relation 8818. Up to 3201 conditions per place. [2022-12-13 21:53:57,182 INFO L137 encePairwiseOnDemand]: 254/258 looper letters, 32 selfloop transitions, 3 changer transitions 0/37 dead transitions. [2022-12-13 21:53:57,182 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 37 transitions, 194 flow [2022-12-13 21:53:57,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 21:53:57,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 21:53:57,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 403 transitions. [2022-12-13 21:53:57,185 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.520671834625323 [2022-12-13 21:53:57,185 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 403 transitions. [2022-12-13 21:53:57,185 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 403 transitions. [2022-12-13 21:53:57,185 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 21:53:57,185 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 403 transitions. [2022-12-13 21:53:57,186 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 134.33333333333334) internal successors, (403), 3 states have internal predecessors, (403), 0 states have call successors, (0), 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 21:53:57,188 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 258.0) internal successors, (1032), 4 states have internal predecessors, (1032), 0 states have call successors, (0), 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 21:53:57,188 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 258.0) internal successors, (1032), 4 states have internal predecessors, (1032), 0 states have call successors, (0), 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 21:53:57,189 INFO L175 Difference]: Start difference. First operand has 39 places, 25 transitions, 89 flow. Second operand 3 states and 403 transitions. [2022-12-13 21:53:57,189 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 37 transitions, 194 flow [2022-12-13 21:53:57,191 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 37 transitions, 186 flow, removed 2 selfloop flow, removed 1 redundant places. [2022-12-13 21:53:57,191 INFO L231 Difference]: Finished difference. Result has 41 places, 27 transitions, 103 flow [2022-12-13 21:53:57,192 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=258, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=103, PETRI_PLACES=41, PETRI_TRANSITIONS=27} [2022-12-13 21:53:57,192 INFO L288 CegarLoopForPetriNet]: 36 programPoint places, 5 predicate places. [2022-12-13 21:53:57,193 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 27 transitions, 103 flow [2022-12-13 21:53:57,193 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 125.33333333333333) internal successors, (752), 6 states have internal predecessors, (752), 0 states have call successors, (0), 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 21:53:57,193 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 21:53:57,193 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:53:57,193 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 21:53:57,194 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 2 more)] === [2022-12-13 21:53:57,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:53:57,194 INFO L85 PathProgramCache]: Analyzing trace with hash 79034775, now seen corresponding path program 1 times [2022-12-13 21:53:57,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:53:57,194 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125554433] [2022-12-13 21:53:57,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:53:57,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:53:57,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:53:57,422 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 21:53:57,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:53:57,422 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125554433] [2022-12-13 21:53:57,423 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1125554433] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:53:57,423 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:53:57,423 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 21:53:57,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463145751] [2022-12-13 21:53:57,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:53:57,423 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 21:53:57,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:53:57,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 21:53:57,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 21:53:57,451 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 258 [2022-12-13 21:53:57,452 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 27 transitions, 103 flow. Second operand has 5 states, 5 states have (on average 131.0) internal successors, (655), 5 states have internal predecessors, (655), 0 states have call successors, (0), 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 21:53:57,452 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 21:53:57,452 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 258 [2022-12-13 21:53:57,452 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 21:53:58,078 INFO L130 PetriNetUnfolder]: 3065/4368 cut-off events. [2022-12-13 21:53:58,078 INFO L131 PetriNetUnfolder]: For 2274/2332 co-relation queries the response was YES. [2022-12-13 21:53:58,082 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10812 conditions, 4368 events. 3065/4368 cut-off events. For 2274/2332 co-relation queries the response was YES. Maximal size of possible extension queue 220. Compared 20936 event pairs, 2186 based on Foata normal form. 43/4407 useless extension candidates. Maximal degree in co-relation 10796. Up to 3793 conditions per place. [2022-12-13 21:53:58,092 INFO L137 encePairwiseOnDemand]: 249/258 looper letters, 29 selfloop transitions, 9 changer transitions 0/40 dead transitions. [2022-12-13 21:53:58,092 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 40 transitions, 214 flow [2022-12-13 21:53:58,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 21:53:58,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 21:53:58,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 547 transitions. [2022-12-13 21:53:58,094 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5300387596899225 [2022-12-13 21:53:58,094 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 547 transitions. [2022-12-13 21:53:58,094 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 547 transitions. [2022-12-13 21:53:58,094 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 21:53:58,095 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 547 transitions. [2022-12-13 21:53:58,096 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 136.75) internal successors, (547), 4 states have internal predecessors, (547), 0 states have call successors, (0), 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 21:53:58,097 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 258.0) internal successors, (1290), 5 states have internal predecessors, (1290), 0 states have call successors, (0), 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 21:53:58,097 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 258.0) internal successors, (1290), 5 states have internal predecessors, (1290), 0 states have call successors, (0), 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 21:53:58,097 INFO L175 Difference]: Start difference. First operand has 41 places, 27 transitions, 103 flow. Second operand 4 states and 547 transitions. [2022-12-13 21:53:58,097 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 40 transitions, 214 flow [2022-12-13 21:53:58,099 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 40 transitions, 211 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 21:53:58,099 INFO L231 Difference]: Finished difference. Result has 44 places, 33 transitions, 155 flow [2022-12-13 21:53:58,100 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=258, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=155, PETRI_PLACES=44, PETRI_TRANSITIONS=33} [2022-12-13 21:53:58,100 INFO L288 CegarLoopForPetriNet]: 36 programPoint places, 8 predicate places. [2022-12-13 21:53:58,100 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 33 transitions, 155 flow [2022-12-13 21:53:58,100 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 131.0) internal successors, (655), 5 states have internal predecessors, (655), 0 states have call successors, (0), 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 21:53:58,100 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 21:53:58,101 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:53:58,101 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 21:53:58,101 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 2 more)] === [2022-12-13 21:53:58,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:53:58,101 INFO L85 PathProgramCache]: Analyzing trace with hash 78926895, now seen corresponding path program 2 times [2022-12-13 21:53:58,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:53:58,101 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197358384] [2022-12-13 21:53:58,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:53:58,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:53:58,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:53:58,456 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 21:53:58,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:53:58,456 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197358384] [2022-12-13 21:53:58,457 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197358384] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:53:58,457 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:53:58,457 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 21:53:58,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050163126] [2022-12-13 21:53:58,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:53:58,457 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 21:53:58,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:53:58,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 21:53:58,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 21:53:58,487 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 258 [2022-12-13 21:53:58,488 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 33 transitions, 155 flow. Second operand has 5 states, 5 states have (on average 131.0) internal successors, (655), 5 states have internal predecessors, (655), 0 states have call successors, (0), 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 21:53:58,488 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 21:53:58,488 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 258 [2022-12-13 21:53:58,488 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 21:53:59,319 INFO L130 PetriNetUnfolder]: 4289/6219 cut-off events. [2022-12-13 21:53:59,319 INFO L131 PetriNetUnfolder]: For 5448/5508 co-relation queries the response was YES. [2022-12-13 21:53:59,325 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17750 conditions, 6219 events. 4289/6219 cut-off events. For 5448/5508 co-relation queries the response was YES. Maximal size of possible extension queue 336. Compared 33322 event pairs, 1736 based on Foata normal form. 92/6308 useless extension candidates. Maximal degree in co-relation 17732. Up to 3484 conditions per place. [2022-12-13 21:53:59,335 INFO L137 encePairwiseOnDemand]: 248/258 looper letters, 40 selfloop transitions, 12 changer transitions 0/54 dead transitions. [2022-12-13 21:53:59,335 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 54 transitions, 328 flow [2022-12-13 21:53:59,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 21:53:59,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 21:53:59,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 688 transitions. [2022-12-13 21:53:59,337 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5333333333333333 [2022-12-13 21:53:59,337 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 688 transitions. [2022-12-13 21:53:59,337 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 688 transitions. [2022-12-13 21:53:59,337 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 21:53:59,337 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 688 transitions. [2022-12-13 21:53:59,338 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 137.6) internal successors, (688), 5 states have internal predecessors, (688), 0 states have call successors, (0), 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 21:53:59,339 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 258.0) internal successors, (1548), 6 states have internal predecessors, (1548), 0 states have call successors, (0), 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 21:53:59,339 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 258.0) internal successors, (1548), 6 states have internal predecessors, (1548), 0 states have call successors, (0), 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 21:53:59,339 INFO L175 Difference]: Start difference. First operand has 44 places, 33 transitions, 155 flow. Second operand 5 states and 688 transitions. [2022-12-13 21:53:59,339 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 54 transitions, 328 flow [2022-12-13 21:53:59,343 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 54 transitions, 316 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-12-13 21:53:59,344 INFO L231 Difference]: Finished difference. Result has 47 places, 35 transitions, 191 flow [2022-12-13 21:53:59,344 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=258, PETRI_DIFFERENCE_MINUEND_FLOW=143, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=191, PETRI_PLACES=47, PETRI_TRANSITIONS=35} [2022-12-13 21:53:59,345 INFO L288 CegarLoopForPetriNet]: 36 programPoint places, 11 predicate places. [2022-12-13 21:53:59,345 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 35 transitions, 191 flow [2022-12-13 21:53:59,345 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 131.0) internal successors, (655), 5 states have internal predecessors, (655), 0 states have call successors, (0), 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 21:53:59,345 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 21:53:59,345 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:53:59,345 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 21:53:59,345 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 2 more)] === [2022-12-13 21:53:59,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:53:59,346 INFO L85 PathProgramCache]: Analyzing trace with hash -341698725, now seen corresponding path program 1 times [2022-12-13 21:53:59,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:53:59,346 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357822729] [2022-12-13 21:53:59,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:53:59,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:53:59,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:53:59,520 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 21:53:59,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:53:59,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357822729] [2022-12-13 21:53:59,521 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357822729] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:53:59,521 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:53:59,521 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 21:53:59,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575127455] [2022-12-13 21:53:59,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:53:59,521 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 21:53:59,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:53:59,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 21:53:59,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 21:53:59,534 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 258 [2022-12-13 21:53:59,534 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 35 transitions, 191 flow. Second operand has 4 states, 4 states have (on average 134.75) internal successors, (539), 4 states have internal predecessors, (539), 0 states have call successors, (0), 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 21:53:59,534 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 21:53:59,534 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 258 [2022-12-13 21:53:59,534 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 21:54:00,381 INFO L130 PetriNetUnfolder]: 3912/5814 cut-off events. [2022-12-13 21:54:00,381 INFO L131 PetriNetUnfolder]: For 7021/7238 co-relation queries the response was YES. [2022-12-13 21:54:00,386 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17082 conditions, 5814 events. 3912/5814 cut-off events. For 7021/7238 co-relation queries the response was YES. Maximal size of possible extension queue 390. Compared 33210 event pairs, 754 based on Foata normal form. 645/6444 useless extension candidates. Maximal degree in co-relation 17063. Up to 4081 conditions per place. [2022-12-13 21:54:00,396 INFO L137 encePairwiseOnDemand]: 251/258 looper letters, 50 selfloop transitions, 5 changer transitions 36/95 dead transitions. [2022-12-13 21:54:00,396 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 95 transitions, 656 flow [2022-12-13 21:54:00,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 21:54:00,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 21:54:00,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 715 transitions. [2022-12-13 21:54:00,399 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5542635658914729 [2022-12-13 21:54:00,399 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 715 transitions. [2022-12-13 21:54:00,399 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 715 transitions. [2022-12-13 21:54:00,399 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 21:54:00,400 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 715 transitions. [2022-12-13 21:54:00,401 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 143.0) internal successors, (715), 5 states have internal predecessors, (715), 0 states have call successors, (0), 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 21:54:00,403 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 258.0) internal successors, (1548), 6 states have internal predecessors, (1548), 0 states have call successors, (0), 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 21:54:00,403 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 258.0) internal successors, (1548), 6 states have internal predecessors, (1548), 0 states have call successors, (0), 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 21:54:00,403 INFO L175 Difference]: Start difference. First operand has 47 places, 35 transitions, 191 flow. Second operand 5 states and 715 transitions. [2022-12-13 21:54:00,404 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 95 transitions, 656 flow [2022-12-13 21:54:00,409 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 95 transitions, 618 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-13 21:54:00,410 INFO L231 Difference]: Finished difference. Result has 51 places, 39 transitions, 224 flow [2022-12-13 21:54:00,410 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=258, PETRI_DIFFERENCE_MINUEND_FLOW=175, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=224, PETRI_PLACES=51, PETRI_TRANSITIONS=39} [2022-12-13 21:54:00,411 INFO L288 CegarLoopForPetriNet]: 36 programPoint places, 15 predicate places. [2022-12-13 21:54:00,411 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 39 transitions, 224 flow [2022-12-13 21:54:00,411 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 134.75) internal successors, (539), 4 states have internal predecessors, (539), 0 states have call successors, (0), 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 21:54:00,411 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 21:54:00,411 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:54:00,412 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 21:54:00,412 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 2 more)] === [2022-12-13 21:54:00,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:54:00,412 INFO L85 PathProgramCache]: Analyzing trace with hash -2063837979, now seen corresponding path program 1 times [2022-12-13 21:54:00,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:54:00,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815520508] [2022-12-13 21:54:00,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:54:00,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:54:00,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:54:00,592 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 21:54:00,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:54:00,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815520508] [2022-12-13 21:54:00,593 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [815520508] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:54:00,593 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:54:00,593 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 21:54:00,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300112406] [2022-12-13 21:54:00,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:54:00,593 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 21:54:00,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:54:00,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 21:54:00,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 21:54:00,604 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 258 [2022-12-13 21:54:00,605 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 39 transitions, 224 flow. Second operand has 5 states, 5 states have (on average 134.2) internal successors, (671), 5 states have internal predecessors, (671), 0 states have call successors, (0), 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 21:54:00,606 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 21:54:00,606 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 258 [2022-12-13 21:54:00,606 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 21:54:01,298 INFO L130 PetriNetUnfolder]: 2456/3819 cut-off events. [2022-12-13 21:54:01,298 INFO L131 PetriNetUnfolder]: For 6239/6378 co-relation queries the response was YES. [2022-12-13 21:54:01,302 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14434 conditions, 3819 events. 2456/3819 cut-off events. For 6239/6378 co-relation queries the response was YES. Maximal size of possible extension queue 244. Compared 21528 event pairs, 282 based on Foata normal form. 484/4288 useless extension candidates. Maximal degree in co-relation 14411. Up to 1707 conditions per place. [2022-12-13 21:54:01,310 INFO L137 encePairwiseOnDemand]: 251/258 looper letters, 67 selfloop transitions, 9 changer transitions 38/118 dead transitions. [2022-12-13 21:54:01,310 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 118 transitions, 856 flow [2022-12-13 21:54:01,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 21:54:01,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 21:54:01,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 860 transitions. [2022-12-13 21:54:01,313 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5555555555555556 [2022-12-13 21:54:01,313 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 860 transitions. [2022-12-13 21:54:01,313 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 860 transitions. [2022-12-13 21:54:01,313 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 21:54:01,313 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 860 transitions. [2022-12-13 21:54:01,315 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 143.33333333333334) internal successors, (860), 6 states have internal predecessors, (860), 0 states have call successors, (0), 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 21:54:01,317 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 258.0) internal successors, (1806), 7 states have internal predecessors, (1806), 0 states have call successors, (0), 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 21:54:01,318 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 258.0) internal successors, (1806), 7 states have internal predecessors, (1806), 0 states have call successors, (0), 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 21:54:01,318 INFO L175 Difference]: Start difference. First operand has 51 places, 39 transitions, 224 flow. Second operand 6 states and 860 transitions. [2022-12-13 21:54:01,318 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 118 transitions, 856 flow [2022-12-13 21:54:01,340 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 118 transitions, 847 flow, removed 2 selfloop flow, removed 2 redundant places. [2022-12-13 21:54:01,341 INFO L231 Difference]: Finished difference. Result has 55 places, 43 transitions, 291 flow [2022-12-13 21:54:01,341 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=258, PETRI_DIFFERENCE_MINUEND_FLOW=215, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=291, PETRI_PLACES=55, PETRI_TRANSITIONS=43} [2022-12-13 21:54:01,342 INFO L288 CegarLoopForPetriNet]: 36 programPoint places, 19 predicate places. [2022-12-13 21:54:01,342 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 43 transitions, 291 flow [2022-12-13 21:54:01,342 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 134.2) internal successors, (671), 5 states have internal predecessors, (671), 0 states have call successors, (0), 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 21:54:01,342 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 21:54:01,342 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 21:54:01,342 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 21:54:01,342 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 2 more)] === [2022-12-13 21:54:01,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:54:01,343 INFO L85 PathProgramCache]: Analyzing trace with hash 1525490480, now seen corresponding path program 1 times [2022-12-13 21:54:01,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:54:01,343 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724113884] [2022-12-13 21:54:01,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:54:01,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:54:01,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:54:01,524 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 21:54:01,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:54:01,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724113884] [2022-12-13 21:54:01,524 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724113884] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:54:01,524 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:54:01,524 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 21:54:01,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413976666] [2022-12-13 21:54:01,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:54:01,525 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 21:54:01,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:54:01,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 21:54:01,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-13 21:54:01,539 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 258 [2022-12-13 21:54:01,540 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 43 transitions, 291 flow. Second operand has 6 states, 6 states have (on average 133.83333333333334) internal successors, (803), 6 states have internal predecessors, (803), 0 states have call successors, (0), 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 21:54:01,540 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 21:54:01,540 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 258 [2022-12-13 21:54:01,540 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 21:54:02,155 INFO L130 PetriNetUnfolder]: 1487/2377 cut-off events. [2022-12-13 21:54:02,155 INFO L131 PetriNetUnfolder]: For 5388/5483 co-relation queries the response was YES. [2022-12-13 21:54:02,158 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10307 conditions, 2377 events. 1487/2377 cut-off events. For 5388/5483 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 12685 event pairs, 179 based on Foata normal form. 258/2620 useless extension candidates. Maximal degree in co-relation 10281. Up to 1036 conditions per place. [2022-12-13 21:54:02,162 INFO L137 encePairwiseOnDemand]: 251/258 looper letters, 75 selfloop transitions, 13 changer transitions 35/127 dead transitions. [2022-12-13 21:54:02,162 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 127 transitions, 1018 flow [2022-12-13 21:54:02,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 21:54:02,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 21:54:02,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1003 transitions. [2022-12-13 21:54:02,163 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5553709856035437 [2022-12-13 21:54:02,163 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1003 transitions. [2022-12-13 21:54:02,164 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1003 transitions. [2022-12-13 21:54:02,164 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 21:54:02,164 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1003 transitions. [2022-12-13 21:54:02,165 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 143.28571428571428) internal successors, (1003), 7 states have internal predecessors, (1003), 0 states have call successors, (0), 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 21:54:02,166 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 258.0) internal successors, (2064), 8 states have internal predecessors, (2064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:54:02,167 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 258.0) internal successors, (2064), 8 states have internal predecessors, (2064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:54:02,167 INFO L175 Difference]: Start difference. First operand has 55 places, 43 transitions, 291 flow. Second operand 7 states and 1003 transitions. [2022-12-13 21:54:02,167 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 127 transitions, 1018 flow [2022-12-13 21:54:02,200 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 127 transitions, 952 flow, removed 28 selfloop flow, removed 4 redundant places. [2022-12-13 21:54:02,201 INFO L231 Difference]: Finished difference. Result has 58 places, 45 transitions, 323 flow [2022-12-13 21:54:02,201 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=258, PETRI_DIFFERENCE_MINUEND_FLOW=249, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=323, PETRI_PLACES=58, PETRI_TRANSITIONS=45} [2022-12-13 21:54:02,201 INFO L288 CegarLoopForPetriNet]: 36 programPoint places, 22 predicate places. [2022-12-13 21:54:02,201 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 45 transitions, 323 flow [2022-12-13 21:54:02,202 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 133.83333333333334) internal successors, (803), 6 states have internal predecessors, (803), 0 states have call successors, (0), 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 21:54:02,202 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 21:54:02,202 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 21:54:02,202 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 21:54:02,202 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 2 more)] === [2022-12-13 21:54:02,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:54:02,202 INFO L85 PathProgramCache]: Analyzing trace with hash 1036125819, now seen corresponding path program 1 times [2022-12-13 21:54:02,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:54:02,203 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866813927] [2022-12-13 21:54:02,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:54:02,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:54:02,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:54:02,406 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 21:54:02,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:54:02,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866813927] [2022-12-13 21:54:02,407 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1866813927] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:54:02,407 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:54:02,407 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 21:54:02,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057117261] [2022-12-13 21:54:02,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:54:02,408 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 21:54:02,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:54:02,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 21:54:02,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-13 21:54:02,422 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 258 [2022-12-13 21:54:02,423 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 45 transitions, 323 flow. Second operand has 7 states, 7 states have (on average 133.71428571428572) internal successors, (936), 7 states have internal predecessors, (936), 0 states have call successors, (0), 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 21:54:02,423 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 21:54:02,423 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 258 [2022-12-13 21:54:02,424 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 21:54:02,866 INFO L130 PetriNetUnfolder]: 1173/1853 cut-off events. [2022-12-13 21:54:02,866 INFO L131 PetriNetUnfolder]: For 3751/3833 co-relation queries the response was YES. [2022-12-13 21:54:02,869 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7695 conditions, 1853 events. 1173/1853 cut-off events. For 3751/3833 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 9433 event pairs, 169 based on Foata normal form. 114/1953 useless extension candidates. Maximal degree in co-relation 7668. Up to 700 conditions per place. [2022-12-13 21:54:02,871 INFO L137 encePairwiseOnDemand]: 251/258 looper letters, 61 selfloop transitions, 17 changer transitions 26/106 dead transitions. [2022-12-13 21:54:02,871 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 106 transitions, 859 flow [2022-12-13 21:54:02,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 21:54:02,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 21:54:02,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1124 transitions. [2022-12-13 21:54:02,873 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5445736434108527 [2022-12-13 21:54:02,873 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1124 transitions. [2022-12-13 21:54:02,873 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1124 transitions. [2022-12-13 21:54:02,874 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 21:54:02,874 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1124 transitions. [2022-12-13 21:54:02,875 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 140.5) internal successors, (1124), 8 states have internal predecessors, (1124), 0 states have call successors, (0), 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 21:54:02,876 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 258.0) internal successors, (2322), 9 states have internal predecessors, (2322), 0 states have call successors, (0), 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 21:54:02,877 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 258.0) internal successors, (2322), 9 states have internal predecessors, (2322), 0 states have call successors, (0), 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 21:54:02,877 INFO L175 Difference]: Start difference. First operand has 58 places, 45 transitions, 323 flow. Second operand 8 states and 1124 transitions. [2022-12-13 21:54:02,877 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 106 transitions, 859 flow [2022-12-13 21:54:02,906 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 106 transitions, 772 flow, removed 27 selfloop flow, removed 7 redundant places. [2022-12-13 21:54:02,907 INFO L231 Difference]: Finished difference. Result has 59 places, 41 transitions, 282 flow [2022-12-13 21:54:02,907 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=258, PETRI_DIFFERENCE_MINUEND_FLOW=254, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=282, PETRI_PLACES=59, PETRI_TRANSITIONS=41} [2022-12-13 21:54:02,907 INFO L288 CegarLoopForPetriNet]: 36 programPoint places, 23 predicate places. [2022-12-13 21:54:02,908 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 41 transitions, 282 flow [2022-12-13 21:54:02,908 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 133.71428571428572) internal successors, (936), 7 states have internal predecessors, (936), 0 states have call successors, (0), 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 21:54:02,908 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 21:54:02,908 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, 1, 1, 1] [2022-12-13 21:54:02,908 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 21:54:02,908 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 2 more)] === [2022-12-13 21:54:02,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:54:02,908 INFO L85 PathProgramCache]: Analyzing trace with hash 128136618, now seen corresponding path program 1 times [2022-12-13 21:54:02,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:54:02,909 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299641521] [2022-12-13 21:54:02,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:54:02,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:54:02,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 21:54:02,975 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 21:54:03,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 21:54:03,047 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 21:54:03,047 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 21:54:03,048 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2022-12-13 21:54:03,049 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 5 remaining) [2022-12-13 21:54:03,049 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2022-12-13 21:54:03,049 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2022-12-13 21:54:03,049 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 5 remaining) [2022-12-13 21:54:03,050 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 21:54:03,050 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:54:03,054 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 21:54:03,054 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 21:54:03,100 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 09:54:03 BasicIcfg [2022-12-13 21:54:03,101 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 21:54:03,101 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-13 21:54:03,101 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-13 21:54:03,101 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-13 21:54:03,101 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 09:53:43" (3/4) ... [2022-12-13 21:54:03,103 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-12-13 21:54:03,154 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55411a4a-af07-4a1a-be84-cc9b95b8bd2c/bin/uautomizer-uyxdKDjOR8/witness.graphml [2022-12-13 21:54:03,155 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-13 21:54:03,155 INFO L158 Benchmark]: Toolchain (without parser) took 21195.14ms. Allocated memory was 151.0MB in the beginning and 662.7MB in the end (delta: 511.7MB). Free memory was 111.9MB in the beginning and 279.0MB in the end (delta: -167.1MB). Peak memory consumption was 346.7MB. Max. memory is 16.1GB. [2022-12-13 21:54:03,155 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 151.0MB. Free memory is still 120.3MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 21:54:03,155 INFO L158 Benchmark]: CACSL2BoogieTranslator took 370.93ms. Allocated memory is still 151.0MB. Free memory was 111.4MB in the beginning and 83.1MB in the end (delta: 28.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2022-12-13 21:54:03,156 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.35ms. Allocated memory is still 151.0MB. Free memory was 83.1MB in the beginning and 79.9MB in the end (delta: 3.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 21:54:03,156 INFO L158 Benchmark]: Boogie Preprocessor took 36.54ms. Allocated memory is still 151.0MB. Free memory was 79.9MB in the beginning and 77.4MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 21:54:03,156 INFO L158 Benchmark]: RCFGBuilder took 771.90ms. Allocated memory was 151.0MB in the beginning and 182.5MB in the end (delta: 31.5MB). Free memory was 77.4MB in the beginning and 95.4MB in the end (delta: -18.0MB). Peak memory consumption was 38.5MB. Max. memory is 16.1GB. [2022-12-13 21:54:03,156 INFO L158 Benchmark]: TraceAbstraction took 19918.12ms. Allocated memory was 182.5MB in the beginning and 662.7MB in the end (delta: 480.2MB). Free memory was 95.4MB in the beginning and 296.8MB in the end (delta: -201.4MB). Peak memory consumption was 278.8MB. Max. memory is 16.1GB. [2022-12-13 21:54:03,157 INFO L158 Benchmark]: Witness Printer took 53.76ms. Allocated memory is still 662.7MB. Free memory was 296.8MB in the beginning and 279.0MB in the end (delta: 17.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2022-12-13 21:54:03,158 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.15ms. Allocated memory is still 151.0MB. Free memory is still 120.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 370.93ms. Allocated memory is still 151.0MB. Free memory was 111.4MB in the beginning and 83.1MB in the end (delta: 28.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.35ms. Allocated memory is still 151.0MB. Free memory was 83.1MB in the beginning and 79.9MB in the end (delta: 3.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 36.54ms. Allocated memory is still 151.0MB. Free memory was 79.9MB in the beginning and 77.4MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 771.90ms. Allocated memory was 151.0MB in the beginning and 182.5MB in the end (delta: 31.5MB). Free memory was 77.4MB in the beginning and 95.4MB in the end (delta: -18.0MB). Peak memory consumption was 38.5MB. Max. memory is 16.1GB. * TraceAbstraction took 19918.12ms. Allocated memory was 182.5MB in the beginning and 662.7MB in the end (delta: 480.2MB). Free memory was 95.4MB in the beginning and 296.8MB in the end (delta: -201.4MB). Peak memory consumption was 278.8MB. Max. memory is 16.1GB. * Witness Printer took 53.76ms. Allocated memory is still 662.7MB. Free memory was 296.8MB in the beginning and 279.0MB in the end (delta: 17.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 9.0s, 141 PlacesBefore, 36 PlacesAfterwards, 129 TransitionsBefore, 23 TransitionsAfterwards, 1832 CoEnabledTransitionPairs, 7 FixpointIterations, 63 TrivialSequentialCompositions, 42 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 1 ChoiceCompositions, 109 TotalNumberOfCompositions, 3818 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1562, independent: 1401, independent conditional: 0, independent unconditional: 1401, dependent: 161, dependent conditional: 0, dependent unconditional: 161, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 924, independent: 885, independent conditional: 0, independent unconditional: 885, dependent: 39, dependent conditional: 0, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1562, independent: 516, independent conditional: 0, independent unconditional: 516, dependent: 122, dependent conditional: 0, dependent unconditional: 122, unknown: 924, unknown conditional: 0, unknown unconditional: 924] , Statistics on independence cache: Total cache size (in pairs): 69, Positive cache size: 53, Positive conditional cache size: 0, Positive unconditional cache size: 53, Negative cache size: 16, Negative conditional cache size: 0, Negative unconditional cache size: 16, 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: [L711] 0 int __unbuffered_cnt = 0; [L713] 0 int __unbuffered_p0_EAX = 0; [L714] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L715] 0 int __unbuffered_p0_EAX$mem_tmp; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd3; [L720] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd4; [L721] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L722] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L723] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L724] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd3; [L725] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd4; [L726] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L727] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L728] 0 int __unbuffered_p0_EAX$w_buff0; [L729] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L730] 0 int __unbuffered_p0_EAX$w_buff1; [L731] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L733] 0 int __unbuffered_p2_EAX = 0; [L734] 0 _Bool main$tmp_guard0; [L735] 0 _Bool main$tmp_guard1; [L737] 0 int x = 0; [L739] 0 int y = 0; [L740] 0 _Bool y$flush_delayed; [L741] 0 int y$mem_tmp; [L742] 0 _Bool y$r_buff0_thd0; [L743] 0 _Bool y$r_buff0_thd1; [L744] 0 _Bool y$r_buff0_thd2; [L745] 0 _Bool y$r_buff0_thd3; [L746] 0 _Bool y$r_buff0_thd4; [L747] 0 _Bool y$r_buff1_thd0; [L748] 0 _Bool y$r_buff1_thd1; [L749] 0 _Bool y$r_buff1_thd2; [L750] 0 _Bool y$r_buff1_thd3; [L751] 0 _Bool y$r_buff1_thd4; [L752] 0 _Bool y$read_delayed; [L753] 0 int *y$read_delayed_var; [L754] 0 int y$w_buff0; [L755] 0 _Bool y$w_buff0_used; [L756] 0 int y$w_buff1; [L757] 0 _Bool y$w_buff1_used; [L758] 0 _Bool weak$$choice0; [L759] 0 _Bool weak$$choice1; [L760] 0 _Bool weak$$choice2; [L852] 0 pthread_t t2145; [L853] FCALL, FORK 0 pthread_create(&t2145, ((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_buff0_thd4=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$r_buff1_thd4=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_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2145, ((void *)0), P0, ((void *)0))=-3, t2145={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L764] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L765] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L766] 1 y$flush_delayed = weak$$choice2 [L767] EXPR 1 \read(y) [L767] 1 y$mem_tmp = y [L768] 1 weak$$choice1 = __VERIFIER_nondet_bool() [L769] EXPR 1 !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L769] EXPR 1 \read(y) [L769] EXPR 1 !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L769] 1 y = !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L770] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)))) [L771] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)))) [L772] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 || !weak$$choice1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 : weak$$choice0)))) [L773] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L774] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L775] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$r_buff1_thd1 : (_Bool)0) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L776] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L777] 1 __unbuffered_p0_EAX$read_delayed_var = &y [L778] EXPR 1 \read(y) [L778] 1 __unbuffered_p0_EAX = y [L779] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L779] 1 y = y$flush_delayed ? y$mem_tmp : y [L780] 1 y$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_buff0_thd4=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$r_buff1_thd4=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_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=255, weak$$choice2=255, x=0, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L854] 0 pthread_t t2146; [L855] FCALL, FORK 0 pthread_create(&t2146, ((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_buff0_thd4=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$r_buff1_thd4=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_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2146, ((void *)0), P1, ((void *)0))=-2, t2145={7:0}, t2146={8:0}, weak$$choice0=0, weak$$choice1=255, weak$$choice2=255, x=0, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L783] 1 x = 1 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_buff0_thd4=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$r_buff1_thd4=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_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=255, weak$$choice2=255, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L856] 0 pthread_t t2147; [L795] 2 x = 2 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_buff0_thd4=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$r_buff1_thd4=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_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=255, weak$$choice2=255, x=2, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L857] FCALL, FORK 0 pthread_create(&t2147, ((void *)0), P2, ((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_buff0_thd4=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$r_buff1_thd4=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_p2_EAX=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(&t2147, ((void *)0), P2, ((void *)0))=-1, t2145={7:0}, t2146={8:0}, t2147={9:0}, weak$$choice0=0, weak$$choice1=255, weak$$choice2=255, x=2, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L858] 0 pthread_t t2148; [L807] 3 __unbuffered_p2_EAX = x 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_buff0_thd4=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$r_buff1_thd4=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_p2_EAX=2, 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=0, weak$$choice1=255, weak$$choice2=255, x=2, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L810] 3 y = 1 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_buff0_thd4=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$r_buff1_thd4=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_p2_EAX=2, 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=0, weak$$choice1=255, weak$$choice2=255, x=2, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L813] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L813] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L813] EXPR 3 \read(y) [L813] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L813] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L813] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L814] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L815] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L816] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L817] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 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_buff0_thd4=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$r_buff1_thd4=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_p2_EAX=2, 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=0, weak$$choice1=255, weak$$choice2=255, x=2, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L859] FCALL, FORK 0 pthread_create(&t2148, ((void *)0), P3, ((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_buff0_thd4=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$r_buff1_thd4=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_p2_EAX=2, arg={0: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, pthread_create(&t2148, ((void *)0), P3, ((void *)0))=0, t2145={7:0}, t2146={8:0}, t2147={9:0}, t2148={5:0}, weak$$choice0=0, weak$$choice1=255, weak$$choice2=255, x=2, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L827] 4 y = 2 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_buff0_thd4=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$r_buff1_thd4=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_p2_EAX=2, arg={0:0}, arg={0: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=0, weak$$choice1=255, weak$$choice2=255, x=2, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L830] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L830] EXPR 4 y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y [L830] EXPR 4 \read(y) [L830] EXPR 4 y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y [L830] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L830] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L831] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L832] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L833] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L834] 4 y$r_buff1_thd4 = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 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_buff0_thd4=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$r_buff1_thd4=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_p2_EAX=2, arg={0:0}, arg={0: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=0, weak$$choice1=255, weak$$choice2=255, x=2, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L788] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L790] 1 return 0; [L800] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L802] 2 return 0; [L820] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L822] 3 return 0; [L837] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L839] 4 return 0; [L861] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L863] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L863] RET 0 assume_abort_if_not(main$tmp_guard0) [L865] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L865] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L865] EXPR 0 \read(y) [L865] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L865] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L865] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L866] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L867] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L868] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L869] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __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_buff0_thd4=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$r_buff1_thd4=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_p2_EAX=2, arg={0:0}, arg={0: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, t2145={7:0}, t2146={8:0}, t2147={9:0}, t2148={5:0}, weak$$choice0=0, weak$$choice1=255, weak$$choice2=255, x=2, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L872] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L873] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L874] 0 y$flush_delayed = weak$$choice2 [L875] EXPR 0 \read(y) [L875] 0 y$mem_tmp = y [L876] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L876] EXPR 0 \read(y) [L876] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L876] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L877] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L878] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L879] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L880] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L881] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L882] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L883] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L884] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L884] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L884] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L884] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L884] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L884] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L885] EXPR 0 x == 2 && y == 2 [L885] EXPR 0 \read(y) [L885] EXPR 0 x == 2 && y == 2 [L885] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p0_EAX == 2 && __unbuffered_p2_EAX == 2) [L886] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L886] 0 y = y$flush_delayed ? y$mem_tmp : y [L887] 0 y$flush_delayed = (_Bool)0 [L889] 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}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=2, __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_buff0_thd4=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$r_buff1_thd4=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_p2_EAX=2, arg={0:0}, arg={0: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=2, y={3:0}, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - UnprovableResult [Line: 857]: 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: 859]: 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: 855]: 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: 853]: 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 9 procedures, 180 locations, 5 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: 19.8s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 7.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 9.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 552 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 431 mSDsluCounter, 146 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 104 mSDsCounter, 106 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1139 IncrementalHoareTripleChecker+Invalid, 1245 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 106 mSolverCounterUnsat, 42 mSDtfsCounter, 1139 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 44 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=323occurred in iteration=10, InterpolantAutomatonStates: 50, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 186 NumberOfCodeBlocks, 186 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 152 ConstructedInterpolants, 0 QuantifiedInterpolants, 992 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 21:54:03,175 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55411a4a-af07-4a1a-be84-cc9b95b8bd2c/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