./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/mix027_power.oepc_pso.oepc_rmo.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d430da05-79a9-44cf-946c-d6a4166d8c9d/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d430da05-79a9-44cf-946c-d6a4166d8c9d/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_d430da05-79a9-44cf-946c-d6a4166d8c9d/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d430da05-79a9-44cf-946c-d6a4166d8c9d/bin/uautomizer-uyxdKDjOR8/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix027_power.oepc_pso.oepc_rmo.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d430da05-79a9-44cf-946c-d6a4166d8c9d/bin/uautomizer-uyxdKDjOR8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d430da05-79a9-44cf-946c-d6a4166d8c9d/bin/uautomizer-uyxdKDjOR8 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d8f535cb798ce58a79ec2e9a728d4e5d884025e215c7cfd9880fc53267dd5a20 --- 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 21:40:02,945 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 21:40:02,947 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 21:40:02,959 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 21:40:02,959 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 21:40:02,960 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 21:40:02,961 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 21:40:02,962 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 21:40:02,963 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 21:40:02,963 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 21:40:02,964 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 21:40:02,965 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 21:40:02,965 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 21:40:02,965 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 21:40:02,966 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 21:40:02,967 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 21:40:02,968 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 21:40:02,968 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 21:40:02,969 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 21:40:02,970 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 21:40:02,971 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 21:40:02,972 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 21:40:02,973 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 21:40:02,974 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 21:40:02,977 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 21:40:02,977 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 21:40:02,978 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 21:40:02,978 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 21:40:02,979 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 21:40:02,980 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 21:40:02,980 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 21:40:02,980 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 21:40:02,981 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 21:40:02,982 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 21:40:02,983 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 21:40:02,983 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 21:40:02,983 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 21:40:02,984 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 21:40:02,984 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 21:40:02,984 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 21:40:02,985 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 21:40:02,986 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d430da05-79a9-44cf-946c-d6a4166d8c9d/bin/uautomizer-uyxdKDjOR8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-12-13 21:40:03,011 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 21:40:03,011 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 21:40:03,011 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 21:40:03,016 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 21:40:03,016 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 21:40:03,016 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 21:40:03,017 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 21:40:03,017 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 21:40:03,017 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 21:40:03,018 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 21:40:03,018 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 21:40:03,018 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-13 21:40:03,018 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 21:40:03,018 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 21:40:03,018 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 21:40:03,018 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-12-13 21:40:03,019 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-12-13 21:40:03,019 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-12-13 21:40:03,019 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 21:40:03,019 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-12-13 21:40:03,019 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 21:40:03,019 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 21:40:03,020 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 21:40:03,020 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 21:40:03,020 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 21:40:03,020 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 21:40:03,020 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 21:40:03,020 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 21:40:03,020 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 21:40:03,021 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 21:40:03,021 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 21:40:03,021 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 21:40:03,021 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 21:40:03,021 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 21:40:03,021 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_d430da05-79a9-44cf-946c-d6a4166d8c9d/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_d430da05-79a9-44cf-946c-d6a4166d8c9d/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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> d8f535cb798ce58a79ec2e9a728d4e5d884025e215c7cfd9880fc53267dd5a20 [2022-12-13 21:40:03,185 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 21:40:03,202 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 21:40:03,204 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 21:40:03,205 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 21:40:03,205 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 21:40:03,206 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d430da05-79a9-44cf-946c-d6a4166d8c9d/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/pthread-wmm/mix027_power.oepc_pso.oepc_rmo.oepc.i [2022-12-13 21:40:05,739 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 21:40:05,958 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 21:40:05,959 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d430da05-79a9-44cf-946c-d6a4166d8c9d/sv-benchmarks/c/pthread-wmm/mix027_power.oepc_pso.oepc_rmo.oepc.i [2022-12-13 21:40:05,971 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d430da05-79a9-44cf-946c-d6a4166d8c9d/bin/uautomizer-uyxdKDjOR8/data/992adf313/71edcc5b10b14f6fa1d4c6ad03cf9c28/FLAGbc4183553 [2022-12-13 21:40:06,339 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d430da05-79a9-44cf-946c-d6a4166d8c9d/bin/uautomizer-uyxdKDjOR8/data/992adf313/71edcc5b10b14f6fa1d4c6ad03cf9c28 [2022-12-13 21:40:06,342 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 21:40:06,344 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 21:40:06,346 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 21:40:06,347 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 21:40:06,351 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 21:40:06,352 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 09:40:06" (1/1) ... [2022-12-13 21:40:06,352 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a437e64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:40:06, skipping insertion in model container [2022-12-13 21:40:06,353 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 09:40:06" (1/1) ... [2022-12-13 21:40:06,359 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 21:40:06,395 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 21:40:06,518 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_d430da05-79a9-44cf-946c-d6a4166d8c9d/sv-benchmarks/c/pthread-wmm/mix027_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2022-12-13 21:40:06,631 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:40:06,633 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:40:06,633 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:40:06,634 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:40:06,634 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:40:06,637 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:40:06,637 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:40:06,638 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:40:06,639 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:40:06,639 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:40:06,639 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:40:06,640 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:40:06,640 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:40:06,642 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:40:06,643 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:40:06,643 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:40:06,644 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:40:06,644 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:40:06,644 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:40:06,645 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:40:06,645 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:40:06,648 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:40:06,648 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:40:06,649 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:40:06,650 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:40:06,650 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:40:06,650 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:40:06,651 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:40:06,651 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:40:06,660 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:40:06,660 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:40:06,663 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:40:06,664 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:40:06,664 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:40:06,671 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:40:06,672 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:40:06,672 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:40:06,675 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:40:06,675 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:40:06,676 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:40:06,677 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 21:40:06,687 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 21:40:06,696 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_d430da05-79a9-44cf-946c-d6a4166d8c9d/sv-benchmarks/c/pthread-wmm/mix027_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2022-12-13 21:40:06,720 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:40:06,721 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:40:06,721 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:40:06,722 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:40:06,722 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:40:06,724 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:40:06,724 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:40:06,725 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:40:06,725 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:40:06,726 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:40:06,726 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:40:06,726 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:40:06,726 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:40:06,729 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:40:06,729 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:40:06,729 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:40:06,730 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:40:06,730 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:40:06,730 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:40:06,731 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:40:06,731 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:40:06,733 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:40:06,733 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:40:06,734 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:40:06,734 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:40:06,735 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:40:06,735 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:40:06,735 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:40:06,735 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:40:06,741 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:40:06,742 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:40:06,743 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:40:06,744 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:40:06,744 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:40:06,748 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:40:06,749 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:40:06,749 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:40:06,751 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:40:06,751 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:40:06,752 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:40:06,752 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 21:40:06,772 INFO L208 MainTranslator]: Completed translation [2022-12-13 21:40:06,772 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:40:06 WrapperNode [2022-12-13 21:40:06,772 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 21:40:06,773 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 21:40:06,773 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 21:40:06,773 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 21:40:06,778 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:40:06" (1/1) ... [2022-12-13 21:40:06,789 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:40:06" (1/1) ... [2022-12-13 21:40:06,804 INFO L138 Inliner]: procedures = 177, calls = 69, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 144 [2022-12-13 21:40:06,805 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 21:40:06,805 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 21:40:06,805 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 21:40:06,805 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 21:40:06,812 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:40:06" (1/1) ... [2022-12-13 21:40:06,812 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:40:06" (1/1) ... [2022-12-13 21:40:06,814 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:40:06" (1/1) ... [2022-12-13 21:40:06,814 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:40:06" (1/1) ... [2022-12-13 21:40:06,819 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:40:06" (1/1) ... [2022-12-13 21:40:06,821 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:40:06" (1/1) ... [2022-12-13 21:40:06,822 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:40:06" (1/1) ... [2022-12-13 21:40:06,823 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:40:06" (1/1) ... [2022-12-13 21:40:06,825 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 21:40:06,826 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 21:40:06,826 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 21:40:06,826 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 21:40:06,827 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:40:06" (1/1) ... [2022-12-13 21:40:06,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 21:40:06,839 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d430da05-79a9-44cf-946c-d6a4166d8c9d/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 21:40:06,848 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d430da05-79a9-44cf-946c-d6a4166d8c9d/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 21:40:06,850 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d430da05-79a9-44cf-946c-d6a4166d8c9d/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 21:40:06,874 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 21:40:06,874 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 21:40:06,874 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 21:40:06,874 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 21:40:06,874 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 21:40:06,874 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 21:40:06,874 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 21:40:06,875 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 21:40:06,875 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 21:40:06,875 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-13 21:40:06,875 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-13 21:40:06,875 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-12-13 21:40:06,875 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-12-13 21:40:06,875 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 21:40:06,875 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 21:40:06,876 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 21:40:06,876 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 21:40:06,877 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 21:40:06,984 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 21:40:06,986 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 21:40:07,277 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 21:40:07,386 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 21:40:07,386 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 21:40:07,388 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 09:40:07 BoogieIcfgContainer [2022-12-13 21:40:07,389 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 21:40:07,391 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 21:40:07,391 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 21:40:07,395 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 21:40:07,395 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 09:40:06" (1/3) ... [2022-12-13 21:40:07,395 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e761c21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 09:40:07, skipping insertion in model container [2022-12-13 21:40:07,396 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:40:06" (2/3) ... [2022-12-13 21:40:07,396 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e761c21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 09:40:07, skipping insertion in model container [2022-12-13 21:40:07,396 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 09:40:07" (3/3) ... [2022-12-13 21:40:07,397 INFO L112 eAbstractionObserver]: Analyzing ICFG mix027_power.oepc_pso.oepc_rmo.oepc.i [2022-12-13 21:40:07,416 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 21:40:07,417 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2022-12-13 21:40:07,417 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 21:40:07,455 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 21:40:07,480 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 160 places, 149 transitions, 318 flow [2022-12-13 21:40:07,518 INFO L130 PetriNetUnfolder]: 2/145 cut-off events. [2022-12-13 21:40:07,518 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 21:40:07,522 INFO L83 FinitePrefix]: Finished finitePrefix Result has 158 conditions, 145 events. 2/145 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 106 event pairs, 0 based on Foata normal form. 0/132 useless extension candidates. Maximal degree in co-relation 101. Up to 2 conditions per place. [2022-12-13 21:40:07,523 INFO L82 GeneralOperation]: Start removeDead. Operand has 160 places, 149 transitions, 318 flow [2022-12-13 21:40:07,526 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 156 places, 145 transitions, 302 flow [2022-12-13 21:40:07,529 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-12-13 21:40:07,536 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 156 places, 145 transitions, 302 flow [2022-12-13 21:40:07,538 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 156 places, 145 transitions, 302 flow [2022-12-13 21:40:07,538 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 156 places, 145 transitions, 302 flow [2022-12-13 21:40:07,559 INFO L130 PetriNetUnfolder]: 2/145 cut-off events. [2022-12-13 21:40:07,560 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 21:40:07,560 INFO L83 FinitePrefix]: Finished finitePrefix Result has 158 conditions, 145 events. 2/145 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 106 event pairs, 0 based on Foata normal form. 0/132 useless extension candidates. Maximal degree in co-relation 101. Up to 2 conditions per place. [2022-12-13 21:40:07,562 INFO L119 LiptonReduction]: Number of co-enabled transitions 3764 [2022-12-13 21:40:10,606 INFO L134 LiptonReduction]: Checked pairs total: 10934 [2022-12-13 21:40:10,606 INFO L136 LiptonReduction]: Total number of compositions: 136 [2022-12-13 21:40:10,620 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 21:40:10,624 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=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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;@2b5d37de, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 21:40:10,624 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2022-12-13 21:40:10,626 INFO L130 PetriNetUnfolder]: 0/1 cut-off events. [2022-12-13 21:40:10,626 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 21:40:10,626 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 21:40:10,626 INFO L209 CegarLoopForPetriNet]: trace histogram [1] [2022-12-13 21:40:10,627 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-12-13 21:40:10,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:40:10,631 INFO L85 PathProgramCache]: Analyzing trace with hash 620, now seen corresponding path program 1 times [2022-12-13 21:40:10,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:40:10,638 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187254945] [2022-12-13 21:40:10,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:40:10,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:40:10,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:40:10,721 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 21:40:10,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:40:10,722 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187254945] [2022-12-13 21:40:10,722 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1187254945] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:40:10,723 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:40:10,723 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-12-13 21:40:10,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636669396] [2022-12-13 21:40:10,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:40:10,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-13 21:40:10,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:40:10,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-13 21:40:10,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-13 21:40:10,749 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 285 [2022-12-13 21:40:10,751 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 41 transitions, 94 flow. Second operand has 2 states, 2 states have (on average 134.5) internal successors, (269), 2 states have internal predecessors, (269), 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 21:40:10,751 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 21:40:10,751 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 285 [2022-12-13 21:40:10,752 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 21:40:12,128 INFO L130 PetriNetUnfolder]: 8719/11825 cut-off events. [2022-12-13 21:40:12,128 INFO L131 PetriNetUnfolder]: For 74/74 co-relation queries the response was YES. [2022-12-13 21:40:12,143 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23773 conditions, 11825 events. 8719/11825 cut-off events. For 74/74 co-relation queries the response was YES. Maximal size of possible extension queue 543. Compared 61539 event pairs, 8719 based on Foata normal form. 0/10332 useless extension candidates. Maximal degree in co-relation 23761. Up to 11731 conditions per place. [2022-12-13 21:40:12,182 INFO L137 encePairwiseOnDemand]: 276/285 looper letters, 28 selfloop transitions, 0 changer transitions 0/32 dead transitions. [2022-12-13 21:40:12,182 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 32 transitions, 132 flow [2022-12-13 21:40:12,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 21:40:12,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-12-13 21:40:12,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 305 transitions. [2022-12-13 21:40:12,192 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5350877192982456 [2022-12-13 21:40:12,193 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 305 transitions. [2022-12-13 21:40:12,193 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 305 transitions. [2022-12-13 21:40:12,194 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 21:40:12,196 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 305 transitions. [2022-12-13 21:40:12,198 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 152.5) internal successors, (305), 2 states have internal predecessors, (305), 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 21:40:12,202 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 285.0) internal successors, (855), 3 states have internal predecessors, (855), 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 21:40:12,203 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 285.0) internal successors, (855), 3 states have internal predecessors, (855), 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 21:40:12,204 INFO L175 Difference]: Start difference. First operand has 53 places, 41 transitions, 94 flow. Second operand 2 states and 305 transitions. [2022-12-13 21:40:12,205 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 32 transitions, 132 flow [2022-12-13 21:40:12,209 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 32 transitions, 128 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-13 21:40:12,210 INFO L231 Difference]: Finished difference. Result has 42 places, 32 transitions, 72 flow [2022-12-13 21:40:12,211 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=285, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=72, PETRI_PLACES=42, PETRI_TRANSITIONS=32} [2022-12-13 21:40:12,214 INFO L288 CegarLoopForPetriNet]: 53 programPoint places, -11 predicate places. [2022-12-13 21:40:12,215 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 32 transitions, 72 flow [2022-12-13 21:40:12,215 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 134.5) internal successors, (269), 2 states have internal predecessors, (269), 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 21:40:12,215 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 21:40:12,215 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-12-13 21:40:12,215 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 21:40:12,216 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-12-13 21:40:12,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:40:12,216 INFO L85 PathProgramCache]: Analyzing trace with hash 611288, now seen corresponding path program 1 times [2022-12-13 21:40:12,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:40:12,216 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461832475] [2022-12-13 21:40:12,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:40:12,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:40:12,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:40:12,386 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 21:40:12,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:40:12,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461832475] [2022-12-13 21:40:12,386 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461832475] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:40:12,387 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:40:12,387 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 21:40:12,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795648557] [2022-12-13 21:40:12,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:40:12,388 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 21:40:12,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:40:12,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 21:40:12,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 21:40:12,393 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 285 [2022-12-13 21:40:12,394 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 32 transitions, 72 flow. Second operand has 3 states, 3 states have (on average 134.0) internal successors, (402), 3 states have internal predecessors, (402), 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 21:40:12,394 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 21:40:12,394 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 285 [2022-12-13 21:40:12,394 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 21:40:13,347 INFO L130 PetriNetUnfolder]: 6855/9417 cut-off events. [2022-12-13 21:40:13,347 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 21:40:13,355 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18854 conditions, 9417 events. 6855/9417 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 437. Compared 49044 event pairs, 2703 based on Foata normal form. 0/8759 useless extension candidates. Maximal degree in co-relation 18851. Up to 7399 conditions per place. [2022-12-13 21:40:13,388 INFO L137 encePairwiseOnDemand]: 282/285 looper letters, 45 selfloop transitions, 2 changer transitions 2/53 dead transitions. [2022-12-13 21:40:13,388 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 53 transitions, 218 flow [2022-12-13 21:40:13,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 21:40:13,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 21:40:13,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 449 transitions. [2022-12-13 21:40:13,391 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5251461988304094 [2022-12-13 21:40:13,391 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 449 transitions. [2022-12-13 21:40:13,391 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 449 transitions. [2022-12-13 21:40:13,391 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 21:40:13,391 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 449 transitions. [2022-12-13 21:40:13,392 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 149.66666666666666) internal successors, (449), 3 states have internal predecessors, (449), 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 21:40:13,393 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 285.0) internal successors, (1140), 4 states have internal predecessors, (1140), 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 21:40:13,394 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 285.0) internal successors, (1140), 4 states have internal predecessors, (1140), 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 21:40:13,394 INFO L175 Difference]: Start difference. First operand has 42 places, 32 transitions, 72 flow. Second operand 3 states and 449 transitions. [2022-12-13 21:40:13,394 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 53 transitions, 218 flow [2022-12-13 21:40:13,394 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 53 transitions, 218 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-13 21:40:13,395 INFO L231 Difference]: Finished difference. Result has 43 places, 30 transitions, 72 flow [2022-12-13 21:40:13,395 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=285, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=72, PETRI_PLACES=43, PETRI_TRANSITIONS=30} [2022-12-13 21:40:13,396 INFO L288 CegarLoopForPetriNet]: 53 programPoint places, -10 predicate places. [2022-12-13 21:40:13,396 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 30 transitions, 72 flow [2022-12-13 21:40:13,396 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 134.0) internal successors, (402), 3 states have internal predecessors, (402), 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 21:40:13,396 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 21:40:13,396 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:40:13,396 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 21:40:13,396 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-12-13 21:40:13,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:40:13,397 INFO L85 PathProgramCache]: Analyzing trace with hash 1931892640, now seen corresponding path program 1 times [2022-12-13 21:40:13,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:40:13,397 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513100298] [2022-12-13 21:40:13,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:40:13,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:40:13,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:40:13,541 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 21:40:13,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:40:13,542 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513100298] [2022-12-13 21:40:13,542 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513100298] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:40:13,542 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:40:13,542 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 21:40:13,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7669304] [2022-12-13 21:40:13,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:40:13,543 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 21:40:13,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:40:13,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 21:40:13,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 21:40:13,549 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 285 [2022-12-13 21:40:13,550 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 30 transitions, 72 flow. Second operand has 3 states, 3 states have (on average 134.66666666666666) internal successors, (404), 3 states have internal predecessors, (404), 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 21:40:13,550 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 21:40:13,550 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 285 [2022-12-13 21:40:13,550 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 21:40:14,588 INFO L130 PetriNetUnfolder]: 7337/10048 cut-off events. [2022-12-13 21:40:14,588 INFO L131 PetriNetUnfolder]: For 501/501 co-relation queries the response was YES. [2022-12-13 21:40:14,596 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20675 conditions, 10048 events. 7337/10048 cut-off events. For 501/501 co-relation queries the response was YES. Maximal size of possible extension queue 434. Compared 50617 event pairs, 3671 based on Foata normal form. 0/9676 useless extension candidates. Maximal degree in co-relation 20671. Up to 9289 conditions per place. [2022-12-13 21:40:14,617 INFO L137 encePairwiseOnDemand]: 281/285 looper letters, 44 selfloop transitions, 3 changer transitions 0/50 dead transitions. [2022-12-13 21:40:14,617 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 50 transitions, 214 flow [2022-12-13 21:40:14,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 21:40:14,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 21:40:14,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 441 transitions. [2022-12-13 21:40:14,619 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5157894736842106 [2022-12-13 21:40:14,619 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 441 transitions. [2022-12-13 21:40:14,619 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 441 transitions. [2022-12-13 21:40:14,619 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 21:40:14,619 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 441 transitions. [2022-12-13 21:40:14,620 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 147.0) internal successors, (441), 3 states have internal predecessors, (441), 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 21:40:14,622 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 285.0) internal successors, (1140), 4 states have internal predecessors, (1140), 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 21:40:14,622 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 285.0) internal successors, (1140), 4 states have internal predecessors, (1140), 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 21:40:14,622 INFO L175 Difference]: Start difference. First operand has 43 places, 30 transitions, 72 flow. Second operand 3 states and 441 transitions. [2022-12-13 21:40:14,622 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 50 transitions, 214 flow [2022-12-13 21:40:14,623 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 50 transitions, 208 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 21:40:14,623 INFO L231 Difference]: Finished difference. Result has 43 places, 32 transitions, 87 flow [2022-12-13 21:40:14,624 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=285, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=87, PETRI_PLACES=43, PETRI_TRANSITIONS=32} [2022-12-13 21:40:14,624 INFO L288 CegarLoopForPetriNet]: 53 programPoint places, -10 predicate places. [2022-12-13 21:40:14,624 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 32 transitions, 87 flow [2022-12-13 21:40:14,624 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 134.66666666666666) internal successors, (404), 3 states have internal predecessors, (404), 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 21:40:14,624 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 21:40:14,624 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:40:14,625 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 21:40:14,625 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-12-13 21:40:14,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:40:14,625 INFO L85 PathProgramCache]: Analyzing trace with hash -240871780, now seen corresponding path program 1 times [2022-12-13 21:40:14,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:40:14,625 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705538436] [2022-12-13 21:40:14,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:40:14,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:40:14,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:40:14,756 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 21:40:14,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:40:14,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705538436] [2022-12-13 21:40:14,757 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705538436] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:40:14,757 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:40:14,757 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 21:40:14,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743205551] [2022-12-13 21:40:14,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:40:14,757 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 21:40:14,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:40:14,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 21:40:14,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 21:40:14,777 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 285 [2022-12-13 21:40:14,778 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 32 transitions, 87 flow. Second operand has 4 states, 4 states have (on average 126.0) internal successors, (504), 4 states have internal predecessors, (504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:40:14,779 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 21:40:14,779 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 285 [2022-12-13 21:40:14,779 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 21:40:17,222 INFO L130 PetriNetUnfolder]: 20775/27928 cut-off events. [2022-12-13 21:40:17,222 INFO L131 PetriNetUnfolder]: For 3371/3371 co-relation queries the response was YES. [2022-12-13 21:40:17,264 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60028 conditions, 27928 events. 20775/27928 cut-off events. For 3371/3371 co-relation queries the response was YES. Maximal size of possible extension queue 903. Compared 144608 event pairs, 4161 based on Foata normal form. 626/28554 useless extension candidates. Maximal degree in co-relation 60023. Up to 12404 conditions per place. [2022-12-13 21:40:17,356 INFO L137 encePairwiseOnDemand]: 276/285 looper letters, 61 selfloop transitions, 10 changer transitions 0/71 dead transitions. [2022-12-13 21:40:17,356 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 71 transitions, 327 flow [2022-12-13 21:40:17,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 21:40:17,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 21:40:17,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 559 transitions. [2022-12-13 21:40:17,358 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4903508771929825 [2022-12-13 21:40:17,359 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 559 transitions. [2022-12-13 21:40:17,359 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 559 transitions. [2022-12-13 21:40:17,359 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 21:40:17,359 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 559 transitions. [2022-12-13 21:40:17,360 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 139.75) internal successors, (559), 4 states have internal predecessors, (559), 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 21:40:17,362 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 285.0) internal successors, (1425), 5 states have internal predecessors, (1425), 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 21:40:17,363 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 285.0) internal successors, (1425), 5 states have internal predecessors, (1425), 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 21:40:17,363 INFO L175 Difference]: Start difference. First operand has 43 places, 32 transitions, 87 flow. Second operand 4 states and 559 transitions. [2022-12-13 21:40:17,363 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 71 transitions, 327 flow [2022-12-13 21:40:17,364 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 71 transitions, 320 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 21:40:17,365 INFO L231 Difference]: Finished difference. Result has 48 places, 40 transitions, 168 flow [2022-12-13 21:40:17,366 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=285, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=168, PETRI_PLACES=48, PETRI_TRANSITIONS=40} [2022-12-13 21:40:17,366 INFO L288 CegarLoopForPetriNet]: 53 programPoint places, -5 predicate places. [2022-12-13 21:40:17,366 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 40 transitions, 168 flow [2022-12-13 21:40:17,367 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 126.0) internal successors, (504), 4 states have internal predecessors, (504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:40:17,367 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 21:40:17,367 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:40:17,367 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 21:40:17,367 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-12-13 21:40:17,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:40:17,368 INFO L85 PathProgramCache]: Analyzing trace with hash -240869365, now seen corresponding path program 1 times [2022-12-13 21:40:17,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:40:17,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541318025] [2022-12-13 21:40:17,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:40:17,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:40:17,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:40:17,806 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 21:40:17,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:40:17,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541318025] [2022-12-13 21:40:17,807 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541318025] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:40:17,807 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:40:17,807 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 21:40:17,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675519308] [2022-12-13 21:40:17,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:40:17,807 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 21:40:17,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:40:17,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 21:40:17,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 21:40:18,079 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 285 [2022-12-13 21:40:18,080 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 40 transitions, 168 flow. Second operand has 7 states, 7 states have (on average 116.71428571428571) internal successors, (817), 7 states have internal predecessors, (817), 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 21:40:18,080 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 21:40:18,080 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 285 [2022-12-13 21:40:18,080 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 21:40:19,195 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([570] L882-->ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK: Formula: (and (= v_~main$tmp_guard1~0_20 (ite (= (ite (not (and (= v_~z~0_18 2) (= 2 v_~__unbuffered_p3_EAX~0_14) (= v_~x~0_15 2) (= v_~__unbuffered_p1_EAX~0_12 0) (= 0 v_~__unbuffered_p3_EBX~0_24))) 1 0) 0) 0 1)) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_13| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_27|) (= (mod v_~main$tmp_guard1~0_20 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_13|) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_27| 0)) InVars {~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_12, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_14, ~z~0=v_~z~0_18, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_24, ~x~0=v_~x~0_15} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_27|, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_13|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_12, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_14, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_20, ~z~0=v_~z~0_18, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_24, ~x~0=v_~x~0_15} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~main$tmp_guard1~0][57], [P3Thread1of1ForFork1InUse, 77#ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAKtrue, 107#L824true, 131#L784true, 151#L804true, Black: 172#(= ~x~0 0), Black: 177#(= ~__unbuffered_p3_EAX~0 0), Black: 178#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 49#L771true, 175#true, P0Thread1of1ForFork2InUse, P2Thread1of1ForFork3InUse, 188#(and (not (= |ULTIMATE.start_main_~#t714~0#1.base| |ULTIMATE.start_main_~#t713~0#1.base|)) (not (= |ULTIMATE.start_main_~#t715~0#1.base| |ULTIMATE.start_main_~#t713~0#1.base|)) (not (= |ULTIMATE.start_main_~#t716~0#1.base| |ULTIMATE.start_main_~#t715~0#1.base|)) (not (= |ULTIMATE.start_main_~#t716~0#1.base| |ULTIMATE.start_main_~#t714~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t716~0#1.base| 0) |ULTIMATE.start_main_~#t714~0#1.base| 0) |ULTIMATE.start_main_~#t713~0#1.base| 0) |ULTIMATE.start_main_~#t715~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t715~0#1.base| |ULTIMATE.start_main_~#t714~0#1.base|)) (not (= |ULTIMATE.start_main_~#t716~0#1.base| |ULTIMATE.start_main_~#t713~0#1.base|))), 163#true, P1Thread1of1ForFork0InUse]) [2022-12-13 21:40:19,195 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2022-12-13 21:40:19,196 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-12-13 21:40:19,196 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-12-13 21:40:19,196 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-12-13 21:40:19,196 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([582] L882-->L866-3: Formula: (and (= |v_ULTIMATE.start_main_#res#1_26| 0) (not (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_33| 0)) (= v_~main$tmp_guard1~0_30 (ite (= (ite (not (and (= v_~__unbuffered_p1_EAX~0_18 0) (= 0 v_~__unbuffered_p3_EBX~0_30) (= v_~x~0_21 2) (= 2 v_~__unbuffered_p3_EAX~0_20) (= v_~z~0_24 2))) 1 0) 0) 0 1)) (= (store (store |v_#valid_209| |v_ULTIMATE.start_main_~#t713~0#1.base_35| 0) |v_ULTIMATE.start_main_~#t714~0#1.base_50| 0) |v_#valid_208|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_19| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_33|) (= (mod v_~main$tmp_guard1~0_30 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_19|)) InVars {~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_18, #valid=|v_#valid_209|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_20, ULTIMATE.start_main_~#t713~0#1.base=|v_ULTIMATE.start_main_~#t713~0#1.base_35|, ULTIMATE.start_main_~#t714~0#1.base=|v_ULTIMATE.start_main_~#t714~0#1.base_50|, ~z~0=v_~z~0_24, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_30, ~x~0=v_~x~0_21} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_33|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_26|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_30, ULTIMATE.start_main_~#t714~0#1.base=|v_ULTIMATE.start_main_~#t714~0#1.base_50|, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_30, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_19|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_18, #valid=|v_#valid_208|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_20, ULTIMATE.start_main_~#t713~0#1.offset=|v_ULTIMATE.start_main_~#t713~0#1.offset_23|, ~z~0=v_~z~0_24, ~x~0=v_~x~0_21} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_main_#res#1, #valid, ~main$tmp_guard1~0, ULTIMATE.start_main_~#t713~0#1.base, ULTIMATE.start_main_~#t713~0#1.offset][50], [P3Thread1of1ForFork1InUse, 189#(and (not (= |ULTIMATE.start_main_~#t716~0#1.base| |ULTIMATE.start_main_~#t715~0#1.base|)) (= (store (store |#valid| |ULTIMATE.start_main_~#t716~0#1.base| 0) |ULTIMATE.start_main_~#t715~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)), 107#L824true, 131#L784true, 151#L804true, Black: 172#(= ~x~0 0), 27#L866-3true, Black: 177#(= ~__unbuffered_p3_EAX~0 0), Black: 175#true, 49#L771true, P0Thread1of1ForFork2InUse, P2Thread1of1ForFork3InUse, 163#true, P1Thread1of1ForFork0InUse, 178#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)))]) [2022-12-13 21:40:19,196 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2022-12-13 21:40:19,196 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-12-13 21:40:19,196 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-12-13 21:40:19,196 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-12-13 21:40:19,260 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([442] L824-->L840: Formula: (let ((.cse3 (= (mod v_~a$r_buff1_thd4~0_62 256) 0)) (.cse7 (= (mod v_~a$r_buff0_thd4~0_62 256) 0))) (let ((.cse8 (not .cse7)) (.cse5 (and .cse3 .cse7)) (.cse11 (= (mod v_~a$w_buff0_used~0_162 256) 0)) (.cse6 (and (= (mod v_~a$w_buff1_used~0_143 256) 0) .cse7))) (let ((.cse2 (= (mod v_~a$w_buff1_used~0_142 256) 0)) (.cse4 (= (mod v_~a$w_buff0_used~0_161 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse9 (or .cse5 .cse11 .cse6)) (.cse10 (and .cse8 (not .cse11)))) (and (= v_~a$w_buff0~0_61 v_~a$w_buff0~0_60) (= (ite .cse0 v_~a$r_buff1_thd4~0_62 (ite (let ((.cse1 (= (mod v_~a$r_buff0_thd4~0_61 256) 0))) (or (and .cse1 .cse2) (and .cse3 .cse1) .cse4)) v_~a$r_buff1_thd4~0_62 0)) v_~a$r_buff1_thd4~0_61) (= v_~a$flush_delayed~0_27 0) (= v_~weak$$choice0~0_5 |v_P3Thread1of1ForFork1_#t~nondet3_1|) (= (ite .cse0 v_~a$w_buff1_used~0_143 (ite (or .cse5 .cse6 .cse4) v_~a$w_buff1_used~0_143 0)) v_~a$w_buff1_used~0_142) (= v_~a~0_86 (ite .cse0 v_~a$mem_tmp~0_22 v_~__unbuffered_p3_EBX~0_12)) (= v_~weak$$choice2~0_30 |v_P3Thread1of1ForFork1_#t~nondet4_1|) (= v_~a$w_buff1~0_52 v_~a$w_buff1~0_51) (= v_~a$r_buff0_thd4~0_61 (ite .cse0 v_~a$r_buff0_thd4~0_62 (ite (or .cse5 (and .cse7 .cse2) .cse4) v_~a$r_buff0_thd4~0_62 (ite (and .cse8 (not .cse4)) 0 v_~a$r_buff0_thd4~0_62)))) (= (ite .cse9 v_~a~0_87 (ite .cse10 v_~a$w_buff0~0_61 v_~a$w_buff1~0_52)) v_~__unbuffered_p3_EBX~0_12) (= (ite .cse0 v_~a$w_buff0_used~0_162 (ite .cse9 v_~a$w_buff0_used~0_162 (ite .cse10 0 v_~a$w_buff0_used~0_162))) v_~a$w_buff0_used~0_161) (= v_~a~0_87 v_~a$mem_tmp~0_22))))) InVars {~a~0=v_~a~0_87, ~a$w_buff1~0=v_~a$w_buff1~0_52, ~a$w_buff0~0=v_~a$w_buff0~0_61, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_62, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_162, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_143, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_62, P3Thread1of1ForFork1_#t~nondet3=|v_P3Thread1of1ForFork1_#t~nondet3_1|, P3Thread1of1ForFork1_#t~nondet4=|v_P3Thread1of1ForFork1_#t~nondet4_1|} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_61, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_161, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_12, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_61, ~a~0=v_~a~0_86, ~a$mem_tmp~0=v_~a$mem_tmp~0_22, ~weak$$choice0~0=v_~weak$$choice0~0_5, ~a$w_buff1~0=v_~a$w_buff1~0_51, ~a$flush_delayed~0=v_~a$flush_delayed~0_27, ~a$w_buff0~0=v_~a$w_buff0~0_60, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_142, ~weak$$choice2~0=v_~weak$$choice2~0_30} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork1_#t~nondet3, P3Thread1of1ForFork1_#t~nondet4][46], [P3Thread1of1ForFork1InUse, 131#L784true, 151#L804true, Black: 172#(= ~x~0 0), 140#L840true, Black: 177#(= ~__unbuffered_p3_EAX~0 0), 49#L771true, Black: 178#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 175#true, 46#L882true, P0Thread1of1ForFork2InUse, P2Thread1of1ForFork3InUse, 163#true, 188#(and (not (= |ULTIMATE.start_main_~#t714~0#1.base| |ULTIMATE.start_main_~#t713~0#1.base|)) (not (= |ULTIMATE.start_main_~#t715~0#1.base| |ULTIMATE.start_main_~#t713~0#1.base|)) (not (= |ULTIMATE.start_main_~#t716~0#1.base| |ULTIMATE.start_main_~#t715~0#1.base|)) (not (= |ULTIMATE.start_main_~#t716~0#1.base| |ULTIMATE.start_main_~#t714~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t716~0#1.base| 0) |ULTIMATE.start_main_~#t714~0#1.base| 0) |ULTIMATE.start_main_~#t713~0#1.base| 0) |ULTIMATE.start_main_~#t715~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t715~0#1.base| |ULTIMATE.start_main_~#t714~0#1.base|)) (not (= |ULTIMATE.start_main_~#t716~0#1.base| |ULTIMATE.start_main_~#t713~0#1.base|))), P1Thread1of1ForFork0InUse]) [2022-12-13 21:40:19,260 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is not cut-off event [2022-12-13 21:40:19,260 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is not cut-off event [2022-12-13 21:40:19,260 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is not cut-off event [2022-12-13 21:40:19,260 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is not cut-off event [2022-12-13 21:40:19,377 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([570] L882-->ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK: Formula: (and (= v_~main$tmp_guard1~0_20 (ite (= (ite (not (and (= v_~z~0_18 2) (= 2 v_~__unbuffered_p3_EAX~0_14) (= v_~x~0_15 2) (= v_~__unbuffered_p1_EAX~0_12 0) (= 0 v_~__unbuffered_p3_EBX~0_24))) 1 0) 0) 0 1)) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_13| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_27|) (= (mod v_~main$tmp_guard1~0_20 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_13|) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_27| 0)) InVars {~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_12, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_14, ~z~0=v_~z~0_18, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_24, ~x~0=v_~x~0_15} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_27|, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_13|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_12, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_14, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_20, ~z~0=v_~z~0_18, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_24, ~x~0=v_~x~0_15} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~main$tmp_guard1~0][57], [P3Thread1of1ForFork1InUse, 77#ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAKtrue, 107#L824true, 86#P0EXITtrue, 131#L784true, 151#L804true, Black: 172#(= ~x~0 0), Black: 177#(= ~__unbuffered_p3_EAX~0 0), Black: 178#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 175#true, P0Thread1of1ForFork2InUse, P2Thread1of1ForFork3InUse, 163#true, 188#(and (not (= |ULTIMATE.start_main_~#t714~0#1.base| |ULTIMATE.start_main_~#t713~0#1.base|)) (not (= |ULTIMATE.start_main_~#t715~0#1.base| |ULTIMATE.start_main_~#t713~0#1.base|)) (not (= |ULTIMATE.start_main_~#t716~0#1.base| |ULTIMATE.start_main_~#t715~0#1.base|)) (not (= |ULTIMATE.start_main_~#t716~0#1.base| |ULTIMATE.start_main_~#t714~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t716~0#1.base| 0) |ULTIMATE.start_main_~#t714~0#1.base| 0) |ULTIMATE.start_main_~#t713~0#1.base| 0) |ULTIMATE.start_main_~#t715~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t715~0#1.base| |ULTIMATE.start_main_~#t714~0#1.base|)) (not (= |ULTIMATE.start_main_~#t716~0#1.base| |ULTIMATE.start_main_~#t713~0#1.base|))), P1Thread1of1ForFork0InUse]) [2022-12-13 21:40:19,378 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2022-12-13 21:40:19,378 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-13 21:40:19,378 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-13 21:40:19,378 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-13 21:40:19,378 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([582] L882-->L866-3: Formula: (and (= |v_ULTIMATE.start_main_#res#1_26| 0) (not (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_33| 0)) (= v_~main$tmp_guard1~0_30 (ite (= (ite (not (and (= v_~__unbuffered_p1_EAX~0_18 0) (= 0 v_~__unbuffered_p3_EBX~0_30) (= v_~x~0_21 2) (= 2 v_~__unbuffered_p3_EAX~0_20) (= v_~z~0_24 2))) 1 0) 0) 0 1)) (= (store (store |v_#valid_209| |v_ULTIMATE.start_main_~#t713~0#1.base_35| 0) |v_ULTIMATE.start_main_~#t714~0#1.base_50| 0) |v_#valid_208|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_19| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_33|) (= (mod v_~main$tmp_guard1~0_30 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_19|)) InVars {~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_18, #valid=|v_#valid_209|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_20, ULTIMATE.start_main_~#t713~0#1.base=|v_ULTIMATE.start_main_~#t713~0#1.base_35|, ULTIMATE.start_main_~#t714~0#1.base=|v_ULTIMATE.start_main_~#t714~0#1.base_50|, ~z~0=v_~z~0_24, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_30, ~x~0=v_~x~0_21} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_33|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_26|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_30, ULTIMATE.start_main_~#t714~0#1.base=|v_ULTIMATE.start_main_~#t714~0#1.base_50|, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_30, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_19|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_18, #valid=|v_#valid_208|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_20, ULTIMATE.start_main_~#t713~0#1.offset=|v_ULTIMATE.start_main_~#t713~0#1.offset_23|, ~z~0=v_~z~0_24, ~x~0=v_~x~0_21} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_main_#res#1, #valid, ~main$tmp_guard1~0, ULTIMATE.start_main_~#t713~0#1.base, ULTIMATE.start_main_~#t713~0#1.offset][50], [P3Thread1of1ForFork1InUse, 189#(and (not (= |ULTIMATE.start_main_~#t716~0#1.base| |ULTIMATE.start_main_~#t715~0#1.base|)) (= (store (store |#valid| |ULTIMATE.start_main_~#t716~0#1.base| 0) |ULTIMATE.start_main_~#t715~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)), 107#L824true, 86#P0EXITtrue, 131#L784true, 151#L804true, Black: 172#(= ~x~0 0), 27#L866-3true, Black: 177#(= ~__unbuffered_p3_EAX~0 0), Black: 175#true, P0Thread1of1ForFork2InUse, P2Thread1of1ForFork3InUse, 163#true, 178#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), P1Thread1of1ForFork0InUse]) [2022-12-13 21:40:19,378 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2022-12-13 21:40:19,378 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-13 21:40:19,378 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-13 21:40:19,378 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-13 21:40:19,411 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([442] L824-->L840: Formula: (let ((.cse3 (= (mod v_~a$r_buff1_thd4~0_62 256) 0)) (.cse7 (= (mod v_~a$r_buff0_thd4~0_62 256) 0))) (let ((.cse8 (not .cse7)) (.cse5 (and .cse3 .cse7)) (.cse11 (= (mod v_~a$w_buff0_used~0_162 256) 0)) (.cse6 (and (= (mod v_~a$w_buff1_used~0_143 256) 0) .cse7))) (let ((.cse2 (= (mod v_~a$w_buff1_used~0_142 256) 0)) (.cse4 (= (mod v_~a$w_buff0_used~0_161 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse9 (or .cse5 .cse11 .cse6)) (.cse10 (and .cse8 (not .cse11)))) (and (= v_~a$w_buff0~0_61 v_~a$w_buff0~0_60) (= (ite .cse0 v_~a$r_buff1_thd4~0_62 (ite (let ((.cse1 (= (mod v_~a$r_buff0_thd4~0_61 256) 0))) (or (and .cse1 .cse2) (and .cse3 .cse1) .cse4)) v_~a$r_buff1_thd4~0_62 0)) v_~a$r_buff1_thd4~0_61) (= v_~a$flush_delayed~0_27 0) (= v_~weak$$choice0~0_5 |v_P3Thread1of1ForFork1_#t~nondet3_1|) (= (ite .cse0 v_~a$w_buff1_used~0_143 (ite (or .cse5 .cse6 .cse4) v_~a$w_buff1_used~0_143 0)) v_~a$w_buff1_used~0_142) (= v_~a~0_86 (ite .cse0 v_~a$mem_tmp~0_22 v_~__unbuffered_p3_EBX~0_12)) (= v_~weak$$choice2~0_30 |v_P3Thread1of1ForFork1_#t~nondet4_1|) (= v_~a$w_buff1~0_52 v_~a$w_buff1~0_51) (= v_~a$r_buff0_thd4~0_61 (ite .cse0 v_~a$r_buff0_thd4~0_62 (ite (or .cse5 (and .cse7 .cse2) .cse4) v_~a$r_buff0_thd4~0_62 (ite (and .cse8 (not .cse4)) 0 v_~a$r_buff0_thd4~0_62)))) (= (ite .cse9 v_~a~0_87 (ite .cse10 v_~a$w_buff0~0_61 v_~a$w_buff1~0_52)) v_~__unbuffered_p3_EBX~0_12) (= (ite .cse0 v_~a$w_buff0_used~0_162 (ite .cse9 v_~a$w_buff0_used~0_162 (ite .cse10 0 v_~a$w_buff0_used~0_162))) v_~a$w_buff0_used~0_161) (= v_~a~0_87 v_~a$mem_tmp~0_22))))) InVars {~a~0=v_~a~0_87, ~a$w_buff1~0=v_~a$w_buff1~0_52, ~a$w_buff0~0=v_~a$w_buff0~0_61, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_62, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_162, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_143, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_62, P3Thread1of1ForFork1_#t~nondet3=|v_P3Thread1of1ForFork1_#t~nondet3_1|, P3Thread1of1ForFork1_#t~nondet4=|v_P3Thread1of1ForFork1_#t~nondet4_1|} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_61, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_161, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_12, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_61, ~a~0=v_~a~0_86, ~a$mem_tmp~0=v_~a$mem_tmp~0_22, ~weak$$choice0~0=v_~weak$$choice0~0_5, ~a$w_buff1~0=v_~a$w_buff1~0_51, ~a$flush_delayed~0=v_~a$flush_delayed~0_27, ~a$w_buff0~0=v_~a$w_buff0~0_60, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_142, ~weak$$choice2~0=v_~weak$$choice2~0_30} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork1_#t~nondet3, P3Thread1of1ForFork1_#t~nondet4][46], [P3Thread1of1ForFork1InUse, 131#L784true, 86#P0EXITtrue, 151#L804true, Black: 172#(= ~x~0 0), 140#L840true, Black: 177#(= ~__unbuffered_p3_EAX~0 0), Black: 178#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 175#true, 46#L882true, P0Thread1of1ForFork2InUse, P2Thread1of1ForFork3InUse, 163#true, 188#(and (not (= |ULTIMATE.start_main_~#t714~0#1.base| |ULTIMATE.start_main_~#t713~0#1.base|)) (not (= |ULTIMATE.start_main_~#t715~0#1.base| |ULTIMATE.start_main_~#t713~0#1.base|)) (not (= |ULTIMATE.start_main_~#t716~0#1.base| |ULTIMATE.start_main_~#t715~0#1.base|)) (not (= |ULTIMATE.start_main_~#t716~0#1.base| |ULTIMATE.start_main_~#t714~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t716~0#1.base| 0) |ULTIMATE.start_main_~#t714~0#1.base| 0) |ULTIMATE.start_main_~#t713~0#1.base| 0) |ULTIMATE.start_main_~#t715~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t715~0#1.base| |ULTIMATE.start_main_~#t714~0#1.base|)) (not (= |ULTIMATE.start_main_~#t716~0#1.base| |ULTIMATE.start_main_~#t713~0#1.base|))), P1Thread1of1ForFork0InUse]) [2022-12-13 21:40:19,411 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is not cut-off event [2022-12-13 21:40:19,411 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is not cut-off event [2022-12-13 21:40:19,411 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is not cut-off event [2022-12-13 21:40:19,411 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is not cut-off event [2022-12-13 21:40:19,803 INFO L130 PetriNetUnfolder]: 12771/17817 cut-off events. [2022-12-13 21:40:19,803 INFO L131 PetriNetUnfolder]: For 11245/11602 co-relation queries the response was YES. [2022-12-13 21:40:19,831 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45432 conditions, 17817 events. 12771/17817 cut-off events. For 11245/11602 co-relation queries the response was YES. Maximal size of possible extension queue 955. Compared 104621 event pairs, 3004 based on Foata normal form. 897/17733 useless extension candidates. Maximal degree in co-relation 45425. Up to 12370 conditions per place. [2022-12-13 21:40:19,912 INFO L137 encePairwiseOnDemand]: 279/285 looper letters, 44 selfloop transitions, 4 changer transitions 19/76 dead transitions. [2022-12-13 21:40:19,912 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 76 transitions, 416 flow [2022-12-13 21:40:19,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 21:40:19,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 21:40:19,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 862 transitions. [2022-12-13 21:40:19,915 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4320802005012531 [2022-12-13 21:40:19,915 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 862 transitions. [2022-12-13 21:40:19,915 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 862 transitions. [2022-12-13 21:40:19,915 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 21:40:19,915 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 862 transitions. [2022-12-13 21:40:19,916 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 123.14285714285714) internal successors, (862), 7 states have internal predecessors, (862), 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 21:40:19,918 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 285.0) internal successors, (2280), 8 states have internal predecessors, (2280), 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 21:40:19,919 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 285.0) internal successors, (2280), 8 states have internal predecessors, (2280), 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 21:40:19,919 INFO L175 Difference]: Start difference. First operand has 48 places, 40 transitions, 168 flow. Second operand 7 states and 862 transitions. [2022-12-13 21:40:19,919 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 76 transitions, 416 flow [2022-12-13 21:40:19,924 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 76 transitions, 414 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 21:40:19,924 INFO L231 Difference]: Finished difference. Result has 52 places, 37 transitions, 162 flow [2022-12-13 21:40:19,925 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=285, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=162, PETRI_PLACES=52, PETRI_TRANSITIONS=37} [2022-12-13 21:40:19,925 INFO L288 CegarLoopForPetriNet]: 53 programPoint places, -1 predicate places. [2022-12-13 21:40:19,925 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 37 transitions, 162 flow [2022-12-13 21:40:19,926 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 116.71428571428571) internal successors, (817), 7 states have internal predecessors, (817), 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 21:40:19,926 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 21:40:19,926 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:40:19,926 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 21:40:19,926 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-12-13 21:40:19,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:40:19,926 INFO L85 PathProgramCache]: Analyzing trace with hash 507014499, now seen corresponding path program 1 times [2022-12-13 21:40:19,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:40:19,926 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296085686] [2022-12-13 21:40:19,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:40:19,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:40:19,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:40:20,011 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 21:40:20,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:40:20,011 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296085686] [2022-12-13 21:40:20,012 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296085686] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:40:20,012 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:40:20,012 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 21:40:20,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917060504] [2022-12-13 21:40:20,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:40:20,012 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 21:40:20,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:40:20,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 21:40:20,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 21:40:20,018 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 285 [2022-12-13 21:40:20,019 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 37 transitions, 162 flow. Second operand has 3 states, 3 states have (on average 136.0) internal successors, (408), 3 states have internal predecessors, (408), 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 21:40:20,019 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 21:40:20,019 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 285 [2022-12-13 21:40:20,019 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 21:40:20,766 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([570] L882-->ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK: Formula: (and (= v_~main$tmp_guard1~0_20 (ite (= (ite (not (and (= v_~z~0_18 2) (= 2 v_~__unbuffered_p3_EAX~0_14) (= v_~x~0_15 2) (= v_~__unbuffered_p1_EAX~0_12 0) (= 0 v_~__unbuffered_p3_EBX~0_24))) 1 0) 0) 0 1)) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_13| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_27|) (= (mod v_~main$tmp_guard1~0_20 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_13|) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_27| 0)) InVars {~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_12, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_14, ~z~0=v_~z~0_18, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_24, ~x~0=v_~x~0_15} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_27|, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_13|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_12, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_14, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_20, ~z~0=v_~z~0_18, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_24, ~x~0=v_~x~0_15} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~main$tmp_guard1~0][50], [P3Thread1of1ForFork1InUse, 77#ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAKtrue, 107#L824true, 131#L784true, 191#true, 151#L804true, Black: 172#(= ~x~0 0), Black: 177#(= ~__unbuffered_p3_EAX~0 0), Black: 178#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 28#L764true, 175#true, P0Thread1of1ForFork2InUse, P2Thread1of1ForFork3InUse, 163#true, 188#(and (not (= |ULTIMATE.start_main_~#t714~0#1.base| |ULTIMATE.start_main_~#t713~0#1.base|)) (not (= |ULTIMATE.start_main_~#t715~0#1.base| |ULTIMATE.start_main_~#t713~0#1.base|)) (not (= |ULTIMATE.start_main_~#t716~0#1.base| |ULTIMATE.start_main_~#t715~0#1.base|)) (not (= |ULTIMATE.start_main_~#t716~0#1.base| |ULTIMATE.start_main_~#t714~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t716~0#1.base| 0) |ULTIMATE.start_main_~#t714~0#1.base| 0) |ULTIMATE.start_main_~#t713~0#1.base| 0) |ULTIMATE.start_main_~#t715~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t715~0#1.base| |ULTIMATE.start_main_~#t714~0#1.base|)) (not (= |ULTIMATE.start_main_~#t716~0#1.base| |ULTIMATE.start_main_~#t713~0#1.base|))), P1Thread1of1ForFork0InUse]) [2022-12-13 21:40:20,766 INFO L383 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2022-12-13 21:40:20,766 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2022-12-13 21:40:20,767 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2022-12-13 21:40:20,767 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2022-12-13 21:40:20,875 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([442] L824-->L840: Formula: (let ((.cse3 (= (mod v_~a$r_buff1_thd4~0_62 256) 0)) (.cse7 (= (mod v_~a$r_buff0_thd4~0_62 256) 0))) (let ((.cse8 (not .cse7)) (.cse5 (and .cse3 .cse7)) (.cse11 (= (mod v_~a$w_buff0_used~0_162 256) 0)) (.cse6 (and (= (mod v_~a$w_buff1_used~0_143 256) 0) .cse7))) (let ((.cse2 (= (mod v_~a$w_buff1_used~0_142 256) 0)) (.cse4 (= (mod v_~a$w_buff0_used~0_161 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse9 (or .cse5 .cse11 .cse6)) (.cse10 (and .cse8 (not .cse11)))) (and (= v_~a$w_buff0~0_61 v_~a$w_buff0~0_60) (= (ite .cse0 v_~a$r_buff1_thd4~0_62 (ite (let ((.cse1 (= (mod v_~a$r_buff0_thd4~0_61 256) 0))) (or (and .cse1 .cse2) (and .cse3 .cse1) .cse4)) v_~a$r_buff1_thd4~0_62 0)) v_~a$r_buff1_thd4~0_61) (= v_~a$flush_delayed~0_27 0) (= v_~weak$$choice0~0_5 |v_P3Thread1of1ForFork1_#t~nondet3_1|) (= (ite .cse0 v_~a$w_buff1_used~0_143 (ite (or .cse5 .cse6 .cse4) v_~a$w_buff1_used~0_143 0)) v_~a$w_buff1_used~0_142) (= v_~a~0_86 (ite .cse0 v_~a$mem_tmp~0_22 v_~__unbuffered_p3_EBX~0_12)) (= v_~weak$$choice2~0_30 |v_P3Thread1of1ForFork1_#t~nondet4_1|) (= v_~a$w_buff1~0_52 v_~a$w_buff1~0_51) (= v_~a$r_buff0_thd4~0_61 (ite .cse0 v_~a$r_buff0_thd4~0_62 (ite (or .cse5 (and .cse7 .cse2) .cse4) v_~a$r_buff0_thd4~0_62 (ite (and .cse8 (not .cse4)) 0 v_~a$r_buff0_thd4~0_62)))) (= (ite .cse9 v_~a~0_87 (ite .cse10 v_~a$w_buff0~0_61 v_~a$w_buff1~0_52)) v_~__unbuffered_p3_EBX~0_12) (= (ite .cse0 v_~a$w_buff0_used~0_162 (ite .cse9 v_~a$w_buff0_used~0_162 (ite .cse10 0 v_~a$w_buff0_used~0_162))) v_~a$w_buff0_used~0_161) (= v_~a~0_87 v_~a$mem_tmp~0_22))))) InVars {~a~0=v_~a~0_87, ~a$w_buff1~0=v_~a$w_buff1~0_52, ~a$w_buff0~0=v_~a$w_buff0~0_61, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_62, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_162, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_143, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_62, P3Thread1of1ForFork1_#t~nondet3=|v_P3Thread1of1ForFork1_#t~nondet3_1|, P3Thread1of1ForFork1_#t~nondet4=|v_P3Thread1of1ForFork1_#t~nondet4_1|} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_61, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_161, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_12, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_61, ~a~0=v_~a~0_86, ~a$mem_tmp~0=v_~a$mem_tmp~0_22, ~weak$$choice0~0=v_~weak$$choice0~0_5, ~a$w_buff1~0=v_~a$w_buff1~0_51, ~a$flush_delayed~0=v_~a$flush_delayed~0_27, ~a$w_buff0~0=v_~a$w_buff0~0_60, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_142, ~weak$$choice2~0=v_~weak$$choice2~0_30} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork1_#t~nondet3, P3Thread1of1ForFork1_#t~nondet4][40], [P3Thread1of1ForFork1InUse, 131#L784true, 191#true, 151#L804true, Black: 172#(= ~x~0 0), 140#L840true, Black: 177#(= ~__unbuffered_p3_EAX~0 0), Black: 178#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 28#L764true, 175#true, 46#L882true, P0Thread1of1ForFork2InUse, P2Thread1of1ForFork3InUse, 163#true, 188#(and (not (= |ULTIMATE.start_main_~#t714~0#1.base| |ULTIMATE.start_main_~#t713~0#1.base|)) (not (= |ULTIMATE.start_main_~#t715~0#1.base| |ULTIMATE.start_main_~#t713~0#1.base|)) (not (= |ULTIMATE.start_main_~#t716~0#1.base| |ULTIMATE.start_main_~#t715~0#1.base|)) (not (= |ULTIMATE.start_main_~#t716~0#1.base| |ULTIMATE.start_main_~#t714~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t716~0#1.base| 0) |ULTIMATE.start_main_~#t714~0#1.base| 0) |ULTIMATE.start_main_~#t713~0#1.base| 0) |ULTIMATE.start_main_~#t715~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t715~0#1.base| |ULTIMATE.start_main_~#t714~0#1.base|)) (not (= |ULTIMATE.start_main_~#t716~0#1.base| |ULTIMATE.start_main_~#t713~0#1.base|))), P1Thread1of1ForFork0InUse]) [2022-12-13 21:40:20,875 INFO L383 tUnfolder$Statistics]: this new event has 19 ancestors and is not cut-off event [2022-12-13 21:40:20,875 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is not cut-off event [2022-12-13 21:40:20,876 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is not cut-off event [2022-12-13 21:40:20,876 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is not cut-off event [2022-12-13 21:40:21,056 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([570] L882-->ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK: Formula: (and (= v_~main$tmp_guard1~0_20 (ite (= (ite (not (and (= v_~z~0_18 2) (= 2 v_~__unbuffered_p3_EAX~0_14) (= v_~x~0_15 2) (= v_~__unbuffered_p1_EAX~0_12 0) (= 0 v_~__unbuffered_p3_EBX~0_24))) 1 0) 0) 0 1)) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_13| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_27|) (= (mod v_~main$tmp_guard1~0_20 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_13|) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_27| 0)) InVars {~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_12, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_14, ~z~0=v_~z~0_18, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_24, ~x~0=v_~x~0_15} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_27|, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_13|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_12, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_14, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_20, ~z~0=v_~z~0_18, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_24, ~x~0=v_~x~0_15} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~main$tmp_guard1~0][50], [P3Thread1of1ForFork1InUse, 77#ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAKtrue, 107#L824true, 131#L784true, 191#true, 151#L804true, Black: 172#(= ~x~0 0), Black: 177#(= ~__unbuffered_p3_EAX~0 0), Black: 178#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 49#L771true, 175#true, P0Thread1of1ForFork2InUse, P2Thread1of1ForFork3InUse, 163#true, 188#(and (not (= |ULTIMATE.start_main_~#t714~0#1.base| |ULTIMATE.start_main_~#t713~0#1.base|)) (not (= |ULTIMATE.start_main_~#t715~0#1.base| |ULTIMATE.start_main_~#t713~0#1.base|)) (not (= |ULTIMATE.start_main_~#t716~0#1.base| |ULTIMATE.start_main_~#t715~0#1.base|)) (not (= |ULTIMATE.start_main_~#t716~0#1.base| |ULTIMATE.start_main_~#t714~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t716~0#1.base| 0) |ULTIMATE.start_main_~#t714~0#1.base| 0) |ULTIMATE.start_main_~#t713~0#1.base| 0) |ULTIMATE.start_main_~#t715~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t715~0#1.base| |ULTIMATE.start_main_~#t714~0#1.base|)) (not (= |ULTIMATE.start_main_~#t716~0#1.base| |ULTIMATE.start_main_~#t713~0#1.base|))), P1Thread1of1ForFork0InUse]) [2022-12-13 21:40:21,056 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2022-12-13 21:40:21,057 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-12-13 21:40:21,057 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-12-13 21:40:21,057 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-12-13 21:40:21,121 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([442] L824-->L840: Formula: (let ((.cse3 (= (mod v_~a$r_buff1_thd4~0_62 256) 0)) (.cse7 (= (mod v_~a$r_buff0_thd4~0_62 256) 0))) (let ((.cse8 (not .cse7)) (.cse5 (and .cse3 .cse7)) (.cse11 (= (mod v_~a$w_buff0_used~0_162 256) 0)) (.cse6 (and (= (mod v_~a$w_buff1_used~0_143 256) 0) .cse7))) (let ((.cse2 (= (mod v_~a$w_buff1_used~0_142 256) 0)) (.cse4 (= (mod v_~a$w_buff0_used~0_161 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse9 (or .cse5 .cse11 .cse6)) (.cse10 (and .cse8 (not .cse11)))) (and (= v_~a$w_buff0~0_61 v_~a$w_buff0~0_60) (= (ite .cse0 v_~a$r_buff1_thd4~0_62 (ite (let ((.cse1 (= (mod v_~a$r_buff0_thd4~0_61 256) 0))) (or (and .cse1 .cse2) (and .cse3 .cse1) .cse4)) v_~a$r_buff1_thd4~0_62 0)) v_~a$r_buff1_thd4~0_61) (= v_~a$flush_delayed~0_27 0) (= v_~weak$$choice0~0_5 |v_P3Thread1of1ForFork1_#t~nondet3_1|) (= (ite .cse0 v_~a$w_buff1_used~0_143 (ite (or .cse5 .cse6 .cse4) v_~a$w_buff1_used~0_143 0)) v_~a$w_buff1_used~0_142) (= v_~a~0_86 (ite .cse0 v_~a$mem_tmp~0_22 v_~__unbuffered_p3_EBX~0_12)) (= v_~weak$$choice2~0_30 |v_P3Thread1of1ForFork1_#t~nondet4_1|) (= v_~a$w_buff1~0_52 v_~a$w_buff1~0_51) (= v_~a$r_buff0_thd4~0_61 (ite .cse0 v_~a$r_buff0_thd4~0_62 (ite (or .cse5 (and .cse7 .cse2) .cse4) v_~a$r_buff0_thd4~0_62 (ite (and .cse8 (not .cse4)) 0 v_~a$r_buff0_thd4~0_62)))) (= (ite .cse9 v_~a~0_87 (ite .cse10 v_~a$w_buff0~0_61 v_~a$w_buff1~0_52)) v_~__unbuffered_p3_EBX~0_12) (= (ite .cse0 v_~a$w_buff0_used~0_162 (ite .cse9 v_~a$w_buff0_used~0_162 (ite .cse10 0 v_~a$w_buff0_used~0_162))) v_~a$w_buff0_used~0_161) (= v_~a~0_87 v_~a$mem_tmp~0_22))))) InVars {~a~0=v_~a~0_87, ~a$w_buff1~0=v_~a$w_buff1~0_52, ~a$w_buff0~0=v_~a$w_buff0~0_61, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_62, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_162, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_143, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_62, P3Thread1of1ForFork1_#t~nondet3=|v_P3Thread1of1ForFork1_#t~nondet3_1|, P3Thread1of1ForFork1_#t~nondet4=|v_P3Thread1of1ForFork1_#t~nondet4_1|} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_61, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_161, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_12, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_61, ~a~0=v_~a~0_86, ~a$mem_tmp~0=v_~a$mem_tmp~0_22, ~weak$$choice0~0=v_~weak$$choice0~0_5, ~a$w_buff1~0=v_~a$w_buff1~0_51, ~a$flush_delayed~0=v_~a$flush_delayed~0_27, ~a$w_buff0~0=v_~a$w_buff0~0_60, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_142, ~weak$$choice2~0=v_~weak$$choice2~0_30} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork1_#t~nondet3, P3Thread1of1ForFork1_#t~nondet4][40], [P3Thread1of1ForFork1InUse, 131#L784true, 191#true, 151#L804true, Black: 172#(= ~x~0 0), 140#L840true, Black: 177#(= ~__unbuffered_p3_EAX~0 0), Black: 178#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 49#L771true, 175#true, 46#L882true, P0Thread1of1ForFork2InUse, P2Thread1of1ForFork3InUse, 163#true, 188#(and (not (= |ULTIMATE.start_main_~#t714~0#1.base| |ULTIMATE.start_main_~#t713~0#1.base|)) (not (= |ULTIMATE.start_main_~#t715~0#1.base| |ULTIMATE.start_main_~#t713~0#1.base|)) (not (= |ULTIMATE.start_main_~#t716~0#1.base| |ULTIMATE.start_main_~#t715~0#1.base|)) (not (= |ULTIMATE.start_main_~#t716~0#1.base| |ULTIMATE.start_main_~#t714~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t716~0#1.base| 0) |ULTIMATE.start_main_~#t714~0#1.base| 0) |ULTIMATE.start_main_~#t713~0#1.base| 0) |ULTIMATE.start_main_~#t715~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t715~0#1.base| |ULTIMATE.start_main_~#t714~0#1.base|)) (not (= |ULTIMATE.start_main_~#t716~0#1.base| |ULTIMATE.start_main_~#t713~0#1.base|))), P1Thread1of1ForFork0InUse]) [2022-12-13 21:40:21,122 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is not cut-off event [2022-12-13 21:40:21,122 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is not cut-off event [2022-12-13 21:40:21,122 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is not cut-off event [2022-12-13 21:40:21,122 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is not cut-off event [2022-12-13 21:40:21,354 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([570] L882-->ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK: Formula: (and (= v_~main$tmp_guard1~0_20 (ite (= (ite (not (and (= v_~z~0_18 2) (= 2 v_~__unbuffered_p3_EAX~0_14) (= v_~x~0_15 2) (= v_~__unbuffered_p1_EAX~0_12 0) (= 0 v_~__unbuffered_p3_EBX~0_24))) 1 0) 0) 0 1)) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_13| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_27|) (= (mod v_~main$tmp_guard1~0_20 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_13|) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_27| 0)) InVars {~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_12, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_14, ~z~0=v_~z~0_18, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_24, ~x~0=v_~x~0_15} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_27|, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_13|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_12, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_14, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_20, ~z~0=v_~z~0_18, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_24, ~x~0=v_~x~0_15} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~main$tmp_guard1~0][50], [P3Thread1of1ForFork1InUse, 77#ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAKtrue, 107#L824true, 131#L784true, 86#P0EXITtrue, 191#true, 151#L804true, Black: 172#(= ~x~0 0), Black: 177#(= ~__unbuffered_p3_EAX~0 0), Black: 178#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 175#true, P0Thread1of1ForFork2InUse, P2Thread1of1ForFork3InUse, 163#true, 188#(and (not (= |ULTIMATE.start_main_~#t714~0#1.base| |ULTIMATE.start_main_~#t713~0#1.base|)) (not (= |ULTIMATE.start_main_~#t715~0#1.base| |ULTIMATE.start_main_~#t713~0#1.base|)) (not (= |ULTIMATE.start_main_~#t716~0#1.base| |ULTIMATE.start_main_~#t715~0#1.base|)) (not (= |ULTIMATE.start_main_~#t716~0#1.base| |ULTIMATE.start_main_~#t714~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t716~0#1.base| 0) |ULTIMATE.start_main_~#t714~0#1.base| 0) |ULTIMATE.start_main_~#t713~0#1.base| 0) |ULTIMATE.start_main_~#t715~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t715~0#1.base| |ULTIMATE.start_main_~#t714~0#1.base|)) (not (= |ULTIMATE.start_main_~#t716~0#1.base| |ULTIMATE.start_main_~#t713~0#1.base|))), P1Thread1of1ForFork0InUse]) [2022-12-13 21:40:21,355 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2022-12-13 21:40:21,355 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-13 21:40:21,355 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-13 21:40:21,355 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-13 21:40:21,391 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([442] L824-->L840: Formula: (let ((.cse3 (= (mod v_~a$r_buff1_thd4~0_62 256) 0)) (.cse7 (= (mod v_~a$r_buff0_thd4~0_62 256) 0))) (let ((.cse8 (not .cse7)) (.cse5 (and .cse3 .cse7)) (.cse11 (= (mod v_~a$w_buff0_used~0_162 256) 0)) (.cse6 (and (= (mod v_~a$w_buff1_used~0_143 256) 0) .cse7))) (let ((.cse2 (= (mod v_~a$w_buff1_used~0_142 256) 0)) (.cse4 (= (mod v_~a$w_buff0_used~0_161 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse9 (or .cse5 .cse11 .cse6)) (.cse10 (and .cse8 (not .cse11)))) (and (= v_~a$w_buff0~0_61 v_~a$w_buff0~0_60) (= (ite .cse0 v_~a$r_buff1_thd4~0_62 (ite (let ((.cse1 (= (mod v_~a$r_buff0_thd4~0_61 256) 0))) (or (and .cse1 .cse2) (and .cse3 .cse1) .cse4)) v_~a$r_buff1_thd4~0_62 0)) v_~a$r_buff1_thd4~0_61) (= v_~a$flush_delayed~0_27 0) (= v_~weak$$choice0~0_5 |v_P3Thread1of1ForFork1_#t~nondet3_1|) (= (ite .cse0 v_~a$w_buff1_used~0_143 (ite (or .cse5 .cse6 .cse4) v_~a$w_buff1_used~0_143 0)) v_~a$w_buff1_used~0_142) (= v_~a~0_86 (ite .cse0 v_~a$mem_tmp~0_22 v_~__unbuffered_p3_EBX~0_12)) (= v_~weak$$choice2~0_30 |v_P3Thread1of1ForFork1_#t~nondet4_1|) (= v_~a$w_buff1~0_52 v_~a$w_buff1~0_51) (= v_~a$r_buff0_thd4~0_61 (ite .cse0 v_~a$r_buff0_thd4~0_62 (ite (or .cse5 (and .cse7 .cse2) .cse4) v_~a$r_buff0_thd4~0_62 (ite (and .cse8 (not .cse4)) 0 v_~a$r_buff0_thd4~0_62)))) (= (ite .cse9 v_~a~0_87 (ite .cse10 v_~a$w_buff0~0_61 v_~a$w_buff1~0_52)) v_~__unbuffered_p3_EBX~0_12) (= (ite .cse0 v_~a$w_buff0_used~0_162 (ite .cse9 v_~a$w_buff0_used~0_162 (ite .cse10 0 v_~a$w_buff0_used~0_162))) v_~a$w_buff0_used~0_161) (= v_~a~0_87 v_~a$mem_tmp~0_22))))) InVars {~a~0=v_~a~0_87, ~a$w_buff1~0=v_~a$w_buff1~0_52, ~a$w_buff0~0=v_~a$w_buff0~0_61, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_62, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_162, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_143, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_62, P3Thread1of1ForFork1_#t~nondet3=|v_P3Thread1of1ForFork1_#t~nondet3_1|, P3Thread1of1ForFork1_#t~nondet4=|v_P3Thread1of1ForFork1_#t~nondet4_1|} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_61, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_161, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_12, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_61, ~a~0=v_~a~0_86, ~a$mem_tmp~0=v_~a$mem_tmp~0_22, ~weak$$choice0~0=v_~weak$$choice0~0_5, ~a$w_buff1~0=v_~a$w_buff1~0_51, ~a$flush_delayed~0=v_~a$flush_delayed~0_27, ~a$w_buff0~0=v_~a$w_buff0~0_60, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_142, ~weak$$choice2~0=v_~weak$$choice2~0_30} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork1_#t~nondet3, P3Thread1of1ForFork1_#t~nondet4][40], [P3Thread1of1ForFork1InUse, 86#P0EXITtrue, 131#L784true, 191#true, 151#L804true, Black: 172#(= ~x~0 0), 140#L840true, Black: 177#(= ~__unbuffered_p3_EAX~0 0), Black: 178#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 175#true, 46#L882true, P0Thread1of1ForFork2InUse, P2Thread1of1ForFork3InUse, 163#true, 188#(and (not (= |ULTIMATE.start_main_~#t714~0#1.base| |ULTIMATE.start_main_~#t713~0#1.base|)) (not (= |ULTIMATE.start_main_~#t715~0#1.base| |ULTIMATE.start_main_~#t713~0#1.base|)) (not (= |ULTIMATE.start_main_~#t716~0#1.base| |ULTIMATE.start_main_~#t715~0#1.base|)) (not (= |ULTIMATE.start_main_~#t716~0#1.base| |ULTIMATE.start_main_~#t714~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t716~0#1.base| 0) |ULTIMATE.start_main_~#t714~0#1.base| 0) |ULTIMATE.start_main_~#t713~0#1.base| 0) |ULTIMATE.start_main_~#t715~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t715~0#1.base| |ULTIMATE.start_main_~#t714~0#1.base|)) (not (= |ULTIMATE.start_main_~#t716~0#1.base| |ULTIMATE.start_main_~#t713~0#1.base|))), P1Thread1of1ForFork0InUse]) [2022-12-13 21:40:21,391 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is not cut-off event [2022-12-13 21:40:21,391 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is not cut-off event [2022-12-13 21:40:21,391 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is not cut-off event [2022-12-13 21:40:21,391 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is not cut-off event [2022-12-13 21:40:22,069 INFO L130 PetriNetUnfolder]: 13805/19384 cut-off events. [2022-12-13 21:40:22,069 INFO L131 PetriNetUnfolder]: For 12859/12874 co-relation queries the response was YES. [2022-12-13 21:40:22,105 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47266 conditions, 19384 events. 13805/19384 cut-off events. For 12859/12874 co-relation queries the response was YES. Maximal size of possible extension queue 965. Compared 117316 event pairs, 6150 based on Foata normal form. 300/18672 useless extension candidates. Maximal degree in co-relation 47258. Up to 10169 conditions per place. [2022-12-13 21:40:22,149 INFO L137 encePairwiseOnDemand]: 282/285 looper letters, 46 selfloop transitions, 6 changer transitions 0/57 dead transitions. [2022-12-13 21:40:22,149 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 57 transitions, 324 flow [2022-12-13 21:40:22,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 21:40:22,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 21:40:22,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 439 transitions. [2022-12-13 21:40:22,151 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5134502923976608 [2022-12-13 21:40:22,151 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 439 transitions. [2022-12-13 21:40:22,151 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 439 transitions. [2022-12-13 21:40:22,151 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 21:40:22,151 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 439 transitions. [2022-12-13 21:40:22,153 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 146.33333333333334) internal successors, (439), 3 states have internal predecessors, (439), 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 21:40:22,154 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 285.0) internal successors, (1140), 4 states have internal predecessors, (1140), 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 21:40:22,154 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 285.0) internal successors, (1140), 4 states have internal predecessors, (1140), 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 21:40:22,154 INFO L175 Difference]: Start difference. First operand has 52 places, 37 transitions, 162 flow. Second operand 3 states and 439 transitions. [2022-12-13 21:40:22,155 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 57 transitions, 324 flow [2022-12-13 21:40:22,157 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 57 transitions, 312 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-13 21:40:22,158 INFO L231 Difference]: Finished difference. Result has 49 places, 37 transitions, 175 flow [2022-12-13 21:40:22,158 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=285, PETRI_DIFFERENCE_MINUEND_FLOW=155, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=175, PETRI_PLACES=49, PETRI_TRANSITIONS=37} [2022-12-13 21:40:22,159 INFO L288 CegarLoopForPetriNet]: 53 programPoint places, -4 predicate places. [2022-12-13 21:40:22,159 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 37 transitions, 175 flow [2022-12-13 21:40:22,159 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 136.0) internal successors, (408), 3 states have internal predecessors, (408), 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 21:40:22,159 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 21:40:22,159 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:40:22,160 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 21:40:22,160 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-12-13 21:40:22,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:40:22,160 INFO L85 PathProgramCache]: Analyzing trace with hash -2091976593, now seen corresponding path program 1 times [2022-12-13 21:40:22,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:40:22,160 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803267744] [2022-12-13 21:40:22,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:40:22,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:40:22,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:40:22,330 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 21:40:22,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:40:22,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803267744] [2022-12-13 21:40:22,330 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803267744] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:40:22,330 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:40:22,330 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 21:40:22,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622752051] [2022-12-13 21:40:22,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:40:22,331 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 21:40:22,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:40:22,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 21:40:22,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 21:40:22,349 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 285 [2022-12-13 21:40:22,350 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 37 transitions, 175 flow. Second operand has 4 states, 4 states have (on average 125.25) internal successors, (501), 4 states have internal predecessors, (501), 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 21:40:22,350 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 21:40:22,350 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 285 [2022-12-13 21:40:22,351 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 21:40:24,940 INFO L130 PetriNetUnfolder]: 23338/32155 cut-off events. [2022-12-13 21:40:24,940 INFO L131 PetriNetUnfolder]: For 27070/27070 co-relation queries the response was YES. [2022-12-13 21:40:24,984 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82463 conditions, 32155 events. 23338/32155 cut-off events. For 27070/27070 co-relation queries the response was YES. Maximal size of possible extension queue 1048. Compared 185962 event pairs, 1709 based on Foata normal form. 240/32395 useless extension candidates. Maximal degree in co-relation 82454. Up to 16520 conditions per place. [2022-12-13 21:40:25,029 INFO L137 encePairwiseOnDemand]: 275/285 looper letters, 76 selfloop transitions, 27 changer transitions 3/106 dead transitions. [2022-12-13 21:40:25,029 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 106 transitions, 681 flow [2022-12-13 21:40:25,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 21:40:25,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 21:40:25,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 692 transitions. [2022-12-13 21:40:25,032 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4856140350877193 [2022-12-13 21:40:25,032 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 692 transitions. [2022-12-13 21:40:25,032 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 692 transitions. [2022-12-13 21:40:25,032 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 21:40:25,032 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 692 transitions. [2022-12-13 21:40:25,033 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 138.4) internal successors, (692), 5 states have internal predecessors, (692), 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 21:40:25,035 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 285.0) internal successors, (1710), 6 states have internal predecessors, (1710), 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 21:40:25,035 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 285.0) internal successors, (1710), 6 states have internal predecessors, (1710), 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 21:40:25,035 INFO L175 Difference]: Start difference. First operand has 49 places, 37 transitions, 175 flow. Second operand 5 states and 692 transitions. [2022-12-13 21:40:25,035 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 106 transitions, 681 flow [2022-12-13 21:40:25,061 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 106 transitions, 651 flow, removed 6 selfloop flow, removed 1 redundant places. [2022-12-13 21:40:25,062 INFO L231 Difference]: Finished difference. Result has 56 places, 58 transitions, 437 flow [2022-12-13 21:40:25,062 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=285, PETRI_DIFFERENCE_MINUEND_FLOW=165, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=437, PETRI_PLACES=56, PETRI_TRANSITIONS=58} [2022-12-13 21:40:25,062 INFO L288 CegarLoopForPetriNet]: 53 programPoint places, 3 predicate places. [2022-12-13 21:40:25,062 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 58 transitions, 437 flow [2022-12-13 21:40:25,063 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 125.25) internal successors, (501), 4 states have internal predecessors, (501), 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 21:40:25,063 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 21:40:25,063 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:40:25,063 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 21:40:25,063 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-12-13 21:40:25,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:40:25,064 INFO L85 PathProgramCache]: Analyzing trace with hash 450374428, now seen corresponding path program 1 times [2022-12-13 21:40:25,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:40:25,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195079501] [2022-12-13 21:40:25,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:40:25,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:40:25,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:40:25,176 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 21:40:25,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:40:25,176 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195079501] [2022-12-13 21:40:25,176 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [195079501] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:40:25,176 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:40:25,176 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 21:40:25,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157414063] [2022-12-13 21:40:25,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:40:25,177 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 21:40:25,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:40:25,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 21:40:25,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 21:40:25,188 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 285 [2022-12-13 21:40:25,189 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 58 transitions, 437 flow. Second operand has 4 states, 4 states have (on average 131.25) internal successors, (525), 4 states have internal predecessors, (525), 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 21:40:25,189 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 21:40:25,189 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 285 [2022-12-13 21:40:25,189 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 21:40:27,219 INFO L130 PetriNetUnfolder]: 14593/21557 cut-off events. [2022-12-13 21:40:27,219 INFO L131 PetriNetUnfolder]: For 29415/31811 co-relation queries the response was YES. [2022-12-13 21:40:27,264 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59302 conditions, 21557 events. 14593/21557 cut-off events. For 29415/31811 co-relation queries the response was YES. Maximal size of possible extension queue 1137. Compared 144707 event pairs, 2389 based on Foata normal form. 2065/23055 useless extension candidates. Maximal degree in co-relation 59290. Up to 13642 conditions per place. [2022-12-13 21:40:27,299 INFO L137 encePairwiseOnDemand]: 278/285 looper letters, 110 selfloop transitions, 10 changer transitions 4/144 dead transitions. [2022-12-13 21:40:27,299 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 144 transitions, 1220 flow [2022-12-13 21:40:27,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 21:40:27,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 21:40:27,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 712 transitions. [2022-12-13 21:40:27,301 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.49964912280701756 [2022-12-13 21:40:27,301 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 712 transitions. [2022-12-13 21:40:27,301 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 712 transitions. [2022-12-13 21:40:27,302 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 21:40:27,302 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 712 transitions. [2022-12-13 21:40:27,303 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 142.4) internal successors, (712), 5 states have internal predecessors, (712), 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 21:40:27,304 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 285.0) internal successors, (1710), 6 states have internal predecessors, (1710), 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 21:40:27,305 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 285.0) internal successors, (1710), 6 states have internal predecessors, (1710), 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 21:40:27,305 INFO L175 Difference]: Start difference. First operand has 56 places, 58 transitions, 437 flow. Second operand 5 states and 712 transitions. [2022-12-13 21:40:27,305 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 144 transitions, 1220 flow [2022-12-13 21:40:27,312 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 144 transitions, 1220 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-13 21:40:27,314 INFO L231 Difference]: Finished difference. Result has 63 places, 67 transitions, 512 flow [2022-12-13 21:40:27,314 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=285, PETRI_DIFFERENCE_MINUEND_FLOW=437, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=512, PETRI_PLACES=63, PETRI_TRANSITIONS=67} [2022-12-13 21:40:27,315 INFO L288 CegarLoopForPetriNet]: 53 programPoint places, 10 predicate places. [2022-12-13 21:40:27,315 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 67 transitions, 512 flow [2022-12-13 21:40:27,315 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 131.25) internal successors, (525), 4 states have internal predecessors, (525), 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 21:40:27,315 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 21:40:27,316 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:40:27,316 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 21:40:27,316 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-12-13 21:40:27,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:40:27,316 INFO L85 PathProgramCache]: Analyzing trace with hash 1525487354, now seen corresponding path program 1 times [2022-12-13 21:40:27,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:40:27,316 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052226794] [2022-12-13 21:40:27,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:40:27,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:40:27,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:40:27,425 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 21:40:27,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:40:27,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052226794] [2022-12-13 21:40:27,426 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052226794] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:40:27,426 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:40:27,426 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 21:40:27,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133873935] [2022-12-13 21:40:27,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:40:27,426 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 21:40:27,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:40:27,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 21:40:27,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 21:40:27,433 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 285 [2022-12-13 21:40:27,433 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 67 transitions, 512 flow. Second operand has 4 states, 4 states have (on average 134.25) internal successors, (537), 4 states have internal predecessors, (537), 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 21:40:27,433 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 21:40:27,433 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 285 [2022-12-13 21:40:27,434 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 21:40:30,864 INFO L130 PetriNetUnfolder]: 22516/33680 cut-off events. [2022-12-13 21:40:30,864 INFO L131 PetriNetUnfolder]: For 63121/65087 co-relation queries the response was YES. [2022-12-13 21:40:30,950 INFO L83 FinitePrefix]: Finished finitePrefix Result has 119226 conditions, 33680 events. 22516/33680 cut-off events. For 63121/65087 co-relation queries the response was YES. Maximal size of possible extension queue 1677. Compared 241598 event pairs, 5126 based on Foata normal form. 756/33691 useless extension candidates. Maximal degree in co-relation 119210. Up to 14972 conditions per place. [2022-12-13 21:40:30,992 INFO L137 encePairwiseOnDemand]: 282/285 looper letters, 74 selfloop transitions, 4 changer transitions 22/116 dead transitions. [2022-12-13 21:40:30,993 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 116 transitions, 969 flow [2022-12-13 21:40:30,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 21:40:30,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 21:40:30,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 577 transitions. [2022-12-13 21:40:30,995 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.506140350877193 [2022-12-13 21:40:30,995 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 577 transitions. [2022-12-13 21:40:30,995 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 577 transitions. [2022-12-13 21:40:30,995 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 21:40:30,995 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 577 transitions. [2022-12-13 21:40:30,996 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 144.25) internal successors, (577), 4 states have internal predecessors, (577), 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 21:40:30,997 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 285.0) internal successors, (1425), 5 states have internal predecessors, (1425), 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 21:40:30,998 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 285.0) internal successors, (1425), 5 states have internal predecessors, (1425), 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 21:40:30,998 INFO L175 Difference]: Start difference. First operand has 63 places, 67 transitions, 512 flow. Second operand 4 states and 577 transitions. [2022-12-13 21:40:30,998 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 116 transitions, 969 flow [2022-12-13 21:40:31,072 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 116 transitions, 957 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 21:40:31,073 INFO L231 Difference]: Finished difference. Result has 67 places, 64 transitions, 507 flow [2022-12-13 21:40:31,073 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=285, PETRI_DIFFERENCE_MINUEND_FLOW=507, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=507, PETRI_PLACES=67, PETRI_TRANSITIONS=64} [2022-12-13 21:40:31,074 INFO L288 CegarLoopForPetriNet]: 53 programPoint places, 14 predicate places. [2022-12-13 21:40:31,074 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 64 transitions, 507 flow [2022-12-13 21:40:31,074 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 134.25) internal successors, (537), 4 states have internal predecessors, (537), 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 21:40:31,074 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 21:40:31,074 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:40:31,074 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 21:40:31,074 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-12-13 21:40:31,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:40:31,075 INFO L85 PathProgramCache]: Analyzing trace with hash -1239516477, now seen corresponding path program 1 times [2022-12-13 21:40:31,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:40:31,075 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194687603] [2022-12-13 21:40:31,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:40:31,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:40:31,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:40:31,182 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 21:40:31,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:40:31,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194687603] [2022-12-13 21:40:31,183 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194687603] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:40:31,183 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:40:31,183 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 21:40:31,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064842437] [2022-12-13 21:40:31,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:40:31,184 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 21:40:31,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:40:31,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 21:40:31,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 21:40:31,201 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 285 [2022-12-13 21:40:31,201 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 64 transitions, 507 flow. Second operand has 5 states, 5 states have (on average 131.2) internal successors, (656), 5 states have internal predecessors, (656), 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 21:40:31,202 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 21:40:31,202 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 285 [2022-12-13 21:40:31,202 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 21:40:33,814 INFO L130 PetriNetUnfolder]: 14447/22109 cut-off events. [2022-12-13 21:40:33,815 INFO L131 PetriNetUnfolder]: For 38916/40745 co-relation queries the response was YES. [2022-12-13 21:40:33,888 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74840 conditions, 22109 events. 14447/22109 cut-off events. For 38916/40745 co-relation queries the response was YES. Maximal size of possible extension queue 1198. Compared 159712 event pairs, 1434 based on Foata normal form. 2093/23681 useless extension candidates. Maximal degree in co-relation 74822. Up to 7959 conditions per place. [2022-12-13 21:40:33,927 INFO L137 encePairwiseOnDemand]: 278/285 looper letters, 144 selfloop transitions, 16 changer transitions 12/192 dead transitions. [2022-12-13 21:40:33,927 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 192 transitions, 1747 flow [2022-12-13 21:40:33,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 21:40:33,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 21:40:33,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 996 transitions. [2022-12-13 21:40:33,930 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4992481203007519 [2022-12-13 21:40:33,930 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 996 transitions. [2022-12-13 21:40:33,930 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 996 transitions. [2022-12-13 21:40:33,931 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 21:40:33,931 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 996 transitions. [2022-12-13 21:40:33,933 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 142.28571428571428) internal successors, (996), 7 states have internal predecessors, (996), 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 21:40:33,935 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 285.0) internal successors, (2280), 8 states have internal predecessors, (2280), 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 21:40:33,935 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 285.0) internal successors, (2280), 8 states have internal predecessors, (2280), 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 21:40:33,935 INFO L175 Difference]: Start difference. First operand has 67 places, 64 transitions, 507 flow. Second operand 7 states and 996 transitions. [2022-12-13 21:40:33,935 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 192 transitions, 1747 flow [2022-12-13 21:40:34,072 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 192 transitions, 1735 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 21:40:34,073 INFO L231 Difference]: Finished difference. Result has 75 places, 73 transitions, 628 flow [2022-12-13 21:40:34,074 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=285, PETRI_DIFFERENCE_MINUEND_FLOW=505, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=628, PETRI_PLACES=75, PETRI_TRANSITIONS=73} [2022-12-13 21:40:34,074 INFO L288 CegarLoopForPetriNet]: 53 programPoint places, 22 predicate places. [2022-12-13 21:40:34,074 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 73 transitions, 628 flow [2022-12-13 21:40:34,074 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 131.2) internal successors, (656), 5 states have internal predecessors, (656), 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 21:40:34,075 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 21:40:34,075 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:40:34,075 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 21:40:34,075 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-12-13 21:40:34,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:40:34,075 INFO L85 PathProgramCache]: Analyzing trace with hash -2039123757, now seen corresponding path program 1 times [2022-12-13 21:40:34,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:40:34,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072400839] [2022-12-13 21:40:34,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:40:34,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:40:34,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:40:34,242 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 21:40:34,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:40:34,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072400839] [2022-12-13 21:40:34,243 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072400839] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:40:34,243 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:40:34,243 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 21:40:34,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123240186] [2022-12-13 21:40:34,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:40:34,244 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 21:40:34,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:40:34,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 21:40:34,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-13 21:40:34,261 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 285 [2022-12-13 21:40:34,263 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 73 transitions, 628 flow. Second operand has 6 states, 6 states have (on average 131.0) internal successors, (786), 6 states have internal predecessors, (786), 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 21:40:34,263 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 21:40:34,263 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 285 [2022-12-13 21:40:34,263 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 21:40:36,763 INFO L130 PetriNetUnfolder]: 13091/20202 cut-off events. [2022-12-13 21:40:36,763 INFO L131 PetriNetUnfolder]: For 48323/49987 co-relation queries the response was YES. [2022-12-13 21:40:36,816 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80255 conditions, 20202 events. 13091/20202 cut-off events. For 48323/49987 co-relation queries the response was YES. Maximal size of possible extension queue 1169. Compared 146601 event pairs, 1103 based on Foata normal form. 1060/20753 useless extension candidates. Maximal degree in co-relation 80234. Up to 7345 conditions per place. [2022-12-13 21:40:36,838 INFO L137 encePairwiseOnDemand]: 278/285 looper letters, 143 selfloop transitions, 24 changer transitions 43/229 dead transitions. [2022-12-13 21:40:36,838 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 229 transitions, 2139 flow [2022-12-13 21:40:36,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 21:40:36,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 21:40:36,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1281 transitions. [2022-12-13 21:40:36,841 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4994152046783626 [2022-12-13 21:40:36,841 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1281 transitions. [2022-12-13 21:40:36,841 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1281 transitions. [2022-12-13 21:40:36,841 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 21:40:36,842 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1281 transitions. [2022-12-13 21:40:36,843 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 142.33333333333334) internal successors, (1281), 9 states have internal predecessors, (1281), 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 21:40:36,845 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 285.0) internal successors, (2850), 10 states have internal predecessors, (2850), 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 21:40:36,846 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 285.0) internal successors, (2850), 10 states have internal predecessors, (2850), 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 21:40:36,846 INFO L175 Difference]: Start difference. First operand has 75 places, 73 transitions, 628 flow. Second operand 9 states and 1281 transitions. [2022-12-13 21:40:36,846 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 229 transitions, 2139 flow [2022-12-13 21:40:38,895 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 229 transitions, 2097 flow, removed 17 selfloop flow, removed 2 redundant places. [2022-12-13 21:40:38,896 INFO L231 Difference]: Finished difference. Result has 84 places, 78 transitions, 710 flow [2022-12-13 21:40:38,897 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=285, PETRI_DIFFERENCE_MINUEND_FLOW=586, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=710, PETRI_PLACES=84, PETRI_TRANSITIONS=78} [2022-12-13 21:40:38,897 INFO L288 CegarLoopForPetriNet]: 53 programPoint places, 31 predicate places. [2022-12-13 21:40:38,897 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 78 transitions, 710 flow [2022-12-13 21:40:38,897 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 131.0) internal successors, (786), 6 states have internal predecessors, (786), 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 21:40:38,897 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 21:40:38,897 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:40:38,897 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 21:40:38,897 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-12-13 21:40:38,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:40:38,898 INFO L85 PathProgramCache]: Analyzing trace with hash 1317523611, now seen corresponding path program 1 times [2022-12-13 21:40:38,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:40:38,898 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939306468] [2022-12-13 21:40:38,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:40:38,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:40:38,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:40:39,069 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 21:40:39,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:40:39,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939306468] [2022-12-13 21:40:39,069 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939306468] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:40:39,069 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:40:39,069 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 21:40:39,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23252505] [2022-12-13 21:40:39,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:40:39,070 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 21:40:39,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:40:39,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 21:40:39,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-13 21:40:39,082 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 285 [2022-12-13 21:40:39,083 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 78 transitions, 710 flow. Second operand has 7 states, 7 states have (on average 131.0) internal successors, (917), 7 states have internal predecessors, (917), 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 21:40:39,083 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 21:40:39,083 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 285 [2022-12-13 21:40:39,083 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 21:40:41,646 INFO L130 PetriNetUnfolder]: 12657/19596 cut-off events. [2022-12-13 21:40:41,646 INFO L131 PetriNetUnfolder]: For 51356/52898 co-relation queries the response was YES. [2022-12-13 21:40:41,717 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79377 conditions, 19596 events. 12657/19596 cut-off events. For 51356/52898 co-relation queries the response was YES. Maximal size of possible extension queue 1168. Compared 143055 event pairs, 1061 based on Foata normal form. 503/19596 useless extension candidates. Maximal degree in co-relation 79352. Up to 3813 conditions per place. [2022-12-13 21:40:41,733 INFO L137 encePairwiseOnDemand]: 278/285 looper letters, 88 selfloop transitions, 23 changer transitions 98/218 dead transitions. [2022-12-13 21:40:41,733 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 218 transitions, 2047 flow [2022-12-13 21:40:41,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 21:40:41,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-13 21:40:41,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1537 transitions. [2022-12-13 21:40:41,736 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4902711323763955 [2022-12-13 21:40:41,737 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1537 transitions. [2022-12-13 21:40:41,737 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1537 transitions. [2022-12-13 21:40:41,737 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 21:40:41,737 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1537 transitions. [2022-12-13 21:40:41,739 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 139.72727272727272) internal successors, (1537), 11 states have internal predecessors, (1537), 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 21:40:41,742 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 285.0) internal successors, (3420), 12 states have internal predecessors, (3420), 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 21:40:41,742 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 285.0) internal successors, (3420), 12 states have internal predecessors, (3420), 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 21:40:41,743 INFO L175 Difference]: Start difference. First operand has 84 places, 78 transitions, 710 flow. Second operand 11 states and 1537 transitions. [2022-12-13 21:40:41,743 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 218 transitions, 2047 flow [2022-12-13 21:40:44,715 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 218 transitions, 1958 flow, removed 31 selfloop flow, removed 5 redundant places. [2022-12-13 21:40:44,717 INFO L231 Difference]: Finished difference. Result has 92 places, 56 transitions, 465 flow [2022-12-13 21:40:44,718 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=285, PETRI_DIFFERENCE_MINUEND_FLOW=621, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=465, PETRI_PLACES=92, PETRI_TRANSITIONS=56} [2022-12-13 21:40:44,718 INFO L288 CegarLoopForPetriNet]: 53 programPoint places, 39 predicate places. [2022-12-13 21:40:44,718 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 56 transitions, 465 flow [2022-12-13 21:40:44,719 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 131.0) internal successors, (917), 7 states have internal predecessors, (917), 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 21:40:44,719 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 21:40:44,719 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:40:44,719 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 21:40:44,719 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-12-13 21:40:44,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:40:44,719 INFO L85 PathProgramCache]: Analyzing trace with hash 714007112, now seen corresponding path program 1 times [2022-12-13 21:40:44,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:40:44,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023452961] [2022-12-13 21:40:44,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:40:44,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:40:44,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:40:44,871 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 21:40:44,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:40:44,872 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023452961] [2022-12-13 21:40:44,872 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023452961] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:40:44,872 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:40:44,872 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 21:40:44,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88728179] [2022-12-13 21:40:44,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:40:44,873 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 21:40:44,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:40:44,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 21:40:44,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 21:40:44,879 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 285 [2022-12-13 21:40:44,879 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 56 transitions, 465 flow. Second operand has 4 states, 4 states have (on average 135.5) internal successors, (542), 4 states have internal predecessors, (542), 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 21:40:44,879 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 21:40:44,880 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 285 [2022-12-13 21:40:44,880 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 21:40:45,680 INFO L130 PetriNetUnfolder]: 4249/6778 cut-off events. [2022-12-13 21:40:45,680 INFO L131 PetriNetUnfolder]: For 20207/20266 co-relation queries the response was YES. [2022-12-13 21:40:45,697 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27340 conditions, 6778 events. 4249/6778 cut-off events. For 20207/20266 co-relation queries the response was YES. Maximal size of possible extension queue 352. Compared 41874 event pairs, 1492 based on Foata normal form. 10/6748 useless extension candidates. Maximal degree in co-relation 27312. Up to 2735 conditions per place. [2022-12-13 21:40:45,703 INFO L137 encePairwiseOnDemand]: 281/285 looper letters, 50 selfloop transitions, 2 changer transitions 65/119 dead transitions. [2022-12-13 21:40:45,703 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 119 transitions, 1232 flow [2022-12-13 21:40:45,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 21:40:45,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 21:40:45,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 574 transitions. [2022-12-13 21:40:45,705 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5035087719298246 [2022-12-13 21:40:45,705 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 574 transitions. [2022-12-13 21:40:45,705 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 574 transitions. [2022-12-13 21:40:45,705 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 21:40:45,705 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 574 transitions. [2022-12-13 21:40:45,706 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 143.5) internal successors, (574), 4 states have internal predecessors, (574), 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 21:40:45,707 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 285.0) internal successors, (1425), 5 states have internal predecessors, (1425), 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 21:40:45,708 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 285.0) internal successors, (1425), 5 states have internal predecessors, (1425), 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 21:40:45,708 INFO L175 Difference]: Start difference. First operand has 92 places, 56 transitions, 465 flow. Second operand 4 states and 574 transitions. [2022-12-13 21:40:45,708 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 119 transitions, 1232 flow [2022-12-13 21:40:45,839 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 119 transitions, 929 flow, removed 74 selfloop flow, removed 17 redundant places. [2022-12-13 21:40:45,839 INFO L231 Difference]: Finished difference. Result has 76 places, 40 transitions, 228 flow [2022-12-13 21:40:45,840 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=285, PETRI_DIFFERENCE_MINUEND_FLOW=346, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=228, PETRI_PLACES=76, PETRI_TRANSITIONS=40} [2022-12-13 21:40:45,840 INFO L288 CegarLoopForPetriNet]: 53 programPoint places, 23 predicate places. [2022-12-13 21:40:45,840 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 40 transitions, 228 flow [2022-12-13 21:40:45,840 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 135.5) internal successors, (542), 4 states have internal predecessors, (542), 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 21:40:45,840 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 21:40:45,840 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:40:45,840 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-13 21:40:45,840 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-12-13 21:40:45,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:40:45,841 INFO L85 PathProgramCache]: Analyzing trace with hash -138622434, now seen corresponding path program 2 times [2022-12-13 21:40:45,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:40:45,841 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762061413] [2022-12-13 21:40:45,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:40:45,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:40:45,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:40:46,595 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 21:40:46,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:40:46,596 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762061413] [2022-12-13 21:40:46,596 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1762061413] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:40:46,596 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:40:46,596 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 21:40:46,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719059260] [2022-12-13 21:40:46,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:40:46,596 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 21:40:46,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:40:46,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 21:40:46,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-12-13 21:40:46,647 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 285 [2022-12-13 21:40:46,648 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 40 transitions, 228 flow. Second operand has 8 states, 8 states have (on average 131.0) internal successors, (1048), 8 states have internal predecessors, (1048), 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 21:40:46,648 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 21:40:46,649 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 285 [2022-12-13 21:40:46,649 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 21:40:46,958 INFO L130 PetriNetUnfolder]: 642/1095 cut-off events. [2022-12-13 21:40:46,958 INFO L131 PetriNetUnfolder]: For 1408/1416 co-relation queries the response was YES. [2022-12-13 21:40:46,960 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3640 conditions, 1095 events. 642/1095 cut-off events. For 1408/1416 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 4805 event pairs, 158 based on Foata normal form. 1/1084 useless extension candidates. Maximal degree in co-relation 3619. Up to 619 conditions per place. [2022-12-13 21:40:46,961 INFO L137 encePairwiseOnDemand]: 279/285 looper letters, 50 selfloop transitions, 4 changer transitions 31/89 dead transitions. [2022-12-13 21:40:46,962 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 89 transitions, 640 flow [2022-12-13 21:40:46,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 21:40:46,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 21:40:46,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 952 transitions. [2022-12-13 21:40:46,965 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.47719298245614034 [2022-12-13 21:40:46,965 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 952 transitions. [2022-12-13 21:40:46,965 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 952 transitions. [2022-12-13 21:40:46,966 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 21:40:46,966 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 952 transitions. [2022-12-13 21:40:46,969 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 136.0) internal successors, (952), 7 states have internal predecessors, (952), 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 21:40:46,972 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 285.0) internal successors, (2280), 8 states have internal predecessors, (2280), 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 21:40:46,973 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 285.0) internal successors, (2280), 8 states have internal predecessors, (2280), 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 21:40:46,973 INFO L175 Difference]: Start difference. First operand has 76 places, 40 transitions, 228 flow. Second operand 7 states and 952 transitions. [2022-12-13 21:40:46,973 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 89 transitions, 640 flow [2022-12-13 21:40:46,981 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 89 transitions, 568 flow, removed 24 selfloop flow, removed 13 redundant places. [2022-12-13 21:40:46,982 INFO L231 Difference]: Finished difference. Result has 63 places, 40 transitions, 191 flow [2022-12-13 21:40:46,982 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=285, PETRI_DIFFERENCE_MINUEND_FLOW=177, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=191, PETRI_PLACES=63, PETRI_TRANSITIONS=40} [2022-12-13 21:40:46,983 INFO L288 CegarLoopForPetriNet]: 53 programPoint places, 10 predicate places. [2022-12-13 21:40:46,983 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 40 transitions, 191 flow [2022-12-13 21:40:46,983 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 131.0) internal successors, (1048), 8 states have internal predecessors, (1048), 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 21:40:46,983 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 21:40:46,983 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:40:46,984 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-13 21:40:46,984 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-12-13 21:40:46,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:40:46,984 INFO L85 PathProgramCache]: Analyzing trace with hash -1861908828, now seen corresponding path program 3 times [2022-12-13 21:40:46,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:40:46,984 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118287109] [2022-12-13 21:40:46,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:40:46,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:40:47,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 21:40:47,023 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 21:40:47,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 21:40:47,077 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 21:40:47,078 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 21:40:47,078 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (15 of 16 remaining) [2022-12-13 21:40:47,080 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (14 of 16 remaining) [2022-12-13 21:40:47,080 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2022-12-13 21:40:47,080 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining) [2022-12-13 21:40:47,080 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2022-12-13 21:40:47,080 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2022-12-13 21:40:47,080 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2022-12-13 21:40:47,080 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2022-12-13 21:40:47,081 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2022-12-13 21:40:47,081 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2022-12-13 21:40:47,081 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (5 of 16 remaining) [2022-12-13 21:40:47,081 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 16 remaining) [2022-12-13 21:40:47,081 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 16 remaining) [2022-12-13 21:40:47,081 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 16 remaining) [2022-12-13 21:40:47,081 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 16 remaining) [2022-12-13 21:40:47,081 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2022-12-13 21:40:47,081 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-13 21:40:47,082 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:40:47,087 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 21:40:47,087 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 21:40:47,133 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 09:40:47 BasicIcfg [2022-12-13 21:40:47,133 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 21:40:47,134 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-13 21:40:47,134 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-13 21:40:47,134 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-13 21:40:47,134 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 09:40:07" (3/4) ... [2022-12-13 21:40:47,136 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-12-13 21:40:47,136 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-13 21:40:47,137 INFO L158 Benchmark]: Toolchain (without parser) took 40792.74ms. Allocated memory was 125.8MB in the beginning and 2.8GB in the end (delta: 2.7GB). Free memory was 89.1MB in the beginning and 931.0MB in the end (delta: -841.8MB). Peak memory consumption was 1.8GB. Max. memory is 16.1GB. [2022-12-13 21:40:47,137 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 125.8MB. Free memory is still 92.7MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 21:40:47,137 INFO L158 Benchmark]: CACSL2BoogieTranslator took 426.07ms. Allocated memory is still 125.8MB. Free memory was 89.1MB in the beginning and 61.0MB in the end (delta: 28.1MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2022-12-13 21:40:47,137 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.91ms. Allocated memory is still 125.8MB. Free memory was 61.0MB in the beginning and 58.6MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 21:40:47,138 INFO L158 Benchmark]: Boogie Preprocessor took 20.29ms. Allocated memory is still 125.8MB. Free memory was 58.6MB in the beginning and 56.4MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 21:40:47,138 INFO L158 Benchmark]: RCFGBuilder took 562.84ms. Allocated memory was 125.8MB in the beginning and 151.0MB in the end (delta: 25.2MB). Free memory was 56.4MB in the beginning and 99.2MB in the end (delta: -42.8MB). Peak memory consumption was 31.0MB. Max. memory is 16.1GB. [2022-12-13 21:40:47,138 INFO L158 Benchmark]: TraceAbstraction took 39742.01ms. Allocated memory was 151.0MB in the beginning and 2.8GB in the end (delta: 2.7GB). Free memory was 98.8MB in the beginning and 932.0MB in the end (delta: -833.2MB). Peak memory consumption was 1.8GB. Max. memory is 16.1GB. [2022-12-13 21:40:47,138 INFO L158 Benchmark]: Witness Printer took 2.86ms. Allocated memory is still 2.8GB. Free memory was 932.0MB in the beginning and 931.0MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 21:40:47,140 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.16ms. Allocated memory is still 125.8MB. Free memory is still 92.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 426.07ms. Allocated memory is still 125.8MB. Free memory was 89.1MB in the beginning and 61.0MB in the end (delta: 28.1MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.91ms. Allocated memory is still 125.8MB. Free memory was 61.0MB in the beginning and 58.6MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 20.29ms. Allocated memory is still 125.8MB. Free memory was 58.6MB in the beginning and 56.4MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 562.84ms. Allocated memory was 125.8MB in the beginning and 151.0MB in the end (delta: 25.2MB). Free memory was 56.4MB in the beginning and 99.2MB in the end (delta: -42.8MB). Peak memory consumption was 31.0MB. Max. memory is 16.1GB. * TraceAbstraction took 39742.01ms. Allocated memory was 151.0MB in the beginning and 2.8GB in the end (delta: 2.7GB). Free memory was 98.8MB in the beginning and 932.0MB in the end (delta: -833.2MB). Peak memory consumption was 1.8GB. Max. memory is 16.1GB. * Witness Printer took 2.86ms. Allocated memory is still 2.8GB. Free memory was 932.0MB in the beginning and 931.0MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.1s, 156 PlacesBefore, 53 PlacesAfterwards, 145 TransitionsBefore, 41 TransitionsAfterwards, 3764 CoEnabledTransitionPairs, 7 FixpointIterations, 50 TrivialSequentialCompositions, 77 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 1 ChoiceCompositions, 136 TotalNumberOfCompositions, 10934 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 5189, independent: 4941, independent conditional: 0, independent unconditional: 4941, dependent: 248, dependent conditional: 0, dependent unconditional: 248, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 2058, independent: 2005, independent conditional: 0, independent unconditional: 2005, dependent: 53, dependent conditional: 0, dependent unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 5189, independent: 2936, independent conditional: 0, independent unconditional: 2936, dependent: 195, dependent conditional: 0, dependent unconditional: 195, unknown: 2058, unknown conditional: 0, unknown unconditional: 2058] , Statistics on independence cache: Total cache size (in pairs): 224, Positive cache size: 203, Positive conditional cache size: 0, Positive unconditional cache size: 203, Negative cache size: 21, Negative conditional cache size: 0, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int __unbuffered_p3_EBX = 0; [L718] 0 int a = 0; [L719] 0 _Bool a$flush_delayed; [L720] 0 int a$mem_tmp; [L721] 0 _Bool a$r_buff0_thd0; [L722] 0 _Bool a$r_buff0_thd1; [L723] 0 _Bool a$r_buff0_thd2; [L724] 0 _Bool a$r_buff0_thd3; [L725] 0 _Bool a$r_buff0_thd4; [L726] 0 _Bool a$r_buff1_thd0; [L727] 0 _Bool a$r_buff1_thd1; [L728] 0 _Bool a$r_buff1_thd2; [L729] 0 _Bool a$r_buff1_thd3; [L730] 0 _Bool a$r_buff1_thd4; [L731] 0 _Bool a$read_delayed; [L732] 0 int *a$read_delayed_var; [L733] 0 int a$w_buff0; [L734] 0 _Bool a$w_buff0_used; [L735] 0 int a$w_buff1; [L736] 0 _Bool a$w_buff1_used; [L737] 0 _Bool main$tmp_guard0; [L738] 0 _Bool main$tmp_guard1; [L740] 0 int x = 0; [L742] 0 int y = 0; [L744] 0 int z = 0; [L745] 0 _Bool weak$$choice0; [L746] 0 _Bool weak$$choice2; [L864] 0 pthread_t t713; [L865] FCALL, FORK 0 pthread_create(&t713, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t713, ((void *)0), P0, ((void *)0))=-2, t713={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L866] 0 pthread_t t714; [L867] FCALL, FORK 0 pthread_create(&t714, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t714, ((void *)0), P1, ((void *)0))=-1, t713={5:0}, t714={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L868] 0 pthread_t t715; [L869] FCALL, FORK 0 pthread_create(&t715, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t715, ((void *)0), P2, ((void *)0))=0, t713={5:0}, t714={6:0}, t715={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L870] 0 pthread_t t716; [L871] FCALL, FORK 0 pthread_create(&t716, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t716, ((void *)0), P3, ((void *)0))=1, t713={5:0}, t714={6:0}, t715={7:0}, t716={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L750] 1 a$w_buff1 = a$w_buff0 [L751] 1 a$w_buff0 = 1 [L752] 1 a$w_buff1_used = a$w_buff0_used [L753] 1 a$w_buff0_used = (_Bool)1 [L754] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L754] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L755] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L756] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L757] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L758] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L759] 1 a$r_buff1_thd4 = a$r_buff0_thd4 [L760] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L763] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L780] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L783] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L800] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L803] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L820] 4 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2] [L823] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2] [L826] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L827] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L828] 4 a$flush_delayed = weak$$choice2 [L829] 4 a$mem_tmp = a [L830] 4 a = !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L831] 4 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L832] 4 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L833] 4 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L834] 4 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L835] 4 a$r_buff0_thd4 = weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L836] 4 a$r_buff1_thd4 = weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L837] 4 __unbuffered_p3_EBX = a [L838] 4 a = a$flush_delayed ? a$mem_tmp : a [L839] 4 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=2] [L842] 4 a = a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L843] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L844] 4 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L845] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L846] 4 a$r_buff1_thd4 = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=2] [L766] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L767] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L768] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L769] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L770] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=2] [L773] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L775] 1 return 0; [L786] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L787] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L788] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L789] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L790] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=2] [L793] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L795] 2 return 0; [L806] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L807] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L808] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L809] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L810] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=2] [L813] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L815] 3 return 0; [L849] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L851] 4 return 0; [L873] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L875] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L875] RET 0 assume_abort_if_not(main$tmp_guard0) [L877] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L878] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L879] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L880] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L881] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t713={5:0}, t714={6:0}, t715={7:0}, t716={3:0}, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=2] [L884] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 2 && __unbuffered_p3_EBX == 0) [L886] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=2] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 862]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 865]: 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: 869]: 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: 867]: 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: 871]: 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 9 procedures, 186 locations, 16 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: 39.6s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 33.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 933 SdHoareTripleChecker+Valid, 2.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 795 mSDsluCounter, 168 SdHoareTripleChecker+Invalid, 1.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 127 mSDsCounter, 104 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2313 IncrementalHoareTripleChecker+Invalid, 2417 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 104 mSolverCounterUnsat, 41 mSDtfsCounter, 2313 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 61 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=710occurred in iteration=11, InterpolantAutomatonStates: 74, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 253 NumberOfCodeBlocks, 253 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 211 ConstructedInterpolants, 0 QuantifiedInterpolants, 1266 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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 could not prove your program: unable to determine feasibility of some traces [2022-12-13 21:40:47,155 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d430da05-79a9-44cf-946c-d6a4166d8c9d/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 Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d430da05-79a9-44cf-946c-d6a4166d8c9d/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d430da05-79a9-44cf-946c-d6a4166d8c9d/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_d430da05-79a9-44cf-946c-d6a4166d8c9d/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d430da05-79a9-44cf-946c-d6a4166d8c9d/bin/uautomizer-uyxdKDjOR8/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix027_power.oepc_pso.oepc_rmo.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d430da05-79a9-44cf-946c-d6a4166d8c9d/bin/uautomizer-uyxdKDjOR8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d430da05-79a9-44cf-946c-d6a4166d8c9d/bin/uautomizer-uyxdKDjOR8 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d8f535cb798ce58a79ec2e9a728d4e5d884025e215c7cfd9880fc53267dd5a20 --- 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 21:40:48,903 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 21:40:48,904 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 21:40:48,927 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 21:40:48,928 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 21:40:48,929 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 21:40:48,931 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 21:40:48,935 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 21:40:48,937 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 21:40:48,938 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 21:40:48,940 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 21:40:48,941 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 21:40:48,942 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 21:40:48,943 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 21:40:48,944 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 21:40:48,945 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 21:40:48,945 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 21:40:48,946 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 21:40:48,947 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 21:40:48,948 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 21:40:48,949 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 21:40:48,949 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 21:40:48,950 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 21:40:48,951 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 21:40:48,953 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 21:40:48,953 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 21:40:48,953 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 21:40:48,954 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 21:40:48,954 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 21:40:48,955 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 21:40:48,955 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 21:40:48,955 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 21:40:48,956 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 21:40:48,956 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 21:40:48,962 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 21:40:48,962 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 21:40:48,963 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 21:40:48,963 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 21:40:48,963 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 21:40:48,964 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 21:40:48,965 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 21:40:48,966 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d430da05-79a9-44cf-946c-d6a4166d8c9d/bin/uautomizer-uyxdKDjOR8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-12-13 21:40:48,989 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 21:40:48,989 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 21:40:48,990 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 21:40:48,990 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 21:40:48,991 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 21:40:48,991 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 21:40:48,991 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 21:40:48,992 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 21:40:48,992 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 21:40:48,992 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 21:40:48,992 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 21:40:48,992 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-13 21:40:48,993 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 21:40:48,993 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 21:40:48,993 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 21:40:48,993 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-12-13 21:40:48,993 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-12-13 21:40:48,993 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-12-13 21:40:48,994 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 21:40:48,994 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-12-13 21:40:48,994 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-12-13 21:40:48,994 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-12-13 21:40:48,994 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 21:40:48,995 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 21:40:48,995 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 21:40:48,995 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 21:40:48,995 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 21:40:48,995 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 21:40:48,996 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 21:40:48,996 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 21:40:48,996 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-12-13 21:40:48,996 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-12-13 21:40:48,996 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 21:40:48,997 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 21:40:48,997 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 21:40:48,997 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2022-12-13 21:40:48,997 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 21:40:48,997 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_d430da05-79a9-44cf-946c-d6a4166d8c9d/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_d430da05-79a9-44cf-946c-d6a4166d8c9d/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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> d8f535cb798ce58a79ec2e9a728d4e5d884025e215c7cfd9880fc53267dd5a20 [2022-12-13 21:40:49,235 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 21:40:49,253 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 21:40:49,254 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 21:40:49,255 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 21:40:49,255 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 21:40:49,257 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d430da05-79a9-44cf-946c-d6a4166d8c9d/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/pthread-wmm/mix027_power.oepc_pso.oepc_rmo.oepc.i [2022-12-13 21:40:51,890 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 21:40:52,103 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 21:40:52,104 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d430da05-79a9-44cf-946c-d6a4166d8c9d/sv-benchmarks/c/pthread-wmm/mix027_power.oepc_pso.oepc_rmo.oepc.i [2022-12-13 21:40:52,116 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d430da05-79a9-44cf-946c-d6a4166d8c9d/bin/uautomizer-uyxdKDjOR8/data/ac0ad070a/c8d749cb05034db187d6ec7480d0aa35/FLAGece5208b8 [2022-12-13 21:40:52,130 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d430da05-79a9-44cf-946c-d6a4166d8c9d/bin/uautomizer-uyxdKDjOR8/data/ac0ad070a/c8d749cb05034db187d6ec7480d0aa35 [2022-12-13 21:40:52,132 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 21:40:52,134 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 21:40:52,135 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 21:40:52,135 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 21:40:52,138 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 21:40:52,138 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 09:40:52" (1/1) ... [2022-12-13 21:40:52,139 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a94f69a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:40:52, skipping insertion in model container [2022-12-13 21:40:52,139 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 09:40:52" (1/1) ... [2022-12-13 21:40:52,144 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 21:40:52,172 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 21:40:52,312 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_d430da05-79a9-44cf-946c-d6a4166d8c9d/sv-benchmarks/c/pthread-wmm/mix027_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2022-12-13 21:40:52,465 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:40:52,468 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:40:52,468 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:40:52,469 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:40:52,469 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:40:52,472 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:40:52,472 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:40:52,473 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:40:52,474 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:40:52,474 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:40:52,474 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:40:52,475 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:40:52,475 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:40:52,478 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:40:52,478 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:40:52,478 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:40:52,479 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:40:52,479 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:40:52,480 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:40:52,480 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:40:52,481 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:40:52,483 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:40:52,483 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:40:52,484 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:40:52,485 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:40:52,485 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:40:52,485 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:40:52,486 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:40:52,486 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:40:52,494 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:40:52,494 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:40:52,497 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:40:52,497 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:40:52,498 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:40:52,505 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:40:52,505 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:40:52,506 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:40:52,508 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:40:52,509 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:40:52,510 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:40:52,511 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 21:40:52,524 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 21:40:52,533 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_d430da05-79a9-44cf-946c-d6a4166d8c9d/sv-benchmarks/c/pthread-wmm/mix027_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2022-12-13 21:40:52,557 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:40:52,558 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:40:52,558 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:40:52,559 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:40:52,559 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:40:52,560 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:40:52,561 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:40:52,561 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:40:52,562 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:40:52,562 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:40:52,562 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:40:52,562 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:40:52,562 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:40:52,564 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:40:52,564 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:40:52,565 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:40:52,565 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:40:52,566 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:40:52,566 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:40:52,566 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:40:52,566 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:40:52,568 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:40:52,568 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:40:52,569 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:40:52,569 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:40:52,569 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:40:52,570 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:40:52,570 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:40:52,570 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:40:52,574 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:40:52,575 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:40:52,576 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:40:52,577 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:40:52,577 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:40:52,581 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:40:52,581 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:40:52,582 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:40:52,583 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:40:52,583 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:40:52,584 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:40:52,585 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 21:40:52,618 INFO L208 MainTranslator]: Completed translation [2022-12-13 21:40:52,618 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:40:52 WrapperNode [2022-12-13 21:40:52,618 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 21:40:52,619 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 21:40:52,619 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 21:40:52,619 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 21:40:52,624 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:40:52" (1/1) ... [2022-12-13 21:40:52,640 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:40:52" (1/1) ... [2022-12-13 21:40:52,661 INFO L138 Inliner]: procedures = 180, calls = 69, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 145 [2022-12-13 21:40:52,661 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 21:40:52,662 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 21:40:52,662 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 21:40:52,662 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 21:40:52,671 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:40:52" (1/1) ... [2022-12-13 21:40:52,671 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:40:52" (1/1) ... [2022-12-13 21:40:52,674 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:40:52" (1/1) ... [2022-12-13 21:40:52,675 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:40:52" (1/1) ... [2022-12-13 21:40:52,684 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:40:52" (1/1) ... [2022-12-13 21:40:52,686 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:40:52" (1/1) ... [2022-12-13 21:40:52,688 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:40:52" (1/1) ... [2022-12-13 21:40:52,690 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:40:52" (1/1) ... [2022-12-13 21:40:52,694 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 21:40:52,694 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 21:40:52,694 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 21:40:52,695 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 21:40:52,695 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:40:52" (1/1) ... [2022-12-13 21:40:52,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 21:40:52,713 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d430da05-79a9-44cf-946c-d6a4166d8c9d/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 21:40:52,725 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d430da05-79a9-44cf-946c-d6a4166d8c9d/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 21:40:52,728 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d430da05-79a9-44cf-946c-d6a4166d8c9d/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 21:40:52,761 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 21:40:52,761 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 21:40:52,761 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 21:40:52,761 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 21:40:52,761 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-12-13 21:40:52,762 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-12-13 21:40:52,762 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 21:40:52,762 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 21:40:52,762 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 21:40:52,762 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 21:40:52,762 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-13 21:40:52,762 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-13 21:40:52,762 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-12-13 21:40:52,763 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-12-13 21:40:52,763 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 21:40:52,763 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 21:40:52,763 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 21:40:52,764 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 21:40:52,894 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 21:40:52,896 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 21:40:53,239 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 21:40:53,329 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 21:40:53,329 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 21:40:53,331 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 09:40:53 BoogieIcfgContainer [2022-12-13 21:40:53,331 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 21:40:53,332 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 21:40:53,332 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 21:40:53,335 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 21:40:53,335 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 09:40:52" (1/3) ... [2022-12-13 21:40:53,336 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4331454e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 09:40:53, skipping insertion in model container [2022-12-13 21:40:53,336 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:40:52" (2/3) ... [2022-12-13 21:40:53,336 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4331454e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 09:40:53, skipping insertion in model container [2022-12-13 21:40:53,336 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 09:40:53" (3/3) ... [2022-12-13 21:40:53,338 INFO L112 eAbstractionObserver]: Analyzing ICFG mix027_power.oepc_pso.oepc_rmo.oepc.i [2022-12-13 21:40:53,354 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 21:40:53,354 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2022-12-13 21:40:53,354 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 21:40:53,409 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 21:40:53,436 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 161 places, 150 transitions, 320 flow [2022-12-13 21:40:53,478 INFO L130 PetriNetUnfolder]: 2/146 cut-off events. [2022-12-13 21:40:53,478 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 21:40:53,482 INFO L83 FinitePrefix]: Finished finitePrefix Result has 159 conditions, 146 events. 2/146 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 106 event pairs, 0 based on Foata normal form. 0/133 useless extension candidates. Maximal degree in co-relation 101. Up to 2 conditions per place. [2022-12-13 21:40:53,483 INFO L82 GeneralOperation]: Start removeDead. Operand has 161 places, 150 transitions, 320 flow [2022-12-13 21:40:53,486 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 157 places, 146 transitions, 304 flow [2022-12-13 21:40:53,489 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-12-13 21:40:53,496 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 157 places, 146 transitions, 304 flow [2022-12-13 21:40:53,498 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 157 places, 146 transitions, 304 flow [2022-12-13 21:40:53,499 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 157 places, 146 transitions, 304 flow [2022-12-13 21:40:53,535 INFO L130 PetriNetUnfolder]: 2/146 cut-off events. [2022-12-13 21:40:53,535 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 21:40:53,536 INFO L83 FinitePrefix]: Finished finitePrefix Result has 159 conditions, 146 events. 2/146 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 106 event pairs, 0 based on Foata normal form. 0/133 useless extension candidates. Maximal degree in co-relation 101. Up to 2 conditions per place. [2022-12-13 21:40:53,540 INFO L119 LiptonReduction]: Number of co-enabled transitions 3764 [2022-12-13 21:41:00,042 INFO L134 LiptonReduction]: Checked pairs total: 11059 [2022-12-13 21:41:00,042 INFO L136 LiptonReduction]: Total number of compositions: 139 [2022-12-13 21:41:00,054 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 21:41:00,059 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=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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;@190391d4, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 21:41:00,059 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2022-12-13 21:41:00,060 INFO L130 PetriNetUnfolder]: 0/1 cut-off events. [2022-12-13 21:41:00,061 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 21:41:00,061 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 21:41:00,061 INFO L209 CegarLoopForPetriNet]: trace histogram [1] [2022-12-13 21:41:00,062 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-12-13 21:41:00,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:41:00,065 INFO L85 PathProgramCache]: Analyzing trace with hash 625, now seen corresponding path program 1 times [2022-12-13 21:41:00,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 21:41:00,074 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [320278622] [2022-12-13 21:41:00,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:41:00,074 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 21:41:00,075 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d430da05-79a9-44cf-946c-d6a4166d8c9d/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 21:41:00,076 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d430da05-79a9-44cf-946c-d6a4166d8c9d/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 21:41:00,109 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d430da05-79a9-44cf-946c-d6a4166d8c9d/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-12-13 21:41:00,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:41:00,166 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2022-12-13 21:41:00,169 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 21:41:00,173 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 21:41:00,173 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 21:41:00,174 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 21:41:00,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [320278622] [2022-12-13 21:41:00,175 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [320278622] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:41:00,175 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:41:00,175 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-12-13 21:41:00,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843308124] [2022-12-13 21:41:00,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:41:00,184 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-13 21:41:00,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 21:41:00,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-13 21:41:00,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-13 21:41:00,205 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 289 [2022-12-13 21:41:00,208 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 41 transitions, 94 flow. Second operand has 2 states, 2 states have (on average 135.5) internal successors, (271), 2 states have internal predecessors, (271), 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 21:41:00,208 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 21:41:00,208 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 289 [2022-12-13 21:41:00,209 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 21:41:01,860 INFO L130 PetriNetUnfolder]: 8719/11825 cut-off events. [2022-12-13 21:41:01,860 INFO L131 PetriNetUnfolder]: For 74/74 co-relation queries the response was YES. [2022-12-13 21:41:01,883 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23773 conditions, 11825 events. 8719/11825 cut-off events. For 74/74 co-relation queries the response was YES. Maximal size of possible extension queue 540. Compared 61570 event pairs, 8719 based on Foata normal form. 0/10332 useless extension candidates. Maximal degree in co-relation 23761. Up to 11731 conditions per place. [2022-12-13 21:41:01,921 INFO L137 encePairwiseOnDemand]: 280/289 looper letters, 28 selfloop transitions, 0 changer transitions 0/32 dead transitions. [2022-12-13 21:41:01,921 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 32 transitions, 132 flow [2022-12-13 21:41:01,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 21:41:01,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-12-13 21:41:01,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 307 transitions. [2022-12-13 21:41:01,936 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5311418685121108 [2022-12-13 21:41:01,936 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 307 transitions. [2022-12-13 21:41:01,937 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 307 transitions. [2022-12-13 21:41:01,938 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 21:41:01,941 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 307 transitions. [2022-12-13 21:41:01,944 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 153.5) internal successors, (307), 2 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:41:01,949 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 289.0) internal successors, (867), 3 states have internal predecessors, (867), 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 21:41:01,950 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 289.0) internal successors, (867), 3 states have internal predecessors, (867), 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 21:41:01,952 INFO L175 Difference]: Start difference. First operand has 53 places, 41 transitions, 94 flow. Second operand 2 states and 307 transitions. [2022-12-13 21:41:01,953 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 32 transitions, 132 flow [2022-12-13 21:41:01,958 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 32 transitions, 128 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-13 21:41:01,959 INFO L231 Difference]: Finished difference. Result has 42 places, 32 transitions, 72 flow [2022-12-13 21:41:01,961 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=289, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=72, PETRI_PLACES=42, PETRI_TRANSITIONS=32} [2022-12-13 21:41:01,965 INFO L288 CegarLoopForPetriNet]: 53 programPoint places, -11 predicate places. [2022-12-13 21:41:01,966 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 32 transitions, 72 flow [2022-12-13 21:41:01,966 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 135.5) internal successors, (271), 2 states have internal predecessors, (271), 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 21:41:01,966 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 21:41:01,966 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-12-13 21:41:01,974 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d430da05-79a9-44cf-946c-d6a4166d8c9d/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-12-13 21:41:02,167 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d430da05-79a9-44cf-946c-d6a4166d8c9d/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 21:41:02,169 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-12-13 21:41:02,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:41:02,172 INFO L85 PathProgramCache]: Analyzing trace with hash 614235, now seen corresponding path program 1 times [2022-12-13 21:41:02,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 21:41:02,177 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1406116913] [2022-12-13 21:41:02,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:41:02,178 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 21:41:02,179 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d430da05-79a9-44cf-946c-d6a4166d8c9d/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 21:41:02,182 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d430da05-79a9-44cf-946c-d6a4166d8c9d/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 21:41:02,185 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d430da05-79a9-44cf-946c-d6a4166d8c9d/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-12-13 21:41:02,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:41:02,361 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-13 21:41:02,362 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 21:41:02,378 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 21:41:02,378 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 21:41:02,378 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 21:41:02,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1406116913] [2022-12-13 21:41:02,378 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1406116913] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:41:02,379 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:41:02,379 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 21:41:02,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094311541] [2022-12-13 21:41:02,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:41:02,380 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 21:41:02,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 21:41:02,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 21:41:02,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 21:41:02,384 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 289 [2022-12-13 21:41:02,385 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 32 transitions, 72 flow. Second operand has 3 states, 3 states have (on average 135.0) internal successors, (405), 3 states have internal predecessors, (405), 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 21:41:02,385 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 21:41:02,385 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 289 [2022-12-13 21:41:02,385 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 21:41:03,331 INFO L130 PetriNetUnfolder]: 6855/9885 cut-off events. [2022-12-13 21:41:03,331 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 21:41:03,343 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19322 conditions, 9885 events. 6855/9885 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 469. Compared 60418 event pairs, 1263 based on Foata normal form. 0/9227 useless extension candidates. Maximal degree in co-relation 19319. Up to 7399 conditions per place. [2022-12-13 21:41:03,372 INFO L137 encePairwiseOnDemand]: 286/289 looper letters, 45 selfloop transitions, 2 changer transitions 2/53 dead transitions. [2022-12-13 21:41:03,372 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 53 transitions, 218 flow [2022-12-13 21:41:03,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 21:41:03,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 21:41:03,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 452 transitions. [2022-12-13 21:41:03,375 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5213379469434832 [2022-12-13 21:41:03,375 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 452 transitions. [2022-12-13 21:41:03,375 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 452 transitions. [2022-12-13 21:41:03,375 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 21:41:03,376 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 452 transitions. [2022-12-13 21:41:03,377 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 150.66666666666666) internal successors, (452), 3 states have internal predecessors, (452), 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 21:41:03,378 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 289.0) internal successors, (1156), 4 states have internal predecessors, (1156), 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 21:41:03,379 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 289.0) internal successors, (1156), 4 states have internal predecessors, (1156), 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 21:41:03,379 INFO L175 Difference]: Start difference. First operand has 42 places, 32 transitions, 72 flow. Second operand 3 states and 452 transitions. [2022-12-13 21:41:03,379 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 53 transitions, 218 flow [2022-12-13 21:41:03,380 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 53 transitions, 218 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-13 21:41:03,380 INFO L231 Difference]: Finished difference. Result has 43 places, 30 transitions, 72 flow [2022-12-13 21:41:03,380 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=289, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=72, PETRI_PLACES=43, PETRI_TRANSITIONS=30} [2022-12-13 21:41:03,381 INFO L288 CegarLoopForPetriNet]: 53 programPoint places, -10 predicate places. [2022-12-13 21:41:03,381 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 30 transitions, 72 flow [2022-12-13 21:41:03,381 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 135.0) internal successors, (405), 3 states have internal predecessors, (405), 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 21:41:03,381 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 21:41:03,381 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:41:03,390 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d430da05-79a9-44cf-946c-d6a4166d8c9d/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2022-12-13 21:41:03,582 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d430da05-79a9-44cf-946c-d6a4166d8c9d/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 21:41:03,583 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-12-13 21:41:03,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:41:03,585 INFO L85 PathProgramCache]: Analyzing trace with hash 83355974, now seen corresponding path program 1 times [2022-12-13 21:41:03,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 21:41:03,587 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1051979508] [2022-12-13 21:41:03,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:41:03,588 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 21:41:03,588 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d430da05-79a9-44cf-946c-d6a4166d8c9d/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 21:41:03,591 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d430da05-79a9-44cf-946c-d6a4166d8c9d/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 21:41:03,594 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d430da05-79a9-44cf-946c-d6a4166d8c9d/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-12-13 21:41:03,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:41:03,708 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-13 21:41:03,709 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 21:41:03,746 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 21:41:03,747 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 21:41:03,747 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 21:41:03,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1051979508] [2022-12-13 21:41:03,747 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1051979508] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:41:03,747 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:41:03,748 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 21:41:03,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414779122] [2022-12-13 21:41:03,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:41:03,748 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 21:41:03,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 21:41:03,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 21:41:03,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 21:41:03,768 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 289 [2022-12-13 21:41:03,768 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 30 transitions, 72 flow. Second operand has 4 states, 4 states have (on average 131.75) internal successors, (527), 4 states have internal predecessors, (527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:41:03,769 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 21:41:03,769 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 289 [2022-12-13 21:41:03,769 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 21:41:04,513 INFO L130 PetriNetUnfolder]: 4483/6401 cut-off events. [2022-12-13 21:41:04,513 INFO L131 PetriNetUnfolder]: For 421/421 co-relation queries the response was YES. [2022-12-13 21:41:04,519 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13350 conditions, 6401 events. 4483/6401 cut-off events. For 421/421 co-relation queries the response was YES. Maximal size of possible extension queue 332. Compared 34442 event pairs, 818 based on Foata normal form. 320/6491 useless extension candidates. Maximal degree in co-relation 13346. Up to 4756 conditions per place. [2022-12-13 21:41:04,532 INFO L137 encePairwiseOnDemand]: 282/289 looper letters, 40 selfloop transitions, 5 changer transitions 27/76 dead transitions. [2022-12-13 21:41:04,532 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 76 transitions, 320 flow [2022-12-13 21:41:04,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 21:41:04,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 21:41:04,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 719 transitions. [2022-12-13 21:41:04,534 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4975778546712803 [2022-12-13 21:41:04,534 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 719 transitions. [2022-12-13 21:41:04,534 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 719 transitions. [2022-12-13 21:41:04,535 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 21:41:04,535 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 719 transitions. [2022-12-13 21:41:04,536 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 143.8) internal successors, (719), 5 states have internal predecessors, (719), 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 21:41:04,538 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 289.0) internal successors, (1734), 6 states have internal predecessors, (1734), 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 21:41:04,539 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 289.0) internal successors, (1734), 6 states have internal predecessors, (1734), 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 21:41:04,539 INFO L175 Difference]: Start difference. First operand has 43 places, 30 transitions, 72 flow. Second operand 5 states and 719 transitions. [2022-12-13 21:41:04,539 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 76 transitions, 320 flow [2022-12-13 21:41:04,539 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 76 transitions, 310 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 21:41:04,540 INFO L231 Difference]: Finished difference. Result has 47 places, 34 transitions, 113 flow [2022-12-13 21:41:04,540 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=289, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=113, PETRI_PLACES=47, PETRI_TRANSITIONS=34} [2022-12-13 21:41:04,541 INFO L288 CegarLoopForPetriNet]: 53 programPoint places, -6 predicate places. [2022-12-13 21:41:04,541 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 34 transitions, 113 flow [2022-12-13 21:41:04,541 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 131.75) internal successors, (527), 4 states have internal predecessors, (527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:41:04,541 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 21:41:04,541 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:41:04,548 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d430da05-79a9-44cf-946c-d6a4166d8c9d/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2022-12-13 21:41:04,741 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d430da05-79a9-44cf-946c-d6a4166d8c9d/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 21:41:04,742 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-12-13 21:41:04,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:41:04,743 INFO L85 PathProgramCache]: Analyzing trace with hash 287830368, now seen corresponding path program 1 times [2022-12-13 21:41:04,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 21:41:04,744 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1354471699] [2022-12-13 21:41:04,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:41:04,744 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 21:41:04,744 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d430da05-79a9-44cf-946c-d6a4166d8c9d/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 21:41:04,745 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d430da05-79a9-44cf-946c-d6a4166d8c9d/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 21:41:04,747 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d430da05-79a9-44cf-946c-d6a4166d8c9d/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-12-13 21:41:04,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:41:04,853 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 21:41:04,853 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 21:41:04,887 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 21:41:04,887 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 21:41:04,888 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 21:41:04,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1354471699] [2022-12-13 21:41:04,888 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1354471699] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:41:04,888 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:41:04,888 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 21:41:04,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493043592] [2022-12-13 21:41:04,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:41:04,888 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 21:41:04,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 21:41:04,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 21:41:04,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 21:41:04,906 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 289 [2022-12-13 21:41:04,907 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 34 transitions, 113 flow. Second operand has 5 states, 5 states have (on average 131.8) internal successors, (659), 5 states have internal predecessors, (659), 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 21:41:04,907 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 21:41:04,908 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 289 [2022-12-13 21:41:04,908 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 21:41:05,439 INFO L130 PetriNetUnfolder]: 2161/3296 cut-off events. [2022-12-13 21:41:05,439 INFO L131 PetriNetUnfolder]: For 1173/1173 co-relation queries the response was YES. [2022-12-13 21:41:05,442 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8691 conditions, 3296 events. 2161/3296 cut-off events. For 1173/1173 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 17362 event pairs, 403 based on Foata normal form. 212/3413 useless extension candidates. Maximal degree in co-relation 8684. Up to 1426 conditions per place. [2022-12-13 21:41:05,447 INFO L137 encePairwiseOnDemand]: 282/289 looper letters, 53 selfloop transitions, 9 changer transitions 27/93 dead transitions. [2022-12-13 21:41:05,447 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 93 transitions, 469 flow [2022-12-13 21:41:05,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 21:41:05,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 21:41:05,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 865 transitions. [2022-12-13 21:41:05,449 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4988465974625144 [2022-12-13 21:41:05,449 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 865 transitions. [2022-12-13 21:41:05,449 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 865 transitions. [2022-12-13 21:41:05,449 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 21:41:05,449 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 865 transitions. [2022-12-13 21:41:05,450 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 144.16666666666666) internal successors, (865), 6 states have internal predecessors, (865), 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 21:41:05,452 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 289.0) internal successors, (2023), 7 states have internal predecessors, (2023), 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 21:41:05,453 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 289.0) internal successors, (2023), 7 states have internal predecessors, (2023), 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 21:41:05,453 INFO L175 Difference]: Start difference. First operand has 47 places, 34 transitions, 113 flow. Second operand 6 states and 865 transitions. [2022-12-13 21:41:05,453 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 93 transitions, 469 flow [2022-12-13 21:41:05,465 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 93 transitions, 462 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-12-13 21:41:05,467 INFO L231 Difference]: Finished difference. Result has 51 places, 38 transitions, 178 flow [2022-12-13 21:41:05,467 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=289, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=178, PETRI_PLACES=51, PETRI_TRANSITIONS=38} [2022-12-13 21:41:05,468 INFO L288 CegarLoopForPetriNet]: 53 programPoint places, -2 predicate places. [2022-12-13 21:41:05,468 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 38 transitions, 178 flow [2022-12-13 21:41:05,469 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 131.8) internal successors, (659), 5 states have internal predecessors, (659), 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 21:41:05,469 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 21:41:05,469 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:41:05,481 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d430da05-79a9-44cf-946c-d6a4166d8c9d/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2022-12-13 21:41:05,670 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d430da05-79a9-44cf-946c-d6a4166d8c9d/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 21:41:05,670 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-12-13 21:41:05,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:41:05,670 INFO L85 PathProgramCache]: Analyzing trace with hash 933762213, now seen corresponding path program 1 times [2022-12-13 21:41:05,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 21:41:05,671 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [982006462] [2022-12-13 21:41:05,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:41:05,671 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 21:41:05,671 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d430da05-79a9-44cf-946c-d6a4166d8c9d/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 21:41:05,672 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d430da05-79a9-44cf-946c-d6a4166d8c9d/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 21:41:05,673 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d430da05-79a9-44cf-946c-d6a4166d8c9d/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-12-13 21:41:05,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:41:05,760 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-13 21:41:05,762 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 21:41:05,805 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 21:41:05,805 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 21:41:05,805 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 21:41:05,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [982006462] [2022-12-13 21:41:05,806 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [982006462] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:41:05,806 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:41:05,806 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 21:41:05,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998302681] [2022-12-13 21:41:05,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:41:05,806 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 21:41:05,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 21:41:05,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 21:41:05,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 21:41:05,827 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 289 [2022-12-13 21:41:05,829 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 38 transitions, 178 flow. Second operand has 6 states, 6 states have (on average 131.83333333333334) internal successors, (791), 6 states have internal predecessors, (791), 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 21:41:05,829 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 21:41:05,829 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 289 [2022-12-13 21:41:05,829 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 21:41:06,274 INFO L130 PetriNetUnfolder]: 1189/1874 cut-off events. [2022-12-13 21:41:06,274 INFO L131 PetriNetUnfolder]: For 1786/1786 co-relation queries the response was YES. [2022-12-13 21:41:06,276 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5594 conditions, 1874 events. 1189/1874 cut-off events. For 1786/1786 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 9227 event pairs, 331 based on Foata normal form. 77/1919 useless extension candidates. Maximal degree in co-relation 5585. Up to 630 conditions per place. [2022-12-13 21:41:06,281 INFO L137 encePairwiseOnDemand]: 282/289 looper letters, 64 selfloop transitions, 13 changer transitions 27/108 dead transitions. [2022-12-13 21:41:06,281 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 108 transitions, 638 flow [2022-12-13 21:41:06,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 21:41:06,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 21:41:06,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1009 transitions. [2022-12-13 21:41:06,285 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.49876421156697975 [2022-12-13 21:41:06,285 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1009 transitions. [2022-12-13 21:41:06,285 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1009 transitions. [2022-12-13 21:41:06,285 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 21:41:06,286 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1009 transitions. [2022-12-13 21:41:06,288 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 144.14285714285714) internal successors, (1009), 7 states have internal predecessors, (1009), 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 21:41:06,291 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 289.0) internal successors, (2312), 8 states have internal predecessors, (2312), 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 21:41:06,292 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 289.0) internal successors, (2312), 8 states have internal predecessors, (2312), 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 21:41:06,292 INFO L175 Difference]: Start difference. First operand has 51 places, 38 transitions, 178 flow. Second operand 7 states and 1009 transitions. [2022-12-13 21:41:06,292 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 108 transitions, 638 flow [2022-12-13 21:41:06,308 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 108 transitions, 576 flow, removed 26 selfloop flow, removed 4 redundant places. [2022-12-13 21:41:06,309 INFO L231 Difference]: Finished difference. Result has 54 places, 42 transitions, 228 flow [2022-12-13 21:41:06,309 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=289, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=228, PETRI_PLACES=54, PETRI_TRANSITIONS=42} [2022-12-13 21:41:06,310 INFO L288 CegarLoopForPetriNet]: 53 programPoint places, 1 predicate places. [2022-12-13 21:41:06,310 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 42 transitions, 228 flow [2022-12-13 21:41:06,310 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 131.83333333333334) internal successors, (791), 6 states have internal predecessors, (791), 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 21:41:06,311 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 21:41:06,311 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:41:06,323 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d430da05-79a9-44cf-946c-d6a4166d8c9d/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2022-12-13 21:41:06,511 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d430da05-79a9-44cf-946c-d6a4166d8c9d/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 21:41:06,511 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-12-13 21:41:06,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:41:06,512 INFO L85 PathProgramCache]: Analyzing trace with hash -707481352, now seen corresponding path program 1 times [2022-12-13 21:41:06,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 21:41:06,512 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [139563874] [2022-12-13 21:41:06,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:41:06,513 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 21:41:06,513 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d430da05-79a9-44cf-946c-d6a4166d8c9d/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 21:41:06,513 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d430da05-79a9-44cf-946c-d6a4166d8c9d/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 21:41:06,514 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d430da05-79a9-44cf-946c-d6a4166d8c9d/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-12-13 21:41:06,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:41:06,597 INFO L263 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-13 21:41:06,598 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 21:41:06,645 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 21:41:06,646 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 21:41:06,646 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 21:41:06,646 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [139563874] [2022-12-13 21:41:06,646 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [139563874] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:41:06,646 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:41:06,646 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 21:41:06,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85093238] [2022-12-13 21:41:06,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:41:06,647 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 21:41:06,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 21:41:06,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 21:41:06,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 21:41:06,682 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 289 [2022-12-13 21:41:06,683 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 42 transitions, 228 flow. Second operand has 7 states, 7 states have (on average 131.85714285714286) internal successors, (923), 7 states have internal predecessors, (923), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:41:06,683 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 21:41:06,683 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 289 [2022-12-13 21:41:06,683 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 21:41:07,206 INFO L130 PetriNetUnfolder]: 1011/1568 cut-off events. [2022-12-13 21:41:07,206 INFO L131 PetriNetUnfolder]: For 1431/1431 co-relation queries the response was YES. [2022-12-13 21:41:07,208 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4520 conditions, 1568 events. 1011/1568 cut-off events. For 1431/1431 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 7531 event pairs, 326 based on Foata normal form. 14/1563 useless extension candidates. Maximal degree in co-relation 4510. Up to 630 conditions per place. [2022-12-13 21:41:07,212 INFO L137 encePairwiseOnDemand]: 282/289 looper letters, 60 selfloop transitions, 17 changer transitions 14/95 dead transitions. [2022-12-13 21:41:07,212 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 95 transitions, 574 flow [2022-12-13 21:41:07,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 21:41:07,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 21:41:07,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1125 transitions. [2022-12-13 21:41:07,214 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4865916955017301 [2022-12-13 21:41:07,214 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1125 transitions. [2022-12-13 21:41:07,214 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1125 transitions. [2022-12-13 21:41:07,215 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 21:41:07,215 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1125 transitions. [2022-12-13 21:41:07,216 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 140.625) internal successors, (1125), 8 states have internal predecessors, (1125), 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 21:41:07,218 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 289.0) internal successors, (2601), 9 states have internal predecessors, (2601), 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 21:41:07,218 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 289.0) internal successors, (2601), 9 states have internal predecessors, (2601), 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 21:41:07,218 INFO L175 Difference]: Start difference. First operand has 54 places, 42 transitions, 228 flow. Second operand 8 states and 1125 transitions. [2022-12-13 21:41:07,218 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 95 transitions, 574 flow [2022-12-13 21:41:07,229 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 95 transitions, 512 flow, removed 22 selfloop flow, removed 5 redundant places. [2022-12-13 21:41:07,230 INFO L231 Difference]: Finished difference. Result has 57 places, 42 transitions, 222 flow [2022-12-13 21:41:07,230 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=289, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=222, PETRI_PLACES=57, PETRI_TRANSITIONS=42} [2022-12-13 21:41:07,230 INFO L288 CegarLoopForPetriNet]: 53 programPoint places, 4 predicate places. [2022-12-13 21:41:07,230 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 42 transitions, 222 flow [2022-12-13 21:41:07,231 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 131.85714285714286) internal successors, (923), 7 states have internal predecessors, (923), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:41:07,231 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 21:41:07,231 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:41:07,243 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d430da05-79a9-44cf-946c-d6a4166d8c9d/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-12-13 21:41:07,431 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d430da05-79a9-44cf-946c-d6a4166d8c9d/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 21:41:07,432 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-12-13 21:41:07,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:41:07,433 INFO L85 PathProgramCache]: Analyzing trace with hash 965365014, now seen corresponding path program 1 times [2022-12-13 21:41:07,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 21:41:07,433 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1658052222] [2022-12-13 21:41:07,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:41:07,434 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 21:41:07,434 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d430da05-79a9-44cf-946c-d6a4166d8c9d/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 21:41:07,435 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d430da05-79a9-44cf-946c-d6a4166d8c9d/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 21:41:07,437 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d430da05-79a9-44cf-946c-d6a4166d8c9d/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-12-13 21:41:07,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:41:07,602 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 17 conjunts are in the unsatisfiable core [2022-12-13 21:41:07,604 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 21:41:07,918 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 21:41:07,919 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 21:41:07,919 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 21:41:07,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1658052222] [2022-12-13 21:41:07,919 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1658052222] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:41:07,919 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:41:07,919 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 21:41:07,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099508297] [2022-12-13 21:41:07,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:41:07,920 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 21:41:07,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 21:41:07,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 21:41:07,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-12-13 21:41:07,977 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 289 [2022-12-13 21:41:07,979 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 42 transitions, 222 flow. Second operand has 8 states, 8 states have (on average 132.0) internal successors, (1056), 8 states have internal predecessors, (1056), 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 21:41:07,979 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 21:41:07,979 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 289 [2022-12-13 21:41:07,979 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 21:41:08,379 INFO L130 PetriNetUnfolder]: 1159/1794 cut-off events. [2022-12-13 21:41:08,379 INFO L131 PetriNetUnfolder]: For 1957/1957 co-relation queries the response was YES. [2022-12-13 21:41:08,381 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5334 conditions, 1794 events. 1159/1794 cut-off events. For 1957/1957 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 8507 event pairs, 195 based on Foata normal form. 0/1787 useless extension candidates. Maximal degree in co-relation 5323. Up to 773 conditions per place. [2022-12-13 21:41:08,385 INFO L137 encePairwiseOnDemand]: 283/289 looper letters, 101 selfloop transitions, 6 changer transitions 0/111 dead transitions. [2022-12-13 21:41:08,385 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 111 transitions, 814 flow [2022-12-13 21:41:08,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 21:41:08,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 21:41:08,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 975 transitions. [2022-12-13 21:41:08,387 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4819574888779041 [2022-12-13 21:41:08,387 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 975 transitions. [2022-12-13 21:41:08,387 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 975 transitions. [2022-12-13 21:41:08,387 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 21:41:08,387 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 975 transitions. [2022-12-13 21:41:08,389 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 139.28571428571428) internal successors, (975), 7 states have internal predecessors, (975), 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 21:41:08,391 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 289.0) internal successors, (2312), 8 states have internal predecessors, (2312), 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 21:41:08,392 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 289.0) internal successors, (2312), 8 states have internal predecessors, (2312), 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 21:41:08,392 INFO L175 Difference]: Start difference. First operand has 57 places, 42 transitions, 222 flow. Second operand 7 states and 975 transitions. [2022-12-13 21:41:08,392 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 111 transitions, 814 flow [2022-12-13 21:41:08,402 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 111 transitions, 658 flow, removed 38 selfloop flow, removed 7 redundant places. [2022-12-13 21:41:08,403 INFO L231 Difference]: Finished difference. Result has 56 places, 44 transitions, 182 flow [2022-12-13 21:41:08,404 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=289, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=182, PETRI_PLACES=56, PETRI_TRANSITIONS=44} [2022-12-13 21:41:08,404 INFO L288 CegarLoopForPetriNet]: 53 programPoint places, 3 predicate places. [2022-12-13 21:41:08,404 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 44 transitions, 182 flow [2022-12-13 21:41:08,405 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 132.0) internal successors, (1056), 8 states have internal predecessors, (1056), 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 21:41:08,405 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 21:41:08,405 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:41:08,418 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d430da05-79a9-44cf-946c-d6a4166d8c9d/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2022-12-13 21:41:08,605 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d430da05-79a9-44cf-946c-d6a4166d8c9d/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 21:41:08,605 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-12-13 21:41:08,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:41:08,606 INFO L85 PathProgramCache]: Analyzing trace with hash 823005130, now seen corresponding path program 2 times [2022-12-13 21:41:08,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 21:41:08,606 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [613641828] [2022-12-13 21:41:08,606 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 21:41:08,606 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 21:41:08,606 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d430da05-79a9-44cf-946c-d6a4166d8c9d/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 21:41:08,607 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d430da05-79a9-44cf-946c-d6a4166d8c9d/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 21:41:08,608 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d430da05-79a9-44cf-946c-d6a4166d8c9d/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-12-13 21:41:08,715 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-12-13 21:41:08,715 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 21:41:08,720 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 21:41:08,721 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 21:41:08,749 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 21:41:08,749 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 21:41:08,749 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 21:41:08,749 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [613641828] [2022-12-13 21:41:08,749 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [613641828] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:41:08,749 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:41:08,749 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 21:41:08,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585515188] [2022-12-13 21:41:08,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:41:08,750 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 21:41:08,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 21:41:08,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 21:41:08,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 21:41:08,757 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 289 [2022-12-13 21:41:08,758 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 44 transitions, 182 flow. Second operand has 4 states, 4 states have (on average 137.25) internal successors, (549), 4 states have internal predecessors, (549), 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 21:41:08,758 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 21:41:08,758 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 289 [2022-12-13 21:41:08,758 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 21:41:09,125 INFO L130 PetriNetUnfolder]: 2053/3295 cut-off events. [2022-12-13 21:41:09,125 INFO L131 PetriNetUnfolder]: For 2883/2883 co-relation queries the response was YES. [2022-12-13 21:41:09,129 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9293 conditions, 3295 events. 2053/3295 cut-off events. For 2883/2883 co-relation queries the response was YES. Maximal size of possible extension queue 163. Compared 18660 event pairs, 269 based on Foata normal form. 1/3295 useless extension candidates. Maximal degree in co-relation 9283. Up to 1605 conditions per place. [2022-12-13 21:41:09,135 INFO L137 encePairwiseOnDemand]: 286/289 looper letters, 90 selfloop transitions, 2 changer transitions 0/95 dead transitions. [2022-12-13 21:41:09,135 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 95 transitions, 598 flow [2022-12-13 21:41:09,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 21:41:09,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 21:41:09,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 582 transitions. [2022-12-13 21:41:09,137 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5034602076124568 [2022-12-13 21:41:09,137 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 582 transitions. [2022-12-13 21:41:09,137 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 582 transitions. [2022-12-13 21:41:09,137 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 21:41:09,137 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 582 transitions. [2022-12-13 21:41:09,138 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 145.5) internal successors, (582), 4 states have internal predecessors, (582), 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 21:41:09,139 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 289.0) internal successors, (1445), 5 states have internal predecessors, (1445), 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 21:41:09,139 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 289.0) internal successors, (1445), 5 states have internal predecessors, (1445), 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 21:41:09,139 INFO L175 Difference]: Start difference. First operand has 56 places, 44 transitions, 182 flow. Second operand 4 states and 582 transitions. [2022-12-13 21:41:09,139 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 95 transitions, 598 flow [2022-12-13 21:41:09,156 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 95 transitions, 585 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-13 21:41:09,157 INFO L231 Difference]: Finished difference. Result has 58 places, 45 transitions, 189 flow [2022-12-13 21:41:09,158 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=289, PETRI_DIFFERENCE_MINUEND_FLOW=176, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=189, PETRI_PLACES=58, PETRI_TRANSITIONS=45} [2022-12-13 21:41:09,158 INFO L288 CegarLoopForPetriNet]: 53 programPoint places, 5 predicate places. [2022-12-13 21:41:09,158 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 45 transitions, 189 flow [2022-12-13 21:41:09,159 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 137.25) internal successors, (549), 4 states have internal predecessors, (549), 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 21:41:09,159 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 21:41:09,159 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:41:09,167 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d430da05-79a9-44cf-946c-d6a4166d8c9d/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-12-13 21:41:09,359 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d430da05-79a9-44cf-946c-d6a4166d8c9d/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 21:41:09,360 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-12-13 21:41:09,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:41:09,362 INFO L85 PathProgramCache]: Analyzing trace with hash 729514156, now seen corresponding path program 3 times [2022-12-13 21:41:09,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 21:41:09,365 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1478868061] [2022-12-13 21:41:09,365 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 21:41:09,366 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 21:41:09,366 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d430da05-79a9-44cf-946c-d6a4166d8c9d/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 21:41:09,369 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d430da05-79a9-44cf-946c-d6a4166d8c9d/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 21:41:09,372 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d430da05-79a9-44cf-946c-d6a4166d8c9d/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-12-13 21:41:09,480 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-12-13 21:41:09,480 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 21:41:09,487 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-13 21:41:09,488 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 21:41:09,501 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 21:41:09,501 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 21:41:09,501 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 21:41:09,502 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1478868061] [2022-12-13 21:41:09,502 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1478868061] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:41:09,502 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:41:09,502 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 21:41:09,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067214500] [2022-12-13 21:41:09,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:41:09,502 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 21:41:09,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 21:41:09,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 21:41:09,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 21:41:09,507 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 289 [2022-12-13 21:41:09,508 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 45 transitions, 189 flow. Second operand has 3 states, 3 states have (on average 140.33333333333334) internal successors, (421), 3 states have internal predecessors, (421), 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 21:41:09,508 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 21:41:09,508 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 289 [2022-12-13 21:41:09,508 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 21:41:10,143 INFO L130 PetriNetUnfolder]: 3274/5118 cut-off events. [2022-12-13 21:41:10,143 INFO L131 PetriNetUnfolder]: For 4450/4450 co-relation queries the response was YES. [2022-12-13 21:41:10,149 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14944 conditions, 5118 events. 3274/5118 cut-off events. For 4450/4450 co-relation queries the response was YES. Maximal size of possible extension queue 272. Compared 30899 event pairs, 1324 based on Foata normal form. 1/5018 useless extension candidates. Maximal degree in co-relation 14932. Up to 2840 conditions per place. [2022-12-13 21:41:10,159 INFO L137 encePairwiseOnDemand]: 286/289 looper letters, 75 selfloop transitions, 2 changer transitions 0/81 dead transitions. [2022-12-13 21:41:10,159 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 81 transitions, 500 flow [2022-12-13 21:41:10,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 21:41:10,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 21:41:10,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 446 transitions. [2022-12-13 21:41:10,160 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5144175317185697 [2022-12-13 21:41:10,161 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 446 transitions. [2022-12-13 21:41:10,161 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 446 transitions. [2022-12-13 21:41:10,161 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 21:41:10,161 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 446 transitions. [2022-12-13 21:41:10,161 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 148.66666666666666) internal successors, (446), 3 states have internal predecessors, (446), 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 21:41:10,162 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 289.0) internal successors, (1156), 4 states have internal predecessors, (1156), 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 21:41:10,162 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 289.0) internal successors, (1156), 4 states have internal predecessors, (1156), 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 21:41:10,162 INFO L175 Difference]: Start difference. First operand has 58 places, 45 transitions, 189 flow. Second operand 3 states and 446 transitions. [2022-12-13 21:41:10,163 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 81 transitions, 500 flow [2022-12-13 21:41:10,220 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 81 transitions, 498 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 21:41:10,221 INFO L231 Difference]: Finished difference. Result has 60 places, 46 transitions, 200 flow [2022-12-13 21:41:10,221 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=289, PETRI_DIFFERENCE_MINUEND_FLOW=188, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=200, PETRI_PLACES=60, PETRI_TRANSITIONS=46} [2022-12-13 21:41:10,221 INFO L288 CegarLoopForPetriNet]: 53 programPoint places, 7 predicate places. [2022-12-13 21:41:10,221 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 46 transitions, 200 flow [2022-12-13 21:41:10,221 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 140.33333333333334) internal successors, (421), 3 states have internal predecessors, (421), 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 21:41:10,221 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 21:41:10,221 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:41:10,229 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d430da05-79a9-44cf-946c-d6a4166d8c9d/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2022-12-13 21:41:10,422 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d430da05-79a9-44cf-946c-d6a4166d8c9d/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 21:41:10,423 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-12-13 21:41:10,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:41:10,424 INFO L85 PathProgramCache]: Analyzing trace with hash 930903210, now seen corresponding path program 4 times [2022-12-13 21:41:10,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 21:41:10,426 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1316334712] [2022-12-13 21:41:10,426 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-13 21:41:10,426 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 21:41:10,427 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d430da05-79a9-44cf-946c-d6a4166d8c9d/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 21:41:10,429 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d430da05-79a9-44cf-946c-d6a4166d8c9d/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 21:41:10,433 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d430da05-79a9-44cf-946c-d6a4166d8c9d/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-12-13 21:41:10,514 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-13 21:41:10,514 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 21:41:10,519 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-13 21:41:10,521 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 21:41:10,534 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 21:41:10,534 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 21:41:10,534 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 21:41:10,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1316334712] [2022-12-13 21:41:10,534 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1316334712] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:41:10,534 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:41:10,534 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 21:41:10,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302836326] [2022-12-13 21:41:10,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:41:10,535 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 21:41:10,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 21:41:10,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 21:41:10,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 21:41:10,542 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 289 [2022-12-13 21:41:10,542 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 46 transitions, 200 flow. Second operand has 3 states, 3 states have (on average 140.33333333333334) internal successors, (421), 3 states have internal predecessors, (421), 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 21:41:10,542 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 21:41:10,543 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 289 [2022-12-13 21:41:10,543 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 21:41:11,248 INFO L130 PetriNetUnfolder]: 5141/8085 cut-off events. [2022-12-13 21:41:11,248 INFO L131 PetriNetUnfolder]: For 7164/7164 co-relation queries the response was YES. [2022-12-13 21:41:11,259 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24168 conditions, 8085 events. 5141/8085 cut-off events. For 7164/7164 co-relation queries the response was YES. Maximal size of possible extension queue 431. Compared 51974 event pairs, 1700 based on Foata normal form. 1/8013 useless extension candidates. Maximal degree in co-relation 24155. Up to 4126 conditions per place. [2022-12-13 21:41:11,276 INFO L137 encePairwiseOnDemand]: 286/289 looper letters, 73 selfloop transitions, 2 changer transitions 0/79 dead transitions. [2022-12-13 21:41:11,276 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 79 transitions, 499 flow [2022-12-13 21:41:11,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 21:41:11,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 21:41:11,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 442 transitions. [2022-12-13 21:41:11,278 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5098039215686274 [2022-12-13 21:41:11,278 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 442 transitions. [2022-12-13 21:41:11,278 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 442 transitions. [2022-12-13 21:41:11,278 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 21:41:11,278 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 442 transitions. [2022-12-13 21:41:11,279 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 147.33333333333334) internal successors, (442), 3 states have internal predecessors, (442), 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 21:41:11,279 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 289.0) internal successors, (1156), 4 states have internal predecessors, (1156), 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 21:41:11,280 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 289.0) internal successors, (1156), 4 states have internal predecessors, (1156), 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 21:41:11,280 INFO L175 Difference]: Start difference. First operand has 60 places, 46 transitions, 200 flow. Second operand 3 states and 442 transitions. [2022-12-13 21:41:11,280 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 79 transitions, 499 flow [2022-12-13 21:41:11,399 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 79 transitions, 496 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 21:41:11,400 INFO L231 Difference]: Finished difference. Result has 62 places, 47 transitions, 210 flow [2022-12-13 21:41:11,400 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=289, PETRI_DIFFERENCE_MINUEND_FLOW=198, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=210, PETRI_PLACES=62, PETRI_TRANSITIONS=47} [2022-12-13 21:41:11,400 INFO L288 CegarLoopForPetriNet]: 53 programPoint places, 9 predicate places. [2022-12-13 21:41:11,401 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 47 transitions, 210 flow [2022-12-13 21:41:11,401 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 140.33333333333334) internal successors, (421), 3 states have internal predecessors, (421), 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 21:41:11,401 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 21:41:11,401 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:41:11,409 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d430da05-79a9-44cf-946c-d6a4166d8c9d/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2022-12-13 21:41:11,601 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d430da05-79a9-44cf-946c-d6a4166d8c9d/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 21:41:11,603 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-12-13 21:41:11,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:41:11,604 INFO L85 PathProgramCache]: Analyzing trace with hash 689959038, now seen corresponding path program 5 times [2022-12-13 21:41:11,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 21:41:11,605 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [325219833] [2022-12-13 21:41:11,605 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-13 21:41:11,606 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 21:41:11,606 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d430da05-79a9-44cf-946c-d6a4166d8c9d/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 21:41:11,608 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d430da05-79a9-44cf-946c-d6a4166d8c9d/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 21:41:11,611 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d430da05-79a9-44cf-946c-d6a4166d8c9d/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-12-13 21:41:11,758 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-12-13 21:41:11,758 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-12-13 21:41:11,758 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 21:41:11,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 21:41:11,895 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-12-13 21:41:11,895 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 21:41:11,895 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (15 of 16 remaining) [2022-12-13 21:41:11,897 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (14 of 16 remaining) [2022-12-13 21:41:11,897 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2022-12-13 21:41:11,897 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining) [2022-12-13 21:41:11,897 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2022-12-13 21:41:11,897 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2022-12-13 21:41:11,897 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2022-12-13 21:41:11,897 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2022-12-13 21:41:11,897 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2022-12-13 21:41:11,898 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2022-12-13 21:41:11,898 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (5 of 16 remaining) [2022-12-13 21:41:11,898 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 16 remaining) [2022-12-13 21:41:11,898 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 16 remaining) [2022-12-13 21:41:11,898 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 16 remaining) [2022-12-13 21:41:11,898 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 16 remaining) [2022-12-13 21:41:11,898 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2022-12-13 21:41:11,921 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d430da05-79a9-44cf-946c-d6a4166d8c9d/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2022-12-13 21:41:12,099 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d430da05-79a9-44cf-946c-d6a4166d8c9d/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 21:41:12,100 INFO L445 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1, 1, 1] [2022-12-13 21:41:12,115 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 21:41:12,116 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 21:41:12,187 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 09:41:12 BasicIcfg [2022-12-13 21:41:12,187 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 21:41:12,188 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-13 21:41:12,188 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-13 21:41:12,188 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-13 21:41:12,188 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 09:40:53" (3/4) ... [2022-12-13 21:41:12,190 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-12-13 21:41:12,190 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-13 21:41:12,191 INFO L158 Benchmark]: Toolchain (without parser) took 20057.48ms. Allocated memory was 62.9MB in the beginning and 1.1GB in the end (delta: 1.0GB). Free memory was 32.1MB in the beginning and 517.4MB in the end (delta: -485.4MB). Peak memory consumption was 530.1MB. Max. memory is 16.1GB. [2022-12-13 21:41:12,191 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 62.9MB. Free memory is still 41.3MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 21:41:12,191 INFO L158 Benchmark]: CACSL2BoogieTranslator took 483.65ms. Allocated memory was 62.9MB in the beginning and 77.6MB in the end (delta: 14.7MB). Free memory was 31.7MB in the beginning and 55.1MB in the end (delta: -23.4MB). Peak memory consumption was 14.8MB. Max. memory is 16.1GB. [2022-12-13 21:41:12,192 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.61ms. Allocated memory is still 77.6MB. Free memory was 55.1MB in the beginning and 52.4MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 21:41:12,192 INFO L158 Benchmark]: Boogie Preprocessor took 31.66ms. Allocated memory is still 77.6MB. Free memory was 52.4MB in the beginning and 50.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 21:41:12,192 INFO L158 Benchmark]: RCFGBuilder took 636.48ms. Allocated memory is still 77.6MB. Free memory was 50.2MB in the beginning and 47.7MB in the end (delta: 2.6MB). Peak memory consumption was 22.6MB. Max. memory is 16.1GB. [2022-12-13 21:41:12,192 INFO L158 Benchmark]: TraceAbstraction took 18855.33ms. Allocated memory was 77.6MB in the beginning and 1.1GB in the end (delta: 1.0GB). Free memory was 46.8MB in the beginning and 517.4MB in the end (delta: -470.6MB). Peak memory consumption was 530.4MB. Max. memory is 16.1GB. [2022-12-13 21:41:12,193 INFO L158 Benchmark]: Witness Printer took 2.66ms. Allocated memory is still 1.1GB. Free memory is still 517.4MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 21:41:12,195 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 62.9MB. Free memory is still 41.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 483.65ms. Allocated memory was 62.9MB in the beginning and 77.6MB in the end (delta: 14.7MB). Free memory was 31.7MB in the beginning and 55.1MB in the end (delta: -23.4MB). Peak memory consumption was 14.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.61ms. Allocated memory is still 77.6MB. Free memory was 55.1MB in the beginning and 52.4MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 31.66ms. Allocated memory is still 77.6MB. Free memory was 52.4MB in the beginning and 50.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 636.48ms. Allocated memory is still 77.6MB. Free memory was 50.2MB in the beginning and 47.7MB in the end (delta: 2.6MB). Peak memory consumption was 22.6MB. Max. memory is 16.1GB. * TraceAbstraction took 18855.33ms. Allocated memory was 77.6MB in the beginning and 1.1GB in the end (delta: 1.0GB). Free memory was 46.8MB in the beginning and 517.4MB in the end (delta: -470.6MB). Peak memory consumption was 530.4MB. Max. memory is 16.1GB. * Witness Printer took 2.66ms. Allocated memory is still 1.1GB. Free memory is still 517.4MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.5s, 157 PlacesBefore, 53 PlacesAfterwards, 146 TransitionsBefore, 41 TransitionsAfterwards, 3764 CoEnabledTransitionPairs, 7 FixpointIterations, 53 TrivialSequentialCompositions, 77 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 1 ChoiceCompositions, 139 TotalNumberOfCompositions, 11059 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4982, independent: 4732, independent conditional: 0, independent unconditional: 4732, dependent: 250, dependent conditional: 0, dependent unconditional: 250, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 2016, independent: 1969, independent conditional: 0, independent unconditional: 1969, dependent: 47, dependent conditional: 0, dependent unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 4982, independent: 2763, independent conditional: 0, independent unconditional: 2763, dependent: 203, dependent conditional: 0, dependent unconditional: 203, unknown: 2016, unknown conditional: 0, unknown unconditional: 2016] , Statistics on independence cache: Total cache size (in pairs): 204, Positive cache size: 184, Positive conditional cache size: 0, Positive unconditional cache size: 184, Negative cache size: 20, Negative conditional cache size: 0, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int __unbuffered_p3_EBX = 0; [L718] 0 int a = 0; [L719] 0 _Bool a$flush_delayed; [L720] 0 int a$mem_tmp; [L721] 0 _Bool a$r_buff0_thd0; [L722] 0 _Bool a$r_buff0_thd1; [L723] 0 _Bool a$r_buff0_thd2; [L724] 0 _Bool a$r_buff0_thd3; [L725] 0 _Bool a$r_buff0_thd4; [L726] 0 _Bool a$r_buff1_thd0; [L727] 0 _Bool a$r_buff1_thd1; [L728] 0 _Bool a$r_buff1_thd2; [L729] 0 _Bool a$r_buff1_thd3; [L730] 0 _Bool a$r_buff1_thd4; [L731] 0 _Bool a$read_delayed; [L732] 0 int *a$read_delayed_var; [L733] 0 int a$w_buff0; [L734] 0 _Bool a$w_buff0_used; [L735] 0 int a$w_buff1; [L736] 0 _Bool a$w_buff1_used; [L737] 0 _Bool main$tmp_guard0; [L738] 0 _Bool main$tmp_guard1; [L740] 0 int x = 0; [L742] 0 int y = 0; [L744] 0 int z = 0; [L745] 0 _Bool weak$$choice0; [L746] 0 _Bool weak$$choice2; [L864] 0 pthread_t t713; [L865] FCALL, FORK 0 pthread_create(&t713, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t713, ((void *)0), P0, ((void *)0))=-1, t713={-16:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L750] 1 a$w_buff1 = a$w_buff0 [L751] 1 a$w_buff0 = 1 [L752] 1 a$w_buff1_used = a$w_buff0_used [L753] 1 a$w_buff0_used = (_Bool)1 [L754] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L754] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L755] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L756] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L757] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L758] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L759] 1 a$r_buff1_thd4 = a$r_buff0_thd4 [L760] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L866] 0 pthread_t t714; [L867] FCALL, FORK 0 pthread_create(&t714, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t714, ((void *)0), P1, ((void *)0))=0, t713={-16:0}, t714={-12:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L763] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L868] 0 pthread_t t715; [L780] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L783] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L786] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L787] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L788] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L789] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L790] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L869] FCALL, FORK 0 pthread_create(&t715, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t715, ((void *)0), P2, ((void *)0))=1, t713={-16:0}, t714={-12:0}, t715={-2:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L870] 0 pthread_t t716; [L800] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L871] FCALL, FORK 0 pthread_create(&t716, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t716, ((void *)0), P3, ((void *)0))=2, t713={-16:0}, t714={-12:0}, t715={-2:0}, t716={-4:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L803] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L806] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L807] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L808] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L809] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L810] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L820] 4 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2] [L823] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2] [L826] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L827] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L828] 4 a$flush_delayed = weak$$choice2 [L829] 4 a$mem_tmp = a [L830] 4 a = !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L831] 4 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L832] 4 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L833] 4 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L834] 4 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L835] 4 a$r_buff0_thd4 = weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L836] 4 a$r_buff1_thd4 = weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L837] 4 __unbuffered_p3_EBX = a [L838] 4 a = a$flush_delayed ? a$mem_tmp : a [L839] 4 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=0, x=2, y=1, z=2] [L766] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L767] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L768] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L769] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L770] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=0, x=2, y=1, z=2] [L773] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L775] 1 return 0; [L793] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L795] 2 return 0; [L842] 4 a = a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L843] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L844] 4 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L845] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L846] 4 a$r_buff1_thd4 = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=0, x=2, y=1, z=2] [L813] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L815] 3 return 0; [L849] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L851] 4 return 0; [L873] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L875] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L875] RET 0 assume_abort_if_not(main$tmp_guard0) [L877] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L878] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L879] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L880] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L881] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t713={-16:0}, t714={-12:0}, t715={-2:0}, t716={-4:0}, weak$$choice0=2, weak$$choice2=0, x=2, y=1, z=2] [L884] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 2 && __unbuffered_p3_EBX == 0) [L886] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=0, x=2, y=1, z=2] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 862]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 865]: 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: 869]: 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: 867]: 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: 871]: 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 9 procedures, 187 locations, 16 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: 18.7s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 7.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.6s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 463 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 391 mSDsluCounter, 121 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 94 mSDsCounter, 68 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1844 IncrementalHoareTripleChecker+Invalid, 1912 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 68 mSolverCounterUnsat, 27 mSDtfsCounter, 1844 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 182 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=228occurred in iteration=5, InterpolantAutomatonStates: 48, 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.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 212 NumberOfCodeBlocks, 212 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 174 ConstructedInterpolants, 0 QuantifiedInterpolants, 740 SizeOfPredicates, 17 NumberOfNonLiveVariables, 1502 ConjunctsInSsa, 65 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-12-13 21:41:12,212 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d430da05-79a9-44cf-946c-d6a4166d8c9d/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample