./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe034_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a3df2ba-a6ed-46c6-af1e-a2291436bde3/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a3df2ba-a6ed-46c6-af1e-a2291436bde3/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_7a3df2ba-a6ed-46c6-af1e-a2291436bde3/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a3df2ba-a6ed-46c6-af1e-a2291436bde3/bin/uautomizer-uyxdKDjOR8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe034_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a3df2ba-a6ed-46c6-af1e-a2291436bde3/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_7a3df2ba-a6ed-46c6-af1e-a2291436bde3/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 11eadb3d3dbb959cb5d260936a4e759de0e9c0b331e2b23d922151dc0bfe3fa5 --- 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 20:11:55,321 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 20:11:55,323 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 20:11:55,340 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 20:11:55,340 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 20:11:55,341 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 20:11:55,342 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 20:11:55,344 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 20:11:55,345 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 20:11:55,346 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 20:11:55,346 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 20:11:55,347 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 20:11:55,348 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 20:11:55,349 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 20:11:55,350 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 20:11:55,351 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 20:11:55,351 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 20:11:55,352 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 20:11:55,353 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 20:11:55,355 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 20:11:55,356 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 20:11:55,358 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 20:11:55,359 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 20:11:55,359 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 20:11:55,362 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 20:11:55,363 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 20:11:55,363 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 20:11:55,364 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 20:11:55,364 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 20:11:55,365 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 20:11:55,365 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 20:11:55,366 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 20:11:55,367 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 20:11:55,367 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 20:11:55,368 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 20:11:55,368 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 20:11:55,369 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 20:11:55,369 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 20:11:55,369 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 20:11:55,370 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 20:11:55,370 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 20:11:55,371 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a3df2ba-a6ed-46c6-af1e-a2291436bde3/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-12-13 20:11:55,390 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 20:11:55,390 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 20:11:55,390 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 20:11:55,391 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 20:11:55,391 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 20:11:55,391 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 20:11:55,392 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 20:11:55,392 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 20:11:55,392 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 20:11:55,392 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 20:11:55,393 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 20:11:55,393 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 20:11:55,393 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 20:11:55,393 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 20:11:55,393 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 20:11:55,393 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 20:11:55,393 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 20:11:55,394 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 20:11:55,394 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 20:11:55,394 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 20:11:55,394 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 20:11:55,394 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 20:11:55,394 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 20:11:55,394 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 20:11:55,395 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 20:11:55,395 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 20:11:55,395 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 20:11:55,395 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 20:11:55,395 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 20:11:55,395 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 20:11:55,395 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 20:11:55,396 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-13 20:11:55,396 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 20:11:55,396 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 20:11:55,396 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 20:11:55,396 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_7a3df2ba-a6ed-46c6-af1e-a2291436bde3/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_7a3df2ba-a6ed-46c6-af1e-a2291436bde3/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 -> 11eadb3d3dbb959cb5d260936a4e759de0e9c0b331e2b23d922151dc0bfe3fa5 [2022-12-13 20:11:55,576 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 20:11:55,593 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 20:11:55,595 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 20:11:55,596 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 20:11:55,596 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 20:11:55,597 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a3df2ba-a6ed-46c6-af1e-a2291436bde3/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/pthread-wmm/safe034_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-12-13 20:11:58,207 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 20:11:58,392 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 20:11:58,393 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a3df2ba-a6ed-46c6-af1e-a2291436bde3/sv-benchmarks/c/pthread-wmm/safe034_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-12-13 20:11:58,404 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a3df2ba-a6ed-46c6-af1e-a2291436bde3/bin/uautomizer-uyxdKDjOR8/data/853101932/4ebbe8b7b0d347e088175550a04b8a3c/FLAG1f40ffc8a [2022-12-13 20:11:58,418 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a3df2ba-a6ed-46c6-af1e-a2291436bde3/bin/uautomizer-uyxdKDjOR8/data/853101932/4ebbe8b7b0d347e088175550a04b8a3c [2022-12-13 20:11:58,420 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 20:11:58,421 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 20:11:58,422 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 20:11:58,422 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 20:11:58,425 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 20:11:58,426 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 08:11:58" (1/1) ... [2022-12-13 20:11:58,426 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77bb314 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:11:58, skipping insertion in model container [2022-12-13 20:11:58,427 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 08:11:58" (1/1) ... [2022-12-13 20:11:58,432 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 20:11:58,459 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 20:11:58,569 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_7a3df2ba-a6ed-46c6-af1e-a2291436bde3/sv-benchmarks/c/pthread-wmm/safe034_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[996,1009] [2022-12-13 20:11:58,672 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 20:11:58,672 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 20:11:58,673 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 20:11:58,673 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 20:11:58,673 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 20:11:58,673 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 20:11:58,673 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 20:11:58,674 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 20:11:58,674 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 20:11:58,674 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 20:11:58,675 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 20:11:58,675 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 20:11:58,675 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 20:11:58,675 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 20:11:58,676 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 20:11:58,682 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 20:11:58,683 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 20:11:58,683 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 20:11:58,683 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 20:11:58,683 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 20:11:58,684 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 20:11:58,685 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 20:11:58,685 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 20:11:58,686 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 20:11:58,686 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 20:11:58,688 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 20:11:58,688 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 20:11:58,688 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 20:11:58,692 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 20:11:58,693 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 20:11:58,693 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 20:11:58,695 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 20:11:58,695 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 20:11:58,695 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 20:11:58,696 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 20:11:58,704 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 20:11:58,713 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_7a3df2ba-a6ed-46c6-af1e-a2291436bde3/sv-benchmarks/c/pthread-wmm/safe034_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[996,1009] [2022-12-13 20:11:58,729 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 20:11:58,729 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 20:11:58,730 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 20:11:58,730 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 20:11:58,730 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 20:11:58,730 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 20:11:58,730 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 20:11:58,730 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 20:11:58,730 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 20:11:58,731 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 20:11:58,731 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 20:11:58,731 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 20:11:58,731 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 20:11:58,731 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 20:11:58,732 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 20:11:58,736 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 20:11:58,737 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 20:11:58,737 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 20:11:58,737 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 20:11:58,737 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 20:11:58,738 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 20:11:58,738 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 20:11:58,739 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 20:11:58,739 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 20:11:58,739 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 20:11:58,740 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 20:11:58,740 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 20:11:58,741 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 20:11:58,743 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 20:11:58,744 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 20:11:58,744 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 20:11:58,745 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 20:11:58,745 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 20:11:58,746 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 20:11:58,746 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 20:11:58,766 INFO L208 MainTranslator]: Completed translation [2022-12-13 20:11:58,766 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:11:58 WrapperNode [2022-12-13 20:11:58,766 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 20:11:58,767 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 20:11:58,767 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 20:11:58,767 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 20:11:58,773 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:11:58" (1/1) ... [2022-12-13 20:11:58,782 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:11:58" (1/1) ... [2022-12-13 20:11:58,798 INFO L138 Inliner]: procedures = 176, calls = 58, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 128 [2022-12-13 20:11:58,798 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 20:11:58,799 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 20:11:58,799 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 20:11:58,799 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 20:11:58,806 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:11:58" (1/1) ... [2022-12-13 20:11:58,806 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:11:58" (1/1) ... [2022-12-13 20:11:58,808 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:11:58" (1/1) ... [2022-12-13 20:11:58,808 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:11:58" (1/1) ... [2022-12-13 20:11:58,813 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:11:58" (1/1) ... [2022-12-13 20:11:58,815 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:11:58" (1/1) ... [2022-12-13 20:11:58,816 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:11:58" (1/1) ... [2022-12-13 20:11:58,817 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:11:58" (1/1) ... [2022-12-13 20:11:58,819 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 20:11:58,820 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 20:11:58,820 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 20:11:58,820 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 20:11:58,820 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:11:58" (1/1) ... [2022-12-13 20:11:58,825 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 20:11:58,835 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a3df2ba-a6ed-46c6-af1e-a2291436bde3/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 20:11:58,846 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a3df2ba-a6ed-46c6-af1e-a2291436bde3/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 20:11:58,848 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a3df2ba-a6ed-46c6-af1e-a2291436bde3/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 20:11:58,881 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 20:11:58,881 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 20:11:58,881 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 20:11:58,881 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 20:11:58,881 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 20:11:58,881 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 20:11:58,881 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 20:11:58,882 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 20:11:58,882 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 20:11:58,882 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-13 20:11:58,882 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-13 20:11:58,882 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 20:11:58,882 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 20:11:58,882 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 20:11:58,882 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 20:11:58,883 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 20:11:58,999 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 20:11:59,001 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 20:11:59,222 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 20:11:59,301 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 20:11:59,301 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 20:11:59,303 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 08:11:59 BoogieIcfgContainer [2022-12-13 20:11:59,303 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 20:11:59,305 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 20:11:59,305 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 20:11:59,307 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 20:11:59,307 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 08:11:58" (1/3) ... [2022-12-13 20:11:59,308 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16362ee0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 08:11:59, skipping insertion in model container [2022-12-13 20:11:59,308 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:11:58" (2/3) ... [2022-12-13 20:11:59,308 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16362ee0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 08:11:59, skipping insertion in model container [2022-12-13 20:11:59,308 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 08:11:59" (3/3) ... [2022-12-13 20:11:59,309 INFO L112 eAbstractionObserver]: Analyzing ICFG safe034_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-12-13 20:11:59,316 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-12-13 20:11:59,324 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 20:11:59,324 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-13 20:11:59,324 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 20:11:59,360 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 20:11:59,386 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 121 places, 113 transitions, 241 flow [2022-12-13 20:11:59,419 INFO L130 PetriNetUnfolder]: 2/110 cut-off events. [2022-12-13 20:11:59,419 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 20:11:59,423 INFO L83 FinitePrefix]: Finished finitePrefix Result has 120 conditions, 110 events. 2/110 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 51 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 71. Up to 2 conditions per place. [2022-12-13 20:11:59,423 INFO L82 GeneralOperation]: Start removeDead. Operand has 121 places, 113 transitions, 241 flow [2022-12-13 20:11:59,426 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 118 places, 110 transitions, 229 flow [2022-12-13 20:11:59,428 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-12-13 20:11:59,436 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 118 places, 110 transitions, 229 flow [2022-12-13 20:11:59,438 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 118 places, 110 transitions, 229 flow [2022-12-13 20:11:59,438 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 118 places, 110 transitions, 229 flow [2022-12-13 20:11:59,456 INFO L130 PetriNetUnfolder]: 2/110 cut-off events. [2022-12-13 20:11:59,456 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 20:11:59,457 INFO L83 FinitePrefix]: Finished finitePrefix Result has 120 conditions, 110 events. 2/110 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 51 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 71. Up to 2 conditions per place. [2022-12-13 20:11:59,458 INFO L119 LiptonReduction]: Number of co-enabled transitions 1836 [2022-12-13 20:12:01,985 INFO L134 LiptonReduction]: Checked pairs total: 3965 [2022-12-13 20:12:01,985 INFO L136 LiptonReduction]: Total number of compositions: 101 [2022-12-13 20:12:01,995 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 20:12:01,999 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;@54e0124a, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 20:12:02,000 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-13 20:12:02,003 INFO L130 PetriNetUnfolder]: 0/12 cut-off events. [2022-12-13 20:12:02,003 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 20:12:02,003 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 20:12:02,004 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:12:02,004 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 20:12:02,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:12:02,008 INFO L85 PathProgramCache]: Analyzing trace with hash -1062582655, now seen corresponding path program 1 times [2022-12-13 20:12:02,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:12:02,014 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903007101] [2022-12-13 20:12:02,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:12:02,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:12:02,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:12:02,317 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 20:12:02,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:12:02,318 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903007101] [2022-12-13 20:12:02,319 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903007101] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:12:02,319 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:12:02,319 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 20:12:02,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089939264] [2022-12-13 20:12:02,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:12:02,326 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 20:12:02,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:12:02,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 20:12:02,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 20:12:02,348 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 214 [2022-12-13 20:12:02,350 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 22 transitions, 53 flow. Second operand has 3 states, 3 states have (on average 103.33333333333333) internal successors, (310), 3 states have internal predecessors, (310), 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 20:12:02,350 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 20:12:02,350 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 214 [2022-12-13 20:12:02,351 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 20:12:02,536 INFO L130 PetriNetUnfolder]: 511/844 cut-off events. [2022-12-13 20:12:02,536 INFO L131 PetriNetUnfolder]: For 11/11 co-relation queries the response was YES. [2022-12-13 20:12:02,539 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1663 conditions, 844 events. 511/844 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 3942 event pairs, 112 based on Foata normal form. 0/795 useless extension candidates. Maximal degree in co-relation 1652. Up to 580 conditions per place. [2022-12-13 20:12:02,543 INFO L137 encePairwiseOnDemand]: 210/214 looper letters, 23 selfloop transitions, 2 changer transitions 2/29 dead transitions. [2022-12-13 20:12:02,544 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 29 transitions, 121 flow [2022-12-13 20:12:02,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 20:12:02,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 20:12:02,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 333 transitions. [2022-12-13 20:12:02,557 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5186915887850467 [2022-12-13 20:12:02,558 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 333 transitions. [2022-12-13 20:12:02,558 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 333 transitions. [2022-12-13 20:12:02,559 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 20:12:02,561 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 333 transitions. [2022-12-13 20:12:02,563 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 111.0) internal successors, (333), 3 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 20:12:02,567 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 214.0) internal successors, (856), 4 states have internal predecessors, (856), 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 20:12:02,568 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 214.0) internal successors, (856), 4 states have internal predecessors, (856), 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 20:12:02,569 INFO L175 Difference]: Start difference. First operand has 31 places, 22 transitions, 53 flow. Second operand 3 states and 333 transitions. [2022-12-13 20:12:02,570 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 29 transitions, 121 flow [2022-12-13 20:12:02,571 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 29 transitions, 118 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-13 20:12:02,573 INFO L231 Difference]: Finished difference. Result has 29 places, 19 transitions, 48 flow [2022-12-13 20:12:02,575 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=48, PETRI_PLACES=29, PETRI_TRANSITIONS=19} [2022-12-13 20:12:02,578 INFO L288 CegarLoopForPetriNet]: 31 programPoint places, -2 predicate places. [2022-12-13 20:12:02,579 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 19 transitions, 48 flow [2022-12-13 20:12:02,579 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 103.33333333333333) internal successors, (310), 3 states have internal predecessors, (310), 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 20:12:02,579 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 20:12:02,579 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:12:02,579 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 20:12:02,580 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 20:12:02,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:12:02,580 INFO L85 PathProgramCache]: Analyzing trace with hash 1060342993, now seen corresponding path program 1 times [2022-12-13 20:12:02,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:12:02,581 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831745102] [2022-12-13 20:12:02,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:12:02,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:12:02,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:12:02,781 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 20:12:02,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:12:02,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831745102] [2022-12-13 20:12:02,782 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831745102] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:12:02,782 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:12:02,782 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 20:12:02,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885655654] [2022-12-13 20:12:02,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:12:02,783 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 20:12:02,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:12:02,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 20:12:02,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 20:12:02,790 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 214 [2022-12-13 20:12:02,790 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 19 transitions, 48 flow. Second operand has 3 states, 3 states have (on average 102.0) internal successors, (306), 3 states have internal predecessors, (306), 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 20:12:02,790 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 20:12:02,791 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 214 [2022-12-13 20:12:02,791 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 20:12:02,922 INFO L130 PetriNetUnfolder]: 489/786 cut-off events. [2022-12-13 20:12:02,922 INFO L131 PetriNetUnfolder]: For 42/42 co-relation queries the response was YES. [2022-12-13 20:12:02,924 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1618 conditions, 786 events. 489/786 cut-off events. For 42/42 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 3317 event pairs, 117 based on Foata normal form. 8/794 useless extension candidates. Maximal degree in co-relation 1608. Up to 689 conditions per place. [2022-12-13 20:12:02,927 INFO L137 encePairwiseOnDemand]: 210/214 looper letters, 27 selfloop transitions, 3 changer transitions 0/31 dead transitions. [2022-12-13 20:12:02,927 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 31 transitions, 138 flow [2022-12-13 20:12:02,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 20:12:02,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 20:12:02,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 328 transitions. [2022-12-13 20:12:02,930 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5109034267912772 [2022-12-13 20:12:02,930 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 328 transitions. [2022-12-13 20:12:02,930 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 328 transitions. [2022-12-13 20:12:02,931 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 20:12:02,931 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 328 transitions. [2022-12-13 20:12:02,932 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 109.33333333333333) internal successors, (328), 3 states have internal predecessors, (328), 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 20:12:02,934 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 214.0) internal successors, (856), 4 states have internal predecessors, (856), 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 20:12:02,934 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 214.0) internal successors, (856), 4 states have internal predecessors, (856), 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 20:12:02,934 INFO L175 Difference]: Start difference. First operand has 29 places, 19 transitions, 48 flow. Second operand 3 states and 328 transitions. [2022-12-13 20:12:02,935 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 31 transitions, 138 flow [2022-12-13 20:12:02,935 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 31 transitions, 132 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 20:12:02,936 INFO L231 Difference]: Finished difference. Result has 29 places, 21 transitions, 63 flow [2022-12-13 20:12:02,936 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=44, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=63, PETRI_PLACES=29, PETRI_TRANSITIONS=21} [2022-12-13 20:12:02,937 INFO L288 CegarLoopForPetriNet]: 31 programPoint places, -2 predicate places. [2022-12-13 20:12:02,937 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 21 transitions, 63 flow [2022-12-13 20:12:02,937 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 102.0) internal successors, (306), 3 states have internal predecessors, (306), 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 20:12:02,937 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 20:12:02,937 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:12:02,937 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 20:12:02,938 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 20:12:02,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:12:02,938 INFO L85 PathProgramCache]: Analyzing trace with hash -1489106888, now seen corresponding path program 1 times [2022-12-13 20:12:02,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:12:02,938 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549501291] [2022-12-13 20:12:02,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:12:02,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:12:02,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:12:03,051 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 20:12:03,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:12:03,051 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549501291] [2022-12-13 20:12:03,052 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549501291] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:12:03,052 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:12:03,052 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 20:12:03,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409068715] [2022-12-13 20:12:03,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:12:03,052 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 20:12:03,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:12:03,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 20:12:03,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 20:12:03,064 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 214 [2022-12-13 20:12:03,065 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 21 transitions, 63 flow. Second operand has 4 states, 4 states have (on average 96.5) internal successors, (386), 4 states have internal predecessors, (386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:12:03,065 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 20:12:03,065 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 214 [2022-12-13 20:12:03,065 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 20:12:03,228 INFO L130 PetriNetUnfolder]: 351/600 cut-off events. [2022-12-13 20:12:03,228 INFO L131 PetriNetUnfolder]: For 73/73 co-relation queries the response was YES. [2022-12-13 20:12:03,229 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1370 conditions, 600 events. 351/600 cut-off events. For 73/73 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 2613 event pairs, 70 based on Foata normal form. 56/650 useless extension candidates. Maximal degree in co-relation 1359. Up to 368 conditions per place. [2022-12-13 20:12:03,232 INFO L137 encePairwiseOnDemand]: 208/214 looper letters, 27 selfloop transitions, 4 changer transitions 19/53 dead transitions. [2022-12-13 20:12:03,232 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 53 transitions, 246 flow [2022-12-13 20:12:03,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 20:12:03,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 20:12:03,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 518 transitions. [2022-12-13 20:12:03,235 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.48411214953271026 [2022-12-13 20:12:03,235 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 518 transitions. [2022-12-13 20:12:03,235 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 518 transitions. [2022-12-13 20:12:03,235 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 20:12:03,235 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 518 transitions. [2022-12-13 20:12:03,237 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 103.6) internal successors, (518), 5 states have internal predecessors, (518), 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 20:12:03,240 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 214.0) internal successors, (1284), 6 states have internal predecessors, (1284), 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 20:12:03,240 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 214.0) internal successors, (1284), 6 states have internal predecessors, (1284), 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 20:12:03,240 INFO L175 Difference]: Start difference. First operand has 29 places, 21 transitions, 63 flow. Second operand 5 states and 518 transitions. [2022-12-13 20:12:03,241 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 53 transitions, 246 flow [2022-12-13 20:12:03,241 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 53 transitions, 240 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 20:12:03,242 INFO L231 Difference]: Finished difference. Result has 35 places, 24 transitions, 96 flow [2022-12-13 20:12:03,242 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=96, PETRI_PLACES=35, PETRI_TRANSITIONS=24} [2022-12-13 20:12:03,243 INFO L288 CegarLoopForPetriNet]: 31 programPoint places, 4 predicate places. [2022-12-13 20:12:03,243 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 24 transitions, 96 flow [2022-12-13 20:12:03,243 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 96.5) internal successors, (386), 4 states have internal predecessors, (386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:12:03,244 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 20:12:03,244 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:12:03,244 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 20:12:03,244 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 20:12:03,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:12:03,245 INFO L85 PathProgramCache]: Analyzing trace with hash -1036640260, now seen corresponding path program 1 times [2022-12-13 20:12:03,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:12:03,245 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800798880] [2022-12-13 20:12:03,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:12:03,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:12:03,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:12:03,356 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 20:12:03,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:12:03,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800798880] [2022-12-13 20:12:03,356 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800798880] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:12:03,356 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:12:03,356 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 20:12:03,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411413321] [2022-12-13 20:12:03,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:12:03,357 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 20:12:03,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:12:03,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 20:12:03,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 20:12:03,368 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 214 [2022-12-13 20:12:03,369 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 24 transitions, 96 flow. Second operand has 5 states, 5 states have (on average 96.2) internal successors, (481), 5 states have internal predecessors, (481), 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 20:12:03,369 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 20:12:03,369 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 214 [2022-12-13 20:12:03,369 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 20:12:03,502 INFO L130 PetriNetUnfolder]: 172/324 cut-off events. [2022-12-13 20:12:03,502 INFO L131 PetriNetUnfolder]: For 159/159 co-relation queries the response was YES. [2022-12-13 20:12:03,502 INFO L83 FinitePrefix]: Finished finitePrefix Result has 962 conditions, 324 events. 172/324 cut-off events. For 159/159 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1235 event pairs, 33 based on Foata normal form. 32/354 useless extension candidates. Maximal degree in co-relation 947. Up to 119 conditions per place. [2022-12-13 20:12:03,504 INFO L137 encePairwiseOnDemand]: 208/214 looper letters, 34 selfloop transitions, 7 changer transitions 18/62 dead transitions. [2022-12-13 20:12:03,504 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 62 transitions, 346 flow [2022-12-13 20:12:03,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 20:12:03,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 20:12:03,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 622 transitions. [2022-12-13 20:12:03,506 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.48442367601246106 [2022-12-13 20:12:03,506 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 622 transitions. [2022-12-13 20:12:03,507 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 622 transitions. [2022-12-13 20:12:03,507 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 20:12:03,507 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 622 transitions. [2022-12-13 20:12:03,509 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 103.66666666666667) internal successors, (622), 6 states have internal predecessors, (622), 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 20:12:03,511 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 214.0) internal successors, (1498), 7 states have internal predecessors, (1498), 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 20:12:03,512 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 214.0) internal successors, (1498), 7 states have internal predecessors, (1498), 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 20:12:03,512 INFO L175 Difference]: Start difference. First operand has 35 places, 24 transitions, 96 flow. Second operand 6 states and 622 transitions. [2022-12-13 20:12:03,512 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 62 transitions, 346 flow [2022-12-13 20:12:03,514 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 62 transitions, 340 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-12-13 20:12:03,515 INFO L231 Difference]: Finished difference. Result has 39 places, 27 transitions, 146 flow [2022-12-13 20:12:03,515 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=146, PETRI_PLACES=39, PETRI_TRANSITIONS=27} [2022-12-13 20:12:03,516 INFO L288 CegarLoopForPetriNet]: 31 programPoint places, 8 predicate places. [2022-12-13 20:12:03,516 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 27 transitions, 146 flow [2022-12-13 20:12:03,517 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 96.2) internal successors, (481), 5 states have internal predecessors, (481), 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 20:12:03,517 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 20:12:03,517 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:12:03,517 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 20:12:03,517 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 20:12:03,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:12:03,518 INFO L85 PathProgramCache]: Analyzing trace with hash 1075828790, now seen corresponding path program 1 times [2022-12-13 20:12:03,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:12:03,518 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113718816] [2022-12-13 20:12:03,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:12:03,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:12:03,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:12:03,669 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 20:12:03,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:12:03,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113718816] [2022-12-13 20:12:03,669 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113718816] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:12:03,669 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:12:03,669 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 20:12:03,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409683110] [2022-12-13 20:12:03,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:12:03,670 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 20:12:03,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:12:03,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 20:12:03,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 20:12:03,677 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 214 [2022-12-13 20:12:03,678 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 27 transitions, 146 flow. Second operand has 4 states, 4 states have (on average 101.75) internal successors, (407), 4 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 20:12:03,678 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 20:12:03,678 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 214 [2022-12-13 20:12:03,678 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 20:12:03,786 INFO L130 PetriNetUnfolder]: 228/431 cut-off events. [2022-12-13 20:12:03,787 INFO L131 PetriNetUnfolder]: For 567/567 co-relation queries the response was YES. [2022-12-13 20:12:03,787 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1434 conditions, 431 events. 228/431 cut-off events. For 567/567 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1791 event pairs, 29 based on Foata normal form. 8/438 useless extension candidates. Maximal degree in co-relation 1416. Up to 228 conditions per place. [2022-12-13 20:12:03,789 INFO L137 encePairwiseOnDemand]: 211/214 looper letters, 38 selfloop transitions, 2 changer transitions 15/57 dead transitions. [2022-12-13 20:12:03,789 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 57 transitions, 430 flow [2022-12-13 20:12:03,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 20:12:03,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 20:12:03,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 432 transitions. [2022-12-13 20:12:03,790 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5046728971962616 [2022-12-13 20:12:03,791 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 432 transitions. [2022-12-13 20:12:03,791 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 432 transitions. [2022-12-13 20:12:03,791 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 20:12:03,791 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 432 transitions. [2022-12-13 20:12:03,792 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 108.0) internal successors, (432), 4 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 20:12:03,794 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 214.0) internal successors, (1070), 5 states have internal predecessors, (1070), 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 20:12:03,795 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 214.0) internal successors, (1070), 5 states have internal predecessors, (1070), 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 20:12:03,795 INFO L175 Difference]: Start difference. First operand has 39 places, 27 transitions, 146 flow. Second operand 4 states and 432 transitions. [2022-12-13 20:12:03,795 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 57 transitions, 430 flow [2022-12-13 20:12:03,799 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 57 transitions, 356 flow, removed 28 selfloop flow, removed 4 redundant places. [2022-12-13 20:12:03,800 INFO L231 Difference]: Finished difference. Result has 38 places, 28 transitions, 129 flow [2022-12-13 20:12:03,800 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=129, PETRI_PLACES=38, PETRI_TRANSITIONS=28} [2022-12-13 20:12:03,801 INFO L288 CegarLoopForPetriNet]: 31 programPoint places, 7 predicate places. [2022-12-13 20:12:03,801 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 28 transitions, 129 flow [2022-12-13 20:12:03,801 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 101.75) internal successors, (407), 4 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 20:12:03,801 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 20:12:03,801 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:12:03,801 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 20:12:03,802 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 20:12:03,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:12:03,802 INFO L85 PathProgramCache]: Analyzing trace with hash -928726432, now seen corresponding path program 2 times [2022-12-13 20:12:03,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:12:03,802 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674403619] [2022-12-13 20:12:03,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:12:03,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:12:03,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:12:03,952 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 20:12:03,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:12:03,953 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674403619] [2022-12-13 20:12:03,953 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674403619] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:12:03,953 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:12:03,953 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 20:12:03,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811760607] [2022-12-13 20:12:03,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:12:03,954 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 20:12:03,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:12:03,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 20:12:03,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-13 20:12:03,970 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 214 [2022-12-13 20:12:03,971 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 28 transitions, 129 flow. Second operand has 6 states, 6 states have (on average 96.33333333333333) internal successors, (578), 6 states have internal predecessors, (578), 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 20:12:03,971 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 20:12:03,971 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 214 [2022-12-13 20:12:03,971 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 20:12:04,097 INFO L130 PetriNetUnfolder]: 155/306 cut-off events. [2022-12-13 20:12:04,097 INFO L131 PetriNetUnfolder]: For 261/262 co-relation queries the response was YES. [2022-12-13 20:12:04,098 INFO L83 FinitePrefix]: Finished finitePrefix Result has 936 conditions, 306 events. 155/306 cut-off events. For 261/262 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1220 event pairs, 37 based on Foata normal form. 17/314 useless extension candidates. Maximal degree in co-relation 919. Up to 115 conditions per place. [2022-12-13 20:12:04,099 INFO L137 encePairwiseOnDemand]: 208/214 looper letters, 29 selfloop transitions, 10 changer transitions 12/54 dead transitions. [2022-12-13 20:12:04,099 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 54 transitions, 326 flow [2022-12-13 20:12:04,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 20:12:04,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 20:12:04,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 708 transitions. [2022-12-13 20:12:04,101 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.472630173564753 [2022-12-13 20:12:04,101 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 708 transitions. [2022-12-13 20:12:04,101 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 708 transitions. [2022-12-13 20:12:04,102 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 20:12:04,102 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 708 transitions. [2022-12-13 20:12:04,103 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 101.14285714285714) internal successors, (708), 7 states have internal predecessors, (708), 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 20:12:04,104 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 214.0) internal successors, (1712), 8 states have internal predecessors, (1712), 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 20:12:04,104 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 214.0) internal successors, (1712), 8 states have internal predecessors, (1712), 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 20:12:04,104 INFO L175 Difference]: Start difference. First operand has 38 places, 28 transitions, 129 flow. Second operand 7 states and 708 transitions. [2022-12-13 20:12:04,104 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 54 transitions, 326 flow [2022-12-13 20:12:04,106 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 54 transitions, 308 flow, removed 7 selfloop flow, removed 1 redundant places. [2022-12-13 20:12:04,107 INFO L231 Difference]: Finished difference. Result has 46 places, 27 transitions, 146 flow [2022-12-13 20:12:04,107 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=146, PETRI_PLACES=46, PETRI_TRANSITIONS=27} [2022-12-13 20:12:04,108 INFO L288 CegarLoopForPetriNet]: 31 programPoint places, 15 predicate places. [2022-12-13 20:12:04,108 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 27 transitions, 146 flow [2022-12-13 20:12:04,108 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 96.33333333333333) internal successors, (578), 6 states have internal predecessors, (578), 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 20:12:04,108 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 20:12:04,108 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:12:04,109 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 20:12:04,109 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 20:12:04,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:12:04,109 INFO L85 PathProgramCache]: Analyzing trace with hash -584978423, now seen corresponding path program 1 times [2022-12-13 20:12:04,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:12:04,109 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973466281] [2022-12-13 20:12:04,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:12:04,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:12:04,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:12:04,238 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 20:12:04,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:12:04,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973466281] [2022-12-13 20:12:04,238 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1973466281] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:12:04,238 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:12:04,238 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 20:12:04,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840583539] [2022-12-13 20:12:04,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:12:04,239 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 20:12:04,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:12:04,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 20:12:04,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 20:12:04,248 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 214 [2022-12-13 20:12:04,249 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 27 transitions, 146 flow. Second operand has 3 states, 3 states have (on average 102.33333333333333) internal successors, (307), 3 states have internal predecessors, (307), 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 20:12:04,249 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 20:12:04,249 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 214 [2022-12-13 20:12:04,249 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 20:12:04,339 INFO L130 PetriNetUnfolder]: 175/343 cut-off events. [2022-12-13 20:12:04,339 INFO L131 PetriNetUnfolder]: For 494/494 co-relation queries the response was YES. [2022-12-13 20:12:04,340 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1159 conditions, 343 events. 175/343 cut-off events. For 494/494 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1395 event pairs, 26 based on Foata normal form. 1/344 useless extension candidates. Maximal degree in co-relation 1144. Up to 244 conditions per place. [2022-12-13 20:12:04,341 INFO L137 encePairwiseOnDemand]: 208/214 looper letters, 34 selfloop transitions, 6 changer transitions 10/50 dead transitions. [2022-12-13 20:12:04,341 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 50 transitions, 372 flow [2022-12-13 20:12:04,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 20:12:04,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 20:12:04,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 324 transitions. [2022-12-13 20:12:04,343 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5046728971962616 [2022-12-13 20:12:04,343 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 324 transitions. [2022-12-13 20:12:04,343 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 324 transitions. [2022-12-13 20:12:04,343 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 20:12:04,343 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 324 transitions. [2022-12-13 20:12:04,344 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 108.0) internal successors, (324), 3 states have internal predecessors, (324), 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 20:12:04,345 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 214.0) internal successors, (856), 4 states have internal predecessors, (856), 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 20:12:04,345 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 214.0) internal successors, (856), 4 states have internal predecessors, (856), 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 20:12:04,346 INFO L175 Difference]: Start difference. First operand has 46 places, 27 transitions, 146 flow. Second operand 3 states and 324 transitions. [2022-12-13 20:12:04,346 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 50 transitions, 372 flow [2022-12-13 20:12:04,348 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 50 transitions, 308 flow, removed 19 selfloop flow, removed 7 redundant places. [2022-12-13 20:12:04,349 INFO L231 Difference]: Finished difference. Result has 40 places, 29 transitions, 150 flow [2022-12-13 20:12:04,349 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=150, PETRI_PLACES=40, PETRI_TRANSITIONS=29} [2022-12-13 20:12:04,350 INFO L288 CegarLoopForPetriNet]: 31 programPoint places, 9 predicate places. [2022-12-13 20:12:04,350 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 29 transitions, 150 flow [2022-12-13 20:12:04,350 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 102.33333333333333) internal successors, (307), 3 states have internal predecessors, (307), 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 20:12:04,350 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 20:12:04,350 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:12:04,350 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 20:12:04,351 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 20:12:04,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:12:04,351 INFO L85 PathProgramCache]: Analyzing trace with hash 1808355855, now seen corresponding path program 2 times [2022-12-13 20:12:04,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:12:04,351 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038406999] [2022-12-13 20:12:04,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:12:04,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:12:04,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:12:04,519 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 20:12:04,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:12:04,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038406999] [2022-12-13 20:12:04,520 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038406999] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:12:04,520 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:12:04,520 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 20:12:04,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841411297] [2022-12-13 20:12:04,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:12:04,521 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 20:12:04,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:12:04,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 20:12:04,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 20:12:04,530 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 214 [2022-12-13 20:12:04,531 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 29 transitions, 150 flow. Second operand has 4 states, 4 states have (on average 100.75) internal successors, (403), 4 states have internal predecessors, (403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:12:04,531 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 20:12:04,531 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 214 [2022-12-13 20:12:04,531 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 20:12:04,625 INFO L130 PetriNetUnfolder]: 175/369 cut-off events. [2022-12-13 20:12:04,625 INFO L131 PetriNetUnfolder]: For 449/449 co-relation queries the response was YES. [2022-12-13 20:12:04,626 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1287 conditions, 369 events. 175/369 cut-off events. For 449/449 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1620 event pairs, 38 based on Foata normal form. 1/370 useless extension candidates. Maximal degree in co-relation 1268. Up to 202 conditions per place. [2022-12-13 20:12:04,627 INFO L137 encePairwiseOnDemand]: 209/214 looper letters, 24 selfloop transitions, 3 changer transitions 23/50 dead transitions. [2022-12-13 20:12:04,627 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 50 transitions, 342 flow [2022-12-13 20:12:04,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 20:12:04,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 20:12:04,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 422 transitions. [2022-12-13 20:12:04,629 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4929906542056075 [2022-12-13 20:12:04,629 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 422 transitions. [2022-12-13 20:12:04,629 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 422 transitions. [2022-12-13 20:12:04,629 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 20:12:04,629 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 422 transitions. [2022-12-13 20:12:04,630 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 105.5) internal successors, (422), 4 states have internal predecessors, (422), 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 20:12:04,632 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 214.0) internal successors, (1070), 5 states have internal predecessors, (1070), 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 20:12:04,632 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 214.0) internal successors, (1070), 5 states have internal predecessors, (1070), 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 20:12:04,632 INFO L175 Difference]: Start difference. First operand has 40 places, 29 transitions, 150 flow. Second operand 4 states and 422 transitions. [2022-12-13 20:12:04,632 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 50 transitions, 342 flow [2022-12-13 20:12:04,635 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 50 transitions, 328 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 20:12:04,636 INFO L231 Difference]: Finished difference. Result has 42 places, 25 transitions, 126 flow [2022-12-13 20:12:04,636 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=126, PETRI_PLACES=42, PETRI_TRANSITIONS=25} [2022-12-13 20:12:04,637 INFO L288 CegarLoopForPetriNet]: 31 programPoint places, 11 predicate places. [2022-12-13 20:12:04,637 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 25 transitions, 126 flow [2022-12-13 20:12:04,637 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 100.75) internal successors, (403), 4 states have internal predecessors, (403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:12:04,637 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 20:12:04,637 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:12:04,637 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 20:12:04,638 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 20:12:04,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:12:04,638 INFO L85 PathProgramCache]: Analyzing trace with hash -191677427, now seen corresponding path program 3 times [2022-12-13 20:12:04,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:12:04,638 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581654435] [2022-12-13 20:12:04,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:12:04,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:12:04,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:12:05,189 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 20:12:05,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:12:05,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581654435] [2022-12-13 20:12:05,190 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1581654435] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:12:05,190 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:12:05,190 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 20:12:05,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978189149] [2022-12-13 20:12:05,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:12:05,191 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 20:12:05,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:12:05,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 20:12:05,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 20:12:05,206 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 214 [2022-12-13 20:12:05,206 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 25 transitions, 126 flow. Second operand has 5 states, 5 states have (on average 95.8) internal successors, (479), 5 states have internal predecessors, (479), 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 20:12:05,206 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 20:12:05,206 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 214 [2022-12-13 20:12:05,207 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 20:12:05,300 INFO L130 PetriNetUnfolder]: 46/116 cut-off events. [2022-12-13 20:12:05,300 INFO L131 PetriNetUnfolder]: For 142/142 co-relation queries the response was YES. [2022-12-13 20:12:05,301 INFO L83 FinitePrefix]: Finished finitePrefix Result has 419 conditions, 116 events. 46/116 cut-off events. For 142/142 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 327 event pairs, 6 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 399. Up to 34 conditions per place. [2022-12-13 20:12:05,301 INFO L137 encePairwiseOnDemand]: 207/214 looper letters, 22 selfloop transitions, 4 changer transitions 24/50 dead transitions. [2022-12-13 20:12:05,301 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 50 transitions, 353 flow [2022-12-13 20:12:05,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 20:12:05,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 20:12:05,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 681 transitions. [2022-12-13 20:12:05,303 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4546061415220294 [2022-12-13 20:12:05,304 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 681 transitions. [2022-12-13 20:12:05,304 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 681 transitions. [2022-12-13 20:12:05,304 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 20:12:05,304 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 681 transitions. [2022-12-13 20:12:05,306 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 97.28571428571429) internal successors, (681), 7 states have internal predecessors, (681), 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 20:12:05,308 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 214.0) internal successors, (1712), 8 states have internal predecessors, (1712), 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 20:12:05,309 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 214.0) internal successors, (1712), 8 states have internal predecessors, (1712), 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 20:12:05,309 INFO L175 Difference]: Start difference. First operand has 42 places, 25 transitions, 126 flow. Second operand 7 states and 681 transitions. [2022-12-13 20:12:05,309 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 50 transitions, 353 flow [2022-12-13 20:12:05,310 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 50 transitions, 325 flow, removed 5 selfloop flow, removed 7 redundant places. [2022-12-13 20:12:05,311 INFO L231 Difference]: Finished difference. Result has 45 places, 25 transitions, 126 flow [2022-12-13 20:12:05,311 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=126, PETRI_PLACES=45, PETRI_TRANSITIONS=25} [2022-12-13 20:12:05,311 INFO L288 CegarLoopForPetriNet]: 31 programPoint places, 14 predicate places. [2022-12-13 20:12:05,312 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 25 transitions, 126 flow [2022-12-13 20:12:05,312 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 95.8) internal successors, (479), 5 states have internal predecessors, (479), 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 20:12:05,312 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 20:12:05,312 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:12:05,312 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 20:12:05,312 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 20:12:05,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:12:05,313 INFO L85 PathProgramCache]: Analyzing trace with hash -157647891, now seen corresponding path program 4 times [2022-12-13 20:12:05,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:12:05,313 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506583799] [2022-12-13 20:12:05,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:12:05,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:12:05,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 20:12:05,356 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 20:12:05,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 20:12:05,391 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 20:12:05,391 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 20:12:05,392 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-13 20:12:05,393 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-12-13 20:12:05,393 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-13 20:12:05,393 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-12-13 20:12:05,394 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-12-13 20:12:05,394 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-13 20:12:05,394 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 20:12:05,394 INFO L445 BasicCegarLoop]: Path program histogram: [4, 2, 1, 1, 1, 1] [2022-12-13 20:12:05,399 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 20:12:05,399 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 20:12:05,442 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 08:12:05 BasicIcfg [2022-12-13 20:12:05,442 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 20:12:05,442 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-13 20:12:05,442 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-13 20:12:05,442 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-13 20:12:05,443 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 08:11:59" (3/4) ... [2022-12-13 20:12:05,444 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-12-13 20:12:05,485 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a3df2ba-a6ed-46c6-af1e-a2291436bde3/bin/uautomizer-uyxdKDjOR8/witness.graphml [2022-12-13 20:12:05,485 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-13 20:12:05,486 INFO L158 Benchmark]: Toolchain (without parser) took 7064.18ms. Allocated memory was 123.7MB in the beginning and 151.0MB in the end (delta: 27.3MB). Free memory was 87.1MB in the beginning and 86.7MB in the end (delta: 475.1kB). Peak memory consumption was 29.2MB. Max. memory is 16.1GB. [2022-12-13 20:12:05,486 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 123.7MB. Free memory is still 94.8MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 20:12:05,486 INFO L158 Benchmark]: CACSL2BoogieTranslator took 344.54ms. Allocated memory is still 123.7MB. Free memory was 87.1MB in the beginning and 61.1MB in the end (delta: 26.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2022-12-13 20:12:05,486 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.04ms. Allocated memory is still 123.7MB. Free memory was 61.1MB in the beginning and 58.8MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 20:12:05,486 INFO L158 Benchmark]: Boogie Preprocessor took 20.70ms. Allocated memory is still 123.7MB. Free memory was 58.8MB in the beginning and 57.0MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 20:12:05,487 INFO L158 Benchmark]: RCFGBuilder took 483.38ms. Allocated memory was 123.7MB in the beginning and 151.0MB in the end (delta: 27.3MB). Free memory was 56.7MB in the beginning and 109.4MB in the end (delta: -52.8MB). Peak memory consumption was 24.6MB. Max. memory is 16.1GB. [2022-12-13 20:12:05,487 INFO L158 Benchmark]: TraceAbstraction took 6136.78ms. Allocated memory is still 151.0MB. Free memory was 109.0MB in the beginning and 95.0MB in the end (delta: 14.0MB). Peak memory consumption was 15.0MB. Max. memory is 16.1GB. [2022-12-13 20:12:05,487 INFO L158 Benchmark]: Witness Printer took 42.96ms. Allocated memory is still 151.0MB. Free memory was 95.0MB in the beginning and 86.7MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-12-13 20:12:05,489 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.13ms. Allocated memory is still 123.7MB. Free memory is still 94.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 344.54ms. Allocated memory is still 123.7MB. Free memory was 87.1MB in the beginning and 61.1MB in the end (delta: 26.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.04ms. Allocated memory is still 123.7MB. Free memory was 61.1MB in the beginning and 58.8MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 20.70ms. Allocated memory is still 123.7MB. Free memory was 58.8MB in the beginning and 57.0MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 483.38ms. Allocated memory was 123.7MB in the beginning and 151.0MB in the end (delta: 27.3MB). Free memory was 56.7MB in the beginning and 109.4MB in the end (delta: -52.8MB). Peak memory consumption was 24.6MB. Max. memory is 16.1GB. * TraceAbstraction took 6136.78ms. Allocated memory is still 151.0MB. Free memory was 109.0MB in the beginning and 95.0MB in the end (delta: 14.0MB). Peak memory consumption was 15.0MB. Max. memory is 16.1GB. * Witness Printer took 42.96ms. Allocated memory is still 151.0MB. Free memory was 95.0MB in the beginning and 86.7MB in the end (delta: 8.4MB). 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.5s, 118 PlacesBefore, 31 PlacesAfterwards, 110 TransitionsBefore, 22 TransitionsAfterwards, 1836 CoEnabledTransitionPairs, 6 FixpointIterations, 41 TrivialSequentialCompositions, 50 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 1 ChoiceCompositions, 101 TotalNumberOfCompositions, 3965 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1995, independent: 1861, independent conditional: 0, independent unconditional: 1861, dependent: 134, dependent conditional: 0, dependent unconditional: 134, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1050, independent: 1010, independent conditional: 0, independent unconditional: 1010, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1995, independent: 851, independent conditional: 0, independent unconditional: 851, dependent: 94, dependent conditional: 0, dependent unconditional: 94, unknown: 1050, unknown conditional: 0, unknown unconditional: 1050] , Statistics on independence cache: Total cache size (in pairs): 73, Positive cache size: 60, Positive conditional cache size: 0, Positive unconditional cache size: 60, Negative cache size: 13, Negative conditional cache size: 0, Negative unconditional cache size: 13, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p1_EAX = 0; [L714] 0 _Bool main$tmp_guard0; [L715] 0 _Bool main$tmp_guard1; [L717] 0 int x = 0; [L719] 0 int y = 0; [L720] 0 _Bool y$flush_delayed; [L721] 0 int y$mem_tmp; [L722] 0 _Bool y$r_buff0_thd0; [L723] 0 _Bool y$r_buff0_thd1; [L724] 0 _Bool y$r_buff0_thd2; [L725] 0 _Bool y$r_buff0_thd3; [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$r_buff1_thd3; [L730] 0 _Bool y$read_delayed; [L731] 0 int *y$read_delayed_var; [L732] 0 int y$w_buff0; [L733] 0 _Bool y$w_buff0_used; [L734] 0 int y$w_buff1; [L735] 0 _Bool y$w_buff1_used; [L737] 0 int z = 0; [L738] 0 _Bool weak$$choice0; [L739] 0 _Bool weak$$choice2; [L827] 0 pthread_t t2577; [L828] FCALL, FORK 0 pthread_create(&t2577, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2577, ((void *)0), P0, ((void *)0))=-3, t2577={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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L829] 0 pthread_t t2578; [L830] FCALL, FORK 0 pthread_create(&t2578, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2578, ((void *)0), P1, ((void *)0))=-2, t2577={5:0}, t2578={6: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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L831] 0 pthread_t t2579; [L832] FCALL, FORK 0 pthread_create(&t2579, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2579, ((void *)0), P2, ((void *)0))=-1, t2577={5:0}, t2578={6:0}, t2579={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L790] 3 y$w_buff1 = y$w_buff0 [L791] 3 y$w_buff0 = 1 [L792] 3 y$w_buff1_used = y$w_buff0_used [L793] 3 y$w_buff0_used = (_Bool)1 [L794] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L794] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L795] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L796] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L797] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L798] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L799] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L802] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L743] 1 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L748] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L760] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L753] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L755] 1 return 0; [L765] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L766] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L767] 2 y$flush_delayed = weak$$choice2 [L768] 2 y$mem_tmp = y [L769] 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) [L770] 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)) [L771] 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)) [L772] 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)) [L773] 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)) [L774] 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)) [L775] 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)) [L776] 2 __unbuffered_p1_EAX = y [L777] 2 y = y$flush_delayed ? y$mem_tmp : y [L778] 2 y$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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=255, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L805] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L806] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L807] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L808] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L809] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=255, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L812] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L814] 3 return 0; [L783] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L785] 2 return 0; [L834] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L836] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L836] RET 0 assume_abort_if_not(main$tmp_guard0) [L838] 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) [L839] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L840] 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 [L841] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L842] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2577={5:0}, t2578={6:0}, t2579={3:0}, weak$$choice0=66, weak$$choice2=255, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L845] 0 main$tmp_guard1 = !(z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0) [L847] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=255, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] - 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: 830]: 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: 832]: 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: 828]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 138 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 6.0s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.6s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 289 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 221 mSDsluCounter, 71 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 28 mSDsCounter, 38 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 635 IncrementalHoareTripleChecker+Invalid, 673 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 38 mSolverCounterUnsat, 43 mSDtfsCounter, 635 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 33 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=150occurred in iteration=7, InterpolantAutomatonStates: 42, 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.6s InterpolantComputationTime, 144 NumberOfCodeBlocks, 144 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 116 ConstructedInterpolants, 0 QuantifiedInterpolants, 540 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-13 20:12:05,501 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a3df2ba-a6ed-46c6-af1e-a2291436bde3/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