./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/rfi007_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d055ddb-02b8-4bb9-a156-8d4ad527e76c/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d055ddb-02b8-4bb9-a156-8d4ad527e76c/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_1d055ddb-02b8-4bb9-a156-8d4ad527e76c/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d055ddb-02b8-4bb9-a156-8d4ad527e76c/bin/uautomizer-uyxdKDjOR8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/rfi007_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d055ddb-02b8-4bb9-a156-8d4ad527e76c/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_1d055ddb-02b8-4bb9-a156-8d4ad527e76c/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 60cd4209446f80c263553fdb6a481b4dd4e668058f5fe80fa8786bdb8310f6e8 --- 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 11:58:24,022 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 11:58:24,024 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 11:58:24,044 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 11:58:24,044 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 11:58:24,045 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 11:58:24,047 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 11:58:24,048 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 11:58:24,050 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 11:58:24,051 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 11:58:24,052 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 11:58:24,053 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 11:58:24,053 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 11:58:24,054 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 11:58:24,056 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 11:58:24,057 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 11:58:24,057 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 11:58:24,058 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 11:58:24,060 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 11:58:24,062 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 11:58:24,064 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 11:58:24,065 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 11:58:24,066 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 11:58:24,067 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 11:58:24,071 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 11:58:24,071 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 11:58:24,072 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 11:58:24,073 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 11:58:24,073 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 11:58:24,075 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 11:58:24,075 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 11:58:24,076 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 11:58:24,077 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 11:58:24,077 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 11:58:24,078 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 11:58:24,079 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 11:58:24,079 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 11:58:24,079 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 11:58:24,080 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 11:58:24,080 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 11:58:24,081 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 11:58:24,082 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d055ddb-02b8-4bb9-a156-8d4ad527e76c/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-12-13 11:58:24,103 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 11:58:24,103 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 11:58:24,104 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 11:58:24,104 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 11:58:24,105 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 11:58:24,105 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 11:58:24,105 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 11:58:24,106 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 11:58:24,106 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 11:58:24,106 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 11:58:24,106 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 11:58:24,106 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 11:58:24,107 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 11:58:24,107 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 11:58:24,107 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 11:58:24,107 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 11:58:24,107 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 11:58:24,107 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 11:58:24,108 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 11:58:24,108 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 11:58:24,108 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 11:58:24,108 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 11:58:24,108 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 11:58:24,108 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 11:58:24,108 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 11:58:24,108 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 11:58:24,109 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 11:58:24,109 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 11:58:24,109 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 11:58:24,109 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 11:58:24,109 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 11:58:24,109 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-13 11:58:24,109 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 11:58:24,110 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 11:58:24,110 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 11:58:24,110 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_1d055ddb-02b8-4bb9-a156-8d4ad527e76c/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_1d055ddb-02b8-4bb9-a156-8d4ad527e76c/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 -> 60cd4209446f80c263553fdb6a481b4dd4e668058f5fe80fa8786bdb8310f6e8 [2022-12-13 11:58:24,290 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 11:58:24,310 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 11:58:24,312 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 11:58:24,313 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 11:58:24,314 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 11:58:24,315 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d055ddb-02b8-4bb9-a156-8d4ad527e76c/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/pthread-wmm/rfi007_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-12-13 11:58:26,836 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 11:58:27,033 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 11:58:27,034 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d055ddb-02b8-4bb9-a156-8d4ad527e76c/sv-benchmarks/c/pthread-wmm/rfi007_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-12-13 11:58:27,046 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d055ddb-02b8-4bb9-a156-8d4ad527e76c/bin/uautomizer-uyxdKDjOR8/data/5f6a7e8b1/b77ff55e18b146b59f392ada5eea2578/FLAG42f8222b3 [2022-12-13 11:58:27,397 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d055ddb-02b8-4bb9-a156-8d4ad527e76c/bin/uautomizer-uyxdKDjOR8/data/5f6a7e8b1/b77ff55e18b146b59f392ada5eea2578 [2022-12-13 11:58:27,400 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 11:58:27,401 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 11:58:27,403 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 11:58:27,403 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 11:58:27,407 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 11:58:27,408 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 11:58:27" (1/1) ... [2022-12-13 11:58:27,409 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d469312 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:58:27, skipping insertion in model container [2022-12-13 11:58:27,409 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 11:58:27" (1/1) ... [2022-12-13 11:58:27,417 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 11:58:27,445 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 11:58:27,552 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_1d055ddb-02b8-4bb9-a156-8d4ad527e76c/sv-benchmarks/c/pthread-wmm/rfi007_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[995,1008] [2022-12-13 11:58:27,654 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:58:27,656 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:58:27,656 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:58:27,656 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:58:27,656 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:58:27,658 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:58:27,659 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:58:27,659 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:58:27,660 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:58:27,660 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:58:27,660 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:58:27,660 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:58:27,660 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:58:27,666 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:58:27,666 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:58:27,668 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:58:27,668 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:58:27,669 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:58:27,673 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:58:27,674 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:58:27,674 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:58:27,676 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:58:27,676 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:58:27,677 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:58:27,677 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 11:58:27,685 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 11:58:27,693 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_1d055ddb-02b8-4bb9-a156-8d4ad527e76c/sv-benchmarks/c/pthread-wmm/rfi007_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[995,1008] [2022-12-13 11:58:27,706 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:58:27,707 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:58:27,708 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:58:27,708 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:58:27,708 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:58:27,710 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:58:27,710 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:58:27,710 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:58:27,710 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:58:27,711 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:58:27,711 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:58:27,711 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:58:27,711 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:58:27,716 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:58:27,716 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:58:27,718 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:58:27,718 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:58:27,719 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:58:27,721 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:58:27,721 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:58:27,721 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:58:27,723 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:58:27,723 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:58:27,724 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:58:27,724 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 11:58:27,745 INFO L208 MainTranslator]: Completed translation [2022-12-13 11:58:27,745 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:58:27 WrapperNode [2022-12-13 11:58:27,745 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 11:58:27,746 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 11:58:27,746 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 11:58:27,746 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 11:58:27,752 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:58:27" (1/1) ... [2022-12-13 11:58:27,765 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:58:27" (1/1) ... [2022-12-13 11:58:27,788 INFO L138 Inliner]: procedures = 175, calls = 43, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 113 [2022-12-13 11:58:27,788 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 11:58:27,789 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 11:58:27,789 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 11:58:27,789 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 11:58:27,798 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:58:27" (1/1) ... [2022-12-13 11:58:27,799 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:58:27" (1/1) ... [2022-12-13 11:58:27,802 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:58:27" (1/1) ... [2022-12-13 11:58:27,802 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:58:27" (1/1) ... [2022-12-13 11:58:27,809 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:58:27" (1/1) ... [2022-12-13 11:58:27,811 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:58:27" (1/1) ... [2022-12-13 11:58:27,813 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:58:27" (1/1) ... [2022-12-13 11:58:27,814 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:58:27" (1/1) ... [2022-12-13 11:58:27,818 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 11:58:27,818 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 11:58:27,818 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 11:58:27,819 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 11:58:27,819 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:58:27" (1/1) ... [2022-12-13 11:58:27,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 11:58:27,835 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d055ddb-02b8-4bb9-a156-8d4ad527e76c/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 11:58:27,845 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d055ddb-02b8-4bb9-a156-8d4ad527e76c/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 11:58:27,847 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d055ddb-02b8-4bb9-a156-8d4ad527e76c/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 11:58:27,879 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 11:58:27,879 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 11:58:27,879 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 11:58:27,880 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 11:58:27,880 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 11:58:27,880 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 11:58:27,880 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 11:58:27,880 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 11:58:27,880 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 11:58:27,880 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 11:58:27,880 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 11:58:27,880 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 11:58:27,881 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 11:58:27,882 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 11:58:27,982 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 11:58:27,983 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 11:58:28,195 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 11:58:28,307 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 11:58:28,307 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 11:58:28,309 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 11:58:28 BoogieIcfgContainer [2022-12-13 11:58:28,309 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 11:58:28,310 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 11:58:28,310 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 11:58:28,313 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 11:58:28,313 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 11:58:27" (1/3) ... [2022-12-13 11:58:28,314 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a428da3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 11:58:28, skipping insertion in model container [2022-12-13 11:58:28,314 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:58:27" (2/3) ... [2022-12-13 11:58:28,314 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a428da3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 11:58:28, skipping insertion in model container [2022-12-13 11:58:28,314 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 11:58:28" (3/3) ... [2022-12-13 11:58:28,315 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi007_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-12-13 11:58:28,321 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-12-13 11:58:28,329 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 11:58:28,329 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-13 11:58:28,329 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 11:58:28,376 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 11:58:28,413 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 101 places, 96 transitions, 202 flow [2022-12-13 11:58:28,453 INFO L130 PetriNetUnfolder]: 2/94 cut-off events. [2022-12-13 11:58:28,453 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 11:58:28,457 INFO L83 FinitePrefix]: Finished finitePrefix Result has 101 conditions, 94 events. 2/94 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 40 event pairs, 0 based on Foata normal form. 0/90 useless extension candidates. Maximal degree in co-relation 56. Up to 2 conditions per place. [2022-12-13 11:58:28,457 INFO L82 GeneralOperation]: Start removeDead. Operand has 101 places, 96 transitions, 202 flow [2022-12-13 11:58:28,461 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 99 places, 94 transitions, 194 flow [2022-12-13 11:58:28,465 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-12-13 11:58:28,476 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 99 places, 94 transitions, 194 flow [2022-12-13 11:58:28,479 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 99 places, 94 transitions, 194 flow [2022-12-13 11:58:28,479 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 99 places, 94 transitions, 194 flow [2022-12-13 11:58:28,501 INFO L130 PetriNetUnfolder]: 2/94 cut-off events. [2022-12-13 11:58:28,502 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 11:58:28,502 INFO L83 FinitePrefix]: Finished finitePrefix Result has 101 conditions, 94 events. 2/94 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 40 event pairs, 0 based on Foata normal form. 0/90 useless extension candidates. Maximal degree in co-relation 56. Up to 2 conditions per place. [2022-12-13 11:58:28,504 INFO L119 LiptonReduction]: Number of co-enabled transitions 1232 [2022-12-13 11:58:30,656 INFO L134 LiptonReduction]: Checked pairs total: 3027 [2022-12-13 11:58:30,656 INFO L136 LiptonReduction]: Total number of compositions: 88 [2022-12-13 11:58:30,666 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 11:58:30,671 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;@6b0a862d, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 11:58:30,671 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-12-13 11:58:30,673 INFO L130 PetriNetUnfolder]: 0/3 cut-off events. [2022-12-13 11:58:30,673 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 11:58:30,673 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:58:30,673 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-12-13 11:58:30,674 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 11:58:30,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:58:30,677 INFO L85 PathProgramCache]: Analyzing trace with hash 425175, now seen corresponding path program 1 times [2022-12-13 11:58:30,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:58:30,685 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457715586] [2022-12-13 11:58:30,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:58:30,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:58:30,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:58:30,924 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 11:58:30,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:58:30,924 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457715586] [2022-12-13 11:58:30,925 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457715586] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:58:30,925 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:58:30,925 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 11:58:30,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279028663] [2022-12-13 11:58:30,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:58:30,933 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 11:58:30,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:58:30,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 11:58:30,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 11:58:30,955 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 184 [2022-12-13 11:58:30,957 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 18 transitions, 42 flow. Second operand has 3 states, 3 states have (on average 85.0) internal successors, (255), 3 states have internal predecessors, (255), 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 11:58:30,957 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:58:30,957 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 184 [2022-12-13 11:58:30,958 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:58:31,057 INFO L130 PetriNetUnfolder]: 142/279 cut-off events. [2022-12-13 11:58:31,057 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-13 11:58:31,058 INFO L83 FinitePrefix]: Finished finitePrefix Result has 544 conditions, 279 events. 142/279 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1203 event pairs, 16 based on Foata normal form. 0/258 useless extension candidates. Maximal degree in co-relation 534. Up to 208 conditions per place. [2022-12-13 11:58:31,059 INFO L137 encePairwiseOnDemand]: 181/184 looper letters, 21 selfloop transitions, 2 changer transitions 2/27 dead transitions. [2022-12-13 11:58:31,059 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 27 transitions, 113 flow [2022-12-13 11:58:31,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 11:58:31,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 11:58:31,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 278 transitions. [2022-12-13 11:58:31,069 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5036231884057971 [2022-12-13 11:58:31,070 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 278 transitions. [2022-12-13 11:58:31,070 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 278 transitions. [2022-12-13 11:58:31,071 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 11:58:31,073 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 278 transitions. [2022-12-13 11:58:31,075 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 92.66666666666667) internal successors, (278), 3 states have internal predecessors, (278), 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 11:58:31,079 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 184.0) internal successors, (736), 4 states have internal predecessors, (736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:58:31,079 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 184.0) internal successors, (736), 4 states have internal predecessors, (736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:58:31,081 INFO L175 Difference]: Start difference. First operand has 25 places, 18 transitions, 42 flow. Second operand 3 states and 278 transitions. [2022-12-13 11:58:31,081 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 27 transitions, 113 flow [2022-12-13 11:58:31,083 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 27 transitions, 110 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 11:58:31,084 INFO L231 Difference]: Finished difference. Result has 24 places, 16 transitions, 40 flow [2022-12-13 11:58:31,085 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=184, PETRI_DIFFERENCE_MINUEND_FLOW=38, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=40, PETRI_PLACES=24, PETRI_TRANSITIONS=16} [2022-12-13 11:58:31,088 INFO L288 CegarLoopForPetriNet]: 25 programPoint places, -1 predicate places. [2022-12-13 11:58:31,088 INFO L495 AbstractCegarLoop]: Abstraction has has 24 places, 16 transitions, 40 flow [2022-12-13 11:58:31,088 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 85.0) internal successors, (255), 3 states have internal predecessors, (255), 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 11:58:31,089 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:58:31,089 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:58:31,089 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 11:58:31,089 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 11:58:31,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:58:31,089 INFO L85 PathProgramCache]: Analyzing trace with hash 1856222553, now seen corresponding path program 1 times [2022-12-13 11:58:31,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:58:31,090 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35567211] [2022-12-13 11:58:31,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:58:31,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:58:31,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:58:31,232 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 11:58:31,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:58:31,233 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35567211] [2022-12-13 11:58:31,233 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [35567211] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:58:31,233 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:58:31,233 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 11:58:31,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597121602] [2022-12-13 11:58:31,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:58:31,235 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 11:58:31,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:58:31,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 11:58:31,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 11:58:31,240 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 184 [2022-12-13 11:58:31,240 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 16 transitions, 40 flow. Second operand has 3 states, 3 states have (on average 85.33333333333333) internal successors, (256), 3 states have internal predecessors, (256), 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 11:58:31,240 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:58:31,240 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 184 [2022-12-13 11:58:31,240 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:58:31,304 INFO L130 PetriNetUnfolder]: 121/219 cut-off events. [2022-12-13 11:58:31,304 INFO L131 PetriNetUnfolder]: For 23/23 co-relation queries the response was YES. [2022-12-13 11:58:31,305 INFO L83 FinitePrefix]: Finished finitePrefix Result has 475 conditions, 219 events. 121/219 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 727 event pairs, 41 based on Foata normal form. 8/226 useless extension candidates. Maximal degree in co-relation 465. Up to 157 conditions per place. [2022-12-13 11:58:31,306 INFO L137 encePairwiseOnDemand]: 181/184 looper letters, 18 selfloop transitions, 2 changer transitions 0/21 dead transitions. [2022-12-13 11:58:31,306 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 21 transitions, 92 flow [2022-12-13 11:58:31,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 11:58:31,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 11:58:31,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 270 transitions. [2022-12-13 11:58:31,309 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4891304347826087 [2022-12-13 11:58:31,309 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 270 transitions. [2022-12-13 11:58:31,309 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 270 transitions. [2022-12-13 11:58:31,309 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 11:58:31,309 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 270 transitions. [2022-12-13 11:58:31,310 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 90.0) internal successors, (270), 3 states have internal predecessors, (270), 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 11:58:31,311 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 184.0) internal successors, (736), 4 states have internal predecessors, (736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:58:31,311 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 184.0) internal successors, (736), 4 states have internal predecessors, (736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:58:31,312 INFO L175 Difference]: Start difference. First operand has 24 places, 16 transitions, 40 flow. Second operand 3 states and 270 transitions. [2022-12-13 11:58:31,312 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 21 transitions, 92 flow [2022-12-13 11:58:31,312 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 23 places, 21 transitions, 86 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 11:58:31,313 INFO L231 Difference]: Finished difference. Result has 24 places, 16 transitions, 44 flow [2022-12-13 11:58:31,313 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=184, PETRI_DIFFERENCE_MINUEND_FLOW=36, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=16, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=44, PETRI_PLACES=24, PETRI_TRANSITIONS=16} [2022-12-13 11:58:31,313 INFO L288 CegarLoopForPetriNet]: 25 programPoint places, -1 predicate places. [2022-12-13 11:58:31,313 INFO L495 AbstractCegarLoop]: Abstraction has has 24 places, 16 transitions, 44 flow [2022-12-13 11:58:31,314 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 85.33333333333333) internal successors, (256), 3 states have internal predecessors, (256), 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 11:58:31,314 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:58:31,314 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:58:31,314 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 11:58:31,314 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 11:58:31,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:58:31,315 INFO L85 PathProgramCache]: Analyzing trace with hash 1367302370, now seen corresponding path program 1 times [2022-12-13 11:58:31,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:58:31,315 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609471928] [2022-12-13 11:58:31,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:58:31,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:58:31,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:58:31,432 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 11:58:31,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:58:31,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609471928] [2022-12-13 11:58:31,433 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [609471928] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:58:31,433 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:58:31,433 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 11:58:31,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279730118] [2022-12-13 11:58:31,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:58:31,434 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 11:58:31,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:58:31,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 11:58:31,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 11:58:31,445 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 184 [2022-12-13 11:58:31,446 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 16 transitions, 44 flow. Second operand has 4 states, 4 states have (on average 83.0) internal successors, (332), 4 states have internal predecessors, (332), 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 11:58:31,446 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:58:31,447 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 184 [2022-12-13 11:58:31,447 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:58:31,551 INFO L130 PetriNetUnfolder]: 61/138 cut-off events. [2022-12-13 11:58:31,551 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-13 11:58:31,552 INFO L83 FinitePrefix]: Finished finitePrefix Result has 299 conditions, 138 events. 61/138 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 481 event pairs, 13 based on Foata normal form. 20/157 useless extension candidates. Maximal degree in co-relation 288. Up to 62 conditions per place. [2022-12-13 11:58:31,552 INFO L137 encePairwiseOnDemand]: 179/184 looper letters, 20 selfloop transitions, 3 changer transitions 15/40 dead transitions. [2022-12-13 11:58:31,553 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 40 transitions, 170 flow [2022-12-13 11:58:31,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 11:58:31,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 11:58:31,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 445 transitions. [2022-12-13 11:58:31,555 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.483695652173913 [2022-12-13 11:58:31,555 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 445 transitions. [2022-12-13 11:58:31,555 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 445 transitions. [2022-12-13 11:58:31,556 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 11:58:31,556 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 445 transitions. [2022-12-13 11:58:31,557 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 89.0) internal successors, (445), 5 states have internal predecessors, (445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:58:31,560 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 184.0) internal successors, (1104), 6 states have internal predecessors, (1104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:58:31,560 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 184.0) internal successors, (1104), 6 states have internal predecessors, (1104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:58:31,560 INFO L175 Difference]: Start difference. First operand has 24 places, 16 transitions, 44 flow. Second operand 5 states and 445 transitions. [2022-12-13 11:58:31,560 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 40 transitions, 170 flow [2022-12-13 11:58:31,561 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 40 transitions, 166 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 11:58:31,562 INFO L231 Difference]: Finished difference. Result has 29 places, 18 transitions, 67 flow [2022-12-13 11:58:31,562 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=184, PETRI_DIFFERENCE_MINUEND_FLOW=40, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=16, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=67, PETRI_PLACES=29, PETRI_TRANSITIONS=18} [2022-12-13 11:58:31,562 INFO L288 CegarLoopForPetriNet]: 25 programPoint places, 4 predicate places. [2022-12-13 11:58:31,563 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 18 transitions, 67 flow [2022-12-13 11:58:31,563 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 83.0) internal successors, (332), 4 states have internal predecessors, (332), 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 11:58:31,563 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:58:31,563 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:58:31,563 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 11:58:31,564 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 11:58:31,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:58:31,564 INFO L85 PathProgramCache]: Analyzing trace with hash -2015160586, now seen corresponding path program 1 times [2022-12-13 11:58:31,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:58:31,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36059728] [2022-12-13 11:58:31,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:58:31,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:58:31,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:58:31,742 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 11:58:31,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:58:31,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36059728] [2022-12-13 11:58:31,742 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [36059728] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:58:31,742 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:58:31,742 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 11:58:31,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718607396] [2022-12-13 11:58:31,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:58:31,743 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 11:58:31,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:58:31,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 11:58:31,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 11:58:31,756 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 184 [2022-12-13 11:58:31,757 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 18 transitions, 67 flow. Second operand has 5 states, 5 states have (on average 83.2) internal successors, (416), 5 states have internal predecessors, (416), 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 11:58:31,757 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:58:31,757 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 184 [2022-12-13 11:58:31,757 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:58:31,831 INFO L130 PetriNetUnfolder]: 24/69 cut-off events. [2022-12-13 11:58:31,831 INFO L131 PetriNetUnfolder]: For 17/17 co-relation queries the response was YES. [2022-12-13 11:58:31,832 INFO L83 FinitePrefix]: Finished finitePrefix Result has 191 conditions, 69 events. 24/69 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 175 event pairs, 10 based on Foata normal form. 8/76 useless extension candidates. Maximal degree in co-relation 177. Up to 29 conditions per place. [2022-12-13 11:58:31,832 INFO L137 encePairwiseOnDemand]: 179/184 looper letters, 18 selfloop transitions, 5 changer transitions 8/33 dead transitions. [2022-12-13 11:58:31,832 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 33 transitions, 171 flow [2022-12-13 11:58:31,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 11:58:31,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 11:58:31,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 519 transitions. [2022-12-13 11:58:31,833 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4701086956521739 [2022-12-13 11:58:31,833 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 519 transitions. [2022-12-13 11:58:31,834 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 519 transitions. [2022-12-13 11:58:31,834 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 11:58:31,834 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 519 transitions. [2022-12-13 11:58:31,835 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 86.5) internal successors, (519), 6 states have internal predecessors, (519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:58:31,837 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 184.0) internal successors, (1288), 7 states have internal predecessors, (1288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:58:31,838 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 184.0) internal successors, (1288), 7 states have internal predecessors, (1288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:58:31,838 INFO L175 Difference]: Start difference. First operand has 29 places, 18 transitions, 67 flow. Second operand 6 states and 519 transitions. [2022-12-13 11:58:31,838 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 33 transitions, 171 flow [2022-12-13 11:58:31,839 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 33 transitions, 154 flow, removed 6 selfloop flow, removed 3 redundant places. [2022-12-13 11:58:31,840 INFO L231 Difference]: Finished difference. Result has 32 places, 18 transitions, 74 flow [2022-12-13 11:58:31,840 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=184, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=74, PETRI_PLACES=32, PETRI_TRANSITIONS=18} [2022-12-13 11:58:31,840 INFO L288 CegarLoopForPetriNet]: 25 programPoint places, 7 predicate places. [2022-12-13 11:58:31,841 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 18 transitions, 74 flow [2022-12-13 11:58:31,841 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 83.2) internal successors, (416), 5 states have internal predecessors, (416), 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 11:58:31,841 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:58:31,841 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:58:31,841 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 11:58:31,841 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 11:58:31,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:58:31,842 INFO L85 PathProgramCache]: Analyzing trace with hash 101215416, now seen corresponding path program 1 times [2022-12-13 11:58:31,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:58:31,842 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57353801] [2022-12-13 11:58:31,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:58:31,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:58:31,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:58:32,239 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 11:58:32,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:58:32,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57353801] [2022-12-13 11:58:32,240 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57353801] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:58:32,240 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:58:32,240 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 11:58:32,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761531504] [2022-12-13 11:58:32,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:58:32,241 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 11:58:32,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:58:32,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 11:58:32,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 11:58:32,266 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 184 [2022-12-13 11:58:32,267 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 18 transitions, 74 flow. Second operand has 6 states, 6 states have (on average 81.33333333333333) internal successors, (488), 6 states have internal predecessors, (488), 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 11:58:32,267 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:58:32,267 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 184 [2022-12-13 11:58:32,267 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:58:32,448 INFO L130 PetriNetUnfolder]: 19/67 cut-off events. [2022-12-13 11:58:32,448 INFO L131 PetriNetUnfolder]: For 56/56 co-relation queries the response was YES. [2022-12-13 11:58:32,448 INFO L83 FinitePrefix]: Finished finitePrefix Result has 192 conditions, 67 events. 19/67 cut-off events. For 56/56 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 176 event pairs, 0 based on Foata normal form. 1/68 useless extension candidates. Maximal degree in co-relation 176. Up to 25 conditions per place. [2022-12-13 11:58:32,448 INFO L137 encePairwiseOnDemand]: 178/184 looper letters, 20 selfloop transitions, 4 changer transitions 11/37 dead transitions. [2022-12-13 11:58:32,448 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 37 transitions, 226 flow [2022-12-13 11:58:32,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 11:58:32,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 11:58:32,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 585 transitions. [2022-12-13 11:58:32,450 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.45419254658385094 [2022-12-13 11:58:32,450 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 585 transitions. [2022-12-13 11:58:32,450 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 585 transitions. [2022-12-13 11:58:32,450 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 11:58:32,450 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 585 transitions. [2022-12-13 11:58:32,451 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 83.57142857142857) internal successors, (585), 7 states have internal predecessors, (585), 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 11:58:32,452 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 184.0) internal successors, (1472), 8 states have internal predecessors, (1472), 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 11:58:32,453 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 184.0) internal successors, (1472), 8 states have internal predecessors, (1472), 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 11:58:32,453 INFO L175 Difference]: Start difference. First operand has 32 places, 18 transitions, 74 flow. Second operand 7 states and 585 transitions. [2022-12-13 11:58:32,453 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 37 transitions, 226 flow [2022-12-13 11:58:32,454 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 37 transitions, 194 flow, removed 10 selfloop flow, removed 5 redundant places. [2022-12-13 11:58:32,454 INFO L231 Difference]: Finished difference. Result has 33 places, 18 transitions, 72 flow [2022-12-13 11:58:32,454 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=184, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=72, PETRI_PLACES=33, PETRI_TRANSITIONS=18} [2022-12-13 11:58:32,454 INFO L288 CegarLoopForPetriNet]: 25 programPoint places, 8 predicate places. [2022-12-13 11:58:32,455 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 18 transitions, 72 flow [2022-12-13 11:58:32,455 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 81.33333333333333) internal successors, (488), 6 states have internal predecessors, (488), 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 11:58:32,455 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:58:32,455 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:58:32,455 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 11:58:32,455 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 11:58:32,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:58:32,456 INFO L85 PathProgramCache]: Analyzing trace with hash -540427542, now seen corresponding path program 2 times [2022-12-13 11:58:32,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:58:32,456 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138121771] [2022-12-13 11:58:32,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:58:32,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:58:32,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:58:32,596 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 11:58:32,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:58:32,596 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138121771] [2022-12-13 11:58:32,596 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138121771] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:58:32,596 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:58:32,596 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 11:58:32,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421615191] [2022-12-13 11:58:32,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:58:32,597 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 11:58:32,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:58:32,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 11:58:32,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 11:58:32,602 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 184 [2022-12-13 11:58:32,603 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 18 transitions, 72 flow. Second operand has 3 states, 3 states have (on average 87.0) internal successors, (261), 3 states have internal predecessors, (261), 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 11:58:32,603 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:58:32,603 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 184 [2022-12-13 11:58:32,603 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:58:32,655 INFO L130 PetriNetUnfolder]: 25/83 cut-off events. [2022-12-13 11:58:32,655 INFO L131 PetriNetUnfolder]: For 52/52 co-relation queries the response was YES. [2022-12-13 11:58:32,656 INFO L83 FinitePrefix]: Finished finitePrefix Result has 247 conditions, 83 events. 25/83 cut-off events. For 52/52 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 233 event pairs, 9 based on Foata normal form. 1/84 useless extension candidates. Maximal degree in co-relation 237. Up to 43 conditions per place. [2022-12-13 11:58:32,656 INFO L137 encePairwiseOnDemand]: 181/184 looper letters, 17 selfloop transitions, 2 changer transitions 10/30 dead transitions. [2022-12-13 11:58:32,656 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 30 transitions, 180 flow [2022-12-13 11:58:32,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 11:58:32,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 11:58:32,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 272 transitions. [2022-12-13 11:58:32,657 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4927536231884058 [2022-12-13 11:58:32,657 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 272 transitions. [2022-12-13 11:58:32,658 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 272 transitions. [2022-12-13 11:58:32,658 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 11:58:32,658 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 272 transitions. [2022-12-13 11:58:32,658 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 90.66666666666667) internal successors, (272), 3 states have internal predecessors, (272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:58:32,659 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 184.0) internal successors, (736), 4 states have internal predecessors, (736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:58:32,660 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 184.0) internal successors, (736), 4 states have internal predecessors, (736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:58:32,660 INFO L175 Difference]: Start difference. First operand has 33 places, 18 transitions, 72 flow. Second operand 3 states and 272 transitions. [2022-12-13 11:58:32,660 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 30 transitions, 180 flow [2022-12-13 11:58:32,661 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 30 transitions, 166 flow, removed 1 selfloop flow, removed 5 redundant places. [2022-12-13 11:58:32,662 INFO L231 Difference]: Finished difference. Result has 29 places, 18 transitions, 70 flow [2022-12-13 11:58:32,662 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=184, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=70, PETRI_PLACES=29, PETRI_TRANSITIONS=18} [2022-12-13 11:58:32,662 INFO L288 CegarLoopForPetriNet]: 25 programPoint places, 4 predicate places. [2022-12-13 11:58:32,662 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 18 transitions, 70 flow [2022-12-13 11:58:32,663 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 87.0) internal successors, (261), 3 states have internal predecessors, (261), 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 11:58:32,663 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:58:32,663 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:58:32,663 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 11:58:32,663 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 11:58:32,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:58:32,664 INFO L85 PathProgramCache]: Analyzing trace with hash 1077634086, now seen corresponding path program 3 times [2022-12-13 11:58:32,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:58:32,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557721187] [2022-12-13 11:58:32,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:58:32,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:58:32,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 11:58:32,699 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 11:58:32,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 11:58:32,739 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 11:58:32,740 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 11:58:32,740 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2022-12-13 11:58:32,742 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2022-12-13 11:58:32,742 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2022-12-13 11:58:32,742 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2022-12-13 11:58:32,742 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2022-12-13 11:58:32,742 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 11:58:32,743 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1] [2022-12-13 11:58:32,747 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 11:58:32,747 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 11:58:32,775 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 11:58:32 BasicIcfg [2022-12-13 11:58:32,775 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 11:58:32,775 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-13 11:58:32,775 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-13 11:58:32,776 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-13 11:58:32,776 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 11:58:28" (3/4) ... [2022-12-13 11:58:32,777 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-12-13 11:58:32,817 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d055ddb-02b8-4bb9-a156-8d4ad527e76c/bin/uautomizer-uyxdKDjOR8/witness.graphml [2022-12-13 11:58:32,817 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-13 11:58:32,818 INFO L158 Benchmark]: Toolchain (without parser) took 5416.61ms. Allocated memory was 130.0MB in the beginning and 157.3MB in the end (delta: 27.3MB). Free memory was 99.6MB in the beginning and 47.3MB in the end (delta: 52.3MB). Peak memory consumption was 81.0MB. Max. memory is 16.1GB. [2022-12-13 11:58:32,818 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 130.0MB. Free memory was 84.9MB in the beginning and 84.7MB in the end (delta: 142.6kB). There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 11:58:32,818 INFO L158 Benchmark]: CACSL2BoogieTranslator took 343.03ms. Allocated memory is still 130.0MB. Free memory was 99.2MB in the beginning and 74.4MB in the end (delta: 24.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2022-12-13 11:58:32,819 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.33ms. Allocated memory is still 130.0MB. Free memory was 74.4MB in the beginning and 72.2MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 11:58:32,819 INFO L158 Benchmark]: Boogie Preprocessor took 28.81ms. Allocated memory is still 130.0MB. Free memory was 71.8MB in the beginning and 70.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 11:58:32,819 INFO L158 Benchmark]: RCFGBuilder took 490.55ms. Allocated memory is still 130.0MB. Free memory was 70.2MB in the beginning and 87.4MB in the end (delta: -17.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2022-12-13 11:58:32,819 INFO L158 Benchmark]: TraceAbstraction took 4464.74ms. Allocated memory was 130.0MB in the beginning and 157.3MB in the end (delta: 27.3MB). Free memory was 87.1MB in the beginning and 54.6MB in the end (delta: 32.5MB). Peak memory consumption was 62.9MB. Max. memory is 16.1GB. [2022-12-13 11:58:32,820 INFO L158 Benchmark]: Witness Printer took 42.01ms. Allocated memory is still 157.3MB. Free memory was 54.6MB in the beginning and 47.3MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-12-13 11:58:32,822 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 130.0MB. Free memory was 84.9MB in the beginning and 84.7MB in the end (delta: 142.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 343.03ms. Allocated memory is still 130.0MB. Free memory was 99.2MB in the beginning and 74.4MB in the end (delta: 24.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.33ms. Allocated memory is still 130.0MB. Free memory was 74.4MB in the beginning and 72.2MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 28.81ms. Allocated memory is still 130.0MB. Free memory was 71.8MB in the beginning and 70.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 490.55ms. Allocated memory is still 130.0MB. Free memory was 70.2MB in the beginning and 87.4MB in the end (delta: -17.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 4464.74ms. Allocated memory was 130.0MB in the beginning and 157.3MB in the end (delta: 27.3MB). Free memory was 87.1MB in the beginning and 54.6MB in the end (delta: 32.5MB). Peak memory consumption was 62.9MB. Max. memory is 16.1GB. * Witness Printer took 42.01ms. Allocated memory is still 157.3MB. Free memory was 54.6MB in the beginning and 47.3MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.2s, 99 PlacesBefore, 25 PlacesAfterwards, 94 TransitionsBefore, 18 TransitionsAfterwards, 1232 CoEnabledTransitionPairs, 6 FixpointIterations, 38 TrivialSequentialCompositions, 39 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 2 ChoiceCompositions, 88 TotalNumberOfCompositions, 3027 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1516, independent: 1387, independent conditional: 0, independent unconditional: 1387, dependent: 129, dependent conditional: 0, dependent unconditional: 129, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 709, independent: 675, independent conditional: 0, independent unconditional: 675, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1516, independent: 712, independent conditional: 0, independent unconditional: 712, dependent: 95, dependent conditional: 0, dependent unconditional: 95, unknown: 709, unknown conditional: 0, unknown unconditional: 709] , Statistics on independence cache: Total cache size (in pairs): 53, Positive cache size: 38, Positive conditional cache size: 0, Positive unconditional cache size: 38, Negative cache size: 15, Negative conditional cache size: 0, Negative unconditional cache size: 15, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L708] 0 int __unbuffered_cnt = 0; [L710] 0 int __unbuffered_p1_EAX = 0; [L712] 0 int __unbuffered_p1_EBX = 0; [L713] 0 _Bool main$tmp_guard0; [L714] 0 _Bool main$tmp_guard1; [L716] 0 int x = 0; [L717] 0 _Bool x$flush_delayed; [L718] 0 int x$mem_tmp; [L719] 0 _Bool x$r_buff0_thd0; [L720] 0 _Bool x$r_buff0_thd1; [L721] 0 _Bool x$r_buff0_thd2; [L722] 0 _Bool x$r_buff1_thd0; [L723] 0 _Bool x$r_buff1_thd1; [L724] 0 _Bool x$r_buff1_thd2; [L725] 0 _Bool x$read_delayed; [L726] 0 int *x$read_delayed_var; [L727] 0 int x$w_buff0; [L728] 0 _Bool x$w_buff0_used; [L729] 0 int x$w_buff1; [L730] 0 _Bool x$w_buff1_used; [L732] 0 int y = 0; [L733] 0 _Bool weak$$choice0; [L734] 0 _Bool weak$$choice2; [L810] 0 pthread_t t1705; [L811] FCALL, FORK 0 pthread_create(&t1705, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1705, ((void *)0), P0, ((void *)0))=-1, t1705={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L738] 1 x$w_buff1 = x$w_buff0 [L739] 1 x$w_buff0 = 1 [L740] 1 x$w_buff1_used = x$w_buff0_used [L741] 1 x$w_buff0_used = (_Bool)1 [L742] CALL 1 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L742] RET 1 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L743] 1 x$r_buff1_thd0 = x$r_buff0_thd0 [L744] 1 x$r_buff1_thd1 = x$r_buff0_thd1 [L745] 1 x$r_buff1_thd2 = x$r_buff0_thd2 [L746] 1 x$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L812] 0 pthread_t t1706; [L813] FCALL, FORK 0 pthread_create(&t1706, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1706, ((void *)0), P1, ((void *)0))=0, t1705={5:0}, t1706={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L749] 1 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L766] 2 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L769] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L772] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L773] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L774] 2 x$flush_delayed = weak$$choice2 [L775] 2 x$mem_tmp = x [L776] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L777] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L778] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L779] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L780] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L781] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L782] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L783] 2 __unbuffered_p1_EBX = x [L784] 2 x = x$flush_delayed ? x$mem_tmp : x [L785] 2 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=65, weak$$choice2=255, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L752] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L753] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L754] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L755] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L756] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=65, weak$$choice2=255, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L788] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L789] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L790] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L791] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L792] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=65, weak$$choice2=255, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L759] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L761] 1 return 0; [L795] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L797] 2 return 0; [L815] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L817] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L817] RET 0 assume_abort_if_not(main$tmp_guard0) [L819] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L820] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L821] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L822] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L823] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1705={5:0}, t1706={3:0}, weak$$choice0=65, weak$$choice2=255, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L826] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p1_EAX == 2 && __unbuffered_p1_EBX == 0) [L828] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=65, weak$$choice2=255, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 813]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 811]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 115 locations, 5 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 4.3s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 144 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 109 mSDsluCounter, 59 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 45 mSDsCounter, 22 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 368 IncrementalHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 22 mSolverCounterUnsat, 14 mSDtfsCounter, 368 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=74occurred in iteration=4, InterpolantAutomatonStates: 27, 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.1s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 79 NumberOfCodeBlocks, 79 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 57 ConstructedInterpolants, 0 QuantifiedInterpolants, 305 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-13 11:58:32,837 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d055ddb-02b8-4bb9-a156-8d4ad527e76c/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