./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix019.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d460dfb9-fdd2-4f8e-b57b-e2901bb18442/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d460dfb9-fdd2-4f8e-b57b-e2901bb18442/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_d460dfb9-fdd2-4f8e-b57b-e2901bb18442/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d460dfb9-fdd2-4f8e-b57b-e2901bb18442/bin/uautomizer-uyxdKDjOR8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix019.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d460dfb9-fdd2-4f8e-b57b-e2901bb18442/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_d460dfb9-fdd2-4f8e-b57b-e2901bb18442/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 67b3041d4ade18f863c3144705a5a5c36c735377f16a3c3ca7c2065b436994d1 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-2329fc7 [2022-12-13 16:07:00,531 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 16:07:00,533 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 16:07:00,551 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 16:07:00,552 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 16:07:00,553 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 16:07:00,554 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 16:07:00,556 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 16:07:00,557 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 16:07:00,558 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 16:07:00,559 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 16:07:00,560 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 16:07:00,561 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 16:07:00,562 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 16:07:00,563 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 16:07:00,564 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 16:07:00,564 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 16:07:00,565 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 16:07:00,567 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 16:07:00,569 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 16:07:00,570 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 16:07:00,571 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 16:07:00,572 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 16:07:00,573 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 16:07:00,577 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 16:07:00,577 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 16:07:00,577 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 16:07:00,578 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 16:07:00,579 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 16:07:00,580 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 16:07:00,580 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 16:07:00,581 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 16:07:00,581 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 16:07:00,582 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 16:07:00,583 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 16:07:00,583 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 16:07:00,584 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 16:07:00,584 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 16:07:00,585 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 16:07:00,585 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 16:07:00,586 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 16:07:00,587 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d460dfb9-fdd2-4f8e-b57b-e2901bb18442/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-12-13 16:07:00,607 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 16:07:00,608 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 16:07:00,608 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 16:07:00,608 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 16:07:00,609 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 16:07:00,609 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 16:07:00,610 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 16:07:00,610 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 16:07:00,610 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 16:07:00,610 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 16:07:00,610 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 16:07:00,611 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 16:07:00,611 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 16:07:00,611 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 16:07:00,611 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 16:07:00,611 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 16:07:00,611 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 16:07:00,612 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 16:07:00,612 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 16:07:00,612 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 16:07:00,612 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 16:07:00,613 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 16:07:00,613 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 16:07:00,613 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 16:07:00,613 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 16:07:00,613 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 16:07:00,614 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 16:07:00,614 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 16:07:00,614 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 16:07:00,614 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 16:07:00,614 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 16:07:00,615 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-13 16:07:00,615 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 16:07:00,615 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 16:07:00,615 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 16:07:00,615 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_d460dfb9-fdd2-4f8e-b57b-e2901bb18442/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_d460dfb9-fdd2-4f8e-b57b-e2901bb18442/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 -> 67b3041d4ade18f863c3144705a5a5c36c735377f16a3c3ca7c2065b436994d1 [2022-12-13 16:07:00,826 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 16:07:00,846 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 16:07:00,849 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 16:07:00,850 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 16:07:00,850 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 16:07:00,852 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d460dfb9-fdd2-4f8e-b57b-e2901bb18442/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/pthread-wmm/mix019.opt.i [2022-12-13 16:07:03,431 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 16:07:03,623 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 16:07:03,623 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d460dfb9-fdd2-4f8e-b57b-e2901bb18442/sv-benchmarks/c/pthread-wmm/mix019.opt.i [2022-12-13 16:07:03,636 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d460dfb9-fdd2-4f8e-b57b-e2901bb18442/bin/uautomizer-uyxdKDjOR8/data/45d545fed/e1ea8b61b19a4fc99ade63c6db4a0355/FLAG702af21f9 [2022-12-13 16:07:03,650 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d460dfb9-fdd2-4f8e-b57b-e2901bb18442/bin/uautomizer-uyxdKDjOR8/data/45d545fed/e1ea8b61b19a4fc99ade63c6db4a0355 [2022-12-13 16:07:03,652 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 16:07:03,654 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 16:07:03,655 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 16:07:03,655 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 16:07:03,659 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 16:07:03,659 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 04:07:03" (1/1) ... [2022-12-13 16:07:03,660 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7af0ff4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:07:03, skipping insertion in model container [2022-12-13 16:07:03,661 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 04:07:03" (1/1) ... [2022-12-13 16:07:03,668 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 16:07:03,712 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 16:07:03,842 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_d460dfb9-fdd2-4f8e-b57b-e2901bb18442/sv-benchmarks/c/pthread-wmm/mix019.opt.i[944,957] [2022-12-13 16:07:03,969 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:07:03,970 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:07:03,970 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:07:03,971 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:07:03,971 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:07:03,971 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:07:03,972 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:07:03,972 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:07:03,973 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:07:03,973 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:07:03,973 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:07:03,980 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:07:03,981 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:07:03,981 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:07:03,981 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:07:03,981 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:07:03,982 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:07:03,983 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:07:03,984 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:07:03,990 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:07:03,990 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:07:03,991 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:07:03,991 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:07:03,993 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:07:03,993 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:07:03,993 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:07:03,998 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:07:03,999 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:07:03,999 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:07:04,001 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:07:04,001 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:07:04,002 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:07:04,003 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 16:07:04,010 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 16:07:04,019 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_d460dfb9-fdd2-4f8e-b57b-e2901bb18442/sv-benchmarks/c/pthread-wmm/mix019.opt.i[944,957] [2022-12-13 16:07:04,035 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:07:04,035 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:07:04,035 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:07:04,035 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:07:04,035 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:07:04,036 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:07:04,036 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:07:04,036 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:07:04,036 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:07:04,037 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:07:04,037 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:07:04,042 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:07:04,042 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:07:04,042 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:07:04,042 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:07:04,043 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:07:04,043 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:07:04,044 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:07:04,044 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:07:04,049 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:07:04,049 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:07:04,049 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:07:04,050 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:07:04,051 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:07:04,051 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:07:04,051 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:07:04,054 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:07:04,054 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:07:04,054 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:07:04,056 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:07:04,056 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:07:04,057 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:07:04,057 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 16:07:04,079 INFO L208 MainTranslator]: Completed translation [2022-12-13 16:07:04,079 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:07:04 WrapperNode [2022-12-13 16:07:04,080 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 16:07:04,080 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 16:07:04,080 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 16:07:04,080 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 16:07:04,086 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:07:04" (1/1) ... [2022-12-13 16:07:04,104 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:07:04" (1/1) ... [2022-12-13 16:07:04,130 INFO L138 Inliner]: procedures = 176, calls = 56, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 147 [2022-12-13 16:07:04,130 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 16:07:04,131 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 16:07:04,131 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 16:07:04,131 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 16:07:04,139 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:07:04" (1/1) ... [2022-12-13 16:07:04,139 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:07:04" (1/1) ... [2022-12-13 16:07:04,143 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:07:04" (1/1) ... [2022-12-13 16:07:04,144 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:07:04" (1/1) ... [2022-12-13 16:07:04,154 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:07:04" (1/1) ... [2022-12-13 16:07:04,155 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:07:04" (1/1) ... [2022-12-13 16:07:04,158 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:07:04" (1/1) ... [2022-12-13 16:07:04,160 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:07:04" (1/1) ... [2022-12-13 16:07:04,164 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 16:07:04,165 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 16:07:04,166 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 16:07:04,166 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 16:07:04,166 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:07:04" (1/1) ... [2022-12-13 16:07:04,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 16:07:04,184 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d460dfb9-fdd2-4f8e-b57b-e2901bb18442/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 16:07:04,194 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d460dfb9-fdd2-4f8e-b57b-e2901bb18442/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 16:07:04,196 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d460dfb9-fdd2-4f8e-b57b-e2901bb18442/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 16:07:04,220 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 16:07:04,220 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 16:07:04,220 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 16:07:04,220 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 16:07:04,221 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 16:07:04,221 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 16:07:04,221 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 16:07:04,221 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 16:07:04,221 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 16:07:04,221 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-13 16:07:04,221 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-13 16:07:04,221 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 16:07:04,221 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 16:07:04,221 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 16:07:04,221 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 16:07:04,222 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-12-13 16:07:04,338 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 16:07:04,340 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 16:07:04,597 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 16:07:04,708 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 16:07:04,708 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 16:07:04,710 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 04:07:04 BoogieIcfgContainer [2022-12-13 16:07:04,710 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 16:07:04,712 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 16:07:04,712 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 16:07:04,714 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 16:07:04,715 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 04:07:03" (1/3) ... [2022-12-13 16:07:04,715 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@905b9c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 04:07:04, skipping insertion in model container [2022-12-13 16:07:04,715 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:07:04" (2/3) ... [2022-12-13 16:07:04,716 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@905b9c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 04:07:04, skipping insertion in model container [2022-12-13 16:07:04,716 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 04:07:04" (3/3) ... [2022-12-13 16:07:04,717 INFO L112 eAbstractionObserver]: Analyzing ICFG mix019.opt.i [2022-12-13 16:07:04,723 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-12-13 16:07:04,730 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 16:07:04,731 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-13 16:07:04,731 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 16:07:04,766 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 16:07:04,792 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 123 places, 115 transitions, 245 flow [2022-12-13 16:07:04,832 INFO L130 PetriNetUnfolder]: 2/112 cut-off events. [2022-12-13 16:07:04,833 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 16:07:04,838 INFO L83 FinitePrefix]: Finished finitePrefix Result has 122 conditions, 112 events. 2/112 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 53 event pairs, 0 based on Foata normal form. 0/108 useless extension candidates. Maximal degree in co-relation 72. Up to 2 conditions per place. [2022-12-13 16:07:04,838 INFO L82 GeneralOperation]: Start removeDead. Operand has 123 places, 115 transitions, 245 flow [2022-12-13 16:07:04,841 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 120 places, 112 transitions, 233 flow [2022-12-13 16:07:04,844 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-12-13 16:07:04,854 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 120 places, 112 transitions, 233 flow [2022-12-13 16:07:04,857 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 120 places, 112 transitions, 233 flow [2022-12-13 16:07:04,858 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 120 places, 112 transitions, 233 flow [2022-12-13 16:07:04,882 INFO L130 PetriNetUnfolder]: 2/112 cut-off events. [2022-12-13 16:07:04,883 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 16:07:04,883 INFO L83 FinitePrefix]: Finished finitePrefix Result has 122 conditions, 112 events. 2/112 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 53 event pairs, 0 based on Foata normal form. 0/108 useless extension candidates. Maximal degree in co-relation 72. Up to 2 conditions per place. [2022-12-13 16:07:04,885 INFO L119 LiptonReduction]: Number of co-enabled transitions 1926 [2022-12-13 16:07:07,380 INFO L134 LiptonReduction]: Checked pairs total: 4721 [2022-12-13 16:07:07,381 INFO L136 LiptonReduction]: Total number of compositions: 102 [2022-12-13 16:07:07,391 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 16:07:07,395 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;@6fa84070, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 16:07:07,395 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-13 16:07:07,399 INFO L130 PetriNetUnfolder]: 0/12 cut-off events. [2022-12-13 16:07:07,399 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 16:07:07,399 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 16:07:07,400 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:07:07,400 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 16:07:07,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:07:07,404 INFO L85 PathProgramCache]: Analyzing trace with hash -1548335542, now seen corresponding path program 1 times [2022-12-13 16:07:07,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:07:07,410 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255551119] [2022-12-13 16:07:07,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:07:07,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:07:07,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:07:07,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:07:07,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:07:07,753 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255551119] [2022-12-13 16:07:07,753 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255551119] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:07:07,754 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:07:07,754 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 16:07:07,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678095813] [2022-12-13 16:07:07,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:07:07,764 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 16:07:07,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:07:07,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 16:07:07,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 16:07:07,791 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 217 [2022-12-13 16:07:07,794 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 23 transitions, 55 flow. Second operand has 3 states, 3 states have (on average 104.33333333333333) internal successors, (313), 3 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:07:07,794 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 16:07:07,794 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 217 [2022-12-13 16:07:07,795 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 16:07:07,975 INFO L130 PetriNetUnfolder]: 644/1036 cut-off events. [2022-12-13 16:07:07,975 INFO L131 PetriNetUnfolder]: For 9/9 co-relation queries the response was YES. [2022-12-13 16:07:07,978 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2048 conditions, 1036 events. 644/1036 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 4785 event pairs, 112 based on Foata normal form. 0/975 useless extension candidates. Maximal degree in co-relation 2037. Up to 773 conditions per place. [2022-12-13 16:07:07,982 INFO L137 encePairwiseOnDemand]: 213/217 looper letters, 24 selfloop transitions, 2 changer transitions 2/30 dead transitions. [2022-12-13 16:07:07,982 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 30 transitions, 125 flow [2022-12-13 16:07:07,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 16:07:07,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 16:07:07,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 337 transitions. [2022-12-13 16:07:07,994 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5176651305683564 [2022-12-13 16:07:07,995 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 337 transitions. [2022-12-13 16:07:07,995 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 337 transitions. [2022-12-13 16:07:07,996 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 16:07:07,998 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 337 transitions. [2022-12-13 16:07:08,001 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 112.33333333333333) internal successors, (337), 3 states have internal predecessors, (337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:07:08,007 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 217.0) internal successors, (868), 4 states have internal predecessors, (868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:07:08,008 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 217.0) internal successors, (868), 4 states have internal predecessors, (868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:07:08,009 INFO L175 Difference]: Start difference. First operand has 32 places, 23 transitions, 55 flow. Second operand 3 states and 337 transitions. [2022-12-13 16:07:08,010 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 30 transitions, 125 flow [2022-12-13 16:07:08,012 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 30 transitions, 122 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-13 16:07:08,013 INFO L231 Difference]: Finished difference. Result has 30 places, 20 transitions, 50 flow [2022-12-13 16:07:08,014 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=50, PETRI_PLACES=30, PETRI_TRANSITIONS=20} [2022-12-13 16:07:08,017 INFO L288 CegarLoopForPetriNet]: 32 programPoint places, -2 predicate places. [2022-12-13 16:07:08,017 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 20 transitions, 50 flow [2022-12-13 16:07:08,017 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.33333333333333) internal successors, (313), 3 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:07:08,017 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 16:07:08,017 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:07:08,017 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 16:07:08,018 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 16:07:08,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:07:08,018 INFO L85 PathProgramCache]: Analyzing trace with hash -1891708449, now seen corresponding path program 1 times [2022-12-13 16:07:08,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:07:08,019 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615247917] [2022-12-13 16:07:08,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:07:08,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:07:08,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:07:08,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:07:08,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:07:08,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615247917] [2022-12-13 16:07:08,178 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [615247917] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:07:08,178 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:07:08,178 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 16:07:08,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443621031] [2022-12-13 16:07:08,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:07:08,179 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 16:07:08,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:07:08,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 16:07:08,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 16:07:08,190 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 217 [2022-12-13 16:07:08,190 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 20 transitions, 50 flow. Second operand has 3 states, 3 states have (on average 99.0) internal successors, (297), 3 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:07:08,190 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 16:07:08,191 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 217 [2022-12-13 16:07:08,191 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 16:07:08,419 INFO L130 PetriNetUnfolder]: 1119/1724 cut-off events. [2022-12-13 16:07:08,420 INFO L131 PetriNetUnfolder]: For 74/74 co-relation queries the response was YES. [2022-12-13 16:07:08,422 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3590 conditions, 1724 events. 1119/1724 cut-off events. For 74/74 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 7787 event pairs, 363 based on Foata normal form. 52/1776 useless extension candidates. Maximal degree in co-relation 3580. Up to 1221 conditions per place. [2022-12-13 16:07:08,429 INFO L137 encePairwiseOnDemand]: 210/217 looper letters, 29 selfloop transitions, 6 changer transitions 0/35 dead transitions. [2022-12-13 16:07:08,429 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 35 transitions, 154 flow [2022-12-13 16:07:08,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 16:07:08,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 16:07:08,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 324 transitions. [2022-12-13 16:07:08,431 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4976958525345622 [2022-12-13 16:07:08,432 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 324 transitions. [2022-12-13 16:07:08,432 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 324 transitions. [2022-12-13 16:07:08,432 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 16:07:08,432 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 324 transitions. [2022-12-13 16:07:08,433 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 16:07:08,435 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 217.0) internal successors, (868), 4 states have internal predecessors, (868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:07:08,436 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 217.0) internal successors, (868), 4 states have internal predecessors, (868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:07:08,436 INFO L175 Difference]: Start difference. First operand has 30 places, 20 transitions, 50 flow. Second operand 3 states and 324 transitions. [2022-12-13 16:07:08,436 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 35 transitions, 154 flow [2022-12-13 16:07:08,437 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 35 transitions, 148 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 16:07:08,438 INFO L231 Difference]: Finished difference. Result has 31 places, 25 transitions, 92 flow [2022-12-13 16:07:08,438 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=92, PETRI_PLACES=31, PETRI_TRANSITIONS=25} [2022-12-13 16:07:08,439 INFO L288 CegarLoopForPetriNet]: 32 programPoint places, -1 predicate places. [2022-12-13 16:07:08,439 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 25 transitions, 92 flow [2022-12-13 16:07:08,440 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 99.0) internal successors, (297), 3 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:07:08,440 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 16:07:08,440 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:07:08,440 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 16:07:08,440 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 16:07:08,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:07:08,441 INFO L85 PathProgramCache]: Analyzing trace with hash 1486579052, now seen corresponding path program 1 times [2022-12-13 16:07:08,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:07:08,441 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606162787] [2022-12-13 16:07:08,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:07:08,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:07:08,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:07:08,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:07:08,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:07:08,581 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606162787] [2022-12-13 16:07:08,582 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606162787] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:07:08,582 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:07:08,582 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 16:07:08,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236401003] [2022-12-13 16:07:08,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:07:08,583 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 16:07:08,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:07:08,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 16:07:08,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 16:07:08,595 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 217 [2022-12-13 16:07:08,595 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 25 transitions, 92 flow. Second operand has 4 states, 4 states have (on average 98.5) internal successors, (394), 4 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:07:08,595 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 16:07:08,596 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 217 [2022-12-13 16:07:08,596 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 16:07:08,829 INFO L130 PetriNetUnfolder]: 1047/1616 cut-off events. [2022-12-13 16:07:08,829 INFO L131 PetriNetUnfolder]: For 673/673 co-relation queries the response was YES. [2022-12-13 16:07:08,831 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4150 conditions, 1616 events. 1047/1616 cut-off events. For 673/673 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 6893 event pairs, 309 based on Foata normal form. 24/1640 useless extension candidates. Maximal degree in co-relation 4138. Up to 867 conditions per place. [2022-12-13 16:07:08,835 INFO L137 encePairwiseOnDemand]: 210/217 looper letters, 33 selfloop transitions, 7 changer transitions 0/40 dead transitions. [2022-12-13 16:07:08,835 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 40 transitions, 216 flow [2022-12-13 16:07:08,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 16:07:08,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 16:07:08,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 422 transitions. [2022-12-13 16:07:08,837 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4861751152073733 [2022-12-13 16:07:08,837 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 422 transitions. [2022-12-13 16:07:08,837 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 422 transitions. [2022-12-13 16:07:08,837 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 16:07:08,837 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 422 transitions. [2022-12-13 16:07:08,838 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 16:07:08,839 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 217.0) internal successors, (1085), 5 states have internal predecessors, (1085), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:07:08,840 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 217.0) internal successors, (1085), 5 states have internal predecessors, (1085), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:07:08,840 INFO L175 Difference]: Start difference. First operand has 31 places, 25 transitions, 92 flow. Second operand 4 states and 422 transitions. [2022-12-13 16:07:08,840 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 40 transitions, 216 flow [2022-12-13 16:07:08,842 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 40 transitions, 198 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 16:07:08,843 INFO L231 Difference]: Finished difference. Result has 35 places, 28 transitions, 128 flow [2022-12-13 16:07:08,843 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=128, PETRI_PLACES=35, PETRI_TRANSITIONS=28} [2022-12-13 16:07:08,843 INFO L288 CegarLoopForPetriNet]: 32 programPoint places, 3 predicate places. [2022-12-13 16:07:08,843 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 28 transitions, 128 flow [2022-12-13 16:07:08,844 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 98.5) internal successors, (394), 4 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:07:08,844 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 16:07:08,844 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:07:08,844 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 16:07:08,844 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 16:07:08,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:07:08,844 INFO L85 PathProgramCache]: Analyzing trace with hash -1206075530, now seen corresponding path program 1 times [2022-12-13 16:07:08,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:07:08,845 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122826959] [2022-12-13 16:07:08,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:07:08,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:07:08,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:07:08,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:07:08,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:07:08,956 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122826959] [2022-12-13 16:07:08,956 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122826959] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:07:08,956 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:07:08,956 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 16:07:08,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621375704] [2022-12-13 16:07:08,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:07:08,957 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 16:07:08,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:07:08,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 16:07:08,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 16:07:08,966 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 217 [2022-12-13 16:07:08,967 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 28 transitions, 128 flow. Second operand has 4 states, 4 states have (on average 98.75) internal successors, (395), 4 states have internal predecessors, (395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:07:08,967 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 16:07:08,967 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 217 [2022-12-13 16:07:08,967 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 16:07:09,216 INFO L130 PetriNetUnfolder]: 1015/1568 cut-off events. [2022-12-13 16:07:09,217 INFO L131 PetriNetUnfolder]: For 1093/1093 co-relation queries the response was YES. [2022-12-13 16:07:09,218 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4315 conditions, 1568 events. 1015/1568 cut-off events. For 1093/1093 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 6972 event pairs, 211 based on Foata normal form. 8/1576 useless extension candidates. Maximal degree in co-relation 4300. Up to 1047 conditions per place. [2022-12-13 16:07:09,227 INFO L137 encePairwiseOnDemand]: 210/217 looper letters, 39 selfloop transitions, 13 changer transitions 0/52 dead transitions. [2022-12-13 16:07:09,227 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 52 transitions, 306 flow [2022-12-13 16:07:09,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 16:07:09,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 16:07:09,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 432 transitions. [2022-12-13 16:07:09,230 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4976958525345622 [2022-12-13 16:07:09,230 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 432 transitions. [2022-12-13 16:07:09,230 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 432 transitions. [2022-12-13 16:07:09,230 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 16:07:09,230 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 432 transitions. [2022-12-13 16:07:09,232 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 16:07:09,233 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 217.0) internal successors, (1085), 5 states have internal predecessors, (1085), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:07:09,233 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 217.0) internal successors, (1085), 5 states have internal predecessors, (1085), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:07:09,233 INFO L175 Difference]: Start difference. First operand has 35 places, 28 transitions, 128 flow. Second operand 4 states and 432 transitions. [2022-12-13 16:07:09,233 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 52 transitions, 306 flow [2022-12-13 16:07:09,235 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 52 transitions, 302 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 16:07:09,236 INFO L231 Difference]: Finished difference. Result has 39 places, 32 transitions, 197 flow [2022-12-13 16:07:09,236 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=125, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=197, PETRI_PLACES=39, PETRI_TRANSITIONS=32} [2022-12-13 16:07:09,237 INFO L288 CegarLoopForPetriNet]: 32 programPoint places, 7 predicate places. [2022-12-13 16:07:09,237 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 32 transitions, 197 flow [2022-12-13 16:07:09,237 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 98.75) internal successors, (395), 4 states have internal predecessors, (395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:07:09,237 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 16:07:09,237 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:07:09,237 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 16:07:09,237 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 16:07:09,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:07:09,238 INFO L85 PathProgramCache]: Analyzing trace with hash 1266407701, now seen corresponding path program 1 times [2022-12-13 16:07:09,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:07:09,238 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748237237] [2022-12-13 16:07:09,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:07:09,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:07:09,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:07:09,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:07:09,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:07:09,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748237237] [2022-12-13 16:07:09,405 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748237237] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:07:09,405 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:07:09,406 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 16:07:09,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679985598] [2022-12-13 16:07:09,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:07:09,406 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 16:07:09,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:07:09,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 16:07:09,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 16:07:09,422 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 217 [2022-12-13 16:07:09,423 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 32 transitions, 197 flow. Second operand has 4 states, 4 states have (on average 98.0) internal successors, (392), 4 states have internal predecessors, (392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:07:09,423 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 16:07:09,423 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 217 [2022-12-13 16:07:09,423 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 16:07:09,661 INFO L130 PetriNetUnfolder]: 679/1143 cut-off events. [2022-12-13 16:07:09,661 INFO L131 PetriNetUnfolder]: For 1526/1598 co-relation queries the response was YES. [2022-12-13 16:07:09,663 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3439 conditions, 1143 events. 679/1143 cut-off events. For 1526/1598 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 5692 event pairs, 118 based on Foata normal form. 144/1264 useless extension candidates. Maximal degree in co-relation 3421. Up to 684 conditions per place. [2022-12-13 16:07:09,670 INFO L137 encePairwiseOnDemand]: 211/217 looper letters, 53 selfloop transitions, 7 changer transitions 18/84 dead transitions. [2022-12-13 16:07:09,670 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 84 transitions, 643 flow [2022-12-13 16:07:09,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 16:07:09,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 16:07:09,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 527 transitions. [2022-12-13 16:07:09,673 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4857142857142857 [2022-12-13 16:07:09,674 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 527 transitions. [2022-12-13 16:07:09,674 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 527 transitions. [2022-12-13 16:07:09,674 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 16:07:09,674 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 527 transitions. [2022-12-13 16:07:09,677 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 105.4) internal successors, (527), 5 states have internal predecessors, (527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:07:09,680 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 217.0) internal successors, (1302), 6 states have internal predecessors, (1302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:07:09,682 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 217.0) internal successors, (1302), 6 states have internal predecessors, (1302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:07:09,682 INFO L175 Difference]: Start difference. First operand has 39 places, 32 transitions, 197 flow. Second operand 5 states and 527 transitions. [2022-12-13 16:07:09,682 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 84 transitions, 643 flow [2022-12-13 16:07:09,686 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 84 transitions, 639 flow, removed 2 selfloop flow, removed 0 redundant places. [2022-12-13 16:07:09,688 INFO L231 Difference]: Finished difference. Result has 46 places, 38 transitions, 249 flow [2022-12-13 16:07:09,688 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=195, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=249, PETRI_PLACES=46, PETRI_TRANSITIONS=38} [2022-12-13 16:07:09,688 INFO L288 CegarLoopForPetriNet]: 32 programPoint places, 14 predicate places. [2022-12-13 16:07:09,689 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 38 transitions, 249 flow [2022-12-13 16:07:09,689 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 98.0) internal successors, (392), 4 states have internal predecessors, (392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:07:09,689 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 16:07:09,689 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:07:09,689 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 16:07:09,689 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 16:07:09,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:07:09,690 INFO L85 PathProgramCache]: Analyzing trace with hash -757114988, now seen corresponding path program 1 times [2022-12-13 16:07:09,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:07:09,690 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211097798] [2022-12-13 16:07:09,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:07:09,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:07:09,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:07:09,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:07:09,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:07:09,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211097798] [2022-12-13 16:07:09,820 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211097798] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:07:09,820 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:07:09,820 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 16:07:09,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028734372] [2022-12-13 16:07:09,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:07:09,821 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 16:07:09,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:07:09,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 16:07:09,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 16:07:09,826 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 217 [2022-12-13 16:07:09,827 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 38 transitions, 249 flow. Second operand has 3 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:07:09,827 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 16:07:09,827 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 217 [2022-12-13 16:07:09,827 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 16:07:10,088 INFO L130 PetriNetUnfolder]: 839/1471 cut-off events. [2022-12-13 16:07:10,088 INFO L131 PetriNetUnfolder]: For 2846/2846 co-relation queries the response was YES. [2022-12-13 16:07:10,091 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5608 conditions, 1471 events. 839/1471 cut-off events. For 2846/2846 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 7713 event pairs, 367 based on Foata normal form. 20/1479 useless extension candidates. Maximal degree in co-relation 5585. Up to 715 conditions per place. [2022-12-13 16:07:10,095 INFO L137 encePairwiseOnDemand]: 214/217 looper letters, 39 selfloop transitions, 6 changer transitions 10/57 dead transitions. [2022-12-13 16:07:10,096 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 57 transitions, 447 flow [2022-12-13 16:07:10,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 16:07:10,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 16:07:10,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 334 transitions. [2022-12-13 16:07:10,098 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5130568356374808 [2022-12-13 16:07:10,098 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 334 transitions. [2022-12-13 16:07:10,098 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 334 transitions. [2022-12-13 16:07:10,099 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 16:07:10,099 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 334 transitions. [2022-12-13 16:07:10,100 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 111.33333333333333) internal successors, (334), 3 states have internal predecessors, (334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:07:10,102 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 217.0) internal successors, (868), 4 states have internal predecessors, (868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:07:10,103 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 217.0) internal successors, (868), 4 states have internal predecessors, (868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:07:10,103 INFO L175 Difference]: Start difference. First operand has 46 places, 38 transitions, 249 flow. Second operand 3 states and 334 transitions. [2022-12-13 16:07:10,103 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 57 transitions, 447 flow [2022-12-13 16:07:10,110 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 57 transitions, 440 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 16:07:10,111 INFO L231 Difference]: Finished difference. Result has 48 places, 34 transitions, 235 flow [2022-12-13 16:07:10,111 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=245, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=235, PETRI_PLACES=48, PETRI_TRANSITIONS=34} [2022-12-13 16:07:10,112 INFO L288 CegarLoopForPetriNet]: 32 programPoint places, 16 predicate places. [2022-12-13 16:07:10,112 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 34 transitions, 235 flow [2022-12-13 16:07:10,113 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:07:10,113 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 16:07:10,113 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:07:10,113 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 16:07:10,113 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 16:07:10,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:07:10,114 INFO L85 PathProgramCache]: Analyzing trace with hash 1421968578, now seen corresponding path program 1 times [2022-12-13 16:07:10,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:07:10,114 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393788092] [2022-12-13 16:07:10,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:07:10,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:07:10,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:07:10,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:07:10,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:07:10,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393788092] [2022-12-13 16:07:10,284 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393788092] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:07:10,284 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:07:10,285 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 16:07:10,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871420053] [2022-12-13 16:07:10,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:07:10,285 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 16:07:10,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:07:10,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 16:07:10,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 16:07:10,297 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 217 [2022-12-13 16:07:10,298 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 34 transitions, 235 flow. Second operand has 5 states, 5 states have (on average 97.8) internal successors, (489), 5 states have internal predecessors, (489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:07:10,298 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 16:07:10,298 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 217 [2022-12-13 16:07:10,298 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 16:07:10,540 INFO L130 PetriNetUnfolder]: 426/783 cut-off events. [2022-12-13 16:07:10,540 INFO L131 PetriNetUnfolder]: For 1476/1537 co-relation queries the response was YES. [2022-12-13 16:07:10,541 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2887 conditions, 783 events. 426/783 cut-off events. For 1476/1537 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 3830 event pairs, 56 based on Foata normal form. 111/885 useless extension candidates. Maximal degree in co-relation 2863. Up to 311 conditions per place. [2022-12-13 16:07:10,543 INFO L137 encePairwiseOnDemand]: 211/217 looper letters, 49 selfloop transitions, 9 changer transitions 38/101 dead transitions. [2022-12-13 16:07:10,543 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 101 transitions, 861 flow [2022-12-13 16:07:10,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 16:07:10,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 16:07:10,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 735 transitions. [2022-12-13 16:07:10,546 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4838709677419355 [2022-12-13 16:07:10,546 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 735 transitions. [2022-12-13 16:07:10,546 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 735 transitions. [2022-12-13 16:07:10,547 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 16:07:10,547 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 735 transitions. [2022-12-13 16:07:10,549 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 105.0) internal successors, (735), 7 states have internal predecessors, (735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:07:10,551 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 217.0) internal successors, (1736), 8 states have internal predecessors, (1736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:07:10,552 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 217.0) internal successors, (1736), 8 states have internal predecessors, (1736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:07:10,552 INFO L175 Difference]: Start difference. First operand has 48 places, 34 transitions, 235 flow. Second operand 7 states and 735 transitions. [2022-12-13 16:07:10,552 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 101 transitions, 861 flow [2022-12-13 16:07:10,555 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 101 transitions, 800 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-13 16:07:10,557 INFO L231 Difference]: Finished difference. Result has 53 places, 37 transitions, 272 flow [2022-12-13 16:07:10,557 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=216, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=272, PETRI_PLACES=53, PETRI_TRANSITIONS=37} [2022-12-13 16:07:10,558 INFO L288 CegarLoopForPetriNet]: 32 programPoint places, 21 predicate places. [2022-12-13 16:07:10,558 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 37 transitions, 272 flow [2022-12-13 16:07:10,558 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 97.8) internal successors, (489), 5 states have internal predecessors, (489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:07:10,558 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 16:07:10,558 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:07:10,558 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 16:07:10,559 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 16:07:10,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:07:10,559 INFO L85 PathProgramCache]: Analyzing trace with hash -182217838, now seen corresponding path program 1 times [2022-12-13 16:07:10,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:07:10,559 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064048255] [2022-12-13 16:07:10,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:07:10,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:07:10,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:07:10,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:07:10,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:07:10,697 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064048255] [2022-12-13 16:07:10,697 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064048255] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:07:10,698 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:07:10,698 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 16:07:10,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121580902] [2022-12-13 16:07:10,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:07:10,698 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 16:07:10,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:07:10,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 16:07:10,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-13 16:07:10,713 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 217 [2022-12-13 16:07:10,714 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 37 transitions, 272 flow. Second operand has 6 states, 6 states have (on average 97.66666666666667) internal successors, (586), 6 states have internal predecessors, (586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:07:10,714 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 16:07:10,714 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 217 [2022-12-13 16:07:10,714 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 16:07:10,953 INFO L130 PetriNetUnfolder]: 334/627 cut-off events. [2022-12-13 16:07:10,953 INFO L131 PetriNetUnfolder]: For 1411/1484 co-relation queries the response was YES. [2022-12-13 16:07:10,954 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2505 conditions, 627 events. 334/627 cut-off events. For 1411/1484 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 3043 event pairs, 48 based on Foata normal form. 66/686 useless extension candidates. Maximal degree in co-relation 2479. Up to 237 conditions per place. [2022-12-13 16:07:10,955 INFO L137 encePairwiseOnDemand]: 211/217 looper letters, 42 selfloop transitions, 12 changer transitions 35/93 dead transitions. [2022-12-13 16:07:10,955 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 93 transitions, 768 flow [2022-12-13 16:07:10,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 16:07:10,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 16:07:10,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 923 transitions. [2022-12-13 16:07:10,959 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4726062467997952 [2022-12-13 16:07:10,959 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 923 transitions. [2022-12-13 16:07:10,959 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 923 transitions. [2022-12-13 16:07:10,960 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 16:07:10,960 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 923 transitions. [2022-12-13 16:07:10,961 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 102.55555555555556) internal successors, (923), 9 states have internal predecessors, (923), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:07:10,963 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 217.0) internal successors, (2170), 10 states have internal predecessors, (2170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:07:10,963 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 217.0) internal successors, (2170), 10 states have internal predecessors, (2170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:07:10,963 INFO L175 Difference]: Start difference. First operand has 53 places, 37 transitions, 272 flow. Second operand 9 states and 923 transitions. [2022-12-13 16:07:10,964 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 93 transitions, 768 flow [2022-12-13 16:07:10,968 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 93 transitions, 717 flow, removed 10 selfloop flow, removed 5 redundant places. [2022-12-13 16:07:10,968 INFO L231 Difference]: Finished difference. Result has 58 places, 34 transitions, 246 flow [2022-12-13 16:07:10,969 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=234, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=246, PETRI_PLACES=58, PETRI_TRANSITIONS=34} [2022-12-13 16:07:10,969 INFO L288 CegarLoopForPetriNet]: 32 programPoint places, 26 predicate places. [2022-12-13 16:07:10,969 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 34 transitions, 246 flow [2022-12-13 16:07:10,970 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 97.66666666666667) internal successors, (586), 6 states have internal predecessors, (586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:07:10,970 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 16:07:10,970 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:07:10,970 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 16:07:10,970 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 16:07:10,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:07:10,970 INFO L85 PathProgramCache]: Analyzing trace with hash 1267645942, now seen corresponding path program 1 times [2022-12-13 16:07:10,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:07:10,971 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474493251] [2022-12-13 16:07:10,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:07:10,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:07:10,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:07:11,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:07:11,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:07:11,092 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474493251] [2022-12-13 16:07:11,092 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [474493251] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:07:11,092 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:07:11,093 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 16:07:11,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352462485] [2022-12-13 16:07:11,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:07:11,093 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 16:07:11,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:07:11,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 16:07:11,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 16:07:11,101 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 217 [2022-12-13 16:07:11,101 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 34 transitions, 246 flow. Second operand has 4 states, 4 states have (on average 103.75) internal successors, (415), 4 states have internal predecessors, (415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:07:11,101 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 16:07:11,101 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 217 [2022-12-13 16:07:11,102 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 16:07:11,223 INFO L130 PetriNetUnfolder]: 208/409 cut-off events. [2022-12-13 16:07:11,224 INFO L131 PetriNetUnfolder]: For 1280/1289 co-relation queries the response was YES. [2022-12-13 16:07:11,224 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1784 conditions, 409 events. 208/409 cut-off events. For 1280/1289 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1719 event pairs, 43 based on Foata normal form. 9/417 useless extension candidates. Maximal degree in co-relation 1758. Up to 243 conditions per place. [2022-12-13 16:07:11,225 INFO L137 encePairwiseOnDemand]: 214/217 looper letters, 26 selfloop transitions, 1 changer transitions 34/62 dead transitions. [2022-12-13 16:07:11,226 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 62 transitions, 561 flow [2022-12-13 16:07:11,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 16:07:11,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 16:07:11,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 434 transitions. [2022-12-13 16:07:11,227 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5 [2022-12-13 16:07:11,227 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 434 transitions. [2022-12-13 16:07:11,228 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 434 transitions. [2022-12-13 16:07:11,228 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 16:07:11,228 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 434 transitions. [2022-12-13 16:07:11,229 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 108.5) internal successors, (434), 4 states have internal predecessors, (434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:07:11,231 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 217.0) internal successors, (1085), 5 states have internal predecessors, (1085), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:07:11,231 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 217.0) internal successors, (1085), 5 states have internal predecessors, (1085), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:07:11,231 INFO L175 Difference]: Start difference. First operand has 58 places, 34 transitions, 246 flow. Second operand 4 states and 434 transitions. [2022-12-13 16:07:11,231 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 62 transitions, 561 flow [2022-12-13 16:07:11,235 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 62 transitions, 451 flow, removed 30 selfloop flow, removed 8 redundant places. [2022-12-13 16:07:11,236 INFO L231 Difference]: Finished difference. Result has 53 places, 26 transitions, 135 flow [2022-12-13 16:07:11,236 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=185, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=135, PETRI_PLACES=53, PETRI_TRANSITIONS=26} [2022-12-13 16:07:11,237 INFO L288 CegarLoopForPetriNet]: 32 programPoint places, 21 predicate places. [2022-12-13 16:07:11,237 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 26 transitions, 135 flow [2022-12-13 16:07:11,237 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 103.75) internal successors, (415), 4 states have internal predecessors, (415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:07:11,237 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 16:07:11,237 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:07:11,237 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 16:07:11,238 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 16:07:11,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:07:11,238 INFO L85 PathProgramCache]: Analyzing trace with hash -87776170, now seen corresponding path program 2 times [2022-12-13 16:07:11,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:07:11,238 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177677364] [2022-12-13 16:07:11,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:07:11,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:07:11,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:07:12,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:07:12,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:07:12,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177677364] [2022-12-13 16:07:12,125 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177677364] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:07:12,125 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:07:12,125 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 16:07:12,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468259067] [2022-12-13 16:07:12,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:07:12,126 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 16:07:12,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:07:12,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 16:07:12,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-13 16:07:12,184 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 217 [2022-12-13 16:07:12,184 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 26 transitions, 135 flow. Second operand has 7 states, 7 states have (on average 97.57142857142857) internal successors, (683), 7 states have internal predecessors, (683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:07:12,184 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 16:07:12,185 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 217 [2022-12-13 16:07:12,185 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 16:07:12,393 INFO L130 PetriNetUnfolder]: 38/102 cut-off events. [2022-12-13 16:07:12,393 INFO L131 PetriNetUnfolder]: For 182/182 co-relation queries the response was YES. [2022-12-13 16:07:12,393 INFO L83 FinitePrefix]: Finished finitePrefix Result has 388 conditions, 102 events. 38/102 cut-off events. For 182/182 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 247 event pairs, 8 based on Foata normal form. 1/103 useless extension candidates. Maximal degree in co-relation 371. Up to 32 conditions per place. [2022-12-13 16:07:12,394 INFO L137 encePairwiseOnDemand]: 210/217 looper letters, 21 selfloop transitions, 4 changer transitions 21/48 dead transitions. [2022-12-13 16:07:12,394 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 48 transitions, 350 flow [2022-12-13 16:07:12,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 16:07:12,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 16:07:12,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 793 transitions. [2022-12-13 16:07:12,397 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4567972350230415 [2022-12-13 16:07:12,397 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 793 transitions. [2022-12-13 16:07:12,397 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 793 transitions. [2022-12-13 16:07:12,398 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 16:07:12,398 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 793 transitions. [2022-12-13 16:07:12,399 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 99.125) internal successors, (793), 8 states have internal predecessors, (793), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:07:12,402 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 217.0) internal successors, (1953), 9 states have internal predecessors, (1953), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:07:12,402 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 217.0) internal successors, (1953), 9 states have internal predecessors, (1953), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:07:12,402 INFO L175 Difference]: Start difference. First operand has 53 places, 26 transitions, 135 flow. Second operand 8 states and 793 transitions. [2022-12-13 16:07:12,403 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 48 transitions, 350 flow [2022-12-13 16:07:12,404 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 48 transitions, 305 flow, removed 8 selfloop flow, removed 11 redundant places. [2022-12-13 16:07:12,404 INFO L231 Difference]: Finished difference. Result has 46 places, 26 transitions, 122 flow [2022-12-13 16:07:12,405 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=122, PETRI_PLACES=46, PETRI_TRANSITIONS=26} [2022-12-13 16:07:12,405 INFO L288 CegarLoopForPetriNet]: 32 programPoint places, 14 predicate places. [2022-12-13 16:07:12,405 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 26 transitions, 122 flow [2022-12-13 16:07:12,406 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 97.57142857142857) internal successors, (683), 7 states have internal predecessors, (683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:07:12,406 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 16:07:12,406 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:07:12,406 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 16:07:12,406 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 16:07:12,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:07:12,407 INFO L85 PathProgramCache]: Analyzing trace with hash -123623642, now seen corresponding path program 3 times [2022-12-13 16:07:12,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:07:12,407 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27087306] [2022-12-13 16:07:12,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:07:12,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:07:12,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 16:07:12,445 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 16:07:12,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 16:07:12,499 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 16:07:12,500 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 16:07:12,501 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-13 16:07:12,502 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-12-13 16:07:12,503 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-13 16:07:12,503 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-12-13 16:07:12,503 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-12-13 16:07:12,503 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-13 16:07:12,503 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 16:07:12,504 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:07:12,509 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 16:07:12,510 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 16:07:12,564 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 04:07:12 BasicIcfg [2022-12-13 16:07:12,564 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 16:07:12,564 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-13 16:07:12,565 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-13 16:07:12,565 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-13 16:07:12,565 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 04:07:04" (3/4) ... [2022-12-13 16:07:12,566 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-12-13 16:07:12,627 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d460dfb9-fdd2-4f8e-b57b-e2901bb18442/bin/uautomizer-uyxdKDjOR8/witness.graphml [2022-12-13 16:07:12,627 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-13 16:07:12,628 INFO L158 Benchmark]: Toolchain (without parser) took 8974.13ms. Allocated memory was 157.3MB in the beginning and 226.5MB in the end (delta: 69.2MB). Free memory was 116.6MB in the beginning and 72.3MB in the end (delta: 44.3MB). Peak memory consumption was 115.5MB. Max. memory is 16.1GB. [2022-12-13 16:07:12,628 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 115.3MB. Free memory is still 87.9MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 16:07:12,628 INFO L158 Benchmark]: CACSL2BoogieTranslator took 424.88ms. Allocated memory is still 157.3MB. Free memory was 116.6MB in the beginning and 89.4MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2022-12-13 16:07:12,628 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.81ms. Allocated memory is still 157.3MB. Free memory was 89.4MB in the beginning and 87.1MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 16:07:12,629 INFO L158 Benchmark]: Boogie Preprocessor took 33.98ms. Allocated memory is still 157.3MB. Free memory was 87.1MB in the beginning and 85.1MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 16:07:12,629 INFO L158 Benchmark]: RCFGBuilder took 545.06ms. Allocated memory is still 157.3MB. Free memory was 85.1MB in the beginning and 123.6MB in the end (delta: -38.5MB). Peak memory consumption was 41.0MB. Max. memory is 16.1GB. [2022-12-13 16:07:12,629 INFO L158 Benchmark]: TraceAbstraction took 7852.08ms. Allocated memory was 157.3MB in the beginning and 226.5MB in the end (delta: 69.2MB). Free memory was 122.8MB in the beginning and 81.7MB in the end (delta: 41.1MB). Peak memory consumption was 110.1MB. Max. memory is 16.1GB. [2022-12-13 16:07:12,630 INFO L158 Benchmark]: Witness Printer took 62.60ms. Allocated memory is still 226.5MB. Free memory was 81.7MB in the beginning and 72.3MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-12-13 16:07:12,631 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.18ms. Allocated memory is still 115.3MB. Free memory is still 87.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 424.88ms. Allocated memory is still 157.3MB. Free memory was 116.6MB in the beginning and 89.4MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.81ms. Allocated memory is still 157.3MB. Free memory was 89.4MB in the beginning and 87.1MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 33.98ms. Allocated memory is still 157.3MB. Free memory was 87.1MB in the beginning and 85.1MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 545.06ms. Allocated memory is still 157.3MB. Free memory was 85.1MB in the beginning and 123.6MB in the end (delta: -38.5MB). Peak memory consumption was 41.0MB. Max. memory is 16.1GB. * TraceAbstraction took 7852.08ms. Allocated memory was 157.3MB in the beginning and 226.5MB in the end (delta: 69.2MB). Free memory was 122.8MB in the beginning and 81.7MB in the end (delta: 41.1MB). Peak memory consumption was 110.1MB. Max. memory is 16.1GB. * Witness Printer took 62.60ms. Allocated memory is still 226.5MB. Free memory was 81.7MB in the beginning and 72.3MB in the end (delta: 9.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, 120 PlacesBefore, 32 PlacesAfterwards, 112 TransitionsBefore, 23 TransitionsAfterwards, 1926 CoEnabledTransitionPairs, 7 FixpointIterations, 42 TrivialSequentialCompositions, 49 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 10 ConcurrentYvCompositions, 1 ChoiceCompositions, 102 TotalNumberOfCompositions, 4721 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2436, independent: 2263, independent conditional: 0, independent unconditional: 2263, dependent: 173, dependent conditional: 0, dependent unconditional: 173, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1084, independent: 1047, independent conditional: 0, independent unconditional: 1047, dependent: 37, dependent conditional: 0, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2436, independent: 1216, independent conditional: 0, independent unconditional: 1216, dependent: 136, dependent conditional: 0, dependent unconditional: 136, unknown: 1084, unknown conditional: 0, unknown unconditional: 1084] , Statistics on independence cache: Total cache size (in pairs): 75, Positive cache size: 61, Positive conditional cache size: 0, Positive unconditional cache size: 61, Negative cache size: 14, Negative conditional cache size: 0, Negative unconditional cache size: 14, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p1_EAX = 0; [L713] 0 int __unbuffered_p2_EAX = 0; [L715] 0 int __unbuffered_p2_EBX = 0; [L716] 0 _Bool main$tmp_guard0; [L717] 0 _Bool main$tmp_guard1; [L719] 0 int x = 0; [L721] 0 int y = 0; [L722] 0 _Bool y$flush_delayed; [L723] 0 int y$mem_tmp; [L724] 0 _Bool y$r_buff0_thd0; [L725] 0 _Bool y$r_buff0_thd1; [L726] 0 _Bool y$r_buff0_thd2; [L727] 0 _Bool y$r_buff0_thd3; [L728] 0 _Bool y$r_buff1_thd0; [L729] 0 _Bool y$r_buff1_thd1; [L730] 0 _Bool y$r_buff1_thd2; [L731] 0 _Bool y$r_buff1_thd3; [L732] 0 _Bool y$read_delayed; [L733] 0 int *y$read_delayed_var; [L734] 0 int y$w_buff0; [L735] 0 _Bool y$w_buff0_used; [L736] 0 int y$w_buff1; [L737] 0 _Bool y$w_buff1_used; [L739] 0 int z = 0; [L740] 0 _Bool weak$$choice0; [L741] 0 _Bool weak$$choice2; [L841] 0 pthread_t t500; [L842] FCALL, FORK 0 pthread_create(&t500, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t500, ((void *)0), P0, ((void *)0))=0, t500={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] [L843] 0 pthread_t t501; [L844] FCALL, FORK 0 pthread_create(&t501, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t501, ((void *)0), P1, ((void *)0))=1, t500={5:0}, t501={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] [L845] 0 pthread_t t502; [L846] FCALL, FORK 0 pthread_create(&t502, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t502, ((void *)0), P2, ((void *)0))=2, t500={5:0}, t501={6:0}, t502={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] [L788] 3 y$w_buff1 = y$w_buff0 [L789] 3 y$w_buff0 = 1 [L790] 3 y$w_buff1_used = y$w_buff0_used [L791] 3 y$w_buff0_used = (_Bool)1 [L792] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L792] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L793] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L794] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L795] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L796] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L797] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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] [L800] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L801] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L802] 3 y$flush_delayed = weak$$choice2 [L803] 3 y$mem_tmp = y [L804] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L805] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L806] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L807] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L808] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L809] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L810] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L811] 3 __unbuffered_p2_EAX = y [L812] 3 y = y$flush_delayed ? y$mem_tmp : y [L813] 3 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, 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] [L816] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, 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] [L745] 1 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, 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] [L748] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, 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=1] [L753] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L755] 1 return 0; [L760] 2 x = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=2, 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] [L763] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L764] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L765] 2 y$flush_delayed = weak$$choice2 [L766] 2 y$mem_tmp = y [L767] 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) [L768] 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)) [L769] 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)) [L770] 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)) [L771] 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)) [L772] 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)) [L773] 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)) [L774] 2 __unbuffered_p1_EAX = y [L775] 2 y = y$flush_delayed ? y$mem_tmp : y [L776] 2 y$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=0, x=2, 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] [L781] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L783] 2 return 0; [L819] 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) [L820] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L821] 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 [L822] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L823] 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}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=2, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L826] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L828] 3 return 0; [L848] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L850] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L850] RET 0 assume_abort_if_not(main$tmp_guard0) [L852] 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) [L853] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L854] 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 [L855] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L856] 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_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t500={5:0}, t501={6:0}, t502={3:0}, weak$$choice0=2, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L859] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L861] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 844]: 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: 842]: 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: 846]: 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, 141 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: 7.7s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 2.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.6s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 355 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 290 mSDsluCounter, 79 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 52 mSDsCounter, 54 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 792 IncrementalHoareTripleChecker+Invalid, 846 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 54 mSolverCounterUnsat, 27 mSDtfsCounter, 792 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 38 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=272occurred in iteration=7, InterpolantAutomatonStates: 50, 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, 2.0s InterpolantComputationTime, 154 NumberOfCodeBlocks, 154 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 124 ConstructedInterpolants, 0 QuantifiedInterpolants, 1067 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-13 16:07:12,647 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d460dfb9-fdd2-4f8e-b57b-e2901bb18442/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