./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix006_tso.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_01bc42e7-863f-44f5-8b22-4b2565850946/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01bc42e7-863f-44f5-8b22-4b2565850946/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_01bc42e7-863f-44f5-8b22-4b2565850946/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01bc42e7-863f-44f5-8b22-4b2565850946/bin/uautomizer-uyxdKDjOR8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix006_tso.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01bc42e7-863f-44f5-8b22-4b2565850946/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_01bc42e7-863f-44f5-8b22-4b2565850946/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 a555daf8b3d43d9709cd95be6561d3a47f75ee906fd0e296710c365eb1f220a2 --- 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 12:56:16,092 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 12:56:16,093 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 12:56:16,105 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 12:56:16,106 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 12:56:16,106 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 12:56:16,107 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 12:56:16,108 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 12:56:16,109 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 12:56:16,110 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 12:56:16,110 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 12:56:16,111 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 12:56:16,111 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 12:56:16,112 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 12:56:16,113 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 12:56:16,113 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 12:56:16,114 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 12:56:16,115 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 12:56:16,115 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 12:56:16,117 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 12:56:16,118 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 12:56:16,119 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 12:56:16,119 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 12:56:16,120 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 12:56:16,122 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 12:56:16,122 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 12:56:16,122 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 12:56:16,123 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 12:56:16,123 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 12:56:16,124 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 12:56:16,124 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 12:56:16,125 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 12:56:16,125 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 12:56:16,126 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 12:56:16,126 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 12:56:16,126 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 12:56:16,127 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 12:56:16,127 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 12:56:16,127 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 12:56:16,127 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 12:56:16,128 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 12:56:16,128 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01bc42e7-863f-44f5-8b22-4b2565850946/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-12-13 12:56:16,142 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 12:56:16,142 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 12:56:16,142 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 12:56:16,142 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 12:56:16,159 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 12:56:16,159 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 12:56:16,160 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 12:56:16,160 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 12:56:16,160 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 12:56:16,161 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 12:56:16,161 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 12:56:16,161 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 12:56:16,161 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 12:56:16,161 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 12:56:16,162 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 12:56:16,162 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 12:56:16,162 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 12:56:16,162 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 12:56:16,162 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 12:56:16,162 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 12:56:16,163 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 12:56:16,163 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 12:56:16,163 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 12:56:16,163 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 12:56:16,163 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 12:56:16,164 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 12:56:16,164 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 12:56:16,164 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 12:56:16,164 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 12:56:16,164 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 12:56:16,164 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 12:56:16,165 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-13 12:56:16,165 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 12:56:16,165 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 12:56:16,165 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 12:56:16,165 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_01bc42e7-863f-44f5-8b22-4b2565850946/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_01bc42e7-863f-44f5-8b22-4b2565850946/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 -> a555daf8b3d43d9709cd95be6561d3a47f75ee906fd0e296710c365eb1f220a2 [2022-12-13 12:56:16,356 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 12:56:16,375 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 12:56:16,377 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 12:56:16,378 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 12:56:16,378 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 12:56:16,380 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01bc42e7-863f-44f5-8b22-4b2565850946/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/pthread-wmm/mix006_tso.oepc.i [2022-12-13 12:56:18,856 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 12:56:19,057 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 12:56:19,057 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01bc42e7-863f-44f5-8b22-4b2565850946/sv-benchmarks/c/pthread-wmm/mix006_tso.oepc.i [2022-12-13 12:56:19,068 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01bc42e7-863f-44f5-8b22-4b2565850946/bin/uautomizer-uyxdKDjOR8/data/2d151a72f/9486349ac3d9446bb9115b980b7c99ad/FLAG6f1f85157 [2022-12-13 12:56:19,437 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01bc42e7-863f-44f5-8b22-4b2565850946/bin/uautomizer-uyxdKDjOR8/data/2d151a72f/9486349ac3d9446bb9115b980b7c99ad [2022-12-13 12:56:19,440 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 12:56:19,442 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 12:56:19,443 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 12:56:19,443 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 12:56:19,449 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 12:56:19,451 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 12:56:19" (1/1) ... [2022-12-13 12:56:19,453 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60d88feb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:56:19, skipping insertion in model container [2022-12-13 12:56:19,453 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 12:56:19" (1/1) ... [2022-12-13 12:56:19,466 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 12:56:19,511 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 12:56:19,667 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_01bc42e7-863f-44f5-8b22-4b2565850946/sv-benchmarks/c/pthread-wmm/mix006_tso.oepc.i[949,962] [2022-12-13 12:56:19,833 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:56:19,834 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:56:19,834 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:56:19,834 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:56:19,835 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:56:19,838 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:56:19,839 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:56:19,839 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:56:19,840 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:56:19,842 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:56:19,842 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:56:19,851 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:56:19,851 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:56:19,858 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:56:19,859 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:56:19,861 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:56:19,861 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:56:19,862 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:56:19,863 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:56:19,864 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:56:19,864 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:56:19,871 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:56:19,871 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:56:19,872 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:56:19,872 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:56:19,875 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:56:19,876 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:56:19,876 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:56:19,883 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:56:19,883 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:56:19,884 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:56:19,887 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:56:19,887 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:56:19,892 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:56:19,894 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 12:56:19,904 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 12:56:19,914 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_01bc42e7-863f-44f5-8b22-4b2565850946/sv-benchmarks/c/pthread-wmm/mix006_tso.oepc.i[949,962] [2022-12-13 12:56:19,933 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:56:19,934 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:56:19,934 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:56:19,935 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:56:19,935 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:56:19,936 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:56:19,937 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:56:19,937 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:56:19,937 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:56:19,938 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:56:19,939 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:56:19,943 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:56:19,943 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:56:19,947 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:56:19,947 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:56:19,949 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:56:19,949 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:56:19,949 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:56:19,950 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:56:19,951 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:56:19,951 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:56:19,955 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:56:19,955 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:56:19,956 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:56:19,956 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:56:19,958 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:56:19,959 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:56:19,959 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:56:19,963 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:56:19,963 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:56:19,964 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:56:19,966 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:56:19,967 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:56:19,970 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:56:19,971 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 12:56:19,999 INFO L208 MainTranslator]: Completed translation [2022-12-13 12:56:19,999 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:56:19 WrapperNode [2022-12-13 12:56:20,000 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 12:56:20,001 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 12:56:20,001 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 12:56:20,001 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 12:56:20,006 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:56:19" (1/1) ... [2022-12-13 12:56:20,023 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:56:19" (1/1) ... [2022-12-13 12:56:20,057 INFO L138 Inliner]: procedures = 176, calls = 59, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 256 [2022-12-13 12:56:20,057 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 12:56:20,058 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 12:56:20,058 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 12:56:20,058 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 12:56:20,066 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:56:19" (1/1) ... [2022-12-13 12:56:20,067 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:56:19" (1/1) ... [2022-12-13 12:56:20,071 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:56:19" (1/1) ... [2022-12-13 12:56:20,071 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:56:19" (1/1) ... [2022-12-13 12:56:20,083 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:56:19" (1/1) ... [2022-12-13 12:56:20,085 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:56:19" (1/1) ... [2022-12-13 12:56:20,089 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:56:19" (1/1) ... [2022-12-13 12:56:20,091 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:56:19" (1/1) ... [2022-12-13 12:56:20,097 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 12:56:20,098 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 12:56:20,098 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 12:56:20,098 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 12:56:20,099 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:56:19" (1/1) ... [2022-12-13 12:56:20,107 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 12:56:20,121 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01bc42e7-863f-44f5-8b22-4b2565850946/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 12:56:20,134 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01bc42e7-863f-44f5-8b22-4b2565850946/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 12:56:20,136 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01bc42e7-863f-44f5-8b22-4b2565850946/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 12:56:20,165 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 12:56:20,165 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 12:56:20,165 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 12:56:20,166 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 12:56:20,166 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 12:56:20,166 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 12:56:20,166 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 12:56:20,166 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 12:56:20,166 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 12:56:20,166 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-13 12:56:20,167 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-13 12:56:20,167 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 12:56:20,167 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 12:56:20,167 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 12:56:20,167 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 12:56:20,169 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 12:56:20,286 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 12:56:20,288 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 12:56:20,660 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 12:56:20,800 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 12:56:20,800 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 12:56:20,802 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 12:56:20 BoogieIcfgContainer [2022-12-13 12:56:20,802 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 12:56:20,804 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 12:56:20,804 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 12:56:20,806 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 12:56:20,806 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 12:56:19" (1/3) ... [2022-12-13 12:56:20,807 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71bd43e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 12:56:20, skipping insertion in model container [2022-12-13 12:56:20,807 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:56:19" (2/3) ... [2022-12-13 12:56:20,807 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71bd43e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 12:56:20, skipping insertion in model container [2022-12-13 12:56:20,807 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 12:56:20" (3/3) ... [2022-12-13 12:56:20,808 INFO L112 eAbstractionObserver]: Analyzing ICFG mix006_tso.oepc.i [2022-12-13 12:56:20,815 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-12-13 12:56:20,823 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 12:56:20,823 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2022-12-13 12:56:20,823 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 12:56:20,872 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 12:56:20,909 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 144 places, 136 transitions, 287 flow [2022-12-13 12:56:20,966 INFO L130 PetriNetUnfolder]: 2/133 cut-off events. [2022-12-13 12:56:20,966 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 12:56:20,971 INFO L83 FinitePrefix]: Finished finitePrefix Result has 143 conditions, 133 events. 2/133 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 63 event pairs, 0 based on Foata normal form. 0/128 useless extension candidates. Maximal degree in co-relation 76. Up to 2 conditions per place. [2022-12-13 12:56:20,971 INFO L82 GeneralOperation]: Start removeDead. Operand has 144 places, 136 transitions, 287 flow [2022-12-13 12:56:20,974 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 141 places, 133 transitions, 275 flow [2022-12-13 12:56:20,977 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-12-13 12:56:20,984 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 141 places, 133 transitions, 275 flow [2022-12-13 12:56:20,986 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 141 places, 133 transitions, 275 flow [2022-12-13 12:56:20,986 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 141 places, 133 transitions, 275 flow [2022-12-13 12:56:21,007 INFO L130 PetriNetUnfolder]: 2/133 cut-off events. [2022-12-13 12:56:21,007 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 12:56:21,007 INFO L83 FinitePrefix]: Finished finitePrefix Result has 143 conditions, 133 events. 2/133 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 63 event pairs, 0 based on Foata normal form. 0/128 useless extension candidates. Maximal degree in co-relation 76. Up to 2 conditions per place. [2022-12-13 12:56:21,008 INFO L119 LiptonReduction]: Number of co-enabled transitions 2386 [2022-12-13 12:56:25,595 INFO L134 LiptonReduction]: Checked pairs total: 6647 [2022-12-13 12:56:25,595 INFO L136 LiptonReduction]: Total number of compositions: 120 [2022-12-13 12:56:25,606 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 12:56:25,611 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;@5e663ae, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 12:56:25,611 INFO L358 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2022-12-13 12:56:25,614 INFO L130 PetriNetUnfolder]: 0/8 cut-off events. [2022-12-13 12:56:25,614 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 12:56:25,614 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:56:25,615 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-12-13 12:56:25,615 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-13 12:56:25,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:56:25,619 INFO L85 PathProgramCache]: Analyzing trace with hash 678681136, now seen corresponding path program 1 times [2022-12-13 12:56:25,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:56:25,626 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432810196] [2022-12-13 12:56:25,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:56:25,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:56:25,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:56:25,966 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 12:56:25,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:56:25,966 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432810196] [2022-12-13 12:56:25,967 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432810196] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:56:25,967 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:56:25,967 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 12:56:25,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602828353] [2022-12-13 12:56:25,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:56:25,974 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 12:56:25,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:56:25,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 12:56:25,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 12:56:25,997 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 256 [2022-12-13 12:56:25,999 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 26 transitions, 61 flow. Second operand has 3 states, 3 states have (on average 118.66666666666667) internal successors, (356), 3 states have internal predecessors, (356), 0 states have call successors, (0), 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 12:56:25,999 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:56:25,999 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 256 [2022-12-13 12:56:26,000 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:56:26,502 INFO L130 PetriNetUnfolder]: 1679/2465 cut-off events. [2022-12-13 12:56:26,502 INFO L131 PetriNetUnfolder]: For 22/22 co-relation queries the response was YES. [2022-12-13 12:56:26,506 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4984 conditions, 2465 events. 1679/2465 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 11874 event pairs, 339 based on Foata normal form. 0/2196 useless extension candidates. Maximal degree in co-relation 4973. Up to 2141 conditions per place. [2022-12-13 12:56:26,513 INFO L137 encePairwiseOnDemand]: 253/256 looper letters, 35 selfloop transitions, 2 changer transitions 0/39 dead transitions. [2022-12-13 12:56:26,513 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 39 transitions, 164 flow [2022-12-13 12:56:26,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 12:56:26,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 12:56:26,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 389 transitions. [2022-12-13 12:56:26,523 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5065104166666666 [2022-12-13 12:56:26,524 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 389 transitions. [2022-12-13 12:56:26,524 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 389 transitions. [2022-12-13 12:56:26,525 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 12:56:26,527 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 389 transitions. [2022-12-13 12:56:26,529 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 129.66666666666666) internal successors, (389), 3 states have internal predecessors, (389), 0 states have call successors, (0), 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 12:56:26,533 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 256.0) internal successors, (1024), 4 states have internal predecessors, (1024), 0 states have call successors, (0), 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 12:56:26,533 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 256.0) internal successors, (1024), 4 states have internal predecessors, (1024), 0 states have call successors, (0), 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 12:56:26,535 INFO L175 Difference]: Start difference. First operand has 36 places, 26 transitions, 61 flow. Second operand 3 states and 389 transitions. [2022-12-13 12:56:26,535 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 39 transitions, 164 flow [2022-12-13 12:56:26,537 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 39 transitions, 160 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-13 12:56:26,538 INFO L231 Difference]: Finished difference. Result has 34 places, 25 transitions, 60 flow [2022-12-13 12:56:26,540 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=256, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=32, 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=60, PETRI_PLACES=34, PETRI_TRANSITIONS=25} [2022-12-13 12:56:26,542 INFO L288 CegarLoopForPetriNet]: 36 programPoint places, -2 predicate places. [2022-12-13 12:56:26,543 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 25 transitions, 60 flow [2022-12-13 12:56:26,543 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 118.66666666666667) internal successors, (356), 3 states have internal predecessors, (356), 0 states have call successors, (0), 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 12:56:26,543 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:56:26,543 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:56:26,543 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 12:56:26,544 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-13 12:56:26,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:56:26,544 INFO L85 PathProgramCache]: Analyzing trace with hash -622395095, now seen corresponding path program 1 times [2022-12-13 12:56:26,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:56:26,544 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172942922] [2022-12-13 12:56:26,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:56:26,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:56:26,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:56:26,637 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 12:56:26,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:56:26,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172942922] [2022-12-13 12:56:26,638 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172942922] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:56:26,638 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:56:26,638 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 12:56:26,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454213619] [2022-12-13 12:56:26,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:56:26,639 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 12:56:26,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:56:26,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 12:56:26,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 12:56:26,641 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 256 [2022-12-13 12:56:26,642 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 25 transitions, 60 flow. Second operand has 3 states, 3 states have (on average 119.33333333333333) internal successors, (358), 3 states have internal predecessors, (358), 0 states have call successors, (0), 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 12:56:26,642 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:56:26,642 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 256 [2022-12-13 12:56:26,643 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:56:27,066 INFO L130 PetriNetUnfolder]: 1393/2171 cut-off events. [2022-12-13 12:56:27,066 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-13 12:56:27,070 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4391 conditions, 2171 events. 1393/2171 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 10792 event pairs, 249 based on Foata normal form. 0/2050 useless extension candidates. Maximal degree in co-relation 4381. Up to 1625 conditions per place. [2022-12-13 12:56:27,077 INFO L137 encePairwiseOnDemand]: 253/256 looper letters, 30 selfloop transitions, 2 changer transitions 2/36 dead transitions. [2022-12-13 12:56:27,077 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 36 transitions, 152 flow [2022-12-13 12:56:27,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 12:56:27,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 12:56:27,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 386 transitions. [2022-12-13 12:56:27,079 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5026041666666666 [2022-12-13 12:56:27,080 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 386 transitions. [2022-12-13 12:56:27,080 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 386 transitions. [2022-12-13 12:56:27,080 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 12:56:27,080 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 386 transitions. [2022-12-13 12:56:27,081 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 128.66666666666666) internal successors, (386), 3 states have internal predecessors, (386), 0 states have call successors, (0), 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 12:56:27,082 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 256.0) internal successors, (1024), 4 states have internal predecessors, (1024), 0 states have call successors, (0), 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 12:56:27,082 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 256.0) internal successors, (1024), 4 states have internal predecessors, (1024), 0 states have call successors, (0), 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 12:56:27,082 INFO L175 Difference]: Start difference. First operand has 34 places, 25 transitions, 60 flow. Second operand 3 states and 386 transitions. [2022-12-13 12:56:27,082 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 36 transitions, 152 flow [2022-12-13 12:56:27,083 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 36 transitions, 146 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 12:56:27,083 INFO L231 Difference]: Finished difference. Result has 33 places, 23 transitions, 56 flow [2022-12-13 12:56:27,083 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=256, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=56, PETRI_PLACES=33, PETRI_TRANSITIONS=23} [2022-12-13 12:56:27,084 INFO L288 CegarLoopForPetriNet]: 36 programPoint places, -3 predicate places. [2022-12-13 12:56:27,084 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 23 transitions, 56 flow [2022-12-13 12:56:27,084 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 119.33333333333333) internal successors, (358), 3 states have internal predecessors, (358), 0 states have call successors, (0), 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 12:56:27,084 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:56:27,084 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:56:27,084 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 12:56:27,085 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-13 12:56:27,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:56:27,085 INFO L85 PathProgramCache]: Analyzing trace with hash -1121156059, now seen corresponding path program 1 times [2022-12-13 12:56:27,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:56:27,085 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431532821] [2022-12-13 12:56:27,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:56:27,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:56:27,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:56:27,562 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 12:56:27,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:56:27,563 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431532821] [2022-12-13 12:56:27,563 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431532821] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:56:27,563 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:56:27,563 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 12:56:27,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242222888] [2022-12-13 12:56:27,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:56:27,564 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 12:56:27,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:56:27,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 12:56:27,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 12:56:27,611 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 256 [2022-12-13 12:56:27,611 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 23 transitions, 56 flow. Second operand has 4 states, 4 states have (on average 111.25) internal successors, (445), 4 states have internal predecessors, (445), 0 states have call successors, (0), 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 12:56:27,612 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:56:27,612 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 256 [2022-12-13 12:56:27,612 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:56:27,953 INFO L130 PetriNetUnfolder]: 1207/1793 cut-off events. [2022-12-13 12:56:27,953 INFO L131 PetriNetUnfolder]: For 80/80 co-relation queries the response was YES. [2022-12-13 12:56:27,955 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3735 conditions, 1793 events. 1207/1793 cut-off events. For 80/80 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 8072 event pairs, 351 based on Foata normal form. 48/1840 useless extension candidates. Maximal degree in co-relation 3725. Up to 1345 conditions per place. [2022-12-13 12:56:27,960 INFO L137 encePairwiseOnDemand]: 253/256 looper letters, 32 selfloop transitions, 2 changer transitions 0/35 dead transitions. [2022-12-13 12:56:27,960 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 35 transitions, 152 flow [2022-12-13 12:56:27,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 12:56:27,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 12:56:27,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 362 transitions. [2022-12-13 12:56:27,961 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4713541666666667 [2022-12-13 12:56:27,961 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 362 transitions. [2022-12-13 12:56:27,961 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 362 transitions. [2022-12-13 12:56:27,962 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 12:56:27,962 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 362 transitions. [2022-12-13 12:56:27,962 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 120.66666666666667) internal successors, (362), 3 states have internal predecessors, (362), 0 states have call successors, (0), 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 12:56:27,964 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 256.0) internal successors, (1024), 4 states have internal predecessors, (1024), 0 states have call successors, (0), 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 12:56:27,964 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 256.0) internal successors, (1024), 4 states have internal predecessors, (1024), 0 states have call successors, (0), 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 12:56:27,964 INFO L175 Difference]: Start difference. First operand has 33 places, 23 transitions, 56 flow. Second operand 3 states and 362 transitions. [2022-12-13 12:56:27,964 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 35 transitions, 152 flow [2022-12-13 12:56:27,965 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 35 transitions, 146 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 12:56:27,965 INFO L231 Difference]: Finished difference. Result has 33 places, 23 transitions, 60 flow [2022-12-13 12:56:27,965 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=256, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=60, PETRI_PLACES=33, PETRI_TRANSITIONS=23} [2022-12-13 12:56:27,966 INFO L288 CegarLoopForPetriNet]: 36 programPoint places, -3 predicate places. [2022-12-13 12:56:27,966 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 23 transitions, 60 flow [2022-12-13 12:56:27,966 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 111.25) internal successors, (445), 4 states have internal predecessors, (445), 0 states have call successors, (0), 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 12:56:27,966 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:56:27,966 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:56:27,966 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 12:56:27,967 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-13 12:56:27,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:56:27,967 INFO L85 PathProgramCache]: Analyzing trace with hash 2121916493, now seen corresponding path program 1 times [2022-12-13 12:56:27,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:56:27,967 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615836654] [2022-12-13 12:56:27,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:56:27,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:56:28,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:56:28,328 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 12:56:28,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:56:28,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615836654] [2022-12-13 12:56:28,328 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1615836654] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:56:28,329 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:56:28,329 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 12:56:28,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097480165] [2022-12-13 12:56:28,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:56:28,329 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 12:56:28,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:56:28,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 12:56:28,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 12:56:28,373 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 256 [2022-12-13 12:56:28,374 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 23 transitions, 60 flow. Second operand has 4 states, 4 states have (on average 111.75) internal successors, (447), 4 states have internal predecessors, (447), 0 states have call successors, (0), 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 12:56:28,374 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:56:28,374 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 256 [2022-12-13 12:56:28,374 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:56:28,662 INFO L130 PetriNetUnfolder]: 1127/1681 cut-off events. [2022-12-13 12:56:28,663 INFO L131 PetriNetUnfolder]: For 149/149 co-relation queries the response was YES. [2022-12-13 12:56:28,664 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3648 conditions, 1681 events. 1127/1681 cut-off events. For 149/149 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 7062 event pairs, 383 based on Foata normal form. 32/1712 useless extension candidates. Maximal degree in co-relation 3637. Up to 1145 conditions per place. [2022-12-13 12:56:28,668 INFO L137 encePairwiseOnDemand]: 253/256 looper letters, 30 selfloop transitions, 2 changer transitions 0/33 dead transitions. [2022-12-13 12:56:28,668 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 33 transitions, 147 flow [2022-12-13 12:56:28,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 12:56:28,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 12:56:28,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 360 transitions. [2022-12-13 12:56:28,670 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.46875 [2022-12-13 12:56:28,670 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 360 transitions. [2022-12-13 12:56:28,671 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 360 transitions. [2022-12-13 12:56:28,671 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 12:56:28,671 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 360 transitions. [2022-12-13 12:56:28,672 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 120.0) internal successors, (360), 3 states have internal predecessors, (360), 0 states have call successors, (0), 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 12:56:28,674 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 256.0) internal successors, (1024), 4 states have internal predecessors, (1024), 0 states have call successors, (0), 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 12:56:28,674 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 256.0) internal successors, (1024), 4 states have internal predecessors, (1024), 0 states have call successors, (0), 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 12:56:28,674 INFO L175 Difference]: Start difference. First operand has 33 places, 23 transitions, 60 flow. Second operand 3 states and 360 transitions. [2022-12-13 12:56:28,674 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 33 transitions, 147 flow [2022-12-13 12:56:28,675 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 33 transitions, 141 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 12:56:28,676 INFO L231 Difference]: Finished difference. Result has 34 places, 23 transitions, 64 flow [2022-12-13 12:56:28,676 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=256, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=64, PETRI_PLACES=34, PETRI_TRANSITIONS=23} [2022-12-13 12:56:28,676 INFO L288 CegarLoopForPetriNet]: 36 programPoint places, -2 predicate places. [2022-12-13 12:56:28,677 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 23 transitions, 64 flow [2022-12-13 12:56:28,677 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 111.75) internal successors, (447), 4 states have internal predecessors, (447), 0 states have call successors, (0), 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 12:56:28,677 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:56:28,677 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:56:28,677 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 12:56:28,677 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-13 12:56:28,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:56:28,678 INFO L85 PathProgramCache]: Analyzing trace with hash -883684704, now seen corresponding path program 1 times [2022-12-13 12:56:28,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:56:28,678 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305678570] [2022-12-13 12:56:28,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:56:28,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:56:28,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:56:28,919 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 12:56:28,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:56:28,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305678570] [2022-12-13 12:56:28,920 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305678570] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:56:28,920 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:56:28,920 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 12:56:28,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732659850] [2022-12-13 12:56:28,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:56:28,921 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 12:56:28,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:56:28,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 12:56:28,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 12:56:28,933 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 256 [2022-12-13 12:56:28,934 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 23 transitions, 64 flow. Second operand has 4 states, 4 states have (on average 113.25) internal successors, (453), 4 states have internal predecessors, (453), 0 states have call successors, (0), 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 12:56:28,934 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:56:28,934 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 256 [2022-12-13 12:56:28,934 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:56:29,206 INFO L130 PetriNetUnfolder]: 737/1200 cut-off events. [2022-12-13 12:56:29,206 INFO L131 PetriNetUnfolder]: For 102/102 co-relation queries the response was YES. [2022-12-13 12:56:29,207 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2704 conditions, 1200 events. 737/1200 cut-off events. For 102/102 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 5566 event pairs, 162 based on Foata normal form. 120/1318 useless extension candidates. Maximal degree in co-relation 2692. Up to 620 conditions per place. [2022-12-13 12:56:29,210 INFO L137 encePairwiseOnDemand]: 250/256 looper letters, 33 selfloop transitions, 4 changer transitions 25/64 dead transitions. [2022-12-13 12:56:29,210 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 64 transitions, 286 flow [2022-12-13 12:56:29,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 12:56:29,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 12:56:29,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 614 transitions. [2022-12-13 12:56:29,213 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4796875 [2022-12-13 12:56:29,213 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 614 transitions. [2022-12-13 12:56:29,213 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 614 transitions. [2022-12-13 12:56:29,213 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 12:56:29,213 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 614 transitions. [2022-12-13 12:56:29,215 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 122.8) internal successors, (614), 5 states have internal predecessors, (614), 0 states have call successors, (0), 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 12:56:29,217 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 256.0) internal successors, (1536), 6 states have internal predecessors, (1536), 0 states have call successors, (0), 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 12:56:29,218 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 256.0) internal successors, (1536), 6 states have internal predecessors, (1536), 0 states have call successors, (0), 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 12:56:29,218 INFO L175 Difference]: Start difference. First operand has 34 places, 23 transitions, 64 flow. Second operand 5 states and 614 transitions. [2022-12-13 12:56:29,218 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 64 transitions, 286 flow [2022-12-13 12:56:29,220 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 64 transitions, 276 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 12:56:29,221 INFO L231 Difference]: Finished difference. Result has 39 places, 26 transitions, 96 flow [2022-12-13 12:56:29,221 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=256, PETRI_DIFFERENCE_MINUEND_FLOW=60, 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=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=96, PETRI_PLACES=39, PETRI_TRANSITIONS=26} [2022-12-13 12:56:29,222 INFO L288 CegarLoopForPetriNet]: 36 programPoint places, 3 predicate places. [2022-12-13 12:56:29,222 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 26 transitions, 96 flow [2022-12-13 12:56:29,222 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 113.25) internal successors, (453), 4 states have internal predecessors, (453), 0 states have call successors, (0), 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 12:56:29,222 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:56:29,222 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:56:29,223 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 12:56:29,223 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-13 12:56:29,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:56:29,223 INFO L85 PathProgramCache]: Analyzing trace with hash 983880507, now seen corresponding path program 1 times [2022-12-13 12:56:29,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:56:29,223 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652521098] [2022-12-13 12:56:29,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:56:29,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:56:29,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:56:29,500 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 12:56:29,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:56:29,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652521098] [2022-12-13 12:56:29,501 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1652521098] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:56:29,501 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:56:29,501 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 12:56:29,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021654244] [2022-12-13 12:56:29,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:56:29,502 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 12:56:29,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:56:29,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 12:56:29,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 12:56:29,520 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 256 [2022-12-13 12:56:29,521 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 26 transitions, 96 flow. Second operand has 5 states, 5 states have (on average 113.2) internal successors, (566), 5 states have internal predecessors, (566), 0 states have call successors, (0), 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 12:56:29,521 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:56:29,521 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 256 [2022-12-13 12:56:29,521 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:56:29,804 INFO L130 PetriNetUnfolder]: 374/662 cut-off events. [2022-12-13 12:56:29,804 INFO L131 PetriNetUnfolder]: For 188/188 co-relation queries the response was YES. [2022-12-13 12:56:29,804 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1816 conditions, 662 events. 374/662 cut-off events. For 188/188 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2854 event pairs, 125 based on Foata normal form. 60/720 useless extension candidates. Maximal degree in co-relation 1801. Up to 219 conditions per place. [2022-12-13 12:56:29,806 INFO L137 encePairwiseOnDemand]: 250/256 looper letters, 44 selfloop transitions, 7 changer transitions 25/78 dead transitions. [2022-12-13 12:56:29,806 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 78 transitions, 404 flow [2022-12-13 12:56:29,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 12:56:29,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 12:56:29,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 738 transitions. [2022-12-13 12:56:29,808 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.48046875 [2022-12-13 12:56:29,808 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 738 transitions. [2022-12-13 12:56:29,808 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 738 transitions. [2022-12-13 12:56:29,808 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 12:56:29,808 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 738 transitions. [2022-12-13 12:56:29,809 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 123.0) internal successors, (738), 6 states have internal predecessors, (738), 0 states have call successors, (0), 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 12:56:29,811 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 256.0) internal successors, (1792), 7 states have internal predecessors, (1792), 0 states have call successors, (0), 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 12:56:29,811 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 256.0) internal successors, (1792), 7 states have internal predecessors, (1792), 0 states have call successors, (0), 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 12:56:29,811 INFO L175 Difference]: Start difference. First operand has 39 places, 26 transitions, 96 flow. Second operand 6 states and 738 transitions. [2022-12-13 12:56:29,811 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 78 transitions, 404 flow [2022-12-13 12:56:29,812 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 78 transitions, 398 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-12-13 12:56:29,813 INFO L231 Difference]: Finished difference. Result has 43 places, 29 transitions, 146 flow [2022-12-13 12:56:29,813 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=256, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=146, PETRI_PLACES=43, PETRI_TRANSITIONS=29} [2022-12-13 12:56:29,813 INFO L288 CegarLoopForPetriNet]: 36 programPoint places, 7 predicate places. [2022-12-13 12:56:29,814 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 29 transitions, 146 flow [2022-12-13 12:56:29,814 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 113.2) internal successors, (566), 5 states have internal predecessors, (566), 0 states have call successors, (0), 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 12:56:29,814 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:56:29,814 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:56:29,814 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 12:56:29,814 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-13 12:56:29,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:56:29,814 INFO L85 PathProgramCache]: Analyzing trace with hash -1477592897, now seen corresponding path program 1 times [2022-12-13 12:56:29,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:56:29,815 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708136332] [2022-12-13 12:56:29,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:56:29,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:56:29,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:56:30,050 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 12:56:30,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:56:30,051 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708136332] [2022-12-13 12:56:30,051 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708136332] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:56:30,051 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:56:30,051 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 12:56:30,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584467904] [2022-12-13 12:56:30,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:56:30,051 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 12:56:30,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:56:30,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 12:56:30,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-13 12:56:30,066 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 256 [2022-12-13 12:56:30,067 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 29 transitions, 146 flow. Second operand has 6 states, 6 states have (on average 113.0) internal successors, (678), 6 states have internal predecessors, (678), 0 states have call successors, (0), 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 12:56:30,067 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:56:30,067 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 256 [2022-12-13 12:56:30,067 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:56:30,298 INFO L130 PetriNetUnfolder]: 260/469 cut-off events. [2022-12-13 12:56:30,298 INFO L131 PetriNetUnfolder]: For 387/387 co-relation queries the response was YES. [2022-12-13 12:56:30,299 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1343 conditions, 469 events. 260/469 cut-off events. For 387/387 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1896 event pairs, 122 based on Foata normal form. 13/480 useless extension candidates. Maximal degree in co-relation 1325. Up to 219 conditions per place. [2022-12-13 12:56:30,300 INFO L137 encePairwiseOnDemand]: 250/256 looper letters, 41 selfloop transitions, 10 changer transitions 13/66 dead transitions. [2022-12-13 12:56:30,300 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 66 transitions, 388 flow [2022-12-13 12:56:30,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 12:56:30,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 12:56:30,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 836 transitions. [2022-12-13 12:56:30,302 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.46651785714285715 [2022-12-13 12:56:30,302 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 836 transitions. [2022-12-13 12:56:30,302 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 836 transitions. [2022-12-13 12:56:30,303 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 12:56:30,303 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 836 transitions. [2022-12-13 12:56:30,304 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 119.42857142857143) internal successors, (836), 7 states have internal predecessors, (836), 0 states have call successors, (0), 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 12:56:30,305 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 256.0) internal successors, (2048), 8 states have internal predecessors, (2048), 0 states have call successors, (0), 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 12:56:30,306 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 256.0) internal successors, (2048), 8 states have internal predecessors, (2048), 0 states have call successors, (0), 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 12:56:30,306 INFO L175 Difference]: Start difference. First operand has 43 places, 29 transitions, 146 flow. Second operand 7 states and 836 transitions. [2022-12-13 12:56:30,306 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 66 transitions, 388 flow [2022-12-13 12:56:30,309 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 66 transitions, 338 flow, removed 16 selfloop flow, removed 6 redundant places. [2022-12-13 12:56:30,310 INFO L231 Difference]: Finished difference. Result has 44 places, 29 transitions, 140 flow [2022-12-13 12:56:30,310 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=256, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=140, PETRI_PLACES=44, PETRI_TRANSITIONS=29} [2022-12-13 12:56:30,311 INFO L288 CegarLoopForPetriNet]: 36 programPoint places, 8 predicate places. [2022-12-13 12:56:30,311 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 29 transitions, 140 flow [2022-12-13 12:56:30,311 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 113.0) internal successors, (678), 6 states have internal predecessors, (678), 0 states have call successors, (0), 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 12:56:30,311 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:56:30,311 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 12:56:30,311 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 12:56:30,312 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-13 12:56:30,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:56:30,312 INFO L85 PathProgramCache]: Analyzing trace with hash 1874053751, now seen corresponding path program 1 times [2022-12-13 12:56:30,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:56:30,312 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762062793] [2022-12-13 12:56:30,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:56:30,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:56:30,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:56:31,026 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 12:56:31,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:56:31,027 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762062793] [2022-12-13 12:56:31,027 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762062793] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:56:31,027 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:56:31,027 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 12:56:31,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503304110] [2022-12-13 12:56:31,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:56:31,028 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 12:56:31,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:56:31,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 12:56:31,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-12-13 12:56:31,097 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 256 [2022-12-13 12:56:31,098 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 29 transitions, 140 flow. Second operand has 8 states, 8 states have (on average 107.875) internal successors, (863), 8 states have internal predecessors, (863), 0 states have call successors, (0), 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 12:56:31,098 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:56:31,098 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 256 [2022-12-13 12:56:31,098 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:56:31,744 INFO L130 PetriNetUnfolder]: 475/815 cut-off events. [2022-12-13 12:56:31,744 INFO L131 PetriNetUnfolder]: For 749/749 co-relation queries the response was YES. [2022-12-13 12:56:31,745 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2233 conditions, 815 events. 475/815 cut-off events. For 749/749 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 3398 event pairs, 33 based on Foata normal form. 1/816 useless extension candidates. Maximal degree in co-relation 2216. Up to 449 conditions per place. [2022-12-13 12:56:31,746 INFO L137 encePairwiseOnDemand]: 248/256 looper letters, 51 selfloop transitions, 10 changer transitions 57/118 dead transitions. [2022-12-13 12:56:31,746 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 118 transitions, 760 flow [2022-12-13 12:56:31,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 12:56:31,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-13 12:56:31,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1357 transitions. [2022-12-13 12:56:31,753 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4417317708333333 [2022-12-13 12:56:31,753 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1357 transitions. [2022-12-13 12:56:31,753 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1357 transitions. [2022-12-13 12:56:31,754 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 12:56:31,754 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1357 transitions. [2022-12-13 12:56:31,756 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 113.08333333333333) internal successors, (1357), 12 states have internal predecessors, (1357), 0 states have call successors, (0), 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 12:56:31,758 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 256.0) internal successors, (3328), 13 states have internal predecessors, (3328), 0 states have call successors, (0), 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 12:56:31,759 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 256.0) internal successors, (3328), 13 states have internal predecessors, (3328), 0 states have call successors, (0), 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 12:56:31,759 INFO L175 Difference]: Start difference. First operand has 44 places, 29 transitions, 140 flow. Second operand 12 states and 1357 transitions. [2022-12-13 12:56:31,759 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 118 transitions, 760 flow [2022-12-13 12:56:31,762 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 118 transitions, 652 flow, removed 24 selfloop flow, removed 6 redundant places. [2022-12-13 12:56:31,762 INFO L231 Difference]: Finished difference. Result has 56 places, 36 transitions, 173 flow [2022-12-13 12:56:31,763 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=256, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=173, PETRI_PLACES=56, PETRI_TRANSITIONS=36} [2022-12-13 12:56:31,763 INFO L288 CegarLoopForPetriNet]: 36 programPoint places, 20 predicate places. [2022-12-13 12:56:31,763 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 36 transitions, 173 flow [2022-12-13 12:56:31,763 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 107.875) internal successors, (863), 8 states have internal predecessors, (863), 0 states have call successors, (0), 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 12:56:31,763 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:56:31,764 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 12:56:31,764 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 12:56:31,764 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-13 12:56:31,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:56:31,764 INFO L85 PathProgramCache]: Analyzing trace with hash 679852933, now seen corresponding path program 2 times [2022-12-13 12:56:31,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:56:31,764 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566783594] [2022-12-13 12:56:31,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:56:31,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:56:31,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:56:33,080 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 12:56:33,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:56:33,081 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566783594] [2022-12-13 12:56:33,081 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1566783594] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:56:33,081 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:56:33,081 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 12:56:33,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519959472] [2022-12-13 12:56:33,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:56:33,082 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 12:56:33,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:56:33,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 12:56:33,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-12-13 12:56:33,201 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 256 [2022-12-13 12:56:33,202 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 36 transitions, 173 flow. Second operand has 10 states, 10 states have (on average 114.2) internal successors, (1142), 10 states have internal predecessors, (1142), 0 states have call successors, (0), 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 12:56:33,203 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:56:33,203 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 256 [2022-12-13 12:56:33,203 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:56:33,778 INFO L130 PetriNetUnfolder]: 433/801 cut-off events. [2022-12-13 12:56:33,778 INFO L131 PetriNetUnfolder]: For 1232/1235 co-relation queries the response was YES. [2022-12-13 12:56:33,779 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2625 conditions, 801 events. 433/801 cut-off events. For 1232/1235 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 3800 event pairs, 12 based on Foata normal form. 1/799 useless extension candidates. Maximal degree in co-relation 2604. Up to 202 conditions per place. [2022-12-13 12:56:33,781 INFO L137 encePairwiseOnDemand]: 247/256 looper letters, 78 selfloop transitions, 15 changer transitions 25/119 dead transitions. [2022-12-13 12:56:33,781 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 119 transitions, 811 flow [2022-12-13 12:56:33,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 12:56:33,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 12:56:33,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 981 transitions. [2022-12-13 12:56:33,783 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.47900390625 [2022-12-13 12:56:33,783 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 981 transitions. [2022-12-13 12:56:33,783 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 981 transitions. [2022-12-13 12:56:33,783 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 12:56:33,783 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 981 transitions. [2022-12-13 12:56:33,784 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 122.625) internal successors, (981), 8 states have internal predecessors, (981), 0 states have call successors, (0), 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 12:56:33,786 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 256.0) internal successors, (2304), 9 states have internal predecessors, (2304), 0 states have call successors, (0), 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 12:56:33,786 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 256.0) internal successors, (2304), 9 states have internal predecessors, (2304), 0 states have call successors, (0), 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 12:56:33,786 INFO L175 Difference]: Start difference. First operand has 56 places, 36 transitions, 173 flow. Second operand 8 states and 981 transitions. [2022-12-13 12:56:33,786 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 119 transitions, 811 flow [2022-12-13 12:56:33,790 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 119 transitions, 779 flow, removed 16 selfloop flow, removed 4 redundant places. [2022-12-13 12:56:33,791 INFO L231 Difference]: Finished difference. Result has 60 places, 45 transitions, 277 flow [2022-12-13 12:56:33,791 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=256, PETRI_DIFFERENCE_MINUEND_FLOW=165, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=277, PETRI_PLACES=60, PETRI_TRANSITIONS=45} [2022-12-13 12:56:33,791 INFO L288 CegarLoopForPetriNet]: 36 programPoint places, 24 predicate places. [2022-12-13 12:56:33,791 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 45 transitions, 277 flow [2022-12-13 12:56:33,792 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 114.2) internal successors, (1142), 10 states have internal predecessors, (1142), 0 states have call successors, (0), 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 12:56:33,792 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:56:33,792 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 12:56:33,792 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 12:56:33,792 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-13 12:56:33,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:56:33,792 INFO L85 PathProgramCache]: Analyzing trace with hash -280821833, now seen corresponding path program 3 times [2022-12-13 12:56:33,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:56:33,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335541357] [2022-12-13 12:56:33,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:56:33,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:56:33,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:56:34,891 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 12:56:34,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:56:34,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335541357] [2022-12-13 12:56:34,891 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335541357] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:56:34,891 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:56:34,892 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 12:56:34,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932460324] [2022-12-13 12:56:34,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:56:34,892 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 12:56:34,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:56:34,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 12:56:34,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-13 12:56:34,916 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 256 [2022-12-13 12:56:34,917 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 45 transitions, 277 flow. Second operand has 7 states, 7 states have (on average 112.0) internal successors, (784), 7 states have internal predecessors, (784), 0 states have call successors, (0), 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 12:56:34,917 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:56:34,917 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 256 [2022-12-13 12:56:34,917 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:56:35,265 INFO L130 PetriNetUnfolder]: 351/681 cut-off events. [2022-12-13 12:56:35,265 INFO L131 PetriNetUnfolder]: For 1236/1239 co-relation queries the response was YES. [2022-12-13 12:56:35,266 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2497 conditions, 681 events. 351/681 cut-off events. For 1236/1239 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 3242 event pairs, 102 based on Foata normal form. 2/668 useless extension candidates. Maximal degree in co-relation 2470. Up to 200 conditions per place. [2022-12-13 12:56:35,267 INFO L137 encePairwiseOnDemand]: 249/256 looper letters, 43 selfloop transitions, 6 changer transitions 40/92 dead transitions. [2022-12-13 12:56:35,267 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 92 transitions, 704 flow [2022-12-13 12:56:35,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 12:56:35,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 12:56:35,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 926 transitions. [2022-12-13 12:56:35,270 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4521484375 [2022-12-13 12:56:35,270 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 926 transitions. [2022-12-13 12:56:35,270 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 926 transitions. [2022-12-13 12:56:35,270 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 12:56:35,270 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 926 transitions. [2022-12-13 12:56:35,272 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 115.75) internal successors, (926), 8 states have internal predecessors, (926), 0 states have call successors, (0), 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 12:56:35,274 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 256.0) internal successors, (2304), 9 states have internal predecessors, (2304), 0 states have call successors, (0), 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 12:56:35,274 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 256.0) internal successors, (2304), 9 states have internal predecessors, (2304), 0 states have call successors, (0), 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 12:56:35,274 INFO L175 Difference]: Start difference. First operand has 60 places, 45 transitions, 277 flow. Second operand 8 states and 926 transitions. [2022-12-13 12:56:35,274 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 92 transitions, 704 flow [2022-12-13 12:56:35,277 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 92 transitions, 693 flow, removed 3 selfloop flow, removed 1 redundant places. [2022-12-13 12:56:35,278 INFO L231 Difference]: Finished difference. Result has 68 places, 39 transitions, 235 flow [2022-12-13 12:56:35,279 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=256, PETRI_DIFFERENCE_MINUEND_FLOW=269, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=235, PETRI_PLACES=68, PETRI_TRANSITIONS=39} [2022-12-13 12:56:35,279 INFO L288 CegarLoopForPetriNet]: 36 programPoint places, 32 predicate places. [2022-12-13 12:56:35,279 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 39 transitions, 235 flow [2022-12-13 12:56:35,280 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 112.0) internal successors, (784), 7 states have internal predecessors, (784), 0 states have call successors, (0), 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 12:56:35,280 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:56:35,280 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 12:56:35,280 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 12:56:35,280 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-13 12:56:35,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:56:35,281 INFO L85 PathProgramCache]: Analyzing trace with hash -1557535525, now seen corresponding path program 4 times [2022-12-13 12:56:35,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:56:35,281 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109143943] [2022-12-13 12:56:35,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:56:35,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:56:35,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 12:56:35,368 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 12:56:35,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 12:56:35,474 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 12:56:35,474 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 12:56:35,474 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (7 of 8 remaining) [2022-12-13 12:56:35,476 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (6 of 8 remaining) [2022-12-13 12:56:35,476 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 8 remaining) [2022-12-13 12:56:35,476 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 8 remaining) [2022-12-13 12:56:35,476 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 8 remaining) [2022-12-13 12:56:35,476 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 8 remaining) [2022-12-13 12:56:35,476 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 8 remaining) [2022-12-13 12:56:35,476 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 8 remaining) [2022-12-13 12:56:35,477 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 12:56:35,477 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:56:35,482 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 12:56:35,482 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 12:56:35,551 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 12:56:35 BasicIcfg [2022-12-13 12:56:35,551 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 12:56:35,551 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-13 12:56:35,551 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-13 12:56:35,551 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-13 12:56:35,552 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 12:56:20" (3/4) ... [2022-12-13 12:56:35,553 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-12-13 12:56:35,633 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01bc42e7-863f-44f5-8b22-4b2565850946/bin/uautomizer-uyxdKDjOR8/witness.graphml [2022-12-13 12:56:35,633 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-13 12:56:35,634 INFO L158 Benchmark]: Toolchain (without parser) took 16192.31ms. Allocated memory was 142.6MB in the beginning and 371.2MB in the end (delta: 228.6MB). Free memory was 105.3MB in the beginning and 194.6MB in the end (delta: -89.3MB). Peak memory consumption was 141.4MB. Max. memory is 16.1GB. [2022-12-13 12:56:35,634 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 142.6MB. Free memory is still 111.1MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 12:56:35,635 INFO L158 Benchmark]: CACSL2BoogieTranslator took 556.59ms. Allocated memory is still 142.6MB. Free memory was 104.9MB in the beginning and 73.6MB in the end (delta: 31.3MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2022-12-13 12:56:35,635 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.85ms. Allocated memory is still 142.6MB. Free memory was 73.6MB in the beginning and 69.4MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-12-13 12:56:35,635 INFO L158 Benchmark]: Boogie Preprocessor took 39.06ms. Allocated memory is still 142.6MB. Free memory was 69.4MB in the beginning and 66.9MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 12:56:35,635 INFO L158 Benchmark]: RCFGBuilder took 704.17ms. Allocated memory was 142.6MB in the beginning and 211.8MB in the end (delta: 69.2MB). Free memory was 66.9MB in the beginning and 130.0MB in the end (delta: -63.2MB). Peak memory consumption was 27.7MB. Max. memory is 16.1GB. [2022-12-13 12:56:35,636 INFO L158 Benchmark]: TraceAbstraction took 14746.95ms. Allocated memory was 211.8MB in the beginning and 371.2MB in the end (delta: 159.4MB). Free memory was 129.0MB in the beginning and 210.3MB in the end (delta: -81.3MB). Peak memory consumption was 78.1MB. Max. memory is 16.1GB. [2022-12-13 12:56:35,636 INFO L158 Benchmark]: Witness Printer took 82.34ms. Allocated memory is still 371.2MB. Free memory was 210.3MB in the beginning and 194.6MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-12-13 12:56:35,637 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.21ms. Allocated memory is still 142.6MB. Free memory is still 111.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 556.59ms. Allocated memory is still 142.6MB. Free memory was 104.9MB in the beginning and 73.6MB in the end (delta: 31.3MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 56.85ms. Allocated memory is still 142.6MB. Free memory was 73.6MB in the beginning and 69.4MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 39.06ms. Allocated memory is still 142.6MB. Free memory was 69.4MB in the beginning and 66.9MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 704.17ms. Allocated memory was 142.6MB in the beginning and 211.8MB in the end (delta: 69.2MB). Free memory was 66.9MB in the beginning and 130.0MB in the end (delta: -63.2MB). Peak memory consumption was 27.7MB. Max. memory is 16.1GB. * TraceAbstraction took 14746.95ms. Allocated memory was 211.8MB in the beginning and 371.2MB in the end (delta: 159.4MB). Free memory was 129.0MB in the beginning and 210.3MB in the end (delta: -81.3MB). Peak memory consumption was 78.1MB. Max. memory is 16.1GB. * Witness Printer took 82.34ms. Allocated memory is still 371.2MB. Free memory was 210.3MB in the beginning and 194.6MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.6s, 141 PlacesBefore, 36 PlacesAfterwards, 133 TransitionsBefore, 26 TransitionsAfterwards, 2386 CoEnabledTransitionPairs, 7 FixpointIterations, 59 TrivialSequentialCompositions, 49 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 10 ConcurrentYvCompositions, 2 ChoiceCompositions, 120 TotalNumberOfCompositions, 6647 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2562, independent: 2351, independent conditional: 0, independent unconditional: 2351, dependent: 211, dependent conditional: 0, dependent unconditional: 211, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1275, independent: 1232, independent conditional: 0, independent unconditional: 1232, dependent: 43, dependent conditional: 0, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2562, independent: 1119, independent conditional: 0, independent unconditional: 1119, dependent: 168, dependent conditional: 0, dependent unconditional: 168, unknown: 1275, unknown conditional: 0, unknown unconditional: 1275] , Statistics on independence cache: Total cache size (in pairs): 88, Positive cache size: 67, Positive conditional cache size: 0, Positive unconditional cache size: 67, Negative cache size: 21, Negative conditional cache size: 0, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p1_EAX = 0; [L713] 0 int __unbuffered_p1_EBX = 0; [L715] 0 int __unbuffered_p2_EAX = 0; [L717] 0 int __unbuffered_p2_EBX = 0; [L718] 0 _Bool main$tmp_guard0; [L719] 0 _Bool main$tmp_guard1; [L721] 0 int x = 0; [L722] 0 _Bool x$flush_delayed; [L723] 0 int x$mem_tmp; [L724] 0 _Bool x$r_buff0_thd0; [L725] 0 _Bool x$r_buff0_thd1; [L726] 0 _Bool x$r_buff0_thd2; [L727] 0 _Bool x$r_buff0_thd3; [L728] 0 _Bool x$r_buff1_thd0; [L729] 0 _Bool x$r_buff1_thd1; [L730] 0 _Bool x$r_buff1_thd2; [L731] 0 _Bool x$r_buff1_thd3; [L732] 0 _Bool x$read_delayed; [L733] 0 int *x$read_delayed_var; [L734] 0 int x$w_buff0; [L735] 0 _Bool x$w_buff0_used; [L736] 0 int x$w_buff1; [L737] 0 _Bool x$w_buff1_used; [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_buff1_thd0; [L747] 0 _Bool y$r_buff1_thd1; [L748] 0 _Bool y$r_buff1_thd2; [L749] 0 _Bool y$r_buff1_thd3; [L750] 0 _Bool y$read_delayed; [L751] 0 int *y$read_delayed_var; [L752] 0 int y$w_buff0; [L753] 0 _Bool y$w_buff0_used; [L754] 0 int y$w_buff1; [L755] 0 _Bool y$w_buff1_used; [L757] 0 int z = 0; [L758] 0 _Bool weak$$choice0; [L759] 0 _Bool weak$$choice2; [L899] 0 pthread_t t171; [L900] FCALL, FORK 0 pthread_create(&t171, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t171, ((void *)0), P0, ((void *)0))=-2, t171={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=0] [L901] 0 pthread_t t172; [L902] FCALL, FORK 0 pthread_create(&t172, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t172, ((void *)0), P1, ((void *)0))=-1, t171={5:0}, t172={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=0] [L783] 2 x$w_buff1 = x$w_buff0 [L784] 2 x$w_buff0 = 2 [L785] 2 x$w_buff1_used = x$w_buff0_used [L786] 2 x$w_buff0_used = (_Bool)1 [L787] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L787] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L788] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L789] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L790] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L791] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L792] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=0] [L903] 0 pthread_t t173; [L795] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L796] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L797] 2 x$flush_delayed = weak$$choice2 [L798] 2 x$mem_tmp = x [L799] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L800] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L801] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L802] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L803] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L804] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L805] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L806] 2 __unbuffered_p1_EAX = x [L807] 2 x = x$flush_delayed ? x$mem_tmp : x [L808] 2 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=0] [L904] FCALL, FORK 0 pthread_create(&t173, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t173, ((void *)0), P2, ((void *)0))=0, t171={5:0}, t172={6:0}, t173={3:0}, weak$$choice0=50, weak$$choice2=255, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=0] [L811] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L812] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L813] 2 y$flush_delayed = weak$$choice2 [L814] 2 y$mem_tmp = y [L815] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L816] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L817] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L818] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L819] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L820] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L821] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L822] 2 __unbuffered_p1_EBX = y [L823] 2 y = y$flush_delayed ? y$mem_tmp : y [L824] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=0] [L841] 3 y$w_buff1 = y$w_buff0 [L842] 3 y$w_buff0 = 1 [L843] 3 y$w_buff1_used = y$w_buff0_used [L844] 3 y$w_buff0_used = (_Bool)1 [L845] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L845] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L846] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L847] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L848] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L849] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L850] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L853] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L854] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L855] 3 y$flush_delayed = weak$$choice2 [L856] 3 y$mem_tmp = y [L857] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L858] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L859] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L860] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L861] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L862] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L863] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L864] 3 __unbuffered_p2_EAX = y [L865] 3 y = y$flush_delayed ? y$mem_tmp : y [L866] 3 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=52, weak$$choice2=255, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L869] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=52, weak$$choice2=255, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L763] 1 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=52, weak$$choice2=255, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L766] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=52, weak$$choice2=255, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L827] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L828] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L829] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L830] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L831] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=52, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L769] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L770] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L771] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L772] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L773] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=52, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L872] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L873] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L874] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L875] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L876] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L877] 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) [L878] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L879] 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 [L880] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L881] 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_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=52, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, 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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L884] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L886] 3 return 0; [L776] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L778] 1 return 0; [L834] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L836] 2 return 0; [L906] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L908] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L908] RET 0 assume_abort_if_not(main$tmp_guard0) [L910] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L911] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L912] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L913] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L914] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L915] 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) [L916] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L917] 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 [L918] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L919] 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}, __unbuffered_cnt=3, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t171={5:0}, t172={6:0}, t173={3:0}, weak$$choice0=52, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, 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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L922] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L923] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L924] 0 x$flush_delayed = weak$$choice2 [L925] 0 x$mem_tmp = x [L926] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L927] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L928] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L929] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L930] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L931] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L932] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L933] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 2 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L934] 0 x = x$flush_delayed ? x$mem_tmp : x [L935] 0 x$flush_delayed = (_Bool)0 [L937] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=1, \old(expression)=0, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, expression=0, expression=1, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, 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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 904]: 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: 900]: 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: 902]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 166 locations, 8 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: 14.6s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 4.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.7s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 659 SdHoareTripleChecker+Valid, 2.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 537 mSDsluCounter, 337 SdHoareTripleChecker+Invalid, 1.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 249 mSDsCounter, 152 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1332 IncrementalHoareTripleChecker+Invalid, 1484 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 152 mSolverCounterUnsat, 88 mSDtfsCounter, 1332 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 51 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=277occurred in iteration=9, InterpolantAutomatonStates: 58, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 4.5s InterpolantComputationTime, 172 NumberOfCodeBlocks, 172 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 139 ConstructedInterpolants, 0 QuantifiedInterpolants, 2151 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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 12:56:35,651 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01bc42e7-863f-44f5-8b22-4b2565850946/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