./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/rfi010.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b8f2f70-acda-4de3-816f-a5d098c888b1/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b8f2f70-acda-4de3-816f-a5d098c888b1/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_8b8f2f70-acda-4de3-816f-a5d098c888b1/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b8f2f70-acda-4de3-816f-a5d098c888b1/bin/uautomizer-uyxdKDjOR8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/rfi010.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b8f2f70-acda-4de3-816f-a5d098c888b1/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_8b8f2f70-acda-4de3-816f-a5d098c888b1/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 582aea72bf150e6792f444cf029a22a25cb033a365b198fc215f246088fb4d39 --- 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 16:05:20,352 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 16:05:20,354 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 16:05:20,372 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 16:05:20,373 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 16:05:20,374 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 16:05:20,375 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 16:05:20,376 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 16:05:20,378 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 16:05:20,379 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 16:05:20,380 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 16:05:20,381 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 16:05:20,381 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 16:05:20,382 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 16:05:20,383 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 16:05:20,384 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 16:05:20,385 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 16:05:20,386 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 16:05:20,387 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 16:05:20,389 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 16:05:20,391 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 16:05:20,392 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 16:05:20,393 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 16:05:20,394 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 16:05:20,397 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 16:05:20,397 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 16:05:20,398 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 16:05:20,398 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 16:05:20,399 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 16:05:20,400 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 16:05:20,400 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 16:05:20,401 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 16:05:20,401 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 16:05:20,402 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 16:05:20,403 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 16:05:20,403 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 16:05:20,404 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 16:05:20,404 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 16:05:20,404 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 16:05:20,405 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 16:05:20,405 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 16:05:20,406 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b8f2f70-acda-4de3-816f-a5d098c888b1/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-12-13 16:05:20,425 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 16:05:20,425 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 16:05:20,426 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 16:05:20,426 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 16:05:20,426 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 16:05:20,427 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 16:05:20,427 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 16:05:20,427 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 16:05:20,428 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 16:05:20,428 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 16:05:20,428 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 16:05:20,428 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 16:05:20,428 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 16:05:20,429 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 16:05:20,429 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 16:05:20,429 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 16:05:20,429 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 16:05:20,429 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 16:05:20,430 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 16:05:20,430 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 16:05:20,430 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 16:05:20,430 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 16:05:20,430 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 16:05:20,430 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 16:05:20,431 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 16:05:20,431 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 16:05:20,431 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 16:05:20,431 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 16:05:20,431 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 16:05:20,432 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 16:05:20,432 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 16:05:20,432 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-13 16:05:20,432 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 16:05:20,432 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 16:05:20,432 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 16:05:20,433 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_8b8f2f70-acda-4de3-816f-a5d098c888b1/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_8b8f2f70-acda-4de3-816f-a5d098c888b1/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 -> 582aea72bf150e6792f444cf029a22a25cb033a365b198fc215f246088fb4d39 [2022-12-13 16:05:20,606 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 16:05:20,625 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 16:05:20,628 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 16:05:20,629 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 16:05:20,629 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 16:05:20,630 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b8f2f70-acda-4de3-816f-a5d098c888b1/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/pthread-wmm/rfi010.i [2022-12-13 16:05:23,174 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 16:05:23,373 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 16:05:23,374 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b8f2f70-acda-4de3-816f-a5d098c888b1/sv-benchmarks/c/pthread-wmm/rfi010.i [2022-12-13 16:05:23,385 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b8f2f70-acda-4de3-816f-a5d098c888b1/bin/uautomizer-uyxdKDjOR8/data/5d25d7870/aa265fa2291548df84b26525bec127be/FLAG9ca02d622 [2022-12-13 16:05:23,396 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b8f2f70-acda-4de3-816f-a5d098c888b1/bin/uautomizer-uyxdKDjOR8/data/5d25d7870/aa265fa2291548df84b26525bec127be [2022-12-13 16:05:23,398 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 16:05:23,399 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 16:05:23,400 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 16:05:23,400 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 16:05:23,403 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 16:05:23,404 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 04:05:23" (1/1) ... [2022-12-13 16:05:23,405 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4991ed10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:05:23, skipping insertion in model container [2022-12-13 16:05:23,405 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 04:05:23" (1/1) ... [2022-12-13 16:05:23,410 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 16:05:23,437 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 16:05:23,560 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_8b8f2f70-acda-4de3-816f-a5d098c888b1/sv-benchmarks/c/pthread-wmm/rfi010.i[983,996] [2022-12-13 16:05:23,675 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:05:23,676 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:05:23,676 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:05:23,676 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:05:23,676 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:05:23,686 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:05:23,686 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:05:23,687 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:05:23,687 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:05:23,687 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:05:23,689 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:05:23,690 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:05:23,691 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:05:23,699 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:05:23,699 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:05:23,700 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:05:23,700 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:05:23,702 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:05:23,703 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:05:23,703 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:05:23,708 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:05:23,709 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:05:23,709 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:05:23,712 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:05:23,712 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:05:23,712 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:05:23,713 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 16:05:23,723 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 16:05:23,734 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_8b8f2f70-acda-4de3-816f-a5d098c888b1/sv-benchmarks/c/pthread-wmm/rfi010.i[983,996] [2022-12-13 16:05:23,756 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:05:23,756 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:05:23,756 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:05:23,757 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:05:23,757 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:05:23,764 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:05:23,764 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:05:23,764 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:05:23,764 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:05:23,764 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:05:23,765 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:05:23,766 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:05:23,766 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:05:23,771 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:05:23,771 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:05:23,772 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:05:23,772 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:05:23,774 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:05:23,775 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:05:23,775 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:05:23,778 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:05:23,778 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:05:23,779 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:05:23,781 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:05:23,781 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:05:23,782 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:05:23,782 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 16:05:23,808 INFO L208 MainTranslator]: Completed translation [2022-12-13 16:05:23,808 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:05:23 WrapperNode [2022-12-13 16:05:23,808 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 16:05:23,809 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 16:05:23,810 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 16:05:23,810 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 16:05:23,817 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:05:23" (1/1) ... [2022-12-13 16:05:23,830 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:05:23" (1/1) ... [2022-12-13 16:05:23,852 INFO L138 Inliner]: procedures = 175, calls = 45, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 132 [2022-12-13 16:05:23,853 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 16:05:23,853 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 16:05:23,853 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 16:05:23,854 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 16:05:23,863 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:05:23" (1/1) ... [2022-12-13 16:05:23,863 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:05:23" (1/1) ... [2022-12-13 16:05:23,866 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:05:23" (1/1) ... [2022-12-13 16:05:23,867 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:05:23" (1/1) ... [2022-12-13 16:05:23,873 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:05:23" (1/1) ... [2022-12-13 16:05:23,875 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:05:23" (1/1) ... [2022-12-13 16:05:23,877 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:05:23" (1/1) ... [2022-12-13 16:05:23,879 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:05:23" (1/1) ... [2022-12-13 16:05:23,882 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 16:05:23,883 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 16:05:23,883 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 16:05:23,883 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 16:05:23,884 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:05:23" (1/1) ... [2022-12-13 16:05:23,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 16:05:23,901 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b8f2f70-acda-4de3-816f-a5d098c888b1/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 16:05:23,912 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b8f2f70-acda-4de3-816f-a5d098c888b1/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 16:05:23,914 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b8f2f70-acda-4de3-816f-a5d098c888b1/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 16:05:23,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 16:05:23,944 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 16:05:23,945 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 16:05:23,945 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 16:05:23,945 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 16:05:23,945 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 16:05:23,945 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 16:05:23,945 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 16:05:23,945 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 16:05:23,945 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 16:05:23,945 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 16:05:23,945 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 16:05:23,945 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 16:05:23,946 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 16:05:24,051 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 16:05:24,052 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 16:05:24,297 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 16:05:24,408 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 16:05:24,408 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 16:05:24,410 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 04:05:24 BoogieIcfgContainer [2022-12-13 16:05:24,410 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 16:05:24,411 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 16:05:24,411 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 16:05:24,414 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 16:05:24,414 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 04:05:23" (1/3) ... [2022-12-13 16:05:24,414 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6580458a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 04:05:24, skipping insertion in model container [2022-12-13 16:05:24,414 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:05:23" (2/3) ... [2022-12-13 16:05:24,415 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6580458a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 04:05:24, skipping insertion in model container [2022-12-13 16:05:24,415 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 04:05:24" (3/3) ... [2022-12-13 16:05:24,416 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi010.i [2022-12-13 16:05:24,422 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-12-13 16:05:24,430 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 16:05:24,430 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-13 16:05:24,430 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 16:05:24,458 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 16:05:24,484 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 101 places, 96 transitions, 202 flow [2022-12-13 16:05:24,512 INFO L130 PetriNetUnfolder]: 2/94 cut-off events. [2022-12-13 16:05:24,512 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 16:05:24,516 INFO L83 FinitePrefix]: Finished finitePrefix Result has 101 conditions, 94 events. 2/94 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 44 event pairs, 0 based on Foata normal form. 0/90 useless extension candidates. Maximal degree in co-relation 55. Up to 2 conditions per place. [2022-12-13 16:05:24,517 INFO L82 GeneralOperation]: Start removeDead. Operand has 101 places, 96 transitions, 202 flow [2022-12-13 16:05:24,519 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 99 places, 94 transitions, 194 flow [2022-12-13 16:05:24,522 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-12-13 16:05:24,530 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 99 places, 94 transitions, 194 flow [2022-12-13 16:05:24,532 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 99 places, 94 transitions, 194 flow [2022-12-13 16:05:24,532 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 99 places, 94 transitions, 194 flow [2022-12-13 16:05:24,548 INFO L130 PetriNetUnfolder]: 2/94 cut-off events. [2022-12-13 16:05:24,548 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 16:05:24,548 INFO L83 FinitePrefix]: Finished finitePrefix Result has 101 conditions, 94 events. 2/94 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 44 event pairs, 0 based on Foata normal form. 0/90 useless extension candidates. Maximal degree in co-relation 55. Up to 2 conditions per place. [2022-12-13 16:05:24,549 INFO L119 LiptonReduction]: Number of co-enabled transitions 1122 [2022-12-13 16:05:26,792 INFO L134 LiptonReduction]: Checked pairs total: 2862 [2022-12-13 16:05:26,793 INFO L136 LiptonReduction]: Total number of compositions: 89 [2022-12-13 16:05:26,805 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 16:05:26,810 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;@23f9cf6e, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 16:05:26,810 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-12-13 16:05:26,814 INFO L130 PetriNetUnfolder]: 0/8 cut-off events. [2022-12-13 16:05:26,814 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 16:05:26,814 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 16:05:26,815 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-12-13 16:05:26,815 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 16:05:26,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:05:26,819 INFO L85 PathProgramCache]: Analyzing trace with hash 428645525, now seen corresponding path program 1 times [2022-12-13 16:05:26,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:05:26,827 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406906987] [2022-12-13 16:05:26,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:05:26,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:05:26,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:05:27,107 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 16:05:27,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:05:27,108 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406906987] [2022-12-13 16:05:27,109 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406906987] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:05:27,109 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:05:27,109 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 16:05:27,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277160484] [2022-12-13 16:05:27,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:05:27,118 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 16:05:27,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:05:27,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 16:05:27,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 16:05:27,139 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 185 [2022-12-13 16:05:27,141 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 18 transitions, 42 flow. Second operand has 3 states, 3 states have (on average 85.66666666666667) internal successors, (257), 3 states have internal predecessors, (257), 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 16:05:27,141 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 16:05:27,141 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 185 [2022-12-13 16:05:27,142 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 16:05:27,233 INFO L130 PetriNetUnfolder]: 142/271 cut-off events. [2022-12-13 16:05:27,233 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-13 16:05:27,234 INFO L83 FinitePrefix]: Finished finitePrefix Result has 536 conditions, 271 events. 142/271 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1001 event pairs, 18 based on Foata normal form. 0/251 useless extension candidates. Maximal degree in co-relation 526. Up to 205 conditions per place. [2022-12-13 16:05:27,235 INFO L137 encePairwiseOnDemand]: 181/185 looper letters, 18 selfloop transitions, 2 changer transitions 2/23 dead transitions. [2022-12-13 16:05:27,235 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 23 transitions, 96 flow [2022-12-13 16:05:27,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 16:05:27,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 16:05:27,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 277 transitions. [2022-12-13 16:05:27,245 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4990990990990991 [2022-12-13 16:05:27,246 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 277 transitions. [2022-12-13 16:05:27,246 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 277 transitions. [2022-12-13 16:05:27,247 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 16:05:27,249 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 277 transitions. [2022-12-13 16:05:27,251 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 92.33333333333333) internal successors, (277), 3 states have internal predecessors, (277), 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 16:05:27,254 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 185.0) internal successors, (740), 4 states have internal predecessors, (740), 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 16:05:27,254 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 185.0) internal successors, (740), 4 states have internal predecessors, (740), 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 16:05:27,256 INFO L175 Difference]: Start difference. First operand has 24 places, 18 transitions, 42 flow. Second operand 3 states and 277 transitions. [2022-12-13 16:05:27,257 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 23 transitions, 96 flow [2022-12-13 16:05:27,258 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 23 places, 23 transitions, 94 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 16:05:27,259 INFO L231 Difference]: Finished difference. Result has 23 places, 15 transitions, 38 flow [2022-12-13 16:05:27,260 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=185, PETRI_DIFFERENCE_MINUEND_FLOW=36, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=16, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=38, PETRI_PLACES=23, PETRI_TRANSITIONS=15} [2022-12-13 16:05:27,263 INFO L288 CegarLoopForPetriNet]: 24 programPoint places, -1 predicate places. [2022-12-13 16:05:27,263 INFO L495 AbstractCegarLoop]: Abstraction has has 23 places, 15 transitions, 38 flow [2022-12-13 16:05:27,263 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 85.66666666666667) internal successors, (257), 3 states have internal predecessors, (257), 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 16:05:27,263 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 16:05:27,263 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:05:27,264 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 16:05:27,264 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 16:05:27,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:05:27,264 INFO L85 PathProgramCache]: Analyzing trace with hash -388440076, now seen corresponding path program 1 times [2022-12-13 16:05:27,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:05:27,264 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057627935] [2022-12-13 16:05:27,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:05:27,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:05:27,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:05:27,380 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 16:05:27,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:05:27,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057627935] [2022-12-13 16:05:27,381 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2057627935] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:05:27,381 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:05:27,381 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 16:05:27,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009926578] [2022-12-13 16:05:27,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:05:27,382 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 16:05:27,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:05:27,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 16:05:27,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 16:05:27,386 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 185 [2022-12-13 16:05:27,386 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 15 transitions, 38 flow. Second operand has 3 states, 3 states have (on average 86.33333333333333) internal successors, (259), 3 states have internal predecessors, (259), 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 16:05:27,386 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 16:05:27,386 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 185 [2022-12-13 16:05:27,386 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 16:05:27,461 INFO L130 PetriNetUnfolder]: 97/190 cut-off events. [2022-12-13 16:05:27,461 INFO L131 PetriNetUnfolder]: For 9/9 co-relation queries the response was YES. [2022-12-13 16:05:27,462 INFO L83 FinitePrefix]: Finished finitePrefix Result has 394 conditions, 190 events. 97/190 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 607 event pairs, 37 based on Foata normal form. 8/198 useless extension candidates. Maximal degree in co-relation 384. Up to 117 conditions per place. [2022-12-13 16:05:27,463 INFO L137 encePairwiseOnDemand]: 182/185 looper letters, 17 selfloop transitions, 2 changer transitions 0/20 dead transitions. [2022-12-13 16:05:27,463 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 24 places, 20 transitions, 86 flow [2022-12-13 16:05:27,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 16:05:27,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 16:05:27,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 272 transitions. [2022-12-13 16:05:27,465 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4900900900900901 [2022-12-13 16:05:27,465 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 272 transitions. [2022-12-13 16:05:27,465 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 272 transitions. [2022-12-13 16:05:27,466 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 16:05:27,466 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 272 transitions. [2022-12-13 16:05:27,467 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 90.66666666666667) internal successors, (272), 3 states have internal predecessors, (272), 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 16:05:27,468 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 185.0) internal successors, (740), 4 states have internal predecessors, (740), 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 16:05:27,469 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 185.0) internal successors, (740), 4 states have internal predecessors, (740), 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 16:05:27,469 INFO L175 Difference]: Start difference. First operand has 23 places, 15 transitions, 38 flow. Second operand 3 states and 272 transitions. [2022-12-13 16:05:27,469 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 24 places, 20 transitions, 86 flow [2022-12-13 16:05:27,470 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 22 places, 20 transitions, 82 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 16:05:27,470 INFO L231 Difference]: Finished difference. Result has 23 places, 15 transitions, 42 flow [2022-12-13 16:05:27,470 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=185, PETRI_DIFFERENCE_MINUEND_FLOW=34, PETRI_DIFFERENCE_MINUEND_PLACES=20, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=15, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=42, PETRI_PLACES=23, PETRI_TRANSITIONS=15} [2022-12-13 16:05:27,471 INFO L288 CegarLoopForPetriNet]: 24 programPoint places, -1 predicate places. [2022-12-13 16:05:27,471 INFO L495 AbstractCegarLoop]: Abstraction has has 23 places, 15 transitions, 42 flow [2022-12-13 16:05:27,471 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 86.33333333333333) internal successors, (259), 3 states have internal predecessors, (259), 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 16:05:27,471 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 16:05:27,472 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:05:27,472 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 16:05:27,472 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 16:05:27,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:05:27,472 INFO L85 PathProgramCache]: Analyzing trace with hash 369193743, now seen corresponding path program 1 times [2022-12-13 16:05:27,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:05:27,473 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277455514] [2022-12-13 16:05:27,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:05:27,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:05:27,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:05:27,673 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 16:05:27,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:05:27,674 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277455514] [2022-12-13 16:05:27,674 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277455514] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:05:27,674 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:05:27,674 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 16:05:27,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479473190] [2022-12-13 16:05:27,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:05:27,675 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 16:05:27,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:05:27,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 16:05:27,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 16:05:27,685 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 185 [2022-12-13 16:05:27,686 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 15 transitions, 42 flow. Second operand has 4 states, 4 states have (on average 83.25) internal successors, (333), 4 states have internal predecessors, (333), 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 16:05:27,686 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 16:05:27,686 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 185 [2022-12-13 16:05:27,686 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 16:05:27,791 INFO L130 PetriNetUnfolder]: 60/134 cut-off events. [2022-12-13 16:05:27,791 INFO L131 PetriNetUnfolder]: For 8/8 co-relation queries the response was YES. [2022-12-13 16:05:27,791 INFO L83 FinitePrefix]: Finished finitePrefix Result has 306 conditions, 134 events. 60/134 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 431 event pairs, 13 based on Foata normal form. 20/154 useless extension candidates. Maximal degree in co-relation 295. Up to 60 conditions per place. [2022-12-13 16:05:27,792 INFO L137 encePairwiseOnDemand]: 180/185 looper letters, 20 selfloop transitions, 3 changer transitions 15/39 dead transitions. [2022-12-13 16:05:27,792 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 39 transitions, 177 flow [2022-12-13 16:05:27,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 16:05:27,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 16:05:27,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 445 transitions. [2022-12-13 16:05:27,794 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4810810810810811 [2022-12-13 16:05:27,794 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 445 transitions. [2022-12-13 16:05:27,794 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 445 transitions. [2022-12-13 16:05:27,795 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 16:05:27,795 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 445 transitions. [2022-12-13 16:05:27,796 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 89.0) internal successors, (445), 5 states have internal predecessors, (445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:05:27,797 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 185.0) internal successors, (1110), 6 states have internal predecessors, (1110), 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 16:05:27,798 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 185.0) internal successors, (1110), 6 states have internal predecessors, (1110), 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 16:05:27,798 INFO L175 Difference]: Start difference. First operand has 23 places, 15 transitions, 42 flow. Second operand 5 states and 445 transitions. [2022-12-13 16:05:27,798 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 39 transitions, 177 flow [2022-12-13 16:05:27,799 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 39 transitions, 167 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 16:05:27,799 INFO L231 Difference]: Finished difference. Result has 28 places, 17 transitions, 65 flow [2022-12-13 16:05:27,799 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=185, PETRI_DIFFERENCE_MINUEND_FLOW=38, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=15, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=65, PETRI_PLACES=28, PETRI_TRANSITIONS=17} [2022-12-13 16:05:27,800 INFO L288 CegarLoopForPetriNet]: 24 programPoint places, 4 predicate places. [2022-12-13 16:05:27,800 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 17 transitions, 65 flow [2022-12-13 16:05:27,800 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 83.25) internal successors, (333), 4 states have internal predecessors, (333), 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 16:05:27,800 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 16:05:27,800 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:05:27,800 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 16:05:27,801 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 16:05:27,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:05:27,801 INFO L85 PathProgramCache]: Analyzing trace with hash -1062879528, now seen corresponding path program 1 times [2022-12-13 16:05:27,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:05:27,801 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945924066] [2022-12-13 16:05:27,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:05:27,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:05:27,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:05:27,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:05:27,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:05:27,948 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945924066] [2022-12-13 16:05:27,948 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [945924066] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:05:27,948 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:05:27,948 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 16:05:27,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002402602] [2022-12-13 16:05:27,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:05:27,949 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 16:05:27,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:05:27,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 16:05:27,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 16:05:27,960 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 185 [2022-12-13 16:05:27,961 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 17 transitions, 65 flow. Second operand has 5 states, 5 states have (on average 83.4) internal successors, (417), 5 states have internal predecessors, (417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:05:27,961 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 16:05:27,961 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 185 [2022-12-13 16:05:27,961 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 16:05:28,040 INFO L130 PetriNetUnfolder]: 24/67 cut-off events. [2022-12-13 16:05:28,040 INFO L131 PetriNetUnfolder]: For 17/17 co-relation queries the response was YES. [2022-12-13 16:05:28,040 INFO L83 FinitePrefix]: Finished finitePrefix Result has 191 conditions, 67 events. 24/67 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 147 event pairs, 10 based on Foata normal form. 8/75 useless extension candidates. Maximal degree in co-relation 177. Up to 29 conditions per place. [2022-12-13 16:05:28,041 INFO L137 encePairwiseOnDemand]: 180/185 looper letters, 18 selfloop transitions, 5 changer transitions 8/32 dead transitions. [2022-12-13 16:05:28,041 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 32 transitions, 171 flow [2022-12-13 16:05:28,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 16:05:28,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 16:05:28,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 519 transitions. [2022-12-13 16:05:28,043 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.46756756756756757 [2022-12-13 16:05:28,043 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 519 transitions. [2022-12-13 16:05:28,043 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 519 transitions. [2022-12-13 16:05:28,043 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 16:05:28,044 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 519 transitions. [2022-12-13 16:05:28,045 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 86.5) internal successors, (519), 6 states have internal predecessors, (519), 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 16:05:28,048 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 185.0) internal successors, (1295), 7 states have internal predecessors, (1295), 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 16:05:28,049 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 185.0) internal successors, (1295), 7 states have internal predecessors, (1295), 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 16:05:28,049 INFO L175 Difference]: Start difference. First operand has 28 places, 17 transitions, 65 flow. Second operand 6 states and 519 transitions. [2022-12-13 16:05:28,049 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 32 transitions, 171 flow [2022-12-13 16:05:28,050 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 32 transitions, 152 flow, removed 6 selfloop flow, removed 3 redundant places. [2022-12-13 16:05:28,051 INFO L231 Difference]: Finished difference. Result has 31 places, 17 transitions, 72 flow [2022-12-13 16:05:28,051 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=185, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=72, PETRI_PLACES=31, PETRI_TRANSITIONS=17} [2022-12-13 16:05:28,052 INFO L288 CegarLoopForPetriNet]: 24 programPoint places, 7 predicate places. [2022-12-13 16:05:28,052 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 17 transitions, 72 flow [2022-12-13 16:05:28,052 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 83.4) internal successors, (417), 5 states have internal predecessors, (417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:05:28,052 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 16:05:28,052 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:05:28,053 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 16:05:28,053 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 16:05:28,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:05:28,053 INFO L85 PathProgramCache]: Analyzing trace with hash 332387437, now seen corresponding path program 1 times [2022-12-13 16:05:28,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:05:28,054 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143491523] [2022-12-13 16:05:28,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:05:28,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:05:28,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:05:28,229 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 16:05:28,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:05:28,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143491523] [2022-12-13 16:05:28,229 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [143491523] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:05:28,229 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:05:28,230 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 16:05:28,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696250756] [2022-12-13 16:05:28,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:05:28,230 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 16:05:28,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:05:28,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 16:05:28,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 16:05:28,240 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 185 [2022-12-13 16:05:28,240 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 17 transitions, 72 flow. Second operand has 4 states, 4 states have (on average 82.75) internal successors, (331), 4 states have internal predecessors, (331), 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 16:05:28,241 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 16:05:28,241 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 185 [2022-12-13 16:05:28,241 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 16:05:28,312 INFO L130 PetriNetUnfolder]: 24/71 cut-off events. [2022-12-13 16:05:28,312 INFO L131 PetriNetUnfolder]: For 65/65 co-relation queries the response was YES. [2022-12-13 16:05:28,312 INFO L83 FinitePrefix]: Finished finitePrefix Result has 212 conditions, 71 events. 24/71 cut-off events. For 65/65 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 183 event pairs, 1 based on Foata normal form. 1/72 useless extension candidates. Maximal degree in co-relation 196. Up to 41 conditions per place. [2022-12-13 16:05:28,312 INFO L137 encePairwiseOnDemand]: 179/185 looper letters, 21 selfloop transitions, 7 changer transitions 9/37 dead transitions. [2022-12-13 16:05:28,313 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 37 transitions, 225 flow [2022-12-13 16:05:28,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 16:05:28,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 16:05:28,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 429 transitions. [2022-12-13 16:05:28,314 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.46378378378378377 [2022-12-13 16:05:28,314 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 429 transitions. [2022-12-13 16:05:28,314 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 429 transitions. [2022-12-13 16:05:28,314 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 16:05:28,314 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 429 transitions. [2022-12-13 16:05:28,315 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 85.8) internal successors, (429), 5 states have internal predecessors, (429), 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 16:05:28,316 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 185.0) internal successors, (1110), 6 states have internal predecessors, (1110), 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 16:05:28,316 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 185.0) internal successors, (1110), 6 states have internal predecessors, (1110), 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 16:05:28,316 INFO L175 Difference]: Start difference. First operand has 31 places, 17 transitions, 72 flow. Second operand 5 states and 429 transitions. [2022-12-13 16:05:28,316 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 37 transitions, 225 flow [2022-12-13 16:05:28,317 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 37 transitions, 194 flow, removed 10 selfloop flow, removed 5 redundant places. [2022-12-13 16:05:28,318 INFO L231 Difference]: Finished difference. Result has 30 places, 21 transitions, 92 flow [2022-12-13 16:05:28,318 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=185, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=92, PETRI_PLACES=30, PETRI_TRANSITIONS=21} [2022-12-13 16:05:28,318 INFO L288 CegarLoopForPetriNet]: 24 programPoint places, 6 predicate places. [2022-12-13 16:05:28,318 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 21 transitions, 92 flow [2022-12-13 16:05:28,318 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 82.75) internal successors, (331), 4 states have internal predecessors, (331), 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 16:05:28,318 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 16:05:28,319 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:05:28,319 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 16:05:28,319 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 16:05:28,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:05:28,319 INFO L85 PathProgramCache]: Analyzing trace with hash -1843793757, now seen corresponding path program 2 times [2022-12-13 16:05:28,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:05:28,319 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084665325] [2022-12-13 16:05:28,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:05:28,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:05:28,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:05:28,452 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 16:05:28,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:05:28,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084665325] [2022-12-13 16:05:28,452 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2084665325] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:05:28,452 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:05:28,452 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 16:05:28,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533887915] [2022-12-13 16:05:28,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:05:28,453 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 16:05:28,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:05:28,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 16:05:28,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 16:05:28,460 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 185 [2022-12-13 16:05:28,461 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 21 transitions, 92 flow. Second operand has 4 states, 4 states have (on average 84.75) internal successors, (339), 4 states have internal predecessors, (339), 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 16:05:28,461 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 16:05:28,461 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 185 [2022-12-13 16:05:28,461 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 16:05:28,525 INFO L130 PetriNetUnfolder]: 23/78 cut-off events. [2022-12-13 16:05:28,526 INFO L131 PetriNetUnfolder]: For 59/59 co-relation queries the response was YES. [2022-12-13 16:05:28,526 INFO L83 FinitePrefix]: Finished finitePrefix Result has 258 conditions, 78 events. 23/78 cut-off events. For 59/59 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 220 event pairs, 3 based on Foata normal form. 1/79 useless extension candidates. Maximal degree in co-relation 243. Up to 43 conditions per place. [2022-12-13 16:05:28,526 INFO L137 encePairwiseOnDemand]: 182/185 looper letters, 18 selfloop transitions, 1 changer transitions 15/34 dead transitions. [2022-12-13 16:05:28,527 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 34 transitions, 212 flow [2022-12-13 16:05:28,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 16:05:28,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 16:05:28,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 353 transitions. [2022-12-13 16:05:28,528 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.47702702702702704 [2022-12-13 16:05:28,528 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 353 transitions. [2022-12-13 16:05:28,528 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 353 transitions. [2022-12-13 16:05:28,528 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 16:05:28,528 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 353 transitions. [2022-12-13 16:05:28,529 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 88.25) internal successors, (353), 4 states have internal predecessors, (353), 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 16:05:28,529 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 185.0) internal successors, (925), 5 states have internal predecessors, (925), 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 16:05:28,530 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 185.0) internal successors, (925), 5 states have internal predecessors, (925), 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 16:05:28,530 INFO L175 Difference]: Start difference. First operand has 30 places, 21 transitions, 92 flow. Second operand 4 states and 353 transitions. [2022-12-13 16:05:28,530 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 34 transitions, 212 flow [2022-12-13 16:05:28,531 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 34 transitions, 212 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-13 16:05:28,531 INFO L231 Difference]: Finished difference. Result has 34 places, 17 transitions, 73 flow [2022-12-13 16:05:28,531 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=185, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=73, PETRI_PLACES=34, PETRI_TRANSITIONS=17} [2022-12-13 16:05:28,531 INFO L288 CegarLoopForPetriNet]: 24 programPoint places, 10 predicate places. [2022-12-13 16:05:28,532 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 17 transitions, 73 flow [2022-12-13 16:05:28,532 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 84.75) internal successors, (339), 4 states have internal predecessors, (339), 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 16:05:28,532 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 16:05:28,532 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:05:28,532 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 16:05:28,532 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 16:05:28,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:05:28,532 INFO L85 PathProgramCache]: Analyzing trace with hash -2147312133, now seen corresponding path program 3 times [2022-12-13 16:05:28,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:05:28,533 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788667460] [2022-12-13 16:05:28,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:05:28,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:05:28,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:05:29,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:05:29,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:05:29,563 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788667460] [2022-12-13 16:05:29,563 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788667460] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:05:29,563 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:05:29,563 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 16:05:29,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463529161] [2022-12-13 16:05:29,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:05:29,563 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 16:05:29,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:05:29,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 16:05:29,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 16:05:29,639 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 185 [2022-12-13 16:05:29,639 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 17 transitions, 73 flow. Second operand has 7 states, 7 states have (on average 78.0) internal successors, (546), 7 states have internal predecessors, (546), 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 16:05:29,639 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 16:05:29,639 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 185 [2022-12-13 16:05:29,639 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 16:05:30,046 INFO L130 PetriNetUnfolder]: 6/36 cut-off events. [2022-12-13 16:05:30,046 INFO L131 PetriNetUnfolder]: For 39/39 co-relation queries the response was YES. [2022-12-13 16:05:30,046 INFO L83 FinitePrefix]: Finished finitePrefix Result has 126 conditions, 36 events. 6/36 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 58 event pairs, 1 based on Foata normal form. 1/37 useless extension candidates. Maximal degree in co-relation 113. Up to 14 conditions per place. [2022-12-13 16:05:30,046 INFO L137 encePairwiseOnDemand]: 178/185 looper letters, 12 selfloop transitions, 4 changer transitions 10/27 dead transitions. [2022-12-13 16:05:30,046 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 27 transitions, 172 flow [2022-12-13 16:05:30,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 16:05:30,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 16:05:30,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 631 transitions. [2022-12-13 16:05:30,048 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4263513513513513 [2022-12-13 16:05:30,048 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 631 transitions. [2022-12-13 16:05:30,048 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 631 transitions. [2022-12-13 16:05:30,048 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 16:05:30,048 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 631 transitions. [2022-12-13 16:05:30,049 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 78.875) internal successors, (631), 8 states have internal predecessors, (631), 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 16:05:30,050 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 185.0) internal successors, (1665), 9 states have internal predecessors, (1665), 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 16:05:30,051 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 185.0) internal successors, (1665), 9 states have internal predecessors, (1665), 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 16:05:30,051 INFO L175 Difference]: Start difference. First operand has 34 places, 17 transitions, 73 flow. Second operand 8 states and 631 transitions. [2022-12-13 16:05:30,051 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 27 transitions, 172 flow [2022-12-13 16:05:30,051 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 27 transitions, 160 flow, removed 4 selfloop flow, removed 4 redundant places. [2022-12-13 16:05:30,052 INFO L231 Difference]: Finished difference. Result has 38 places, 17 transitions, 80 flow [2022-12-13 16:05:30,052 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=185, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=80, PETRI_PLACES=38, PETRI_TRANSITIONS=17} [2022-12-13 16:05:30,052 INFO L288 CegarLoopForPetriNet]: 24 programPoint places, 14 predicate places. [2022-12-13 16:05:30,053 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 17 transitions, 80 flow [2022-12-13 16:05:30,053 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 78.0) internal successors, (546), 7 states have internal predecessors, (546), 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 16:05:30,053 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 16:05:30,053 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:05:30,053 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 16:05:30,053 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 16:05:30,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:05:30,054 INFO L85 PathProgramCache]: Analyzing trace with hash -1446018793, now seen corresponding path program 4 times [2022-12-13 16:05:30,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:05:30,054 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780520760] [2022-12-13 16:05:30,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:05:30,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:05:30,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 16:05:30,080 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 16:05:30,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 16:05:30,135 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 16:05:30,136 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 16:05:30,136 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2022-12-13 16:05:30,138 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2022-12-13 16:05:30,138 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2022-12-13 16:05:30,138 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2022-12-13 16:05:30,138 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2022-12-13 16:05:30,138 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 16:05:30,138 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1] [2022-12-13 16:05:30,143 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 16:05:30,143 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 16:05:30,174 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 04:05:30 BasicIcfg [2022-12-13 16:05:30,175 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 16:05:30,175 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-13 16:05:30,175 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-13 16:05:30,175 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-13 16:05:30,176 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 04:05:24" (3/4) ... [2022-12-13 16:05:30,177 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-12-13 16:05:30,226 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b8f2f70-acda-4de3-816f-a5d098c888b1/bin/uautomizer-uyxdKDjOR8/witness.graphml [2022-12-13 16:05:30,226 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-13 16:05:30,226 INFO L158 Benchmark]: Toolchain (without parser) took 6827.04ms. Allocated memory was 113.2MB in the beginning and 167.8MB in the end (delta: 54.5MB). Free memory was 80.3MB in the beginning and 62.4MB in the end (delta: 17.9MB). Peak memory consumption was 73.6MB. Max. memory is 16.1GB. [2022-12-13 16:05:30,226 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 113.2MB. Free memory is still 86.7MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 16:05:30,227 INFO L158 Benchmark]: CACSL2BoogieTranslator took 408.60ms. Allocated memory is still 113.2MB. Free memory was 80.3MB in the beginning and 54.3MB in the end (delta: 26.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2022-12-13 16:05:30,227 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.40ms. Allocated memory is still 113.2MB. Free memory was 54.3MB in the beginning and 51.4MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-12-13 16:05:30,227 INFO L158 Benchmark]: Boogie Preprocessor took 28.77ms. Allocated memory is still 113.2MB. Free memory was 51.4MB in the beginning and 49.7MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 16:05:30,227 INFO L158 Benchmark]: RCFGBuilder took 527.01ms. Allocated memory was 113.2MB in the beginning and 138.4MB in the end (delta: 25.2MB). Free memory was 49.7MB in the beginning and 82.6MB in the end (delta: -33.0MB). Peak memory consumption was 15.6MB. Max. memory is 16.1GB. [2022-12-13 16:05:30,227 INFO L158 Benchmark]: TraceAbstraction took 5763.46ms. Allocated memory was 138.4MB in the beginning and 167.8MB in the end (delta: 29.4MB). Free memory was 81.7MB in the beginning and 69.7MB in the end (delta: 12.0MB). Peak memory consumption was 41.2MB. Max. memory is 16.1GB. [2022-12-13 16:05:30,228 INFO L158 Benchmark]: Witness Printer took 50.73ms. Allocated memory is still 167.8MB. Free memory was 69.7MB in the beginning and 62.4MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-12-13 16:05:30,229 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.17ms. Allocated memory is still 113.2MB. Free memory is still 86.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 408.60ms. Allocated memory is still 113.2MB. Free memory was 80.3MB in the beginning and 54.3MB in the end (delta: 26.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.40ms. Allocated memory is still 113.2MB. Free memory was 54.3MB in the beginning and 51.4MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 28.77ms. Allocated memory is still 113.2MB. Free memory was 51.4MB in the beginning and 49.7MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 527.01ms. Allocated memory was 113.2MB in the beginning and 138.4MB in the end (delta: 25.2MB). Free memory was 49.7MB in the beginning and 82.6MB in the end (delta: -33.0MB). Peak memory consumption was 15.6MB. Max. memory is 16.1GB. * TraceAbstraction took 5763.46ms. Allocated memory was 138.4MB in the beginning and 167.8MB in the end (delta: 29.4MB). Free memory was 81.7MB in the beginning and 69.7MB in the end (delta: 12.0MB). Peak memory consumption was 41.2MB. Max. memory is 16.1GB. * Witness Printer took 50.73ms. Allocated memory is still 167.8MB. Free memory was 69.7MB in the beginning and 62.4MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.3s, 99 PlacesBefore, 24 PlacesAfterwards, 94 TransitionsBefore, 18 TransitionsAfterwards, 1122 CoEnabledTransitionPairs, 7 FixpointIterations, 39 TrivialSequentialCompositions, 42 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 1 ChoiceCompositions, 89 TotalNumberOfCompositions, 2862 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1423, independent: 1284, independent conditional: 0, independent unconditional: 1284, dependent: 139, dependent conditional: 0, dependent unconditional: 139, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 648, independent: 613, independent conditional: 0, independent unconditional: 613, dependent: 35, dependent conditional: 0, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1423, independent: 671, independent conditional: 0, independent unconditional: 671, dependent: 104, dependent conditional: 0, dependent unconditional: 104, unknown: 648, unknown conditional: 0, unknown unconditional: 648] , Statistics on independence cache: Total cache size (in pairs): 48, Positive cache size: 34, Positive conditional cache size: 0, Positive unconditional cache size: 34, 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: 19]: 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_p0_EAX = 0; [L713] 0 int __unbuffered_p1_EAX = 0; [L715] 0 int __unbuffered_p1_EBX = 0; [L716] 0 _Bool main$tmp_guard0; [L717] 0 _Bool main$tmp_guard1; [L719] 0 int x = 0; [L721] 0 int y = 0; [L722] 0 _Bool y$flush_delayed; [L723] 0 int y$mem_tmp; [L724] 0 _Bool y$r_buff0_thd0; [L725] 0 _Bool y$r_buff0_thd1; [L726] 0 _Bool y$r_buff0_thd2; [L727] 0 _Bool y$r_buff1_thd0; [L728] 0 _Bool y$r_buff1_thd1; [L729] 0 _Bool y$r_buff1_thd2; [L730] 0 _Bool y$read_delayed; [L731] 0 int *y$read_delayed_var; [L732] 0 int y$w_buff0; [L733] 0 _Bool y$w_buff0_used; [L734] 0 int y$w_buff1; [L735] 0 _Bool y$w_buff1_used; [L736] 0 _Bool weak$$choice0; [L737] 0 _Bool weak$$choice2; [L823] 0 pthread_t t1761; [L824] FCALL, FORK 0 pthread_create(&t1761, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1761, ((void *)0), P0, ((void *)0))=-2, t1761={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L825] 0 pthread_t t1762; [L826] FCALL, FORK 0 pthread_create(&t1762, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1762, ((void *)0), P1, ((void *)0))=-1, t1761={5:0}, t1762={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L771] 2 y$w_buff1 = y$w_buff0 [L772] 2 y$w_buff0 = 1 [L773] 2 y$w_buff1_used = y$w_buff0_used [L774] 2 y$w_buff0_used = (_Bool)1 [L775] CALL 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L775] RET 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L776] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L777] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L778] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L779] 2 y$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L782] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L783] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L784] 2 y$flush_delayed = weak$$choice2 [L785] 2 y$mem_tmp = y [L786] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L787] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L788] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L789] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L790] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L791] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L792] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L793] 2 __unbuffered_p1_EAX = y [L794] 2 y = y$flush_delayed ? y$mem_tmp : y [L795] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L798] 2 __unbuffered_p1_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L741] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L746] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L747] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L748] 1 y$flush_delayed = weak$$choice2 [L749] 1 y$mem_tmp = y [L750] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L751] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L752] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L753] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L754] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L755] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L756] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L757] 1 __unbuffered_p0_EAX = y [L758] 1 y = y$flush_delayed ? y$mem_tmp : y [L759] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L764] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L766] 1 return 0; [L801] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L802] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L803] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L804] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L805] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L808] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L810] 2 return 0; [L828] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L830] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L830] RET 0 assume_abort_if_not(main$tmp_guard0) [L832] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L833] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L834] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L835] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L836] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1761={5:0}, t1762={3:0}, weak$$choice0=49, weak$$choice2=255, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L839] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) [L841] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - UnprovableResult [Line: 19]: 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: 826]: 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: 824]: 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 5 procedures, 114 locations, 5 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 5.7s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 170 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 133 mSDsluCounter, 61 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 47 mSDsCounter, 32 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 465 IncrementalHoareTripleChecker+Invalid, 497 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 32 mSolverCounterUnsat, 14 mSDtfsCounter, 465 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 27 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=92occurred in iteration=5, InterpolantAutomatonStates: 34, 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.8s InterpolantComputationTime, 93 NumberOfCodeBlocks, 93 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 71 ConstructedInterpolants, 0 QuantifiedInterpolants, 629 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 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 16:05:30,244 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b8f2f70-acda-4de3-816f-a5d098c888b1/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