./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix011_tso.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b8d3ba0-e110-48aa-982c-abf7facf972b/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b8d3ba0-e110-48aa-982c-abf7facf972b/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_2b8d3ba0-e110-48aa-982c-abf7facf972b/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b8d3ba0-e110-48aa-982c-abf7facf972b/bin/uautomizer-uyxdKDjOR8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix011_tso.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b8d3ba0-e110-48aa-982c-abf7facf972b/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_2b8d3ba0-e110-48aa-982c-abf7facf972b/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 a4d86e141dde5935b04f74715dd2fbb14b0de9136d07674e0b6c5447ac95e0ef --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-2329fc7 [2022-12-13 21:29:19,672 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 21:29:19,674 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 21:29:19,694 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 21:29:19,694 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 21:29:19,695 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 21:29:19,696 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 21:29:19,698 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 21:29:19,700 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 21:29:19,701 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 21:29:19,702 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 21:29:19,703 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 21:29:19,703 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 21:29:19,704 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 21:29:19,705 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 21:29:19,706 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 21:29:19,707 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 21:29:19,708 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 21:29:19,710 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 21:29:19,711 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 21:29:19,713 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 21:29:19,714 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 21:29:19,715 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 21:29:19,716 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 21:29:19,720 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 21:29:19,720 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 21:29:19,720 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 21:29:19,721 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 21:29:19,722 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 21:29:19,723 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 21:29:19,723 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 21:29:19,724 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 21:29:19,724 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 21:29:19,725 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 21:29:19,726 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 21:29:19,726 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 21:29:19,727 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 21:29:19,727 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 21:29:19,727 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 21:29:19,728 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 21:29:19,729 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 21:29:19,730 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b8d3ba0-e110-48aa-982c-abf7facf972b/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-12-13 21:29:19,753 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 21:29:19,753 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 21:29:19,753 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 21:29:19,754 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 21:29:19,754 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 21:29:19,755 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 21:29:19,755 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 21:29:19,755 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 21:29:19,756 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 21:29:19,756 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 21:29:19,756 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 21:29:19,756 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 21:29:19,756 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 21:29:19,757 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 21:29:19,757 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 21:29:19,757 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 21:29:19,757 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 21:29:19,757 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 21:29:19,757 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 21:29:19,758 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 21:29:19,758 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 21:29:19,758 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 21:29:19,758 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 21:29:19,758 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 21:29:19,759 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 21:29:19,759 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 21:29:19,759 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 21:29:19,759 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 21:29:19,759 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 21:29:19,760 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 21:29:19,760 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 21:29:19,760 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-13 21:29:19,760 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 21:29:19,760 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 21:29:19,760 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 21:29:19,761 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_2b8d3ba0-e110-48aa-982c-abf7facf972b/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_2b8d3ba0-e110-48aa-982c-abf7facf972b/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 -> a4d86e141dde5935b04f74715dd2fbb14b0de9136d07674e0b6c5447ac95e0ef [2022-12-13 21:29:19,937 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 21:29:19,953 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 21:29:19,956 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 21:29:19,957 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 21:29:19,957 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 21:29:19,959 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b8d3ba0-e110-48aa-982c-abf7facf972b/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/pthread-wmm/mix011_tso.oepc.i [2022-12-13 21:29:22,460 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 21:29:22,666 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 21:29:22,667 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b8d3ba0-e110-48aa-982c-abf7facf972b/sv-benchmarks/c/pthread-wmm/mix011_tso.oepc.i [2022-12-13 21:29:22,676 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b8d3ba0-e110-48aa-982c-abf7facf972b/bin/uautomizer-uyxdKDjOR8/data/daa75c546/136248e6ee4948a4972e14257adfc424/FLAGc811890d2 [2022-12-13 21:29:23,044 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b8d3ba0-e110-48aa-982c-abf7facf972b/bin/uautomizer-uyxdKDjOR8/data/daa75c546/136248e6ee4948a4972e14257adfc424 [2022-12-13 21:29:23,048 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 21:29:23,050 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 21:29:23,052 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 21:29:23,052 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 21:29:23,056 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 21:29:23,057 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 09:29:23" (1/1) ... [2022-12-13 21:29:23,058 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7bb6a828 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:29:23, skipping insertion in model container [2022-12-13 21:29:23,058 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 09:29:23" (1/1) ... [2022-12-13 21:29:23,065 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 21:29:23,092 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 21:29:23,211 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_2b8d3ba0-e110-48aa-982c-abf7facf972b/sv-benchmarks/c/pthread-wmm/mix011_tso.oepc.i[949,962] [2022-12-13 21:29:23,292 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:29:23,292 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:29:23,292 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:29:23,293 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:29:23,293 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:29:23,295 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:29:23,296 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:29:23,296 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:29:23,297 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:29:23,298 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:29:23,298 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:29:23,299 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:29:23,299 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:29:23,299 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:29:23,299 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:29:23,300 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:29:23,300 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:29:23,302 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:29:23,302 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:29:23,303 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:29:23,303 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:29:23,303 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:29:23,304 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:29:23,304 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:29:23,304 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:29:23,304 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:29:23,305 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:29:23,307 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:29:23,307 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:29:23,307 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:29:23,312 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:29:23,313 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:29:23,313 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:29:23,315 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:29:23,315 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:29:23,322 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:29:23,323 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 21:29:23,330 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 21:29:23,339 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_2b8d3ba0-e110-48aa-982c-abf7facf972b/sv-benchmarks/c/pthread-wmm/mix011_tso.oepc.i[949,962] [2022-12-13 21:29:23,357 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:29:23,357 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:29:23,357 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:29:23,358 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:29:23,358 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:29:23,360 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:29:23,360 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:29:23,360 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:29:23,361 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:29:23,362 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:29:23,362 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:29:23,362 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:29:23,362 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:29:23,363 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:29:23,363 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:29:23,363 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:29:23,363 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:29:23,366 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:29:23,366 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:29:23,366 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:29:23,367 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:29:23,367 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:29:23,367 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:29:23,367 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:29:23,368 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:29:23,368 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:29:23,368 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:29:23,370 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:29:23,370 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:29:23,370 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:29:23,373 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:29:23,374 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:29:23,374 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:29:23,376 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:29:23,376 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:29:23,381 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:29:23,382 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 21:29:23,404 INFO L208 MainTranslator]: Completed translation [2022-12-13 21:29:23,404 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:29:23 WrapperNode [2022-12-13 21:29:23,404 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 21:29:23,405 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 21:29:23,405 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 21:29:23,405 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 21:29:23,411 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:29:23" (1/1) ... [2022-12-13 21:29:23,425 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:29:23" (1/1) ... [2022-12-13 21:29:23,450 INFO L138 Inliner]: procedures = 176, calls = 60, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 152 [2022-12-13 21:29:23,451 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 21:29:23,452 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 21:29:23,452 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 21:29:23,452 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 21:29:23,461 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:29:23" (1/1) ... [2022-12-13 21:29:23,462 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:29:23" (1/1) ... [2022-12-13 21:29:23,465 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:29:23" (1/1) ... [2022-12-13 21:29:23,465 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:29:23" (1/1) ... [2022-12-13 21:29:23,473 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:29:23" (1/1) ... [2022-12-13 21:29:23,475 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:29:23" (1/1) ... [2022-12-13 21:29:23,477 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:29:23" (1/1) ... [2022-12-13 21:29:23,478 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:29:23" (1/1) ... [2022-12-13 21:29:23,481 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 21:29:23,482 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 21:29:23,482 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 21:29:23,482 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 21:29:23,483 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:29:23" (1/1) ... [2022-12-13 21:29:23,490 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 21:29:23,501 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b8d3ba0-e110-48aa-982c-abf7facf972b/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 21:29:23,513 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b8d3ba0-e110-48aa-982c-abf7facf972b/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 21:29:23,515 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b8d3ba0-e110-48aa-982c-abf7facf972b/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 21:29:23,550 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 21:29:23,551 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 21:29:23,551 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 21:29:23,551 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 21:29:23,551 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 21:29:23,551 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 21:29:23,551 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 21:29:23,551 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 21:29:23,552 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 21:29:23,552 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-13 21:29:23,552 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-13 21:29:23,552 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 21:29:23,552 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 21:29:23,552 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 21:29:23,552 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 21:29:23,554 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-12-13 21:29:23,664 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 21:29:23,666 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 21:29:23,911 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 21:29:23,996 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 21:29:23,997 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 21:29:23,998 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 09:29:23 BoogieIcfgContainer [2022-12-13 21:29:23,998 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 21:29:24,000 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 21:29:24,000 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 21:29:24,003 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 21:29:24,003 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 09:29:23" (1/3) ... [2022-12-13 21:29:24,003 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42d2f653 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 09:29:24, skipping insertion in model container [2022-12-13 21:29:24,003 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:29:23" (2/3) ... [2022-12-13 21:29:24,004 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42d2f653 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 09:29:24, skipping insertion in model container [2022-12-13 21:29:24,004 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 09:29:23" (3/3) ... [2022-12-13 21:29:24,005 INFO L112 eAbstractionObserver]: Analyzing ICFG mix011_tso.oepc.i [2022-12-13 21:29:24,011 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-12-13 21:29:24,019 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 21:29:24,019 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-13 21:29:24,019 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 21:29:24,069 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 21:29:24,097 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 129 places, 121 transitions, 257 flow [2022-12-13 21:29:24,130 INFO L130 PetriNetUnfolder]: 2/118 cut-off events. [2022-12-13 21:29:24,130 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 21:29:24,134 INFO L83 FinitePrefix]: Finished finitePrefix Result has 128 conditions, 118 events. 2/118 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/114 useless extension candidates. Maximal degree in co-relation 76. Up to 2 conditions per place. [2022-12-13 21:29:24,134 INFO L82 GeneralOperation]: Start removeDead. Operand has 129 places, 121 transitions, 257 flow [2022-12-13 21:29:24,137 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 126 places, 118 transitions, 245 flow [2022-12-13 21:29:24,139 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-12-13 21:29:24,147 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 126 places, 118 transitions, 245 flow [2022-12-13 21:29:24,149 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 126 places, 118 transitions, 245 flow [2022-12-13 21:29:24,149 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 126 places, 118 transitions, 245 flow [2022-12-13 21:29:24,167 INFO L130 PetriNetUnfolder]: 2/118 cut-off events. [2022-12-13 21:29:24,168 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 21:29:24,168 INFO L83 FinitePrefix]: Finished finitePrefix Result has 128 conditions, 118 events. 2/118 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/114 useless extension candidates. Maximal degree in co-relation 76. Up to 2 conditions per place. [2022-12-13 21:29:24,169 INFO L119 LiptonReduction]: Number of co-enabled transitions 2398 [2022-12-13 21:29:27,264 INFO L134 LiptonReduction]: Checked pairs total: 6673 [2022-12-13 21:29:27,264 INFO L136 LiptonReduction]: Total number of compositions: 103 [2022-12-13 21:29:27,275 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 21:29:27,279 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;@64f2a32c, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 21:29:27,279 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-13 21:29:27,281 INFO L130 PetriNetUnfolder]: 0/7 cut-off events. [2022-12-13 21:29:27,282 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 21:29:27,282 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 21:29:27,282 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-12-13 21:29:27,282 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 21:29:27,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:29:27,286 INFO L85 PathProgramCache]: Analyzing trace with hash 489335111, now seen corresponding path program 1 times [2022-12-13 21:29:27,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:29:27,293 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521070058] [2022-12-13 21:29:27,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:29:27,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:29:27,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:29:27,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 21:29:27,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:29:27,559 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521070058] [2022-12-13 21:29:27,559 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [521070058] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:29:27,560 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:29:27,560 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 21:29:27,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024663987] [2022-12-13 21:29:27,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:29:27,568 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 21:29:27,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:29:27,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 21:29:27,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 21:29:27,588 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 224 [2022-12-13 21:29:27,590 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 27 transitions, 63 flow. Second operand has 3 states, 3 states have (on average 108.66666666666667) internal successors, (326), 3 states have internal predecessors, (326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:29:27,590 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 21:29:27,590 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 224 [2022-12-13 21:29:27,591 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 21:29:27,850 INFO L130 PetriNetUnfolder]: 855/1402 cut-off events. [2022-12-13 21:29:27,850 INFO L131 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2022-12-13 21:29:27,854 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2729 conditions, 1402 events. 855/1402 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 7114 event pairs, 237 based on Foata normal form. 0/1325 useless extension candidates. Maximal degree in co-relation 2718. Up to 1027 conditions per place. [2022-12-13 21:29:27,860 INFO L137 encePairwiseOnDemand]: 220/224 looper letters, 29 selfloop transitions, 2 changer transitions 2/38 dead transitions. [2022-12-13 21:29:27,861 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 38 transitions, 154 flow [2022-12-13 21:29:27,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 21:29:27,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 21:29:27,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 357 transitions. [2022-12-13 21:29:27,874 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.53125 [2022-12-13 21:29:27,875 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 357 transitions. [2022-12-13 21:29:27,875 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 357 transitions. [2022-12-13 21:29:27,877 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 21:29:27,879 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 357 transitions. [2022-12-13 21:29:27,882 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 119.0) internal successors, (357), 3 states have internal predecessors, (357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:29:27,887 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 224.0) internal successors, (896), 4 states have internal predecessors, (896), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:29:27,888 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 224.0) internal successors, (896), 4 states have internal predecessors, (896), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:29:27,889 INFO L175 Difference]: Start difference. First operand has 36 places, 27 transitions, 63 flow. Second operand 3 states and 357 transitions. [2022-12-13 21:29:27,890 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 38 transitions, 154 flow [2022-12-13 21:29:27,893 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 38 transitions, 150 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-13 21:29:27,894 INFO L231 Difference]: Finished difference. Result has 34 places, 24 transitions, 58 flow [2022-12-13 21:29:27,896 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=224, 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=58, PETRI_PLACES=34, PETRI_TRANSITIONS=24} [2022-12-13 21:29:27,900 INFO L288 CegarLoopForPetriNet]: 36 programPoint places, -2 predicate places. [2022-12-13 21:29:27,900 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 24 transitions, 58 flow [2022-12-13 21:29:27,900 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 108.66666666666667) internal successors, (326), 3 states have internal predecessors, (326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:29:27,900 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 21:29:27,901 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:29:27,901 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 21:29:27,901 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 21:29:27,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:29:27,902 INFO L85 PathProgramCache]: Analyzing trace with hash -818135757, now seen corresponding path program 1 times [2022-12-13 21:29:27,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:29:27,902 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191649356] [2022-12-13 21:29:27,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:29:27,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:29:27,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:29:28,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 21:29:28,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:29:28,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191649356] [2022-12-13 21:29:28,340 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191649356] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:29:28,340 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:29:28,340 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 21:29:28,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302115662] [2022-12-13 21:29:28,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:29:28,341 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 21:29:28,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:29:28,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 21:29:28,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 21:29:28,399 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 224 [2022-12-13 21:29:28,399 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 24 transitions, 58 flow. Second operand has 5 states, 5 states have (on average 97.0) internal successors, (485), 5 states have internal predecessors, (485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:29:28,399 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 21:29:28,399 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 224 [2022-12-13 21:29:28,399 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 21:29:28,772 INFO L130 PetriNetUnfolder]: 1683/2510 cut-off events. [2022-12-13 21:29:28,772 INFO L131 PetriNetUnfolder]: For 101/101 co-relation queries the response was YES. [2022-12-13 21:29:28,774 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5184 conditions, 2510 events. 1683/2510 cut-off events. For 101/101 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 11942 event pairs, 423 based on Foata normal form. 144/2653 useless extension candidates. Maximal degree in co-relation 5174. Up to 1665 conditions per place. [2022-12-13 21:29:28,779 INFO L137 encePairwiseOnDemand]: 220/224 looper letters, 33 selfloop transitions, 2 changer transitions 22/58 dead transitions. [2022-12-13 21:29:28,780 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 58 transitions, 244 flow [2022-12-13 21:29:28,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 21:29:28,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 21:29:28,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 534 transitions. [2022-12-13 21:29:28,782 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4767857142857143 [2022-12-13 21:29:28,782 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 534 transitions. [2022-12-13 21:29:28,783 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 534 transitions. [2022-12-13 21:29:28,783 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 21:29:28,783 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 534 transitions. [2022-12-13 21:29:28,784 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 106.8) internal successors, (534), 5 states have internal predecessors, (534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:29:28,786 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 224.0) internal successors, (1344), 6 states have internal predecessors, (1344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:29:28,786 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 224.0) internal successors, (1344), 6 states have internal predecessors, (1344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:29:28,786 INFO L175 Difference]: Start difference. First operand has 34 places, 24 transitions, 58 flow. Second operand 5 states and 534 transitions. [2022-12-13 21:29:28,787 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 58 transitions, 244 flow [2022-12-13 21:29:28,787 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 58 transitions, 238 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 21:29:28,788 INFO L231 Difference]: Finished difference. Result has 38 places, 24 transitions, 66 flow [2022-12-13 21:29:28,788 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=224, 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=5, PETRI_FLOW=66, PETRI_PLACES=38, PETRI_TRANSITIONS=24} [2022-12-13 21:29:28,788 INFO L288 CegarLoopForPetriNet]: 36 programPoint places, 2 predicate places. [2022-12-13 21:29:28,788 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 24 transitions, 66 flow [2022-12-13 21:29:28,789 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 97.0) internal successors, (485), 5 states have internal predecessors, (485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:29:28,789 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 21:29:28,789 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:29:28,789 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 21:29:28,789 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 21:29:28,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:29:28,790 INFO L85 PathProgramCache]: Analyzing trace with hash -1144714138, now seen corresponding path program 1 times [2022-12-13 21:29:28,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:29:28,790 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334022223] [2022-12-13 21:29:28,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:29:28,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:29:28,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:29:29,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 21:29:29,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:29:29,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334022223] [2022-12-13 21:29:29,085 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334022223] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:29:29,085 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:29:29,085 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 21:29:29,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966342472] [2022-12-13 21:29:29,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:29:29,086 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 21:29:29,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:29:29,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 21:29:29,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 21:29:29,166 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 224 [2022-12-13 21:29:29,167 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 24 transitions, 66 flow. Second operand has 5 states, 5 states have (on average 97.4) internal successors, (487), 5 states have internal predecessors, (487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:29:29,168 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 21:29:29,168 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 224 [2022-12-13 21:29:29,168 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 21:29:29,472 INFO L130 PetriNetUnfolder]: 1431/2146 cut-off events. [2022-12-13 21:29:29,473 INFO L131 PetriNetUnfolder]: For 437/437 co-relation queries the response was YES. [2022-12-13 21:29:29,475 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4739 conditions, 2146 events. 1431/2146 cut-off events. For 437/437 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 9499 event pairs, 431 based on Foata normal form. 96/2241 useless extension candidates. Maximal degree in co-relation 4726. Up to 1353 conditions per place. [2022-12-13 21:29:29,480 INFO L137 encePairwiseOnDemand]: 220/224 looper letters, 31 selfloop transitions, 2 changer transitions 18/52 dead transitions. [2022-12-13 21:29:29,480 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 52 transitions, 229 flow [2022-12-13 21:29:29,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 21:29:29,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 21:29:29,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 528 transitions. [2022-12-13 21:29:29,482 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4714285714285714 [2022-12-13 21:29:29,482 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 528 transitions. [2022-12-13 21:29:29,482 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 528 transitions. [2022-12-13 21:29:29,482 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 21:29:29,482 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 528 transitions. [2022-12-13 21:29:29,483 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 105.6) internal successors, (528), 5 states have internal predecessors, (528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:29:29,486 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 224.0) internal successors, (1344), 6 states have internal predecessors, (1344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:29:29,487 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 224.0) internal successors, (1344), 6 states have internal predecessors, (1344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:29:29,487 INFO L175 Difference]: Start difference. First operand has 38 places, 24 transitions, 66 flow. Second operand 5 states and 528 transitions. [2022-12-13 21:29:29,488 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 52 transitions, 229 flow [2022-12-13 21:29:29,493 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 52 transitions, 219 flow, removed 2 selfloop flow, removed 4 redundant places. [2022-12-13 21:29:29,494 INFO L231 Difference]: Finished difference. Result has 39 places, 24 transitions, 70 flow [2022-12-13 21:29:29,494 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=224, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=32, 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=5, PETRI_FLOW=70, PETRI_PLACES=39, PETRI_TRANSITIONS=24} [2022-12-13 21:29:29,495 INFO L288 CegarLoopForPetriNet]: 36 programPoint places, 3 predicate places. [2022-12-13 21:29:29,495 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 24 transitions, 70 flow [2022-12-13 21:29:29,495 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 97.4) internal successors, (487), 5 states have internal predecessors, (487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:29:29,495 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 21:29:29,495 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:29:29,496 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 21:29:29,496 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 21:29:29,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:29:29,496 INFO L85 PathProgramCache]: Analyzing trace with hash -670420261, now seen corresponding path program 1 times [2022-12-13 21:29:29,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:29:29,497 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027357566] [2022-12-13 21:29:29,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:29:29,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:29:29,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:29:29,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 21:29:29,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:29:29,870 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027357566] [2022-12-13 21:29:29,870 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027357566] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:29:29,870 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:29:29,870 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 21:29:29,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786693317] [2022-12-13 21:29:29,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:29:29,871 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 21:29:29,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:29:29,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 21:29:29,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 21:29:29,905 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 224 [2022-12-13 21:29:29,906 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 24 transitions, 70 flow. Second operand has 6 states, 6 states have (on average 107.0) internal successors, (642), 6 states have internal predecessors, (642), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:29:29,906 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 21:29:29,906 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 224 [2022-12-13 21:29:29,906 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 21:29:30,180 INFO L130 PetriNetUnfolder]: 703/1212 cut-off events. [2022-12-13 21:29:30,180 INFO L131 PetriNetUnfolder]: For 286/286 co-relation queries the response was YES. [2022-12-13 21:29:30,182 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2580 conditions, 1212 events. 703/1212 cut-off events. For 286/286 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 6332 event pairs, 103 based on Foata normal form. 46/1245 useless extension candidates. Maximal degree in co-relation 2566. Up to 699 conditions per place. [2022-12-13 21:29:30,185 INFO L137 encePairwiseOnDemand]: 217/224 looper letters, 35 selfloop transitions, 5 changer transitions 14/59 dead transitions. [2022-12-13 21:29:30,185 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 59 transitions, 256 flow [2022-12-13 21:29:30,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 21:29:30,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 21:29:30,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 686 transitions. [2022-12-13 21:29:30,187 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5104166666666666 [2022-12-13 21:29:30,187 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 686 transitions. [2022-12-13 21:29:30,187 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 686 transitions. [2022-12-13 21:29:30,187 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 21:29:30,187 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 686 transitions. [2022-12-13 21:29:30,188 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 114.33333333333333) internal successors, (686), 6 states have internal predecessors, (686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:29:30,190 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 224.0) internal successors, (1568), 7 states have internal predecessors, (1568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:29:30,190 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 224.0) internal successors, (1568), 7 states have internal predecessors, (1568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:29:30,190 INFO L175 Difference]: Start difference. First operand has 39 places, 24 transitions, 70 flow. Second operand 6 states and 686 transitions. [2022-12-13 21:29:30,190 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 59 transitions, 256 flow [2022-12-13 21:29:30,192 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 59 transitions, 248 flow, removed 2 selfloop flow, removed 4 redundant places. [2022-12-13 21:29:30,192 INFO L231 Difference]: Finished difference. Result has 41 places, 27 transitions, 100 flow [2022-12-13 21:29:30,192 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=224, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=100, PETRI_PLACES=41, PETRI_TRANSITIONS=27} [2022-12-13 21:29:30,193 INFO L288 CegarLoopForPetriNet]: 36 programPoint places, 5 predicate places. [2022-12-13 21:29:30,193 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 27 transitions, 100 flow [2022-12-13 21:29:30,193 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 107.0) internal successors, (642), 6 states have internal predecessors, (642), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:29:30,193 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 21:29:30,193 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:29:30,193 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 21:29:30,194 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 21:29:30,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:29:30,194 INFO L85 PathProgramCache]: Analyzing trace with hash -2054464192, now seen corresponding path program 1 times [2022-12-13 21:29:30,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:29:30,194 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180729586] [2022-12-13 21:29:30,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:29:30,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:29:30,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:29:30,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 21:29:30,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:29:30,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180729586] [2022-12-13 21:29:30,315 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [180729586] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:29:30,315 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:29:30,315 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 21:29:30,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607256981] [2022-12-13 21:29:30,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:29:30,316 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 21:29:30,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:29:30,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 21:29:30,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 21:29:30,329 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 224 [2022-12-13 21:29:30,330 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 27 transitions, 100 flow. Second operand has 5 states, 5 states have (on average 105.8) internal successors, (529), 5 states have internal predecessors, (529), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:29:30,330 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 21:29:30,330 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 224 [2022-12-13 21:29:30,330 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 21:29:30,689 INFO L130 PetriNetUnfolder]: 1240/2066 cut-off events. [2022-12-13 21:29:30,689 INFO L131 PetriNetUnfolder]: For 1421/1421 co-relation queries the response was YES. [2022-12-13 21:29:30,693 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5561 conditions, 2066 events. 1240/2066 cut-off events. For 1421/1421 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 11316 event pairs, 242 based on Foata normal form. 34/2096 useless extension candidates. Maximal degree in co-relation 5546. Up to 885 conditions per place. [2022-12-13 21:29:30,700 INFO L137 encePairwiseOnDemand]: 220/224 looper letters, 40 selfloop transitions, 2 changer transitions 13/59 dead transitions. [2022-12-13 21:29:30,700 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 59 transitions, 334 flow [2022-12-13 21:29:30,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 21:29:30,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 21:29:30,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 563 transitions. [2022-12-13 21:29:30,703 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5026785714285714 [2022-12-13 21:29:30,703 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 563 transitions. [2022-12-13 21:29:30,703 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 563 transitions. [2022-12-13 21:29:30,703 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 21:29:30,704 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 563 transitions. [2022-12-13 21:29:30,705 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 112.6) internal successors, (563), 5 states have internal predecessors, (563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:29:30,707 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 224.0) internal successors, (1344), 6 states have internal predecessors, (1344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:29:30,707 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 224.0) internal successors, (1344), 6 states have internal predecessors, (1344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:29:30,708 INFO L175 Difference]: Start difference. First operand has 41 places, 27 transitions, 100 flow. Second operand 5 states and 563 transitions. [2022-12-13 21:29:30,708 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 59 transitions, 334 flow [2022-12-13 21:29:30,711 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 59 transitions, 318 flow, removed 2 selfloop flow, removed 3 redundant places. [2022-12-13 21:29:30,712 INFO L231 Difference]: Finished difference. Result has 43 places, 28 transitions, 107 flow [2022-12-13 21:29:30,712 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=224, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=107, PETRI_PLACES=43, PETRI_TRANSITIONS=28} [2022-12-13 21:29:30,713 INFO L288 CegarLoopForPetriNet]: 36 programPoint places, 7 predicate places. [2022-12-13 21:29:30,713 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 28 transitions, 107 flow [2022-12-13 21:29:30,713 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 105.8) internal successors, (529), 5 states have internal predecessors, (529), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:29:30,713 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 21:29:30,713 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:29:30,714 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 21:29:30,714 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 21:29:30,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:29:30,714 INFO L85 PathProgramCache]: Analyzing trace with hash -1777223900, now seen corresponding path program 2 times [2022-12-13 21:29:30,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:29:30,715 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142889415] [2022-12-13 21:29:30,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:29:30,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:29:30,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:29:30,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 21:29:30,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:29:30,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142889415] [2022-12-13 21:29:30,855 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142889415] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:29:30,855 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:29:30,856 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 21:29:30,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63401232] [2022-12-13 21:29:30,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:29:30,856 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 21:29:30,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:29:30,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 21:29:30,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 21:29:30,866 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 224 [2022-12-13 21:29:30,867 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 28 transitions, 107 flow. Second operand has 4 states, 4 states have (on average 105.25) internal successors, (421), 4 states have internal predecessors, (421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:29:30,867 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 21:29:30,867 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 224 [2022-12-13 21:29:30,868 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 21:29:31,062 INFO L130 PetriNetUnfolder]: 752/1303 cut-off events. [2022-12-13 21:29:31,062 INFO L131 PetriNetUnfolder]: For 1287/1301 co-relation queries the response was YES. [2022-12-13 21:29:31,064 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3648 conditions, 1303 events. 752/1303 cut-off events. For 1287/1301 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 7211 event pairs, 154 based on Foata normal form. 114/1366 useless extension candidates. Maximal degree in co-relation 3632. Up to 581 conditions per place. [2022-12-13 21:29:31,066 INFO L137 encePairwiseOnDemand]: 218/224 looper letters, 45 selfloop transitions, 5 changer transitions 1/57 dead transitions. [2022-12-13 21:29:31,066 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 57 transitions, 317 flow [2022-12-13 21:29:31,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 21:29:31,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 21:29:31,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 452 transitions. [2022-12-13 21:29:31,068 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5044642857142857 [2022-12-13 21:29:31,068 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 452 transitions. [2022-12-13 21:29:31,068 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 452 transitions. [2022-12-13 21:29:31,068 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 21:29:31,068 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 452 transitions. [2022-12-13 21:29:31,069 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 113.0) internal successors, (452), 4 states have internal predecessors, (452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:29:31,070 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 224.0) internal successors, (1120), 5 states have internal predecessors, (1120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:29:31,070 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 224.0) internal successors, (1120), 5 states have internal predecessors, (1120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:29:31,070 INFO L175 Difference]: Start difference. First operand has 43 places, 28 transitions, 107 flow. Second operand 4 states and 452 transitions. [2022-12-13 21:29:31,070 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 57 transitions, 317 flow [2022-12-13 21:29:31,072 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 57 transitions, 312 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-12-13 21:29:31,072 INFO L231 Difference]: Finished difference. Result has 45 places, 31 transitions, 138 flow [2022-12-13 21:29:31,073 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=224, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=138, PETRI_PLACES=45, PETRI_TRANSITIONS=31} [2022-12-13 21:29:31,073 INFO L288 CegarLoopForPetriNet]: 36 programPoint places, 9 predicate places. [2022-12-13 21:29:31,073 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 31 transitions, 138 flow [2022-12-13 21:29:31,073 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 105.25) internal successors, (421), 4 states have internal predecessors, (421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:29:31,073 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 21:29:31,073 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:29:31,074 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 21:29:31,074 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 21:29:31,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:29:31,074 INFO L85 PathProgramCache]: Analyzing trace with hash -1525462800, now seen corresponding path program 1 times [2022-12-13 21:29:31,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:29:31,074 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210589275] [2022-12-13 21:29:31,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:29:31,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:29:31,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:29:31,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 21:29:31,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:29:31,197 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210589275] [2022-12-13 21:29:31,197 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210589275] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:29:31,197 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:29:31,197 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 21:29:31,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605039685] [2022-12-13 21:29:31,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:29:31,198 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 21:29:31,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:29:31,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 21:29:31,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 21:29:31,212 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 224 [2022-12-13 21:29:31,213 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 31 transitions, 138 flow. Second operand has 5 states, 5 states have (on average 104.8) internal successors, (524), 5 states have internal predecessors, (524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:29:31,213 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 21:29:31,213 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 224 [2022-12-13 21:29:31,213 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 21:29:31,414 INFO L130 PetriNetUnfolder]: 355/694 cut-off events. [2022-12-13 21:29:31,414 INFO L131 PetriNetUnfolder]: For 756/768 co-relation queries the response was YES. [2022-12-13 21:29:31,415 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2299 conditions, 694 events. 355/694 cut-off events. For 756/768 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 3589 event pairs, 63 based on Foata normal form. 69/747 useless extension candidates. Maximal degree in co-relation 2281. Up to 278 conditions per place. [2022-12-13 21:29:31,417 INFO L137 encePairwiseOnDemand]: 218/224 looper letters, 48 selfloop transitions, 8 changer transitions 5/67 dead transitions. [2022-12-13 21:29:31,417 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 67 transitions, 411 flow [2022-12-13 21:29:31,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 21:29:31,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 21:29:31,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 565 transitions. [2022-12-13 21:29:31,419 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5044642857142857 [2022-12-13 21:29:31,419 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 565 transitions. [2022-12-13 21:29:31,419 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 565 transitions. [2022-12-13 21:29:31,419 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 21:29:31,419 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 565 transitions. [2022-12-13 21:29:31,420 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 113.0) internal successors, (565), 5 states have internal predecessors, (565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:29:31,421 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 224.0) internal successors, (1344), 6 states have internal predecessors, (1344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:29:31,421 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 224.0) internal successors, (1344), 6 states have internal predecessors, (1344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:29:31,421 INFO L175 Difference]: Start difference. First operand has 45 places, 31 transitions, 138 flow. Second operand 5 states and 565 transitions. [2022-12-13 21:29:31,421 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 67 transitions, 411 flow [2022-12-13 21:29:31,422 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 67 transitions, 401 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-12-13 21:29:31,423 INFO L231 Difference]: Finished difference. Result has 49 places, 34 transitions, 178 flow [2022-12-13 21:29:31,423 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=224, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=178, PETRI_PLACES=49, PETRI_TRANSITIONS=34} [2022-12-13 21:29:31,424 INFO L288 CegarLoopForPetriNet]: 36 programPoint places, 13 predicate places. [2022-12-13 21:29:31,424 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 34 transitions, 178 flow [2022-12-13 21:29:31,424 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 104.8) internal successors, (524), 5 states have internal predecessors, (524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:29:31,424 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 21:29:31,424 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:29:31,424 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 21:29:31,424 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 21:29:31,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:29:31,425 INFO L85 PathProgramCache]: Analyzing trace with hash -67653627, now seen corresponding path program 1 times [2022-12-13 21:29:31,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:29:31,425 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068945549] [2022-12-13 21:29:31,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:29:31,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:29:31,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:29:31,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 21:29:31,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:29:31,578 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068945549] [2022-12-13 21:29:31,578 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068945549] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:29:31,578 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:29:31,578 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 21:29:31,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676630467] [2022-12-13 21:29:31,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:29:31,579 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 21:29:31,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:29:31,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 21:29:31,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-13 21:29:31,591 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 224 [2022-12-13 21:29:31,592 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 34 transitions, 178 flow. Second operand has 6 states, 6 states have (on average 104.66666666666667) internal successors, (628), 6 states have internal predecessors, (628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:29:31,592 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 21:29:31,593 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 224 [2022-12-13 21:29:31,593 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 21:29:31,753 INFO L130 PetriNetUnfolder]: 220/454 cut-off events. [2022-12-13 21:29:31,753 INFO L131 PetriNetUnfolder]: For 716/728 co-relation queries the response was YES. [2022-12-13 21:29:31,754 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1611 conditions, 454 events. 220/454 cut-off events. For 716/728 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2168 event pairs, 61 based on Foata normal form. 19/464 useless extension candidates. Maximal degree in co-relation 1591. Up to 160 conditions per place. [2022-12-13 21:29:31,756 INFO L137 encePairwiseOnDemand]: 218/224 looper letters, 36 selfloop transitions, 11 changer transitions 5/57 dead transitions. [2022-12-13 21:29:31,757 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 57 transitions, 376 flow [2022-12-13 21:29:31,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 21:29:31,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 21:29:31,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 658 transitions. [2022-12-13 21:29:31,758 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4895833333333333 [2022-12-13 21:29:31,758 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 658 transitions. [2022-12-13 21:29:31,758 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 658 transitions. [2022-12-13 21:29:31,759 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 21:29:31,759 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 658 transitions. [2022-12-13 21:29:31,760 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 109.66666666666667) internal successors, (658), 6 states have internal predecessors, (658), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:29:31,761 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 224.0) internal successors, (1568), 7 states have internal predecessors, (1568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:29:31,761 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 224.0) internal successors, (1568), 7 states have internal predecessors, (1568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:29:31,761 INFO L175 Difference]: Start difference. First operand has 49 places, 34 transitions, 178 flow. Second operand 6 states and 658 transitions. [2022-12-13 21:29:31,761 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 57 transitions, 376 flow [2022-12-13 21:29:31,763 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 57 transitions, 339 flow, removed 8 selfloop flow, removed 6 redundant places. [2022-12-13 21:29:31,764 INFO L231 Difference]: Finished difference. Result has 50 places, 33 transitions, 174 flow [2022-12-13 21:29:31,764 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=224, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=174, PETRI_PLACES=50, PETRI_TRANSITIONS=33} [2022-12-13 21:29:31,764 INFO L288 CegarLoopForPetriNet]: 36 programPoint places, 14 predicate places. [2022-12-13 21:29:31,765 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 33 transitions, 174 flow [2022-12-13 21:29:31,765 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 104.66666666666667) internal successors, (628), 6 states have internal predecessors, (628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:29:31,765 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 21:29:31,765 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, 1] [2022-12-13 21:29:31,765 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 21:29:31,765 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 21:29:31,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:29:31,766 INFO L85 PathProgramCache]: Analyzing trace with hash 258296191, now seen corresponding path program 1 times [2022-12-13 21:29:31,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:29:31,766 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908266266] [2022-12-13 21:29:31,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:29:31,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:29:31,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:29:32,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 21:29:32,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:29:32,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908266266] [2022-12-13 21:29:32,056 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908266266] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:29:32,056 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:29:32,056 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 21:29:32,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923429794] [2022-12-13 21:29:32,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:29:32,057 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 21:29:32,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:29:32,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 21:29:32,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 21:29:32,114 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 224 [2022-12-13 21:29:32,114 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 33 transitions, 174 flow. Second operand has 6 states, 6 states have (on average 96.83333333333333) internal successors, (581), 6 states have internal predecessors, (581), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:29:32,115 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 21:29:32,115 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 224 [2022-12-13 21:29:32,115 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 21:29:32,402 INFO L130 PetriNetUnfolder]: 393/748 cut-off events. [2022-12-13 21:29:32,402 INFO L131 PetriNetUnfolder]: For 1153/1153 co-relation queries the response was YES. [2022-12-13 21:29:32,403 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2531 conditions, 748 events. 393/748 cut-off events. For 1153/1153 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 3612 event pairs, 98 based on Foata normal form. 1/749 useless extension candidates. Maximal degree in co-relation 2512. Up to 459 conditions per place. [2022-12-13 21:29:32,404 INFO L137 encePairwiseOnDemand]: 216/224 looper letters, 39 selfloop transitions, 3 changer transitions 42/85 dead transitions. [2022-12-13 21:29:32,404 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 85 transitions, 604 flow [2022-12-13 21:29:32,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 21:29:32,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 21:29:32,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 714 transitions. [2022-12-13 21:29:32,407 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.45535714285714285 [2022-12-13 21:29:32,407 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 714 transitions. [2022-12-13 21:29:32,407 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 714 transitions. [2022-12-13 21:29:32,408 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 21:29:32,408 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 714 transitions. [2022-12-13 21:29:32,409 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 102.0) internal successors, (714), 7 states have internal predecessors, (714), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:29:32,412 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 224.0) internal successors, (1792), 8 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 21:29:32,412 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 224.0) internal successors, (1792), 8 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 21:29:32,413 INFO L175 Difference]: Start difference. First operand has 50 places, 33 transitions, 174 flow. Second operand 7 states and 714 transitions. [2022-12-13 21:29:32,413 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 85 transitions, 604 flow [2022-12-13 21:29:32,417 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 85 transitions, 451 flow, removed 31 selfloop flow, removed 11 redundant places. [2022-12-13 21:29:32,418 INFO L231 Difference]: Finished difference. Result has 49 places, 33 transitions, 129 flow [2022-12-13 21:29:32,418 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=224, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=129, PETRI_PLACES=49, PETRI_TRANSITIONS=33} [2022-12-13 21:29:32,419 INFO L288 CegarLoopForPetriNet]: 36 programPoint places, 13 predicate places. [2022-12-13 21:29:32,419 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 33 transitions, 129 flow [2022-12-13 21:29:32,419 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 96.83333333333333) internal successors, (581), 6 states have internal predecessors, (581), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:29:32,420 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 21:29:32,420 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, 1] [2022-12-13 21:29:32,420 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 21:29:32,420 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 21:29:32,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:29:32,420 INFO L85 PathProgramCache]: Analyzing trace with hash 2032072693, now seen corresponding path program 2 times [2022-12-13 21:29:32,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:29:32,421 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208909333] [2022-12-13 21:29:32,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:29:32,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:29:32,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 21:29:32,468 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 21:29:32,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 21:29:32,531 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 21:29:32,531 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 21:29:32,531 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-13 21:29:32,533 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-12-13 21:29:32,533 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-13 21:29:32,533 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-12-13 21:29:32,533 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-12-13 21:29:32,533 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-13 21:29:32,533 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 21:29:32,534 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1] [2022-12-13 21:29:32,538 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 21:29:32,538 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 21:29:32,577 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 09:29:32 BasicIcfg [2022-12-13 21:29:32,577 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 21:29:32,577 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-13 21:29:32,577 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-13 21:29:32,578 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-13 21:29:32,578 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 09:29:23" (3/4) ... [2022-12-13 21:29:32,579 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-12-13 21:29:32,625 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b8d3ba0-e110-48aa-982c-abf7facf972b/bin/uautomizer-uyxdKDjOR8/witness.graphml [2022-12-13 21:29:32,625 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-13 21:29:32,625 INFO L158 Benchmark]: Toolchain (without parser) took 9575.86ms. Allocated memory was 113.2MB in the beginning and 205.5MB in the end (delta: 92.3MB). Free memory was 62.9MB in the beginning and 137.3MB in the end (delta: -74.4MB). Peak memory consumption was 18.1MB. Max. memory is 16.1GB. [2022-12-13 21:29:32,626 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 113.2MB. Free memory is still 84.1MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 21:29:32,626 INFO L158 Benchmark]: CACSL2BoogieTranslator took 353.11ms. Allocated memory was 113.2MB in the beginning and 169.9MB in the end (delta: 56.6MB). Free memory was 62.9MB in the beginning and 123.1MB in the end (delta: -60.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-12-13 21:29:32,626 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.93ms. Allocated memory is still 169.9MB. Free memory was 123.1MB in the beginning and 121.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 21:29:32,626 INFO L158 Benchmark]: Boogie Preprocessor took 29.91ms. Allocated memory is still 169.9MB. Free memory was 121.0MB in the beginning and 118.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 21:29:32,626 INFO L158 Benchmark]: RCFGBuilder took 516.41ms. Allocated memory is still 169.9MB. Free memory was 118.9MB in the beginning and 84.5MB in the end (delta: 34.4MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2022-12-13 21:29:32,627 INFO L158 Benchmark]: TraceAbstraction took 8576.93ms. Allocated memory was 169.9MB in the beginning and 205.5MB in the end (delta: 35.7MB). Free memory was 83.3MB in the beginning and 147.8MB in the end (delta: -64.5MB). Peak memory consumption was 72.0MB. Max. memory is 16.1GB. [2022-12-13 21:29:32,627 INFO L158 Benchmark]: Witness Printer took 47.62ms. Allocated memory is still 205.5MB. Free memory was 147.8MB in the beginning and 137.3MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-12-13 21:29:32,628 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.14ms. Allocated memory is still 113.2MB. Free memory is still 84.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 353.11ms. Allocated memory was 113.2MB in the beginning and 169.9MB in the end (delta: 56.6MB). Free memory was 62.9MB in the beginning and 123.1MB in the end (delta: -60.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.93ms. Allocated memory is still 169.9MB. Free memory was 123.1MB in the beginning and 121.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 29.91ms. Allocated memory is still 169.9MB. Free memory was 121.0MB in the beginning and 118.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 516.41ms. Allocated memory is still 169.9MB. Free memory was 118.9MB in the beginning and 84.5MB in the end (delta: 34.4MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 8576.93ms. Allocated memory was 169.9MB in the beginning and 205.5MB in the end (delta: 35.7MB). Free memory was 83.3MB in the beginning and 147.8MB in the end (delta: -64.5MB). Peak memory consumption was 72.0MB. Max. memory is 16.1GB. * Witness Printer took 47.62ms. Allocated memory is still 205.5MB. Free memory was 147.8MB in the beginning and 137.3MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.1s, 126 PlacesBefore, 36 PlacesAfterwards, 118 TransitionsBefore, 27 TransitionsAfterwards, 2398 CoEnabledTransitionPairs, 7 FixpointIterations, 44 TrivialSequentialCompositions, 50 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 1 ChoiceCompositions, 103 TotalNumberOfCompositions, 6673 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3380, independent: 3172, independent conditional: 0, independent unconditional: 3172, dependent: 208, dependent conditional: 0, dependent unconditional: 208, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1354, independent: 1314, independent conditional: 0, independent unconditional: 1314, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3380, independent: 1858, independent conditional: 0, independent unconditional: 1858, dependent: 168, dependent conditional: 0, dependent unconditional: 168, unknown: 1354, unknown conditional: 0, unknown unconditional: 1354] , Statistics on independence cache: Total cache size (in pairs): 96, Positive cache size: 82, Positive conditional cache size: 0, Positive unconditional cache size: 82, Negative cache size: 14, Negative conditional cache size: 0, Negative unconditional cache size: 14, 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; [L719] 0 int a = 0; [L720] 0 _Bool main$tmp_guard0; [L721] 0 _Bool main$tmp_guard1; [L723] 0 int x = 0; [L724] 0 _Bool x$flush_delayed; [L725] 0 int x$mem_tmp; [L726] 0 _Bool x$r_buff0_thd0; [L727] 0 _Bool x$r_buff0_thd1; [L728] 0 _Bool x$r_buff0_thd2; [L729] 0 _Bool x$r_buff0_thd3; [L730] 0 _Bool x$r_buff1_thd0; [L731] 0 _Bool x$r_buff1_thd1; [L732] 0 _Bool x$r_buff1_thd2; [L733] 0 _Bool x$r_buff1_thd3; [L734] 0 _Bool x$read_delayed; [L735] 0 int *x$read_delayed_var; [L736] 0 int x$w_buff0; [L737] 0 _Bool x$w_buff0_used; [L738] 0 int x$w_buff1; [L739] 0 _Bool x$w_buff1_used; [L741] 0 int y = 0; [L743] 0 int z = 0; [L744] 0 _Bool weak$$choice0; [L745] 0 _Bool weak$$choice2; [L835] 0 pthread_t t299; [L836] FCALL, FORK 0 pthread_create(&t299, ((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, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t299, ((void *)0), P0, ((void *)0))=-3, t299={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, z=0] [L837] 0 pthread_t t300; [L838] FCALL, FORK 0 pthread_create(&t300, ((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, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t300, ((void *)0), P1, ((void *)0))=-2, t299={5:0}, t300={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, z=0] [L839] 0 pthread_t t301; [L840] FCALL, FORK 0 pthread_create(&t301, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t301, ((void *)0), P2, ((void *)0))=-1, t299={5:0}, t300={6:0}, t301={3: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, z=0] [L769] 2 x$w_buff1 = x$w_buff0 [L770] 2 x$w_buff0 = 2 [L771] 2 x$w_buff1_used = x$w_buff0_used [L772] 2 x$w_buff0_used = (_Bool)1 [L773] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L773] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L774] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L775] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L776] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L777] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L778] 2 x$r_buff0_thd2 = (_Bool)1 [L781] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$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=1, z=0] [L784] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$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=1, z=0] [L787] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$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=1, z=0] [L804] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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=1, z=1] [L807] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=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=1, z=1] [L810] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=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=1, z=1] [L749] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0: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=1, z=1] [L752] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0: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=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=1, z=1] [L755] 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) [L756] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L757] 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 [L758] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L759] 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=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0: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=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=1, z=1] [L762] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L764] 1 return 0; [L790] 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) [L791] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L792] 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 [L793] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L794] 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 [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, 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, z=1] [L813] 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) [L814] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L815] 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 [L816] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L817] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0: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=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, z=1] [L797] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L799] 2 return 0; [L820] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L822] 3 return 0; [L842] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t299={5:0}, t300={6:0}, t301={3:0}, weak$$choice0=0, weak$$choice2=0, 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, z=1] [L844] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L844] RET 0 assume_abort_if_not(main$tmp_guard0) [L846] 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) [L847] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L848] 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 [L849] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L850] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t299={5:0}, t300={6:0}, t301={3:0}, weak$$choice0=0, weak$$choice2=0, 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, z=1] [L853] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L854] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L855] 0 x$flush_delayed = weak$$choice2 [L856] 0 x$mem_tmp = x [L857] 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) [L858] 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)) [L859] 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)) [L860] 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)) [L861] 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)) [L862] 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)) [L863] 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)) [L864] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L865] 0 x = x$flush_delayed ? x$mem_tmp : x [L866] 0 x$flush_delayed = (_Bool)0 [L868] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, 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, 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: 836]: 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: 840]: 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: 838]: 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, 151 locations, 6 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: 8.4s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 595 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 476 mSDsluCounter, 300 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 222 mSDsCounter, 77 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 952 IncrementalHoareTripleChecker+Invalid, 1029 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 77 mSolverCounterUnsat, 78 mSDtfsCounter, 952 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 48 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=178occurred in iteration=7, InterpolantAutomatonStates: 46, 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.2s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 158 NumberOfCodeBlocks, 158 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 125 ConstructedInterpolants, 0 QuantifiedInterpolants, 1001 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-13 21:29:32,642 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b8d3ba0-e110-48aa-982c-abf7facf972b/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