./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix012_power.oepc_power.opt_pso.oepc_rmo.oepc_rmo.opt_tso.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_603e9714-8bee-409f-b9a8-5e82a5bbc288/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_603e9714-8bee-409f-b9a8-5e82a5bbc288/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_603e9714-8bee-409f-b9a8-5e82a5bbc288/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_603e9714-8bee-409f-b9a8-5e82a5bbc288/bin/uautomizer-uyxdKDjOR8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix012_power.oepc_power.opt_pso.oepc_rmo.oepc_rmo.opt_tso.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_603e9714-8bee-409f-b9a8-5e82a5bbc288/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_603e9714-8bee-409f-b9a8-5e82a5bbc288/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 af189c8870b49f611aa022222cf968f0c789441d4d4f9926444b1aa8c8dc68d1 --- 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 19:29:58,213 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 19:29:58,215 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 19:29:58,228 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 19:29:58,228 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 19:29:58,229 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 19:29:58,229 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 19:29:58,230 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 19:29:58,231 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 19:29:58,232 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 19:29:58,233 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 19:29:58,233 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 19:29:58,234 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 19:29:58,234 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 19:29:58,235 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 19:29:58,236 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 19:29:58,236 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 19:29:58,237 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 19:29:58,238 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 19:29:58,239 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 19:29:58,240 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 19:29:58,241 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 19:29:58,242 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 19:29:58,242 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 19:29:58,244 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 19:29:58,245 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 19:29:58,245 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 19:29:58,245 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 19:29:58,246 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 19:29:58,246 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 19:29:58,247 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 19:29:58,247 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 19:29:58,247 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 19:29:58,248 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 19:29:58,249 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 19:29:58,249 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 19:29:58,249 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 19:29:58,249 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 19:29:58,250 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 19:29:58,250 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 19:29:58,250 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 19:29:58,251 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_603e9714-8bee-409f-b9a8-5e82a5bbc288/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-12-13 19:29:58,265 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 19:29:58,265 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 19:29:58,265 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 19:29:58,265 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 19:29:58,266 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 19:29:58,266 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 19:29:58,266 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 19:29:58,266 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 19:29:58,266 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 19:29:58,267 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 19:29:58,267 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 19:29:58,267 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 19:29:58,267 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 19:29:58,267 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 19:29:58,267 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 19:29:58,267 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 19:29:58,267 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 19:29:58,267 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 19:29:58,267 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 19:29:58,267 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 19:29:58,268 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 19:29:58,268 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 19:29:58,268 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 19:29:58,268 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 19:29:58,268 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 19:29:58,268 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 19:29:58,268 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 19:29:58,268 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 19:29:58,268 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 19:29:58,268 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 19:29:58,269 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 19:29:58,269 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-13 19:29:58,269 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 19:29:58,269 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 19:29:58,269 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 19:29:58,269 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_603e9714-8bee-409f-b9a8-5e82a5bbc288/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_603e9714-8bee-409f-b9a8-5e82a5bbc288/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 -> af189c8870b49f611aa022222cf968f0c789441d4d4f9926444b1aa8c8dc68d1 [2022-12-13 19:29:58,425 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 19:29:58,442 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 19:29:58,444 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 19:29:58,445 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 19:29:58,446 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 19:29:58,447 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_603e9714-8bee-409f-b9a8-5e82a5bbc288/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/pthread-wmm/mix012_power.oepc_power.opt_pso.oepc_rmo.oepc_rmo.opt_tso.oepc.i [2022-12-13 19:30:00,910 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 19:30:01,130 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 19:30:01,130 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_603e9714-8bee-409f-b9a8-5e82a5bbc288/sv-benchmarks/c/pthread-wmm/mix012_power.oepc_power.opt_pso.oepc_rmo.oepc_rmo.opt_tso.oepc.i [2022-12-13 19:30:01,144 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_603e9714-8bee-409f-b9a8-5e82a5bbc288/bin/uautomizer-uyxdKDjOR8/data/7f9960151/21aa38b7acdd4c45a01bfcca93cf9925/FLAG699752613 [2022-12-13 19:30:01,466 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_603e9714-8bee-409f-b9a8-5e82a5bbc288/bin/uautomizer-uyxdKDjOR8/data/7f9960151/21aa38b7acdd4c45a01bfcca93cf9925 [2022-12-13 19:30:01,468 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 19:30:01,469 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 19:30:01,470 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 19:30:01,470 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 19:30:01,473 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 19:30:01,473 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 07:30:01" (1/1) ... [2022-12-13 19:30:01,474 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32c966dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:30:01, skipping insertion in model container [2022-12-13 19:30:01,475 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 07:30:01" (1/1) ... [2022-12-13 19:30:01,480 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 19:30:01,511 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 19:30:01,639 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_603e9714-8bee-409f-b9a8-5e82a5bbc288/sv-benchmarks/c/pthread-wmm/mix012_power.oepc_power.opt_pso.oepc_rmo.oepc_rmo.opt_tso.oepc.i[996,1009] [2022-12-13 19:30:01,756 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 19:30:01,757 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 19:30:01,758 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 19:30:01,758 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 19:30:01,758 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 19:30:01,760 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 19:30:01,760 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 19:30:01,761 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 19:30:01,761 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 19:30:01,761 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 19:30:01,762 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 19:30:01,762 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 19:30:01,762 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 19:30:01,768 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 19:30:01,768 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 19:30:01,770 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 19:30:01,770 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 19:30:01,771 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 19:30:01,775 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 19:30:01,775 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 19:30:01,775 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 19:30:01,777 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 19:30:01,777 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 19:30:01,778 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 19:30:01,778 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 19:30:01,786 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 19:30:01,795 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_603e9714-8bee-409f-b9a8-5e82a5bbc288/sv-benchmarks/c/pthread-wmm/mix012_power.oepc_power.opt_pso.oepc_rmo.oepc_rmo.opt_tso.oepc.i[996,1009] [2022-12-13 19:30:01,810 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 19:30:01,811 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 19:30:01,811 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 19:30:01,811 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 19:30:01,811 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 19:30:01,813 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 19:30:01,813 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 19:30:01,813 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 19:30:01,814 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 19:30:01,814 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 19:30:01,814 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 19:30:01,814 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 19:30:01,815 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 19:30:01,820 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 19:30:01,820 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 19:30:01,822 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 19:30:01,822 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 19:30:01,822 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 19:30:01,824 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 19:30:01,825 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 19:30:01,825 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 19:30:01,827 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 19:30:01,827 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 19:30:01,827 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 19:30:01,828 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 19:30:01,847 INFO L208 MainTranslator]: Completed translation [2022-12-13 19:30:01,848 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:30:01 WrapperNode [2022-12-13 19:30:01,848 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 19:30:01,848 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 19:30:01,849 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 19:30:01,849 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 19:30:01,854 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:30:01" (1/1) ... [2022-12-13 19:30:01,863 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:30:01" (1/1) ... [2022-12-13 19:30:01,879 INFO L138 Inliner]: procedures = 175, calls = 43, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 114 [2022-12-13 19:30:01,879 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 19:30:01,880 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 19:30:01,880 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 19:30:01,880 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 19:30:01,886 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:30:01" (1/1) ... [2022-12-13 19:30:01,887 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:30:01" (1/1) ... [2022-12-13 19:30:01,889 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:30:01" (1/1) ... [2022-12-13 19:30:01,889 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:30:01" (1/1) ... [2022-12-13 19:30:01,895 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:30:01" (1/1) ... [2022-12-13 19:30:01,896 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:30:01" (1/1) ... [2022-12-13 19:30:01,897 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:30:01" (1/1) ... [2022-12-13 19:30:01,898 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:30:01" (1/1) ... [2022-12-13 19:30:01,901 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 19:30:01,901 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 19:30:01,901 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 19:30:01,901 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 19:30:01,902 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:30:01" (1/1) ... [2022-12-13 19:30:01,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 19:30:01,916 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_603e9714-8bee-409f-b9a8-5e82a5bbc288/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 19:30:01,927 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_603e9714-8bee-409f-b9a8-5e82a5bbc288/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 19:30:01,929 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_603e9714-8bee-409f-b9a8-5e82a5bbc288/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 19:30:01,960 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 19:30:01,961 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 19:30:01,961 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 19:30:01,961 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 19:30:01,961 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 19:30:01,961 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 19:30:01,961 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 19:30:01,961 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 19:30:01,961 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 19:30:01,961 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 19:30:01,961 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 19:30:01,961 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 19:30:01,962 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 19:30:01,963 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 19:30:02,065 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 19:30:02,067 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 19:30:02,310 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 19:30:02,411 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 19:30:02,411 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 19:30:02,413 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 07:30:02 BoogieIcfgContainer [2022-12-13 19:30:02,413 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 19:30:02,414 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 19:30:02,414 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 19:30:02,417 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 19:30:02,417 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 07:30:01" (1/3) ... [2022-12-13 19:30:02,417 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f970050 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 07:30:02, skipping insertion in model container [2022-12-13 19:30:02,417 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:30:01" (2/3) ... [2022-12-13 19:30:02,418 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f970050 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 07:30:02, skipping insertion in model container [2022-12-13 19:30:02,418 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 07:30:02" (3/3) ... [2022-12-13 19:30:02,419 INFO L112 eAbstractionObserver]: Analyzing ICFG mix012_power.oepc_power.opt_pso.oepc_rmo.oepc_rmo.opt_tso.oepc.i [2022-12-13 19:30:02,433 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-12-13 19:30:02,441 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 19:30:02,441 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-13 19:30:02,441 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 19:30:02,477 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 19:30:02,504 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 102 places, 97 transitions, 204 flow [2022-12-13 19:30:02,535 INFO L130 PetriNetUnfolder]: 2/95 cut-off events. [2022-12-13 19:30:02,535 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 19:30:02,539 INFO L83 FinitePrefix]: Finished finitePrefix Result has 102 conditions, 95 events. 2/95 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 45 event pairs, 0 based on Foata normal form. 0/91 useless extension candidates. Maximal degree in co-relation 56. Up to 2 conditions per place. [2022-12-13 19:30:02,539 INFO L82 GeneralOperation]: Start removeDead. Operand has 102 places, 97 transitions, 204 flow [2022-12-13 19:30:02,542 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 100 places, 95 transitions, 196 flow [2022-12-13 19:30:02,544 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-12-13 19:30:02,552 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 95 transitions, 196 flow [2022-12-13 19:30:02,554 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 95 transitions, 196 flow [2022-12-13 19:30:02,554 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 95 transitions, 196 flow [2022-12-13 19:30:02,572 INFO L130 PetriNetUnfolder]: 2/95 cut-off events. [2022-12-13 19:30:02,572 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 19:30:02,573 INFO L83 FinitePrefix]: Finished finitePrefix Result has 102 conditions, 95 events. 2/95 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 45 event pairs, 0 based on Foata normal form. 0/91 useless extension candidates. Maximal degree in co-relation 56. Up to 2 conditions per place. [2022-12-13 19:30:02,573 INFO L119 LiptonReduction]: Number of co-enabled transitions 1232 [2022-12-13 19:30:04,913 INFO L134 LiptonReduction]: Checked pairs total: 3195 [2022-12-13 19:30:04,913 INFO L136 LiptonReduction]: Total number of compositions: 87 [2022-12-13 19:30:04,925 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 19:30:04,930 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;@1153ad39, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 19:30:04,930 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-12-13 19:30:04,932 INFO L130 PetriNetUnfolder]: 0/2 cut-off events. [2022-12-13 19:30:04,933 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 19:30:04,933 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 19:30:04,933 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-12-13 19:30:04,934 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 19:30:04,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:30:04,938 INFO L85 PathProgramCache]: Analyzing trace with hash 427159, now seen corresponding path program 1 times [2022-12-13 19:30:04,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:30:04,945 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334946900] [2022-12-13 19:30:04,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:30:04,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:30:05,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:30:05,194 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 19:30:05,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:30:05,195 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334946900] [2022-12-13 19:30:05,195 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334946900] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 19:30:05,195 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 19:30:05,195 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 19:30:05,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990416209] [2022-12-13 19:30:05,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 19:30:05,203 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 19:30:05,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:30:05,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 19:30:05,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 19:30:05,223 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 184 [2022-12-13 19:30:05,225 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 21 transitions, 48 flow. Second operand has 3 states, 3 states have (on average 86.0) internal successors, (258), 3 states have internal predecessors, (258), 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 19:30:05,225 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 19:30:05,226 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 184 [2022-12-13 19:30:05,226 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 19:30:05,352 INFO L130 PetriNetUnfolder]: 204/393 cut-off events. [2022-12-13 19:30:05,352 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-13 19:30:05,353 INFO L83 FinitePrefix]: Finished finitePrefix Result has 760 conditions, 393 events. 204/393 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1816 event pairs, 24 based on Foata normal form. 20/372 useless extension candidates. Maximal degree in co-relation 750. Up to 292 conditions per place. [2022-12-13 19:30:05,355 INFO L137 encePairwiseOnDemand]: 180/184 looper letters, 23 selfloop transitions, 2 changer transitions 4/31 dead transitions. [2022-12-13 19:30:05,355 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 31 transitions, 129 flow [2022-12-13 19:30:05,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 19:30:05,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 19:30:05,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 287 transitions. [2022-12-13 19:30:05,366 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.519927536231884 [2022-12-13 19:30:05,367 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 287 transitions. [2022-12-13 19:30:05,367 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 287 transitions. [2022-12-13 19:30:05,368 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 19:30:05,370 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 287 transitions. [2022-12-13 19:30:05,373 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 95.66666666666667) internal successors, (287), 3 states have internal predecessors, (287), 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 19:30:05,379 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 184.0) internal successors, (736), 4 states have internal predecessors, (736), 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 19:30:05,380 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 184.0) internal successors, (736), 4 states have internal predecessors, (736), 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 19:30:05,382 INFO L175 Difference]: Start difference. First operand has 27 places, 21 transitions, 48 flow. Second operand 3 states and 287 transitions. [2022-12-13 19:30:05,383 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 31 transitions, 129 flow [2022-12-13 19:30:05,384 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 31 transitions, 126 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 19:30:05,385 INFO L231 Difference]: Finished difference. Result has 26 places, 17 transitions, 42 flow [2022-12-13 19:30:05,387 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=184, PETRI_DIFFERENCE_MINUEND_FLOW=42, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=42, PETRI_PLACES=26, PETRI_TRANSITIONS=17} [2022-12-13 19:30:05,390 INFO L288 CegarLoopForPetriNet]: 27 programPoint places, -1 predicate places. [2022-12-13 19:30:05,390 INFO L495 AbstractCegarLoop]: Abstraction has has 26 places, 17 transitions, 42 flow [2022-12-13 19:30:05,390 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 86.0) internal successors, (258), 3 states have internal predecessors, (258), 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 19:30:05,391 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 19:30:05,391 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 19:30:05,391 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 19:30:05,391 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 19:30:05,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:30:05,392 INFO L85 PathProgramCache]: Analyzing trace with hash -1533514526, now seen corresponding path program 1 times [2022-12-13 19:30:05,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:30:05,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960305475] [2022-12-13 19:30:05,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:30:05,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:30:05,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:30:05,564 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 19:30:05,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:30:05,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960305475] [2022-12-13 19:30:05,565 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1960305475] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 19:30:05,565 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 19:30:05,565 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 19:30:05,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41057773] [2022-12-13 19:30:05,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 19:30:05,567 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 19:30:05,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:30:05,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 19:30:05,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 19:30:05,575 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 184 [2022-12-13 19:30:05,576 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 17 transitions, 42 flow. Second operand has 4 states, 4 states have (on average 85.0) internal successors, (340), 4 states have internal predecessors, (340), 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 19:30:05,576 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 19:30:05,576 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 184 [2022-12-13 19:30:05,576 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 19:30:05,689 INFO L130 PetriNetUnfolder]: 167/306 cut-off events. [2022-12-13 19:30:05,689 INFO L131 PetriNetUnfolder]: For 33/33 co-relation queries the response was YES. [2022-12-13 19:30:05,690 INFO L83 FinitePrefix]: Finished finitePrefix Result has 658 conditions, 306 events. 167/306 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1151 event pairs, 53 based on Foata normal form. 24/329 useless extension candidates. Maximal degree in co-relation 648. Up to 197 conditions per place. [2022-12-13 19:30:05,692 INFO L137 encePairwiseOnDemand]: 180/184 looper letters, 19 selfloop transitions, 2 changer transitions 12/34 dead transitions. [2022-12-13 19:30:05,692 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 34 transitions, 148 flow [2022-12-13 19:30:05,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 19:30:05,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 19:30:05,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 450 transitions. [2022-12-13 19:30:05,695 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4891304347826087 [2022-12-13 19:30:05,696 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 450 transitions. [2022-12-13 19:30:05,696 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 450 transitions. [2022-12-13 19:30:05,696 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 19:30:05,696 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 450 transitions. [2022-12-13 19:30:05,698 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 90.0) internal successors, (450), 5 states have internal predecessors, (450), 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 19:30:05,701 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 184.0) internal successors, (1104), 6 states have internal predecessors, (1104), 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 19:30:05,702 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 184.0) internal successors, (1104), 6 states have internal predecessors, (1104), 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 19:30:05,702 INFO L175 Difference]: Start difference. First operand has 26 places, 17 transitions, 42 flow. Second operand 5 states and 450 transitions. [2022-12-13 19:30:05,702 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 34 transitions, 148 flow [2022-12-13 19:30:05,702 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 34 transitions, 138 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 19:30:05,703 INFO L231 Difference]: Finished difference. Result has 29 places, 17 transitions, 50 flow [2022-12-13 19:30:05,703 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=184, PETRI_DIFFERENCE_MINUEND_FLOW=38, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=50, PETRI_PLACES=29, PETRI_TRANSITIONS=17} [2022-12-13 19:30:05,704 INFO L288 CegarLoopForPetriNet]: 27 programPoint places, 2 predicate places. [2022-12-13 19:30:05,704 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 17 transitions, 50 flow [2022-12-13 19:30:05,704 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 85.0) internal successors, (340), 4 states have internal predecessors, (340), 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 19:30:05,704 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 19:30:05,704 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 19:30:05,704 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 19:30:05,705 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 19:30:05,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:30:05,705 INFO L85 PathProgramCache]: Analyzing trace with hash -593785556, now seen corresponding path program 1 times [2022-12-13 19:30:05,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:30:05,706 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827837374] [2022-12-13 19:30:05,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:30:05,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:30:05,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:30:05,859 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 19:30:05,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:30:05,859 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827837374] [2022-12-13 19:30:05,859 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827837374] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 19:30:05,859 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 19:30:05,859 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 19:30:05,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351160554] [2022-12-13 19:30:05,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 19:30:05,860 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 19:30:05,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:30:05,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 19:30:05,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 19:30:05,870 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 184 [2022-12-13 19:30:05,870 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 17 transitions, 50 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 19:30:05,871 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 19:30:05,871 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 184 [2022-12-13 19:30:05,871 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 19:30:05,949 INFO L130 PetriNetUnfolder]: 67/154 cut-off events. [2022-12-13 19:30:05,949 INFO L131 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2022-12-13 19:30:05,949 INFO L83 FinitePrefix]: Finished finitePrefix Result has 350 conditions, 154 events. 67/154 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 532 event pairs, 27 based on Foata normal form. 20/173 useless extension candidates. Maximal degree in co-relation 337. Up to 58 conditions per place. [2022-12-13 19:30:05,950 INFO L137 encePairwiseOnDemand]: 179/184 looper letters, 27 selfloop transitions, 4 changer transitions 1/34 dead transitions. [2022-12-13 19:30:05,950 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 34 transitions, 150 flow [2022-12-13 19:30:05,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 19:30:05,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 19:30:05,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 358 transitions. [2022-12-13 19:30:05,953 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.48641304347826086 [2022-12-13 19:30:05,953 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 358 transitions. [2022-12-13 19:30:05,953 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 358 transitions. [2022-12-13 19:30:05,953 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 19:30:05,953 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 358 transitions. [2022-12-13 19:30:05,955 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 89.5) internal successors, (358), 4 states have internal predecessors, (358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:30:05,956 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 184.0) internal successors, (920), 5 states have internal predecessors, (920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:30:05,957 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 184.0) internal successors, (920), 5 states have internal predecessors, (920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:30:05,957 INFO L175 Difference]: Start difference. First operand has 29 places, 17 transitions, 50 flow. Second operand 4 states and 358 transitions. [2022-12-13 19:30:05,957 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 34 transitions, 150 flow [2022-12-13 19:30:05,958 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 34 transitions, 142 flow, removed 2 selfloop flow, removed 4 redundant places. [2022-12-13 19:30:05,959 INFO L231 Difference]: Finished difference. Result has 28 places, 19 transitions, 68 flow [2022-12-13 19:30:05,959 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=184, PETRI_DIFFERENCE_MINUEND_FLOW=42, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=68, PETRI_PLACES=28, PETRI_TRANSITIONS=19} [2022-12-13 19:30:05,959 INFO L288 CegarLoopForPetriNet]: 27 programPoint places, 1 predicate places. [2022-12-13 19:30:05,959 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 19 transitions, 68 flow [2022-12-13 19:30:05,960 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 19:30:05,960 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 19:30:05,960 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 19:30:05,960 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 19:30:05,960 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 19:30:05,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:30:05,961 INFO L85 PathProgramCache]: Analyzing trace with hash 32233096, now seen corresponding path program 1 times [2022-12-13 19:30:05,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:30:05,961 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399133047] [2022-12-13 19:30:05,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:30:05,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:30:06,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:30:06,129 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 19:30:06,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:30:06,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399133047] [2022-12-13 19:30:06,130 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399133047] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 19:30:06,130 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 19:30:06,130 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 19:30:06,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567657527] [2022-12-13 19:30:06,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 19:30:06,130 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 19:30:06,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:30:06,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 19:30:06,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 19:30:06,138 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 184 [2022-12-13 19:30:06,139 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 19 transitions, 68 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 19:30:06,139 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 19:30:06,139 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 184 [2022-12-13 19:30:06,139 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 19:30:06,206 INFO L130 PetriNetUnfolder]: 24/70 cut-off events. [2022-12-13 19:30:06,206 INFO L131 PetriNetUnfolder]: For 21/21 co-relation queries the response was YES. [2022-12-13 19:30:06,207 INFO L83 FinitePrefix]: Finished finitePrefix Result has 196 conditions, 70 events. 24/70 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 178 event pairs, 10 based on Foata normal form. 8/77 useless extension candidates. Maximal degree in co-relation 183. Up to 29 conditions per place. [2022-12-13 19:30:06,207 INFO L137 encePairwiseOnDemand]: 179/184 looper letters, 18 selfloop transitions, 6 changer transitions 1/27 dead transitions. [2022-12-13 19:30:06,207 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 27 transitions, 139 flow [2022-12-13 19:30:06,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 19:30:06,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 19:30:06,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 432 transitions. [2022-12-13 19:30:06,209 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.46956521739130436 [2022-12-13 19:30:06,209 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 432 transitions. [2022-12-13 19:30:06,209 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 432 transitions. [2022-12-13 19:30:06,209 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 19:30:06,209 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 432 transitions. [2022-12-13 19:30:06,210 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 86.4) internal successors, (432), 5 states have internal predecessors, (432), 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 19:30:06,211 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 184.0) internal successors, (1104), 6 states have internal predecessors, (1104), 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 19:30:06,212 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 184.0) internal successors, (1104), 6 states have internal predecessors, (1104), 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 19:30:06,212 INFO L175 Difference]: Start difference. First operand has 28 places, 19 transitions, 68 flow. Second operand 5 states and 432 transitions. [2022-12-13 19:30:06,212 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 27 transitions, 139 flow [2022-12-13 19:30:06,213 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 27 transitions, 126 flow, removed 2 selfloop flow, removed 3 redundant places. [2022-12-13 19:30:06,213 INFO L231 Difference]: Finished difference. Result has 31 places, 19 transitions, 80 flow [2022-12-13 19:30:06,213 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=184, PETRI_DIFFERENCE_MINUEND_FLOW=57, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=80, PETRI_PLACES=31, PETRI_TRANSITIONS=19} [2022-12-13 19:30:06,214 INFO L288 CegarLoopForPetriNet]: 27 programPoint places, 4 predicate places. [2022-12-13 19:30:06,214 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 19 transitions, 80 flow [2022-12-13 19:30:06,214 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 19:30:06,214 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 19:30:06,215 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 19:30:06,215 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 19:30:06,215 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 19:30:06,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:30:06,215 INFO L85 PathProgramCache]: Analyzing trace with hash 1783477494, now seen corresponding path program 1 times [2022-12-13 19:30:06,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:30:06,215 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149563743] [2022-12-13 19:30:06,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:30:06,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:30:06,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:30:06,620 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 19:30:06,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:30:06,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149563743] [2022-12-13 19:30:06,621 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149563743] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 19:30:06,621 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 19:30:06,621 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 19:30:06,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346735252] [2022-12-13 19:30:06,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 19:30:06,621 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 19:30:06,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:30:06,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 19:30:06,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-13 19:30:06,654 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 184 [2022-12-13 19:30:06,656 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 19 transitions, 80 flow. Second operand has 7 states, 7 states have (on average 81.14285714285714) internal successors, (568), 7 states have internal predecessors, (568), 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 19:30:06,656 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 19:30:06,656 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 184 [2022-12-13 19:30:06,656 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 19:30:06,884 INFO L130 PetriNetUnfolder]: 20/72 cut-off events. [2022-12-13 19:30:06,884 INFO L131 PetriNetUnfolder]: For 72/72 co-relation queries the response was YES. [2022-12-13 19:30:06,885 INFO L83 FinitePrefix]: Finished finitePrefix Result has 232 conditions, 72 events. 20/72 cut-off events. For 72/72 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 181 event pairs, 0 based on Foata normal form. 1/73 useless extension candidates. Maximal degree in co-relation 218. Up to 24 conditions per place. [2022-12-13 19:30:06,885 INFO L137 encePairwiseOnDemand]: 176/184 looper letters, 25 selfloop transitions, 5 changer transitions 13/45 dead transitions. [2022-12-13 19:30:06,885 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 45 transitions, 302 flow [2022-12-13 19:30:06,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 19:30:06,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 19:30:06,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 670 transitions. [2022-12-13 19:30:06,887 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.45516304347826086 [2022-12-13 19:30:06,887 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 670 transitions. [2022-12-13 19:30:06,887 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 670 transitions. [2022-12-13 19:30:06,887 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 19:30:06,887 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 670 transitions. [2022-12-13 19:30:06,888 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 83.75) internal successors, (670), 8 states have internal predecessors, (670), 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 19:30:06,890 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 184.0) internal successors, (1656), 9 states have internal predecessors, (1656), 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 19:30:06,890 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 184.0) internal successors, (1656), 9 states have internal predecessors, (1656), 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 19:30:06,890 INFO L175 Difference]: Start difference. First operand has 31 places, 19 transitions, 80 flow. Second operand 8 states and 670 transitions. [2022-12-13 19:30:06,890 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 45 transitions, 302 flow [2022-12-13 19:30:06,891 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 45 transitions, 210 flow, removed 15 selfloop flow, removed 7 redundant places. [2022-12-13 19:30:06,891 INFO L231 Difference]: Finished difference. Result has 35 places, 21 transitions, 79 flow [2022-12-13 19:30:06,892 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=184, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=79, PETRI_PLACES=35, PETRI_TRANSITIONS=21} [2022-12-13 19:30:06,892 INFO L288 CegarLoopForPetriNet]: 27 programPoint places, 8 predicate places. [2022-12-13 19:30:06,892 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 21 transitions, 79 flow [2022-12-13 19:30:06,892 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 81.14285714285714) internal successors, (568), 7 states have internal predecessors, (568), 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 19:30:06,892 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 19:30:06,892 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 19:30:06,893 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 19:30:06,893 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 19:30:06,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:30:06,893 INFO L85 PathProgramCache]: Analyzing trace with hash 1202700362, now seen corresponding path program 2 times [2022-12-13 19:30:06,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:30:06,893 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250063985] [2022-12-13 19:30:06,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:30:06,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:30:06,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:30:07,021 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 19:30:07,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:30:07,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250063985] [2022-12-13 19:30:07,022 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [250063985] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 19:30:07,022 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 19:30:07,022 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 19:30:07,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458764680] [2022-12-13 19:30:07,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 19:30:07,023 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 19:30:07,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:30:07,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 19:30:07,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 19:30:07,040 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 184 [2022-12-13 19:30:07,041 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 21 transitions, 79 flow. Second operand has 5 states, 5 states have (on average 81.4) internal successors, (407), 5 states have internal predecessors, (407), 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 19:30:07,041 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 19:30:07,041 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 184 [2022-12-13 19:30:07,041 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 19:30:07,135 INFO L130 PetriNetUnfolder]: 33/106 cut-off events. [2022-12-13 19:30:07,135 INFO L131 PetriNetUnfolder]: For 39/39 co-relation queries the response was YES. [2022-12-13 19:30:07,135 INFO L83 FinitePrefix]: Finished finitePrefix Result has 307 conditions, 106 events. 33/106 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 323 event pairs, 5 based on Foata normal form. 1/107 useless extension candidates. Maximal degree in co-relation 297. Up to 49 conditions per place. [2022-12-13 19:30:07,136 INFO L137 encePairwiseOnDemand]: 177/184 looper letters, 23 selfloop transitions, 7 changer transitions 13/43 dead transitions. [2022-12-13 19:30:07,136 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 43 transitions, 246 flow [2022-12-13 19:30:07,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 19:30:07,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 19:30:07,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 504 transitions. [2022-12-13 19:30:07,138 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.45652173913043476 [2022-12-13 19:30:07,138 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 504 transitions. [2022-12-13 19:30:07,138 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 504 transitions. [2022-12-13 19:30:07,139 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 19:30:07,139 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 504 transitions. [2022-12-13 19:30:07,140 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 84.0) internal successors, (504), 6 states have internal predecessors, (504), 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 19:30:07,142 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 184.0) internal successors, (1288), 7 states have internal predecessors, (1288), 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 19:30:07,142 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 184.0) internal successors, (1288), 7 states have internal predecessors, (1288), 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 19:30:07,142 INFO L175 Difference]: Start difference. First operand has 35 places, 21 transitions, 79 flow. Second operand 6 states and 504 transitions. [2022-12-13 19:30:07,143 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 43 transitions, 246 flow [2022-12-13 19:30:07,144 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 43 transitions, 221 flow, removed 5 selfloop flow, removed 6 redundant places. [2022-12-13 19:30:07,144 INFO L231 Difference]: Finished difference. Result has 33 places, 26 transitions, 106 flow [2022-12-13 19:30:07,144 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=184, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=106, PETRI_PLACES=33, PETRI_TRANSITIONS=26} [2022-12-13 19:30:07,145 INFO L288 CegarLoopForPetriNet]: 27 programPoint places, 6 predicate places. [2022-12-13 19:30:07,145 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 26 transitions, 106 flow [2022-12-13 19:30:07,145 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 81.4) internal successors, (407), 5 states have internal predecessors, (407), 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 19:30:07,145 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 19:30:07,146 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 19:30:07,146 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 19:30:07,146 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 19:30:07,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:30:07,146 INFO L85 PathProgramCache]: Analyzing trace with hash -1365209574, now seen corresponding path program 3 times [2022-12-13 19:30:07,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:30:07,147 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445582301] [2022-12-13 19:30:07,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:30:07,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:30:07,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 19:30:07,192 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 19:30:07,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 19:30:07,244 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 19:30:07,244 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 19:30:07,245 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2022-12-13 19:30:07,247 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2022-12-13 19:30:07,248 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2022-12-13 19:30:07,248 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2022-12-13 19:30:07,248 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2022-12-13 19:30:07,248 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 19:30:07,248 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1] [2022-12-13 19:30:07,254 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 19:30:07,254 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 19:30:07,296 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 07:30:07 BasicIcfg [2022-12-13 19:30:07,296 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 19:30:07,297 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-13 19:30:07,297 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-13 19:30:07,297 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-13 19:30:07,297 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 07:30:02" (3/4) ... [2022-12-13 19:30:07,299 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-12-13 19:30:07,357 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_603e9714-8bee-409f-b9a8-5e82a5bbc288/bin/uautomizer-uyxdKDjOR8/witness.graphml [2022-12-13 19:30:07,357 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-13 19:30:07,358 INFO L158 Benchmark]: Toolchain (without parser) took 5888.49ms. Allocated memory was 144.7MB in the beginning and 174.1MB in the end (delta: 29.4MB). Free memory was 112.2MB in the beginning and 67.0MB in the end (delta: 45.3MB). Peak memory consumption was 77.6MB. Max. memory is 16.1GB. [2022-12-13 19:30:07,358 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 102.8MB. Free memory was 56.2MB in the beginning and 56.1MB in the end (delta: 117.7kB). There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 19:30:07,358 INFO L158 Benchmark]: CACSL2BoogieTranslator took 377.95ms. Allocated memory is still 144.7MB. Free memory was 111.6MB in the beginning and 87.0MB in the end (delta: 24.6MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2022-12-13 19:30:07,359 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.96ms. Allocated memory is still 144.7MB. Free memory was 87.0MB in the beginning and 84.3MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-12-13 19:30:07,359 INFO L158 Benchmark]: Boogie Preprocessor took 20.87ms. Allocated memory is still 144.7MB. Free memory was 84.3MB in the beginning and 82.8MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 19:30:07,359 INFO L158 Benchmark]: RCFGBuilder took 511.62ms. Allocated memory is still 144.7MB. Free memory was 82.8MB in the beginning and 113.4MB in the end (delta: -30.6MB). Peak memory consumption was 37.9MB. Max. memory is 16.1GB. [2022-12-13 19:30:07,359 INFO L158 Benchmark]: TraceAbstraction took 4882.03ms. Allocated memory was 144.7MB in the beginning and 174.1MB in the end (delta: 29.4MB). Free memory was 112.7MB in the beginning and 74.3MB in the end (delta: 38.4MB). Peak memory consumption was 67.0MB. Max. memory is 16.1GB. [2022-12-13 19:30:07,360 INFO L158 Benchmark]: Witness Printer took 60.77ms. Allocated memory is still 174.1MB. Free memory was 74.3MB in the beginning and 67.0MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-12-13 19:30:07,361 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.19ms. Allocated memory is still 102.8MB. Free memory was 56.2MB in the beginning and 56.1MB in the end (delta: 117.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 377.95ms. Allocated memory is still 144.7MB. Free memory was 111.6MB in the beginning and 87.0MB in the end (delta: 24.6MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 30.96ms. Allocated memory is still 144.7MB. Free memory was 87.0MB in the beginning and 84.3MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 20.87ms. Allocated memory is still 144.7MB. Free memory was 84.3MB in the beginning and 82.8MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 511.62ms. Allocated memory is still 144.7MB. Free memory was 82.8MB in the beginning and 113.4MB in the end (delta: -30.6MB). Peak memory consumption was 37.9MB. Max. memory is 16.1GB. * TraceAbstraction took 4882.03ms. Allocated memory was 144.7MB in the beginning and 174.1MB in the end (delta: 29.4MB). Free memory was 112.7MB in the beginning and 74.3MB in the end (delta: 38.4MB). Peak memory consumption was 67.0MB. Max. memory is 16.1GB. * Witness Printer took 60.77ms. Allocated memory is still 174.1MB. Free memory was 74.3MB in the beginning and 67.0MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.4s, 100 PlacesBefore, 27 PlacesAfterwards, 95 TransitionsBefore, 21 TransitionsAfterwards, 1232 CoEnabledTransitionPairs, 6 FixpointIterations, 39 TrivialSequentialCompositions, 37 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 10 ConcurrentYvCompositions, 1 ChoiceCompositions, 87 TotalNumberOfCompositions, 3195 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1482, independent: 1353, independent conditional: 0, independent unconditional: 1353, dependent: 129, dependent conditional: 0, dependent unconditional: 129, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 704, independent: 674, independent conditional: 0, independent unconditional: 674, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1482, independent: 679, independent conditional: 0, independent unconditional: 679, dependent: 99, dependent conditional: 0, dependent unconditional: 99, unknown: 704, unknown conditional: 0, unknown unconditional: 704] , Statistics on independence cache: Total cache size (in pairs): 66, Positive cache size: 51, Positive conditional cache size: 0, Positive unconditional cache size: 51, Negative cache size: 15, Negative conditional cache size: 0, Negative unconditional cache size: 15, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L708] 0 int __unbuffered_cnt = 0; [L710] 0 int __unbuffered_p0_EAX = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p1_EBX = 0; [L715] 0 _Bool main$tmp_guard0; [L716] 0 _Bool main$tmp_guard1; [L718] 0 int x = 0; [L720] 0 int y = 0; [L721] 0 _Bool y$flush_delayed; [L722] 0 int y$mem_tmp; [L723] 0 _Bool y$r_buff0_thd0; [L724] 0 _Bool y$r_buff0_thd1; [L725] 0 _Bool y$r_buff0_thd2; [L726] 0 _Bool y$r_buff1_thd0; [L727] 0 _Bool y$r_buff1_thd1; [L728] 0 _Bool y$r_buff1_thd2; [L729] 0 _Bool y$read_delayed; [L730] 0 int *y$read_delayed_var; [L731] 0 int y$w_buff0; [L732] 0 _Bool y$w_buff0_used; [L733] 0 int y$w_buff1; [L734] 0 _Bool y$w_buff1_used; [L735] 0 _Bool weak$$choice0; [L736] 0 _Bool weak$$choice2; [L812] 0 pthread_t t305; [L813] FCALL, FORK 0 pthread_create(&t305, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t305, ((void *)0), P0, ((void *)0))=-2, t305={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] [L814] 0 pthread_t t306; [L740] 1 y$w_buff1 = y$w_buff0 [L741] 1 y$w_buff0 = 1 [L742] 1 y$w_buff1_used = y$w_buff0_used [L743] 1 y$w_buff0_used = (_Bool)1 [L744] CALL 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L744] RET 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L745] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L746] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L747] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L748] 1 y$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L815] FCALL, FORK 0 pthread_create(&t306, ((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(&t306, ((void *)0), P1, ((void *)0))=-1, t305={5:0}, t306={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=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L751] 1 __unbuffered_p0_EAX = x 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=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L768] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L771] 2 __unbuffered_p1_EAX = x 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=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L774] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L775] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L776] 2 y$flush_delayed = weak$$choice2 [L777] 2 y$mem_tmp = y [L778] 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) [L779] 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)) [L780] 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)) [L781] 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)) [L782] 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)) [L783] 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)) [L784] 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)) [L785] 2 __unbuffered_p1_EBX = y [L786] 2 y = y$flush_delayed ? y$mem_tmp : y [L787] 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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L790] 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) [L791] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L792] 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 [L793] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L794] 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 [__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=66, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L754] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L755] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L756] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L757] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L758] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 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}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L761] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L763] 1 return 0; [L797] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L799] 2 return 0; [L817] 0 main$tmp_guard0 = __unbuffered_cnt == 2 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, t305={5:0}, t306={3:0}, weak$$choice0=66, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L819] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L819] RET 0 assume_abort_if_not(main$tmp_guard0) [L821] 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) [L822] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L823] 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 [L824] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L825] 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, t305={5:0}, t306={3:0}, weak$$choice0=66, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L828] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) [L830] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, \result={0:0}, __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=66, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 815]: 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: 813]: 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, 116 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: 4.7s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 219 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 176 mSDsluCounter, 100 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 78 mSDsCounter, 30 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 466 IncrementalHoareTripleChecker+Invalid, 496 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 30 mSolverCounterUnsat, 22 mSDtfsCounter, 466 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=106occurred in iteration=6, InterpolantAutomatonStates: 31, 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.0s InterpolantComputationTime, 85 NumberOfCodeBlocks, 85 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 62 ConstructedInterpolants, 0 QuantifiedInterpolants, 479 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 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 19:30:07,375 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_603e9714-8bee-409f-b9a8-5e82a5bbc288/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