./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/mix030_power.oepc_pso.oepc_rmo.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 38b53e6a 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_e025b304-97e6-42d7-a3ce-aa44b34f6f9b/bin/uautomizer-ZsLfNo2U6R/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e025b304-97e6-42d7-a3ce-aa44b34f6f9b/bin/uautomizer-ZsLfNo2U6R/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e025b304-97e6-42d7-a3ce-aa44b34f6f9b/bin/uautomizer-ZsLfNo2U6R/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e025b304-97e6-42d7-a3ce-aa44b34f6f9b/bin/uautomizer-ZsLfNo2U6R/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix030_power.oepc_pso.oepc_rmo.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e025b304-97e6-42d7-a3ce-aa44b34f6f9b/bin/uautomizer-ZsLfNo2U6R/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e025b304-97e6-42d7-a3ce-aa44b34f6f9b/bin/uautomizer-ZsLfNo2U6R --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 a6d0914923ba77f2cbf67d52dc6ec759519359118cb2f8fd5f254f95bf2b938e --- 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-38b53e6 [2022-11-25 16:57:35,457 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 16:57:35,460 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 16:57:35,483 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 16:57:35,483 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 16:57:35,485 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 16:57:35,486 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 16:57:35,488 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 16:57:35,490 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 16:57:35,491 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 16:57:35,492 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 16:57:35,493 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 16:57:35,493 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 16:57:35,499 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 16:57:35,505 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 16:57:35,506 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 16:57:35,509 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 16:57:35,510 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 16:57:35,512 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 16:57:35,517 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 16:57:35,521 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 16:57:35,523 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 16:57:35,524 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 16:57:35,525 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 16:57:35,529 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 16:57:35,529 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 16:57:35,529 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 16:57:35,531 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 16:57:35,531 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 16:57:35,532 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 16:57:35,533 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 16:57:35,533 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 16:57:35,534 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 16:57:35,539 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 16:57:35,540 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 16:57:35,541 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 16:57:35,542 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 16:57:35,543 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 16:57:35,543 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 16:57:35,545 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 16:57:35,547 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 16:57:35,548 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e025b304-97e6-42d7-a3ce-aa44b34f6f9b/bin/uautomizer-ZsLfNo2U6R/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-11-25 16:57:35,596 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 16:57:35,600 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 16:57:35,601 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 16:57:35,601 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 16:57:35,602 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 16:57:35,602 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 16:57:35,603 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 16:57:35,603 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 16:57:35,604 INFO L138 SettingsManager]: * Use SBE=true [2022-11-25 16:57:35,604 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 16:57:35,605 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 16:57:35,605 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-25 16:57:35,606 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 16:57:35,606 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 16:57:35,606 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 16:57:35,606 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-25 16:57:35,607 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-25 16:57:35,607 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-25 16:57:35,607 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 16:57:35,607 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-25 16:57:35,608 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 16:57:35,608 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 16:57:35,608 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 16:57:35,608 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-25 16:57:35,609 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 16:57:35,609 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 16:57:35,609 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 16:57:35,609 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 16:57:35,610 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-25 16:57:35,610 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-25 16:57:35,610 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-25 16:57:35,610 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-25 16:57:35,611 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-25 16:57:35,611 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_e025b304-97e6-42d7-a3ce-aa44b34f6f9b/bin/uautomizer-ZsLfNo2U6R/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_e025b304-97e6-42d7-a3ce-aa44b34f6f9b/bin/uautomizer-ZsLfNo2U6R 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 -> a6d0914923ba77f2cbf67d52dc6ec759519359118cb2f8fd5f254f95bf2b938e [2022-11-25 16:57:35,839 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 16:57:35,879 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 16:57:35,882 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 16:57:35,883 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 16:57:35,883 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 16:57:35,885 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e025b304-97e6-42d7-a3ce-aa44b34f6f9b/bin/uautomizer-ZsLfNo2U6R/../../sv-benchmarks/c/pthread-wmm/mix030_power.oepc_pso.oepc_rmo.oepc.i [2022-11-25 16:57:39,034 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 16:57:39,329 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 16:57:39,334 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e025b304-97e6-42d7-a3ce-aa44b34f6f9b/sv-benchmarks/c/pthread-wmm/mix030_power.oepc_pso.oepc_rmo.oepc.i [2022-11-25 16:57:39,359 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e025b304-97e6-42d7-a3ce-aa44b34f6f9b/bin/uautomizer-ZsLfNo2U6R/data/1e5199569/13f3edc10d004d26a9ae546d64fb9457/FLAG383072b2f [2022-11-25 16:57:39,380 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e025b304-97e6-42d7-a3ce-aa44b34f6f9b/bin/uautomizer-ZsLfNo2U6R/data/1e5199569/13f3edc10d004d26a9ae546d64fb9457 [2022-11-25 16:57:39,382 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 16:57:39,384 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 16:57:39,387 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 16:57:39,387 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 16:57:39,391 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 16:57:39,393 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 04:57:39" (1/1) ... [2022-11-25 16:57:39,395 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52c3e33b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:57:39, skipping insertion in model container [2022-11-25 16:57:39,395 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 04:57:39" (1/1) ... [2022-11-25 16:57:39,402 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 16:57:39,458 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 16:57:39,666 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_e025b304-97e6-42d7-a3ce-aa44b34f6f9b/sv-benchmarks/c/pthread-wmm/mix030_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2022-11-25 16:57:39,822 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:57:39,824 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:57:39,825 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:57:39,825 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:57:39,825 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:57:39,829 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:57:39,829 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:57:39,830 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:57:39,831 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:57:39,831 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:57:39,832 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:57:39,832 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:57:39,832 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:57:39,836 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:57:39,836 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:57:39,836 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:57:39,837 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:57:39,838 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:57:39,838 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:57:39,838 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:57:39,839 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:57:39,842 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:57:39,843 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:57:39,843 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:57:39,844 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:57:39,845 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:57:39,845 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:57:39,845 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:57:39,846 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:57:39,855 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:57:39,855 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:57:39,858 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:57:39,859 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:57:39,859 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:57:39,866 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:57:39,867 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:57:39,867 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:57:39,870 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:57:39,871 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:57:39,872 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:57:39,873 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 16:57:39,883 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 16:57:39,895 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_e025b304-97e6-42d7-a3ce-aa44b34f6f9b/sv-benchmarks/c/pthread-wmm/mix030_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2022-11-25 16:57:39,934 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:57:39,935 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:57:39,936 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:57:39,937 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:57:39,937 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:57:39,940 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:57:39,940 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:57:39,941 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:57:39,942 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:57:39,942 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:57:39,942 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:57:39,943 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:57:39,943 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:57:39,946 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:57:39,946 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:57:39,947 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:57:39,947 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:57:39,948 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:57:39,948 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:57:39,948 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:57:39,949 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:57:39,951 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:57:39,952 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:57:39,952 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:57:39,953 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:57:39,953 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:57:39,954 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:57:39,954 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:57:39,954 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:57:39,962 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:57:39,962 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:57:39,965 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:57:39,965 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:57:39,966 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:57:39,970 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:57:39,971 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:57:39,974 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:57:39,976 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:57:39,983 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:57:39,984 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:57:39,985 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 16:57:40,036 INFO L208 MainTranslator]: Completed translation [2022-11-25 16:57:40,037 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:57:40 WrapperNode [2022-11-25 16:57:40,037 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 16:57:40,038 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 16:57:40,040 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 16:57:40,040 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 16:57:40,048 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:57:40" (1/1) ... [2022-11-25 16:57:40,091 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:57:40" (1/1) ... [2022-11-25 16:57:40,135 INFO L138 Inliner]: procedures = 177, calls = 69, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 143 [2022-11-25 16:57:40,135 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 16:57:40,136 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 16:57:40,136 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 16:57:40,136 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 16:57:40,152 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:57:40" (1/1) ... [2022-11-25 16:57:40,153 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:57:40" (1/1) ... [2022-11-25 16:57:40,167 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:57:40" (1/1) ... [2022-11-25 16:57:40,171 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:57:40" (1/1) ... [2022-11-25 16:57:40,178 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:57:40" (1/1) ... [2022-11-25 16:57:40,196 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:57:40" (1/1) ... [2022-11-25 16:57:40,198 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:57:40" (1/1) ... [2022-11-25 16:57:40,200 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:57:40" (1/1) ... [2022-11-25 16:57:40,203 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 16:57:40,204 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 16:57:40,204 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 16:57:40,205 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 16:57:40,205 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:57:40" (1/1) ... [2022-11-25 16:57:40,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 16:57:40,232 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e025b304-97e6-42d7-a3ce-aa44b34f6f9b/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:57:40,248 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e025b304-97e6-42d7-a3ce-aa44b34f6f9b/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 16:57:40,279 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e025b304-97e6-42d7-a3ce-aa44b34f6f9b/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 16:57:40,299 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-25 16:57:40,299 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-25 16:57:40,299 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 16:57:40,300 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-25 16:57:40,300 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-25 16:57:40,301 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-25 16:57:40,301 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-25 16:57:40,301 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-25 16:57:40,301 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-25 16:57:40,301 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-25 16:57:40,302 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-25 16:57:40,302 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-11-25 16:57:40,302 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-11-25 16:57:40,302 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-25 16:57:40,302 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-25 16:57:40,303 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 16:57:40,303 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 16:57:40,304 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-25 16:57:40,463 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 16:57:40,465 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 16:57:40,922 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 16:57:41,119 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 16:57:41,119 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-25 16:57:41,122 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 04:57:41 BoogieIcfgContainer [2022-11-25 16:57:41,122 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 16:57:41,125 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 16:57:41,125 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 16:57:41,129 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 16:57:41,129 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 04:57:39" (1/3) ... [2022-11-25 16:57:41,130 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bce97cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 04:57:41, skipping insertion in model container [2022-11-25 16:57:41,130 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:57:40" (2/3) ... [2022-11-25 16:57:41,131 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bce97cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 04:57:41, skipping insertion in model container [2022-11-25 16:57:41,131 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 04:57:41" (3/3) ... [2022-11-25 16:57:41,132 INFO L112 eAbstractionObserver]: Analyzing ICFG mix030_power.oepc_pso.oepc_rmo.oepc.i [2022-11-25 16:57:41,153 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 16:57:41,154 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2022-11-25 16:57:41,154 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-25 16:57:41,261 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-25 16:57:41,314 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 159 places, 148 transitions, 316 flow [2022-11-25 16:57:41,381 INFO L130 PetriNetUnfolder]: 2/144 cut-off events. [2022-11-25 16:57:41,381 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 16:57:41,387 INFO L83 FinitePrefix]: Finished finitePrefix Result has 157 conditions, 144 events. 2/144 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 103 event pairs, 0 based on Foata normal form. 0/131 useless extension candidates. Maximal degree in co-relation 101. Up to 2 conditions per place. [2022-11-25 16:57:41,388 INFO L82 GeneralOperation]: Start removeDead. Operand has 159 places, 148 transitions, 316 flow [2022-11-25 16:57:41,393 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 155 places, 144 transitions, 300 flow [2022-11-25 16:57:41,397 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-25 16:57:41,413 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 155 places, 144 transitions, 300 flow [2022-11-25 16:57:41,416 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 155 places, 144 transitions, 300 flow [2022-11-25 16:57:41,416 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 155 places, 144 transitions, 300 flow [2022-11-25 16:57:41,456 INFO L130 PetriNetUnfolder]: 2/144 cut-off events. [2022-11-25 16:57:41,456 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 16:57:41,457 INFO L83 FinitePrefix]: Finished finitePrefix Result has 157 conditions, 144 events. 2/144 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 103 event pairs, 0 based on Foata normal form. 0/131 useless extension candidates. Maximal degree in co-relation 101. Up to 2 conditions per place. [2022-11-25 16:57:41,460 INFO L119 LiptonReduction]: Number of co-enabled transitions 3764 [2022-11-25 16:57:47,778 INFO L134 LiptonReduction]: Checked pairs total: 10926 [2022-11-25 16:57:47,779 INFO L136 LiptonReduction]: Total number of compositions: 142 [2022-11-25 16:57:47,806 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 16:57:47,815 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;@8f027d0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 16:57:47,815 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2022-11-25 16:57:47,822 INFO L130 PetriNetUnfolder]: 0/1 cut-off events. [2022-11-25 16:57:47,822 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 16:57:47,822 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 16:57:47,823 INFO L209 CegarLoopForPetriNet]: trace histogram [1] [2022-11-25 16:57:47,824 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-11-25 16:57:47,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:57:47,830 INFO L85 PathProgramCache]: Analyzing trace with hash 623, now seen corresponding path program 1 times [2022-11-25 16:57:47,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:57:47,842 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110433979] [2022-11-25 16:57:47,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:57:47,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:57:47,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:57:47,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:57:47,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:57:47,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110433979] [2022-11-25 16:57:47,993 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110433979] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:57:47,994 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:57:47,994 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-25 16:57:47,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325002454] [2022-11-25 16:57:47,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:57:48,004 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-25 16:57:48,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:57:48,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-25 16:57:48,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-25 16:57:48,037 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 290 [2022-11-25 16:57:48,043 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 41 transitions, 94 flow. Second operand has 2 states, 2 states have (on average 133.5) internal successors, (267), 2 states have internal predecessors, (267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:57:48,044 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 16:57:48,045 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 290 [2022-11-25 16:57:48,046 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 16:57:50,181 INFO L130 PetriNetUnfolder]: 8719/11825 cut-off events. [2022-11-25 16:57:50,182 INFO L131 PetriNetUnfolder]: For 74/74 co-relation queries the response was YES. [2022-11-25 16:57:50,212 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 61386 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-11-25 16:57:50,273 INFO L137 encePairwiseOnDemand]: 281/290 looper letters, 28 selfloop transitions, 0 changer transitions 0/32 dead transitions. [2022-11-25 16:57:50,274 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 32 transitions, 132 flow [2022-11-25 16:57:50,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 16:57:50,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-11-25 16:57:50,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 303 transitions. [2022-11-25 16:57:50,294 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5224137931034483 [2022-11-25 16:57:50,295 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 303 transitions. [2022-11-25 16:57:50,295 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 303 transitions. [2022-11-25 16:57:50,299 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 16:57:50,301 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 303 transitions. [2022-11-25 16:57:50,308 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 151.5) internal successors, (303), 2 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:57:50,313 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 290.0) internal successors, (870), 3 states have internal predecessors, (870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:57:50,314 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 290.0) internal successors, (870), 3 states have internal predecessors, (870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:57:50,316 INFO L175 Difference]: Start difference. First operand has 53 places, 41 transitions, 94 flow. Second operand 2 states and 303 transitions. [2022-11-25 16:57:50,317 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 32 transitions, 132 flow [2022-11-25 16:57:50,324 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 32 transitions, 128 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-25 16:57:50,326 INFO L231 Difference]: Finished difference. Result has 42 places, 32 transitions, 72 flow [2022-11-25 16:57:50,328 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=290, 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-11-25 16:57:50,333 INFO L288 CegarLoopForPetriNet]: 53 programPoint places, -11 predicate places. [2022-11-25 16:57:50,333 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 32 transitions, 72 flow [2022-11-25 16:57:50,333 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 133.5) internal successors, (267), 2 states have internal predecessors, (267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:57:50,334 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 16:57:50,334 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-11-25 16:57:50,334 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-25 16:57:50,334 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-25 16:57:50,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:57:50,344 INFO L85 PathProgramCache]: Analyzing trace with hash 612132, now seen corresponding path program 1 times [2022-11-25 16:57:50,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:57:50,345 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258600906] [2022-11-25 16:57:50,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:57:50,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:57:50,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:57:50,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:57:50,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:57:50,710 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258600906] [2022-11-25 16:57:50,710 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [258600906] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:57:50,711 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:57:50,711 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-25 16:57:50,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192140739] [2022-11-25 16:57:50,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:57:50,713 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 16:57:50,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:57:50,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 16:57:50,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 16:57:50,720 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 290 [2022-11-25 16:57:50,721 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 32 transitions, 72 flow. Second operand has 3 states, 3 states have (on average 133.0) internal successors, (399), 3 states have internal predecessors, (399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:57:50,722 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 16:57:50,722 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 290 [2022-11-25 16:57:50,722 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 16:57:52,358 INFO L130 PetriNetUnfolder]: 6855/9353 cut-off events. [2022-11-25 16:57:52,358 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 16:57:52,380 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18790 conditions, 9353 events. 6855/9353 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 435. Compared 46892 event pairs, 3527 based on Foata normal form. 0/8695 useless extension candidates. Maximal degree in co-relation 18787. Up to 7399 conditions per place. [2022-11-25 16:57:52,427 INFO L137 encePairwiseOnDemand]: 287/290 looper letters, 45 selfloop transitions, 2 changer transitions 2/53 dead transitions. [2022-11-25 16:57:52,427 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 53 transitions, 218 flow [2022-11-25 16:57:52,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 16:57:52,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 16:57:52,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 446 transitions. [2022-11-25 16:57:52,431 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5126436781609195 [2022-11-25 16:57:52,431 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 446 transitions. [2022-11-25 16:57:52,431 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 446 transitions. [2022-11-25 16:57:52,432 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 16:57:52,432 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 446 transitions. [2022-11-25 16:57:52,433 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-11-25 16:57:52,437 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 290.0) internal successors, (1160), 4 states have internal predecessors, (1160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:57:52,438 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 290.0) internal successors, (1160), 4 states have internal predecessors, (1160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:57:52,438 INFO L175 Difference]: Start difference. First operand has 42 places, 32 transitions, 72 flow. Second operand 3 states and 446 transitions. [2022-11-25 16:57:52,439 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 53 transitions, 218 flow [2022-11-25 16:57:52,439 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 53 transitions, 218 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-25 16:57:52,440 INFO L231 Difference]: Finished difference. Result has 43 places, 30 transitions, 72 flow [2022-11-25 16:57:52,441 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=290, 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-11-25 16:57:52,442 INFO L288 CegarLoopForPetriNet]: 53 programPoint places, -10 predicate places. [2022-11-25 16:57:52,442 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 30 transitions, 72 flow [2022-11-25 16:57:52,443 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 133.0) internal successors, (399), 3 states have internal predecessors, (399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:57:52,444 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 16:57:52,444 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:57:52,448 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-25 16:57:52,449 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-11-25 16:57:52,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:57:52,450 INFO L85 PathProgramCache]: Analyzing trace with hash 687200626, now seen corresponding path program 1 times [2022-11-25 16:57:52,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:57:52,450 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416263274] [2022-11-25 16:57:52,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:57:52,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:57:52,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:57:52,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:57:52,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:57:52,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416263274] [2022-11-25 16:57:52,856 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416263274] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:57:52,857 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:57:52,857 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-25 16:57:52,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956045089] [2022-11-25 16:57:52,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:57:52,858 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 16:57:52,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:57:52,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 16:57:52,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 16:57:52,883 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 290 [2022-11-25 16:57:52,884 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 30 transitions, 72 flow. Second operand has 3 states, 3 states have (on average 124.66666666666667) internal successors, (374), 3 states have internal predecessors, (374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:57:52,884 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 16:57:52,884 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 290 [2022-11-25 16:57:52,884 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 16:57:57,135 INFO L130 PetriNetUnfolder]: 25569/34295 cut-off events. [2022-11-25 16:57:57,135 INFO L131 PetriNetUnfolder]: For 1684/1684 co-relation queries the response was YES. [2022-11-25 16:57:57,215 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70676 conditions, 34295 events. 25569/34295 cut-off events. For 1684/1684 co-relation queries the response was YES. Maximal size of possible extension queue 1072. Compared 184943 event pairs, 9937 based on Foata normal form. 0/33625 useless extension candidates. Maximal degree in co-relation 70672. Up to 17160 conditions per place. [2022-11-25 16:57:57,347 INFO L137 encePairwiseOnDemand]: 279/290 looper letters, 45 selfloop transitions, 10 changer transitions 0/55 dead transitions. [2022-11-25 16:57:57,347 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 55 transitions, 238 flow [2022-11-25 16:57:57,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 16:57:57,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 16:57:57,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 419 transitions. [2022-11-25 16:57:57,350 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.48160919540229885 [2022-11-25 16:57:57,350 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 419 transitions. [2022-11-25 16:57:57,350 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 419 transitions. [2022-11-25 16:57:57,351 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 16:57:57,351 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 419 transitions. [2022-11-25 16:57:57,352 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 139.66666666666666) internal successors, (419), 3 states have internal predecessors, (419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:57:57,354 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 290.0) internal successors, (1160), 4 states have internal predecessors, (1160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:57:57,355 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 290.0) internal successors, (1160), 4 states have internal predecessors, (1160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:57:57,355 INFO L175 Difference]: Start difference. First operand has 43 places, 30 transitions, 72 flow. Second operand 3 states and 419 transitions. [2022-11-25 16:57:57,355 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 55 transitions, 238 flow [2022-11-25 16:57:57,356 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 55 transitions, 232 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-25 16:57:57,358 INFO L231 Difference]: Finished difference. Result has 44 places, 39 transitions, 146 flow [2022-11-25 16:57:57,358 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=290, 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=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=146, PETRI_PLACES=44, PETRI_TRANSITIONS=39} [2022-11-25 16:57:57,360 INFO L288 CegarLoopForPetriNet]: 53 programPoint places, -9 predicate places. [2022-11-25 16:57:57,360 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 39 transitions, 146 flow [2022-11-25 16:57:57,361 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 124.66666666666667) internal successors, (374), 3 states have internal predecessors, (374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:57:57,361 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 16:57:57,361 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:57:57,361 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-25 16:57:57,362 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-11-25 16:57:57,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:57:57,363 INFO L85 PathProgramCache]: Analyzing trace with hash -171618424, now seen corresponding path program 1 times [2022-11-25 16:57:57,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:57:57,363 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747291027] [2022-11-25 16:57:57,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:57:57,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:57:57,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:57:57,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:57:57,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:57:57,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747291027] [2022-11-25 16:57:57,611 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747291027] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:57:57,611 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:57:57,611 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 16:57:57,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141926307] [2022-11-25 16:57:57,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:57:57,612 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 16:57:57,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:57:57,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 16:57:57,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 16:57:57,638 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 290 [2022-11-25 16:57:57,639 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 39 transitions, 146 flow. Second operand has 4 states, 4 states have (on average 124.0) internal successors, (496), 4 states have internal predecessors, (496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:57:57,639 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 16:57:57,639 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 290 [2022-11-25 16:57:57,639 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 16:58:01,784 INFO L130 PetriNetUnfolder]: 24439/32764 cut-off events. [2022-11-25 16:58:01,784 INFO L131 PetriNetUnfolder]: For 16906/16906 co-relation queries the response was YES. [2022-11-25 16:58:01,866 INFO L83 FinitePrefix]: Finished finitePrefix Result has 86356 conditions, 32764 events. 24439/32764 cut-off events. For 16906/16906 co-relation queries the response was YES. Maximal size of possible extension queue 1018. Compared 172207 event pairs, 5224 based on Foata normal form. 170/32934 useless extension candidates. Maximal degree in co-relation 86351. Up to 12667 conditions per place. [2022-11-25 16:58:02,004 INFO L137 encePairwiseOnDemand]: 280/290 looper letters, 63 selfloop transitions, 10 changer transitions 0/73 dead transitions. [2022-11-25 16:58:02,004 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 73 transitions, 396 flow [2022-11-25 16:58:02,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 16:58:02,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-25 16:58:02,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 550 transitions. [2022-11-25 16:58:02,007 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.47413793103448276 [2022-11-25 16:58:02,007 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 550 transitions. [2022-11-25 16:58:02,007 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 550 transitions. [2022-11-25 16:58:02,008 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 16:58:02,008 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 550 transitions. [2022-11-25 16:58:02,009 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 137.5) internal successors, (550), 4 states have internal predecessors, (550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:58:02,012 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 290.0) internal successors, (1450), 5 states have internal predecessors, (1450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:58:02,013 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 290.0) internal successors, (1450), 5 states have internal predecessors, (1450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:58:02,013 INFO L175 Difference]: Start difference. First operand has 44 places, 39 transitions, 146 flow. Second operand 4 states and 550 transitions. [2022-11-25 16:58:02,013 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 73 transitions, 396 flow [2022-11-25 16:58:02,071 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 73 transitions, 364 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-25 16:58:02,073 INFO L231 Difference]: Finished difference. Result has 48 places, 45 transitions, 204 flow [2022-11-25 16:58:02,073 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=290, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=204, PETRI_PLACES=48, PETRI_TRANSITIONS=45} [2022-11-25 16:58:02,075 INFO L288 CegarLoopForPetriNet]: 53 programPoint places, -5 predicate places. [2022-11-25 16:58:02,076 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 45 transitions, 204 flow [2022-11-25 16:58:02,076 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 124.0) internal successors, (496), 4 states have internal predecessors, (496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:58:02,076 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 16:58:02,077 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:58:02,077 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-25 16:58:02,077 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-11-25 16:58:02,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:58:02,078 INFO L85 PathProgramCache]: Analyzing trace with hash -171615981, now seen corresponding path program 1 times [2022-11-25 16:58:02,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:58:02,078 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350309426] [2022-11-25 16:58:02,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:58:02,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:58:02,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:58:03,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:58:03,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:58:03,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350309426] [2022-11-25 16:58:03,047 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [350309426] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:58:03,047 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:58:03,048 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 16:58:03,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993207818] [2022-11-25 16:58:03,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:58:03,048 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 16:58:03,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:58:03,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 16:58:03,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-25 16:58:03,461 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 290 [2022-11-25 16:58:03,462 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 45 transitions, 204 flow. Second operand has 7 states, 7 states have (on average 115.71428571428571) internal successors, (810), 7 states have internal predecessors, (810), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:58:03,462 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 16:58:03,463 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 290 [2022-11-25 16:58:03,463 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 16:58:05,376 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([440] L822-->L838: Formula: (let ((.cse9 (= (mod v_~a$r_buff1_thd4~0_56 256) 0)) (.cse10 (= (mod v_~a$r_buff0_thd4~0_60 256) 0))) (let ((.cse11 (not .cse10)) (.cse4 (and .cse10 (= (mod v_~a$w_buff1_used~0_131 256) 0))) (.cse12 (= (mod v_~a$w_buff0_used~0_150 256) 0)) (.cse6 (and .cse9 .cse10))) (let ((.cse1 (or .cse4 .cse12 .cse6)) (.cse2 (and (not .cse12) .cse11))) (let ((.cse3 (ite .cse1 v_~a~0_87 (ite .cse2 v_~a$w_buff0~0_71 v_~a$w_buff1~0_62))) (.cse0 (not (= (mod v_~weak$$choice2~0_34 256) 0))) (.cse8 (= (mod v_~a$w_buff1_used~0_130 256) 0)) (.cse5 (= (mod v_~a$w_buff0_used~0_149 256) 0))) (and (= (ite .cse0 v_~a$w_buff0_used~0_150 (ite .cse1 v_~a$w_buff0_used~0_150 (ite .cse2 0 v_~a$w_buff0_used~0_150))) v_~a$w_buff0_used~0_149) (= v_~a~0_86 (ite .cse0 v_~a$mem_tmp~0_14 .cse3)) (= v_~weak$$choice2~0_34 |v_P3Thread1of1ForFork0_#t~nondet4_1|) (= v_~a$flush_delayed~0_21 0) (= (ite .cse0 v_~a$w_buff1_used~0_131 (ite (or .cse4 .cse5 .cse6) v_~a$w_buff1_used~0_131 0)) v_~a$w_buff1_used~0_130) (= .cse3 v_~__unbuffered_p3_EBX~0_10) (= v_~weak$$choice0~0_7 |v_P3Thread1of1ForFork0_#t~nondet3_1|) (= v_~a$w_buff0~0_71 v_~a$w_buff0~0_70) (= v_~a~0_87 v_~a$mem_tmp~0_14) (= v_~a$w_buff1~0_62 v_~a$w_buff1~0_61) (= (ite .cse0 v_~a$r_buff1_thd4~0_56 (ite (let ((.cse7 (= (mod v_~a$r_buff0_thd4~0_59 256) 0))) (or (and .cse7 .cse8) .cse5 (and .cse7 .cse9))) v_~a$r_buff1_thd4~0_56 0)) v_~a$r_buff1_thd4~0_55) (= (ite .cse0 v_~a$r_buff0_thd4~0_60 (ite (or (and .cse10 .cse8) .cse5 .cse6) v_~a$r_buff0_thd4~0_60 (ite (and .cse11 (not .cse5)) 0 v_~a$r_buff0_thd4~0_60))) v_~a$r_buff0_thd4~0_59)))))) InVars {~a~0=v_~a~0_87, ~a$w_buff1~0=v_~a$w_buff1~0_62, ~a$w_buff0~0=v_~a$w_buff0~0_71, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_56, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_150, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_131, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_60, P3Thread1of1ForFork0_#t~nondet3=|v_P3Thread1of1ForFork0_#t~nondet3_1|, P3Thread1of1ForFork0_#t~nondet4=|v_P3Thread1of1ForFork0_#t~nondet4_1|} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_55, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_149, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_59, ~a~0=v_~a~0_86, ~a$mem_tmp~0=v_~a$mem_tmp~0_14, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~a$w_buff1~0=v_~a$w_buff1~0_61, ~a$flush_delayed~0=v_~a$flush_delayed~0_21, ~a$w_buff0~0=v_~a$w_buff0~0_70, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_130, ~weak$$choice2~0=v_~weak$$choice2~0_34} 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, P3Thread1of1ForFork0_#t~nondet3, P3Thread1of1ForFork0_#t~nondet4][50], [P0Thread1of1ForFork1InUse, 42#L880true, 162#true, 29#L779true, Black: 171#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 40#L802true, Black: 177#(<= ~__unbuffered_p3_EAX~0 0), 141#L838true, Black: 178#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 39#L769true, 175#true, P1Thread1of1ForFork3InUse, P3Thread1of1ForFork0InUse, 188#(and (not (= |ULTIMATE.start_main_~#t803~0#1.base| |ULTIMATE.start_main_~#t804~0#1.base|)) (not (= |ULTIMATE.start_main_~#t802~0#1.base| |ULTIMATE.start_main_~#t801~0#1.base|)) (not (= |ULTIMATE.start_main_~#t803~0#1.base| |ULTIMATE.start_main_~#t801~0#1.base|)) (not (= |ULTIMATE.start_main_~#t803~0#1.base| |ULTIMATE.start_main_~#t802~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t802~0#1.base| 0) |ULTIMATE.start_main_~#t801~0#1.base| 0) |ULTIMATE.start_main_~#t803~0#1.base| 0) |ULTIMATE.start_main_~#t804~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t801~0#1.base| |ULTIMATE.start_main_~#t804~0#1.base|)) (not (= |ULTIMATE.start_main_~#t802~0#1.base| |ULTIMATE.start_main_~#t804~0#1.base|))), P2Thread1of1ForFork2InUse]) [2022-11-25 16:58:05,376 INFO L383 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2022-11-25 16:58:05,376 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2022-11-25 16:58:05,377 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2022-11-25 16:58:05,377 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2022-11-25 16:58:05,620 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([589] L880-->L866-3: Formula: (and (= (mod v_~main$tmp_guard1~0_108 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_87|) (= |v_ULTIMATE.start_main_#res#1_58| 0) (= (ite (= 0 (ite (not (and (= 2 v_~x~0_131) (= v_~z~0_137 2) (= v_~y~0_128 2) (= v_~__unbuffered_p3_EAX~0_106 2) (= v_~__unbuffered_p3_EBX~0_122 0))) 1 0)) 0 1) v_~main$tmp_guard1~0_108) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_101| |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_87|) (not (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_101| 0)) (= |v_#valid_266| (store (store (store |v_#valid_268| |v_ULTIMATE.start_main_~#t801~0#1.base_77| 0) |v_ULTIMATE.start_main_~#t802~0#1.base_51| 0) |v_ULTIMATE.start_main_~#t803~0#1.base_58| 0))) InVars {ULTIMATE.start_main_~#t802~0#1.base=|v_ULTIMATE.start_main_~#t802~0#1.base_51|, ULTIMATE.start_main_~#t803~0#1.base=|v_ULTIMATE.start_main_~#t803~0#1.base_58|, ULTIMATE.start_main_~#t801~0#1.base=|v_ULTIMATE.start_main_~#t801~0#1.base_77|, #valid=|v_#valid_268|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_106, ~z~0=v_~z~0_137, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_122, ~y~0=v_~y~0_128, ~x~0=v_~x~0_131} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_101|, ULTIMATE.start_main_~#t803~0#1.base=|v_ULTIMATE.start_main_~#t803~0#1.base_58|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_58|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_108, ULTIMATE.start_main_~#t802~0#1.offset=|v_ULTIMATE.start_main_~#t802~0#1.offset_43|, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_122, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_87|, ULTIMATE.start_main_~#t801~0#1.offset=|v_ULTIMATE.start_main_~#t801~0#1.offset_43|, #valid=|v_#valid_266|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_106, ~z~0=v_~z~0_137, ~y~0=v_~y~0_128, ~x~0=v_~x~0_131} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t802~0#1.base, ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_main_~#t801~0#1.base, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_~#t801~0#1.offset, #valid, ~main$tmp_guard1~0, ULTIMATE.start_main_~#t802~0#1.offset][57], [P0Thread1of1ForFork1InUse, 189#(= |ULTIMATE.start_main_old_#valid#1| (store |#valid| |ULTIMATE.start_main_~#t804~0#1.base| 0)), 26#L866-3true, 162#true, 29#L779true, Black: 169#true, 40#L802true, Black: 177#(<= ~__unbuffered_p3_EAX~0 0), Black: 175#true, 39#L769true, 46#L822true, P1Thread1of1ForFork3InUse, P3Thread1of1ForFork0InUse, P2Thread1of1ForFork2InUse, 178#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)))]) [2022-11-25 16:58:05,621 INFO L383 tUnfolder$Statistics]: this new event has 19 ancestors and is not cut-off event [2022-11-25 16:58:05,621 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is not cut-off event [2022-11-25 16:58:05,621 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is not cut-off event [2022-11-25 16:58:05,621 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is not cut-off event [2022-11-25 16:58:05,622 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([572] L880-->ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK: Formula: (and (= v_~main$tmp_guard1~0_58 (ite (= (ite (not (and (= v_~z~0_83 2) (= v_~x~0_77 2) (= 0 v_~__unbuffered_p3_EBX~0_78) (= v_~y~0_74 2) (= 2 v_~__unbuffered_p3_EAX~0_62))) 1 0) 0) 0 1)) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_45| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_55|) (= (mod v_~main$tmp_guard1~0_58 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_45|) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_55| 0)) InVars {~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_62, ~z~0=v_~z~0_83, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_78, ~y~0=v_~y~0_74, ~x~0=v_~x~0_77} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_55|, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_45|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_62, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_58, ~z~0=v_~z~0_83, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_78, ~y~0=v_~y~0_74, ~x~0=v_~x~0_77} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~main$tmp_guard1~0][58], [P0Thread1of1ForFork1InUse, 162#true, 29#L779true, 80#ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAKtrue, Black: 171#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 40#L802true, Black: 177#(<= ~__unbuffered_p3_EAX~0 0), Black: 178#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 39#L769true, 175#true, P1Thread1of1ForFork3InUse, 46#L822true, P3Thread1of1ForFork0InUse, 188#(and (not (= |ULTIMATE.start_main_~#t803~0#1.base| |ULTIMATE.start_main_~#t804~0#1.base|)) (not (= |ULTIMATE.start_main_~#t802~0#1.base| |ULTIMATE.start_main_~#t801~0#1.base|)) (not (= |ULTIMATE.start_main_~#t803~0#1.base| |ULTIMATE.start_main_~#t801~0#1.base|)) (not (= |ULTIMATE.start_main_~#t803~0#1.base| |ULTIMATE.start_main_~#t802~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t802~0#1.base| 0) |ULTIMATE.start_main_~#t801~0#1.base| 0) |ULTIMATE.start_main_~#t803~0#1.base| 0) |ULTIMATE.start_main_~#t804~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t801~0#1.base| |ULTIMATE.start_main_~#t804~0#1.base|)) (not (= |ULTIMATE.start_main_~#t802~0#1.base| |ULTIMATE.start_main_~#t804~0#1.base|))), P2Thread1of1ForFork2InUse]) [2022-11-25 16:58:05,622 INFO L383 tUnfolder$Statistics]: this new event has 19 ancestors and is not cut-off event [2022-11-25 16:58:05,622 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is not cut-off event [2022-11-25 16:58:05,623 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is not cut-off event [2022-11-25 16:58:05,623 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is not cut-off event [2022-11-25 16:58:05,713 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([440] L822-->L838: Formula: (let ((.cse9 (= (mod v_~a$r_buff1_thd4~0_56 256) 0)) (.cse10 (= (mod v_~a$r_buff0_thd4~0_60 256) 0))) (let ((.cse11 (not .cse10)) (.cse4 (and .cse10 (= (mod v_~a$w_buff1_used~0_131 256) 0))) (.cse12 (= (mod v_~a$w_buff0_used~0_150 256) 0)) (.cse6 (and .cse9 .cse10))) (let ((.cse1 (or .cse4 .cse12 .cse6)) (.cse2 (and (not .cse12) .cse11))) (let ((.cse3 (ite .cse1 v_~a~0_87 (ite .cse2 v_~a$w_buff0~0_71 v_~a$w_buff1~0_62))) (.cse0 (not (= (mod v_~weak$$choice2~0_34 256) 0))) (.cse8 (= (mod v_~a$w_buff1_used~0_130 256) 0)) (.cse5 (= (mod v_~a$w_buff0_used~0_149 256) 0))) (and (= (ite .cse0 v_~a$w_buff0_used~0_150 (ite .cse1 v_~a$w_buff0_used~0_150 (ite .cse2 0 v_~a$w_buff0_used~0_150))) v_~a$w_buff0_used~0_149) (= v_~a~0_86 (ite .cse0 v_~a$mem_tmp~0_14 .cse3)) (= v_~weak$$choice2~0_34 |v_P3Thread1of1ForFork0_#t~nondet4_1|) (= v_~a$flush_delayed~0_21 0) (= (ite .cse0 v_~a$w_buff1_used~0_131 (ite (or .cse4 .cse5 .cse6) v_~a$w_buff1_used~0_131 0)) v_~a$w_buff1_used~0_130) (= .cse3 v_~__unbuffered_p3_EBX~0_10) (= v_~weak$$choice0~0_7 |v_P3Thread1of1ForFork0_#t~nondet3_1|) (= v_~a$w_buff0~0_71 v_~a$w_buff0~0_70) (= v_~a~0_87 v_~a$mem_tmp~0_14) (= v_~a$w_buff1~0_62 v_~a$w_buff1~0_61) (= (ite .cse0 v_~a$r_buff1_thd4~0_56 (ite (let ((.cse7 (= (mod v_~a$r_buff0_thd4~0_59 256) 0))) (or (and .cse7 .cse8) .cse5 (and .cse7 .cse9))) v_~a$r_buff1_thd4~0_56 0)) v_~a$r_buff1_thd4~0_55) (= (ite .cse0 v_~a$r_buff0_thd4~0_60 (ite (or (and .cse10 .cse8) .cse5 .cse6) v_~a$r_buff0_thd4~0_60 (ite (and .cse11 (not .cse5)) 0 v_~a$r_buff0_thd4~0_60))) v_~a$r_buff0_thd4~0_59)))))) InVars {~a~0=v_~a~0_87, ~a$w_buff1~0=v_~a$w_buff1~0_62, ~a$w_buff0~0=v_~a$w_buff0~0_71, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_56, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_150, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_131, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_60, P3Thread1of1ForFork0_#t~nondet3=|v_P3Thread1of1ForFork0_#t~nondet3_1|, P3Thread1of1ForFork0_#t~nondet4=|v_P3Thread1of1ForFork0_#t~nondet4_1|} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_55, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_149, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_59, ~a~0=v_~a~0_86, ~a$mem_tmp~0=v_~a$mem_tmp~0_14, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~a$w_buff1~0=v_~a$w_buff1~0_61, ~a$flush_delayed~0=v_~a$flush_delayed~0_21, ~a$w_buff0~0=v_~a$w_buff0~0_70, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_130, ~weak$$choice2~0=v_~weak$$choice2~0_34} 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, P3Thread1of1ForFork0_#t~nondet3, P3Thread1of1ForFork0_#t~nondet4][50], [P0Thread1of1ForFork1InUse, 42#L880true, 162#true, 29#L779true, Black: 171#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 40#L802true, 116#P0EXITtrue, Black: 177#(<= ~__unbuffered_p3_EAX~0 0), 141#L838true, Black: 178#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 175#true, P1Thread1of1ForFork3InUse, P3Thread1of1ForFork0InUse, 188#(and (not (= |ULTIMATE.start_main_~#t803~0#1.base| |ULTIMATE.start_main_~#t804~0#1.base|)) (not (= |ULTIMATE.start_main_~#t802~0#1.base| |ULTIMATE.start_main_~#t801~0#1.base|)) (not (= |ULTIMATE.start_main_~#t803~0#1.base| |ULTIMATE.start_main_~#t801~0#1.base|)) (not (= |ULTIMATE.start_main_~#t803~0#1.base| |ULTIMATE.start_main_~#t802~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t802~0#1.base| 0) |ULTIMATE.start_main_~#t801~0#1.base| 0) |ULTIMATE.start_main_~#t803~0#1.base| 0) |ULTIMATE.start_main_~#t804~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t801~0#1.base| |ULTIMATE.start_main_~#t804~0#1.base|)) (not (= |ULTIMATE.start_main_~#t802~0#1.base| |ULTIMATE.start_main_~#t804~0#1.base|))), P2Thread1of1ForFork2InUse]) [2022-11-25 16:58:05,714 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2022-11-25 16:58:05,714 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-11-25 16:58:05,714 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-11-25 16:58:05,714 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-11-25 16:58:06,056 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([589] L880-->L866-3: Formula: (and (= (mod v_~main$tmp_guard1~0_108 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_87|) (= |v_ULTIMATE.start_main_#res#1_58| 0) (= (ite (= 0 (ite (not (and (= 2 v_~x~0_131) (= v_~z~0_137 2) (= v_~y~0_128 2) (= v_~__unbuffered_p3_EAX~0_106 2) (= v_~__unbuffered_p3_EBX~0_122 0))) 1 0)) 0 1) v_~main$tmp_guard1~0_108) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_101| |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_87|) (not (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_101| 0)) (= |v_#valid_266| (store (store (store |v_#valid_268| |v_ULTIMATE.start_main_~#t801~0#1.base_77| 0) |v_ULTIMATE.start_main_~#t802~0#1.base_51| 0) |v_ULTIMATE.start_main_~#t803~0#1.base_58| 0))) InVars {ULTIMATE.start_main_~#t802~0#1.base=|v_ULTIMATE.start_main_~#t802~0#1.base_51|, ULTIMATE.start_main_~#t803~0#1.base=|v_ULTIMATE.start_main_~#t803~0#1.base_58|, ULTIMATE.start_main_~#t801~0#1.base=|v_ULTIMATE.start_main_~#t801~0#1.base_77|, #valid=|v_#valid_268|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_106, ~z~0=v_~z~0_137, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_122, ~y~0=v_~y~0_128, ~x~0=v_~x~0_131} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_101|, ULTIMATE.start_main_~#t803~0#1.base=|v_ULTIMATE.start_main_~#t803~0#1.base_58|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_58|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_108, ULTIMATE.start_main_~#t802~0#1.offset=|v_ULTIMATE.start_main_~#t802~0#1.offset_43|, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_122, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_87|, ULTIMATE.start_main_~#t801~0#1.offset=|v_ULTIMATE.start_main_~#t801~0#1.offset_43|, #valid=|v_#valid_266|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_106, ~z~0=v_~z~0_137, ~y~0=v_~y~0_128, ~x~0=v_~x~0_131} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t802~0#1.base, ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_main_~#t801~0#1.base, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_~#t801~0#1.offset, #valid, ~main$tmp_guard1~0, ULTIMATE.start_main_~#t802~0#1.offset][57], [P0Thread1of1ForFork1InUse, 26#L866-3true, 189#(= |ULTIMATE.start_main_old_#valid#1| (store |#valid| |ULTIMATE.start_main_~#t804~0#1.base| 0)), 162#true, 29#L779true, Black: 169#true, 40#L802true, 116#P0EXITtrue, Black: 177#(<= ~__unbuffered_p3_EAX~0 0), Black: 175#true, 46#L822true, P1Thread1of1ForFork3InUse, P3Thread1of1ForFork0InUse, P2Thread1of1ForFork2InUse, 178#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)))]) [2022-11-25 16:58:06,057 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is not cut-off event [2022-11-25 16:58:06,057 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is not cut-off event [2022-11-25 16:58:06,057 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is not cut-off event [2022-11-25 16:58:06,057 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is not cut-off event [2022-11-25 16:58:06,058 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([572] L880-->ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK: Formula: (and (= v_~main$tmp_guard1~0_58 (ite (= (ite (not (and (= v_~z~0_83 2) (= v_~x~0_77 2) (= 0 v_~__unbuffered_p3_EBX~0_78) (= v_~y~0_74 2) (= 2 v_~__unbuffered_p3_EAX~0_62))) 1 0) 0) 0 1)) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_45| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_55|) (= (mod v_~main$tmp_guard1~0_58 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_45|) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_55| 0)) InVars {~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_62, ~z~0=v_~z~0_83, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_78, ~y~0=v_~y~0_74, ~x~0=v_~x~0_77} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_55|, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_45|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_62, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_58, ~z~0=v_~z~0_83, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_78, ~y~0=v_~y~0_74, ~x~0=v_~x~0_77} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~main$tmp_guard1~0][58], [P0Thread1of1ForFork1InUse, 162#true, 29#L779true, 80#ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAKtrue, Black: 171#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 40#L802true, 116#P0EXITtrue, Black: 177#(<= ~__unbuffered_p3_EAX~0 0), Black: 178#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 175#true, 46#L822true, P1Thread1of1ForFork3InUse, P3Thread1of1ForFork0InUse, P2Thread1of1ForFork2InUse, 188#(and (not (= |ULTIMATE.start_main_~#t803~0#1.base| |ULTIMATE.start_main_~#t804~0#1.base|)) (not (= |ULTIMATE.start_main_~#t802~0#1.base| |ULTIMATE.start_main_~#t801~0#1.base|)) (not (= |ULTIMATE.start_main_~#t803~0#1.base| |ULTIMATE.start_main_~#t801~0#1.base|)) (not (= |ULTIMATE.start_main_~#t803~0#1.base| |ULTIMATE.start_main_~#t802~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t802~0#1.base| 0) |ULTIMATE.start_main_~#t801~0#1.base| 0) |ULTIMATE.start_main_~#t803~0#1.base| 0) |ULTIMATE.start_main_~#t804~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t801~0#1.base| |ULTIMATE.start_main_~#t804~0#1.base|)) (not (= |ULTIMATE.start_main_~#t802~0#1.base| |ULTIMATE.start_main_~#t804~0#1.base|)))]) [2022-11-25 16:58:06,059 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is not cut-off event [2022-11-25 16:58:06,059 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is not cut-off event [2022-11-25 16:58:06,059 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is not cut-off event [2022-11-25 16:58:06,059 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is not cut-off event [2022-11-25 16:58:07,079 INFO L130 PetriNetUnfolder]: 16361/22565 cut-off events. [2022-11-25 16:58:07,080 INFO L131 PetriNetUnfolder]: For 16620/17950 co-relation queries the response was YES. [2022-11-25 16:58:07,138 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61355 conditions, 22565 events. 16361/22565 cut-off events. For 16620/17950 co-relation queries the response was YES. Maximal size of possible extension queue 1011. Compared 130651 event pairs, 3003 based on Foata normal form. 1398/22906 useless extension candidates. Maximal degree in co-relation 61348. Up to 15310 conditions per place. [2022-11-25 16:58:07,213 INFO L137 encePairwiseOnDemand]: 284/290 looper letters, 46 selfloop transitions, 4 changer transitions 22/83 dead transitions. [2022-11-25 16:58:07,214 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 83 transitions, 476 flow [2022-11-25 16:58:07,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 16:58:07,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-25 16:58:07,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 855 transitions. [2022-11-25 16:58:07,218 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4211822660098522 [2022-11-25 16:58:07,218 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 855 transitions. [2022-11-25 16:58:07,218 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 855 transitions. [2022-11-25 16:58:07,219 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 16:58:07,219 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 855 transitions. [2022-11-25 16:58:07,221 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 122.14285714285714) internal successors, (855), 7 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-11-25 16:58:07,225 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 290.0) internal successors, (2320), 8 states have internal predecessors, (2320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:58:07,226 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 290.0) internal successors, (2320), 8 states have internal predecessors, (2320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:58:07,226 INFO L175 Difference]: Start difference. First operand has 48 places, 45 transitions, 204 flow. Second operand 7 states and 855 transitions. [2022-11-25 16:58:07,227 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 83 transitions, 476 flow [2022-11-25 16:58:07,286 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 83 transitions, 473 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-25 16:58:07,288 INFO L231 Difference]: Finished difference. Result has 52 places, 41 transitions, 189 flow [2022-11-25 16:58:07,288 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=290, PETRI_DIFFERENCE_MINUEND_FLOW=199, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=189, PETRI_PLACES=52, PETRI_TRANSITIONS=41} [2022-11-25 16:58:07,291 INFO L288 CegarLoopForPetriNet]: 53 programPoint places, -1 predicate places. [2022-11-25 16:58:07,291 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 41 transitions, 189 flow [2022-11-25 16:58:07,292 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 115.71428571428571) internal successors, (810), 7 states have internal predecessors, (810), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:58:07,292 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 16:58:07,292 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:58:07,292 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-25 16:58:07,292 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-11-25 16:58:07,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:58:07,293 INFO L85 PathProgramCache]: Analyzing trace with hash -1094892156, now seen corresponding path program 1 times [2022-11-25 16:58:07,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:58:07,293 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854766872] [2022-11-25 16:58:07,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:58:07,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:58:07,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:58:07,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:58:07,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:58:07,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854766872] [2022-11-25 16:58:07,506 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854766872] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:58:07,506 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:58:07,506 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 16:58:07,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863958306] [2022-11-25 16:58:07,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:58:07,513 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 16:58:07,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:58:07,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 16:58:07,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 16:58:07,539 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 290 [2022-11-25 16:58:07,541 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 41 transitions, 189 flow. Second operand has 4 states, 4 states have (on average 124.75) internal successors, (499), 4 states have internal predecessors, (499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:58:07,541 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 16:58:07,541 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 290 [2022-11-25 16:58:07,542 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 16:58:11,075 INFO L130 PetriNetUnfolder]: 21210/29056 cut-off events. [2022-11-25 16:58:11,075 INFO L131 PetriNetUnfolder]: For 18995/18995 co-relation queries the response was YES. [2022-11-25 16:58:11,155 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78063 conditions, 29056 events. 21210/29056 cut-off events. For 18995/18995 co-relation queries the response was YES. Maximal size of possible extension queue 956. Compared 162427 event pairs, 4855 based on Foata normal form. 300/29356 useless extension candidates. Maximal degree in co-relation 78055. Up to 11904 conditions per place. [2022-11-25 16:58:11,239 INFO L137 encePairwiseOnDemand]: 280/290 looper letters, 66 selfloop transitions, 18 changer transitions 1/85 dead transitions. [2022-11-25 16:58:11,239 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 85 transitions, 519 flow [2022-11-25 16:58:11,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 16:58:11,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-25 16:58:11,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 557 transitions. [2022-11-25 16:58:11,245 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.48017241379310344 [2022-11-25 16:58:11,245 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 557 transitions. [2022-11-25 16:58:11,245 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 557 transitions. [2022-11-25 16:58:11,245 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 16:58:11,246 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 557 transitions. [2022-11-25 16:58:11,251 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 139.25) internal successors, (557), 4 states have internal predecessors, (557), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:58:11,256 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 290.0) internal successors, (1450), 5 states have internal predecessors, (1450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:58:11,257 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 290.0) internal successors, (1450), 5 states have internal predecessors, (1450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:58:11,257 INFO L175 Difference]: Start difference. First operand has 52 places, 41 transitions, 189 flow. Second operand 4 states and 557 transitions. [2022-11-25 16:58:11,258 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 85 transitions, 519 flow [2022-11-25 16:58:11,274 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 85 transitions, 506 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-25 16:58:11,277 INFO L231 Difference]: Finished difference. Result has 52 places, 50 transitions, 329 flow [2022-11-25 16:58:11,277 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=290, PETRI_DIFFERENCE_MINUEND_FLOW=182, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=329, PETRI_PLACES=52, PETRI_TRANSITIONS=50} [2022-11-25 16:58:11,280 INFO L288 CegarLoopForPetriNet]: 53 programPoint places, -1 predicate places. [2022-11-25 16:58:11,280 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 50 transitions, 329 flow [2022-11-25 16:58:11,281 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 124.75) internal successors, (499), 4 states have internal predecessors, (499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:58:11,281 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 16:58:11,281 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:58:11,281 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-25 16:58:11,281 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-11-25 16:58:11,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:58:11,282 INFO L85 PathProgramCache]: Analyzing trace with hash -1025247761, now seen corresponding path program 1 times [2022-11-25 16:58:11,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:58:11,282 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634327213] [2022-11-25 16:58:11,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:58:11,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:58:11,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:58:11,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:58:11,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:58:11,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634327213] [2022-11-25 16:58:11,473 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634327213] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:58:11,474 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:58:11,474 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 16:58:11,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179965393] [2022-11-25 16:58:11,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:58:11,475 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 16:58:11,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:58:11,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 16:58:11,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 16:58:11,501 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 290 [2022-11-25 16:58:11,502 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 50 transitions, 329 flow. Second operand has 4 states, 4 states have (on average 124.25) internal successors, (497), 4 states have internal predecessors, (497), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:58:11,503 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 16:58:11,503 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 290 [2022-11-25 16:58:11,503 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 16:58:14,843 INFO L130 PetriNetUnfolder]: 20736/28413 cut-off events. [2022-11-25 16:58:14,844 INFO L131 PetriNetUnfolder]: For 42040/42040 co-relation queries the response was YES. [2022-11-25 16:58:14,918 INFO L83 FinitePrefix]: Finished finitePrefix Result has 86316 conditions, 28413 events. 20736/28413 cut-off events. For 42040/42040 co-relation queries the response was YES. Maximal size of possible extension queue 927. Compared 158760 event pairs, 2256 based on Foata normal form. 40/28453 useless extension candidates. Maximal degree in co-relation 86306. Up to 14004 conditions per place. [2022-11-25 16:58:14,983 INFO L137 encePairwiseOnDemand]: 280/290 looper letters, 63 selfloop transitions, 25 changer transitions 1/89 dead transitions. [2022-11-25 16:58:14,983 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 89 transitions, 691 flow [2022-11-25 16:58:14,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 16:58:14,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-25 16:58:14,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 552 transitions. [2022-11-25 16:58:14,991 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.47586206896551725 [2022-11-25 16:58:14,991 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 552 transitions. [2022-11-25 16:58:14,991 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 552 transitions. [2022-11-25 16:58:14,991 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 16:58:14,992 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 552 transitions. [2022-11-25 16:58:14,993 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 138.0) internal successors, (552), 4 states have internal predecessors, (552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:58:14,996 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 290.0) internal successors, (1450), 5 states have internal predecessors, (1450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:58:14,997 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 290.0) internal successors, (1450), 5 states have internal predecessors, (1450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:58:14,997 INFO L175 Difference]: Start difference. First operand has 52 places, 50 transitions, 329 flow. Second operand 4 states and 552 transitions. [2022-11-25 16:58:14,997 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 89 transitions, 691 flow [2022-11-25 16:58:15,099 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 89 transitions, 691 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-25 16:58:15,102 INFO L231 Difference]: Finished difference. Result has 58 places, 59 transitions, 542 flow [2022-11-25 16:58:15,102 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=290, PETRI_DIFFERENCE_MINUEND_FLOW=329, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=542, PETRI_PLACES=58, PETRI_TRANSITIONS=59} [2022-11-25 16:58:15,103 INFO L288 CegarLoopForPetriNet]: 53 programPoint places, 5 predicate places. [2022-11-25 16:58:15,104 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 59 transitions, 542 flow [2022-11-25 16:58:15,104 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 124.25) internal successors, (497), 4 states have internal predecessors, (497), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:58:15,104 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 16:58:15,104 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:58:15,105 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-25 16:58:15,105 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-11-25 16:58:15,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:58:15,105 INFO L85 PathProgramCache]: Analyzing trace with hash -1716663770, now seen corresponding path program 1 times [2022-11-25 16:58:15,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:58:15,106 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753185757] [2022-11-25 16:58:15,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:58:15,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:58:15,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:58:15,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:58:15,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:58:15,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753185757] [2022-11-25 16:58:15,265 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753185757] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:58:15,269 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:58:15,269 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-25 16:58:15,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705913155] [2022-11-25 16:58:15,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:58:15,271 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 16:58:15,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:58:15,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 16:58:15,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 16:58:15,279 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 290 [2022-11-25 16:58:15,279 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 59 transitions, 542 flow. Second operand has 3 states, 3 states have (on average 134.33333333333334) internal successors, (403), 3 states have internal predecessors, (403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:58:15,280 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 16:58:15,280 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 290 [2022-11-25 16:58:15,280 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 16:58:18,664 INFO L130 PetriNetUnfolder]: 16602/23856 cut-off events. [2022-11-25 16:58:18,664 INFO L131 PetriNetUnfolder]: For 68938/69751 co-relation queries the response was YES. [2022-11-25 16:58:18,752 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77531 conditions, 23856 events. 16602/23856 cut-off events. For 68938/69751 co-relation queries the response was YES. Maximal size of possible extension queue 1055. Compared 148374 event pairs, 7473 based on Foata normal form. 544/24007 useless extension candidates. Maximal degree in co-relation 77518. Up to 21599 conditions per place. [2022-11-25 16:58:18,839 INFO L137 encePairwiseOnDemand]: 286/290 looper letters, 65 selfloop transitions, 10 changer transitions 0/88 dead transitions. [2022-11-25 16:58:18,839 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 88 transitions, 901 flow [2022-11-25 16:58:18,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 16:58:18,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 16:58:18,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 434 transitions. [2022-11-25 16:58:18,846 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.49885057471264366 [2022-11-25 16:58:18,846 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 434 transitions. [2022-11-25 16:58:18,846 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 434 transitions. [2022-11-25 16:58:18,847 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 16:58:18,847 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 434 transitions. [2022-11-25 16:58:18,850 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 144.66666666666666) internal successors, (434), 3 states have internal predecessors, (434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:58:18,851 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 290.0) internal successors, (1160), 4 states have internal predecessors, (1160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:58:18,854 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 290.0) internal successors, (1160), 4 states have internal predecessors, (1160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:58:18,854 INFO L175 Difference]: Start difference. First operand has 58 places, 59 transitions, 542 flow. Second operand 3 states and 434 transitions. [2022-11-25 16:58:18,854 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 88 transitions, 901 flow [2022-11-25 16:58:18,962 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 88 transitions, 897 flow, removed 2 selfloop flow, removed 0 redundant places. [2022-11-25 16:58:18,965 INFO L231 Difference]: Finished difference. Result has 61 places, 68 transitions, 696 flow [2022-11-25 16:58:18,965 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=290, PETRI_DIFFERENCE_MINUEND_FLOW=540, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=696, PETRI_PLACES=61, PETRI_TRANSITIONS=68} [2022-11-25 16:58:18,966 INFO L288 CegarLoopForPetriNet]: 53 programPoint places, 8 predicate places. [2022-11-25 16:58:18,966 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 68 transitions, 696 flow [2022-11-25 16:58:18,966 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 134.33333333333334) internal successors, (403), 3 states have internal predecessors, (403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:58:18,966 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 16:58:18,967 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:58:18,967 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-25 16:58:18,967 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-11-25 16:58:18,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:58:18,968 INFO L85 PathProgramCache]: Analyzing trace with hash -1674800048, now seen corresponding path program 1 times [2022-11-25 16:58:18,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:58:18,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996458976] [2022-11-25 16:58:18,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:58:18,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:58:19,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:58:19,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:58:19,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:58:19,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996458976] [2022-11-25 16:58:19,219 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996458976] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:58:19,219 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:58:19,219 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 16:58:19,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309204198] [2022-11-25 16:58:19,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:58:19,221 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 16:58:19,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:58:19,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 16:58:19,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 16:58:19,233 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 290 [2022-11-25 16:58:19,234 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 68 transitions, 696 flow. Second operand has 4 states, 4 states have (on average 130.5) internal successors, (522), 4 states have internal predecessors, (522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:58:19,234 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 16:58:19,235 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 290 [2022-11-25 16:58:19,235 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 16:58:21,041 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([440] L822-->L838: Formula: (let ((.cse9 (= (mod v_~a$r_buff1_thd4~0_56 256) 0)) (.cse10 (= (mod v_~a$r_buff0_thd4~0_60 256) 0))) (let ((.cse11 (not .cse10)) (.cse4 (and .cse10 (= (mod v_~a$w_buff1_used~0_131 256) 0))) (.cse12 (= (mod v_~a$w_buff0_used~0_150 256) 0)) (.cse6 (and .cse9 .cse10))) (let ((.cse1 (or .cse4 .cse12 .cse6)) (.cse2 (and (not .cse12) .cse11))) (let ((.cse3 (ite .cse1 v_~a~0_87 (ite .cse2 v_~a$w_buff0~0_71 v_~a$w_buff1~0_62))) (.cse0 (not (= (mod v_~weak$$choice2~0_34 256) 0))) (.cse8 (= (mod v_~a$w_buff1_used~0_130 256) 0)) (.cse5 (= (mod v_~a$w_buff0_used~0_149 256) 0))) (and (= (ite .cse0 v_~a$w_buff0_used~0_150 (ite .cse1 v_~a$w_buff0_used~0_150 (ite .cse2 0 v_~a$w_buff0_used~0_150))) v_~a$w_buff0_used~0_149) (= v_~a~0_86 (ite .cse0 v_~a$mem_tmp~0_14 .cse3)) (= v_~weak$$choice2~0_34 |v_P3Thread1of1ForFork0_#t~nondet4_1|) (= v_~a$flush_delayed~0_21 0) (= (ite .cse0 v_~a$w_buff1_used~0_131 (ite (or .cse4 .cse5 .cse6) v_~a$w_buff1_used~0_131 0)) v_~a$w_buff1_used~0_130) (= .cse3 v_~__unbuffered_p3_EBX~0_10) (= v_~weak$$choice0~0_7 |v_P3Thread1of1ForFork0_#t~nondet3_1|) (= v_~a$w_buff0~0_71 v_~a$w_buff0~0_70) (= v_~a~0_87 v_~a$mem_tmp~0_14) (= v_~a$w_buff1~0_62 v_~a$w_buff1~0_61) (= (ite .cse0 v_~a$r_buff1_thd4~0_56 (ite (let ((.cse7 (= (mod v_~a$r_buff0_thd4~0_59 256) 0))) (or (and .cse7 .cse8) .cse5 (and .cse7 .cse9))) v_~a$r_buff1_thd4~0_56 0)) v_~a$r_buff1_thd4~0_55) (= (ite .cse0 v_~a$r_buff0_thd4~0_60 (ite (or (and .cse10 .cse8) .cse5 .cse6) v_~a$r_buff0_thd4~0_60 (ite (and .cse11 (not .cse5)) 0 v_~a$r_buff0_thd4~0_60))) v_~a$r_buff0_thd4~0_59)))))) InVars {~a~0=v_~a~0_87, ~a$w_buff1~0=v_~a$w_buff1~0_62, ~a$w_buff0~0=v_~a$w_buff0~0_71, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_56, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_150, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_131, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_60, P3Thread1of1ForFork0_#t~nondet3=|v_P3Thread1of1ForFork0_#t~nondet3_1|, P3Thread1of1ForFork0_#t~nondet4=|v_P3Thread1of1ForFork0_#t~nondet4_1|} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_55, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_149, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_59, ~a~0=v_~a~0_86, ~a$mem_tmp~0=v_~a$mem_tmp~0_14, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~a$w_buff1~0=v_~a$w_buff1~0_61, ~a$flush_delayed~0=v_~a$flush_delayed~0_21, ~a$w_buff0~0=v_~a$w_buff0~0_70, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_130, ~weak$$choice2~0=v_~weak$$choice2~0_34} 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, P3Thread1of1ForFork0_#t~nondet3, P3Thread1of1ForFork0_#t~nondet4][146], [P0Thread1of1ForFork1InUse, Black: 194#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 162#true, 193#(= ~y~0 1), Black: 191#true, 53#P2EXITtrue, Black: 201#(= ~y~0 0), Black: 171#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 202#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 51#L782true, Black: 209#(= ~x~0 0), Black: 177#(<= ~__unbuffered_p3_EAX~0 0), 141#L838true, Black: 178#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 85#L2true, 199#true, 175#true, P1Thread1of1ForFork3InUse, 207#true, P3Thread1of1ForFork0InUse, P2Thread1of1ForFork2InUse, 89#L762true, 188#(and (not (= |ULTIMATE.start_main_~#t803~0#1.base| |ULTIMATE.start_main_~#t804~0#1.base|)) (not (= |ULTIMATE.start_main_~#t802~0#1.base| |ULTIMATE.start_main_~#t801~0#1.base|)) (not (= |ULTIMATE.start_main_~#t803~0#1.base| |ULTIMATE.start_main_~#t801~0#1.base|)) (not (= |ULTIMATE.start_main_~#t803~0#1.base| |ULTIMATE.start_main_~#t802~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t802~0#1.base| 0) |ULTIMATE.start_main_~#t801~0#1.base| 0) |ULTIMATE.start_main_~#t803~0#1.base| 0) |ULTIMATE.start_main_~#t804~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t801~0#1.base| |ULTIMATE.start_main_~#t804~0#1.base|)) (not (= |ULTIMATE.start_main_~#t802~0#1.base| |ULTIMATE.start_main_~#t804~0#1.base|))), 212#true]) [2022-11-25 16:58:21,041 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2022-11-25 16:58:21,042 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-11-25 16:58:21,042 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-11-25 16:58:21,042 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-11-25 16:58:21,315 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([440] L822-->L838: Formula: (let ((.cse9 (= (mod v_~a$r_buff1_thd4~0_56 256) 0)) (.cse10 (= (mod v_~a$r_buff0_thd4~0_60 256) 0))) (let ((.cse11 (not .cse10)) (.cse4 (and .cse10 (= (mod v_~a$w_buff1_used~0_131 256) 0))) (.cse12 (= (mod v_~a$w_buff0_used~0_150 256) 0)) (.cse6 (and .cse9 .cse10))) (let ((.cse1 (or .cse4 .cse12 .cse6)) (.cse2 (and (not .cse12) .cse11))) (let ((.cse3 (ite .cse1 v_~a~0_87 (ite .cse2 v_~a$w_buff0~0_71 v_~a$w_buff1~0_62))) (.cse0 (not (= (mod v_~weak$$choice2~0_34 256) 0))) (.cse8 (= (mod v_~a$w_buff1_used~0_130 256) 0)) (.cse5 (= (mod v_~a$w_buff0_used~0_149 256) 0))) (and (= (ite .cse0 v_~a$w_buff0_used~0_150 (ite .cse1 v_~a$w_buff0_used~0_150 (ite .cse2 0 v_~a$w_buff0_used~0_150))) v_~a$w_buff0_used~0_149) (= v_~a~0_86 (ite .cse0 v_~a$mem_tmp~0_14 .cse3)) (= v_~weak$$choice2~0_34 |v_P3Thread1of1ForFork0_#t~nondet4_1|) (= v_~a$flush_delayed~0_21 0) (= (ite .cse0 v_~a$w_buff1_used~0_131 (ite (or .cse4 .cse5 .cse6) v_~a$w_buff1_used~0_131 0)) v_~a$w_buff1_used~0_130) (= .cse3 v_~__unbuffered_p3_EBX~0_10) (= v_~weak$$choice0~0_7 |v_P3Thread1of1ForFork0_#t~nondet3_1|) (= v_~a$w_buff0~0_71 v_~a$w_buff0~0_70) (= v_~a~0_87 v_~a$mem_tmp~0_14) (= v_~a$w_buff1~0_62 v_~a$w_buff1~0_61) (= (ite .cse0 v_~a$r_buff1_thd4~0_56 (ite (let ((.cse7 (= (mod v_~a$r_buff0_thd4~0_59 256) 0))) (or (and .cse7 .cse8) .cse5 (and .cse7 .cse9))) v_~a$r_buff1_thd4~0_56 0)) v_~a$r_buff1_thd4~0_55) (= (ite .cse0 v_~a$r_buff0_thd4~0_60 (ite (or (and .cse10 .cse8) .cse5 .cse6) v_~a$r_buff0_thd4~0_60 (ite (and .cse11 (not .cse5)) 0 v_~a$r_buff0_thd4~0_60))) v_~a$r_buff0_thd4~0_59)))))) InVars {~a~0=v_~a~0_87, ~a$w_buff1~0=v_~a$w_buff1~0_62, ~a$w_buff0~0=v_~a$w_buff0~0_71, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_56, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_150, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_131, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_60, P3Thread1of1ForFork0_#t~nondet3=|v_P3Thread1of1ForFork0_#t~nondet3_1|, P3Thread1of1ForFork0_#t~nondet4=|v_P3Thread1of1ForFork0_#t~nondet4_1|} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_55, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_149, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_59, ~a~0=v_~a~0_86, ~a$mem_tmp~0=v_~a$mem_tmp~0_14, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~a$w_buff1~0=v_~a$w_buff1~0_61, ~a$flush_delayed~0=v_~a$flush_delayed~0_21, ~a$w_buff0~0=v_~a$w_buff0~0_70, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_130, ~weak$$choice2~0=v_~weak$$choice2~0_34} 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, P3Thread1of1ForFork0_#t~nondet3, P3Thread1of1ForFork0_#t~nondet4][146], [P0Thread1of1ForFork1InUse, Black: 194#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 162#true, 193#(= ~y~0 1), Black: 191#true, 53#P2EXITtrue, Black: 201#(= ~y~0 0), Black: 171#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 202#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 51#L782true, Black: 209#(= ~x~0 0), Black: 177#(<= ~__unbuffered_p3_EAX~0 0), 141#L838true, Black: 178#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 85#L2true, 39#L769true, 199#true, 175#true, P1Thread1of1ForFork3InUse, 207#true, P3Thread1of1ForFork0InUse, P2Thread1of1ForFork2InUse, 188#(and (not (= |ULTIMATE.start_main_~#t803~0#1.base| |ULTIMATE.start_main_~#t804~0#1.base|)) (not (= |ULTIMATE.start_main_~#t802~0#1.base| |ULTIMATE.start_main_~#t801~0#1.base|)) (not (= |ULTIMATE.start_main_~#t803~0#1.base| |ULTIMATE.start_main_~#t801~0#1.base|)) (not (= |ULTIMATE.start_main_~#t803~0#1.base| |ULTIMATE.start_main_~#t802~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t802~0#1.base| 0) |ULTIMATE.start_main_~#t801~0#1.base| 0) |ULTIMATE.start_main_~#t803~0#1.base| 0) |ULTIMATE.start_main_~#t804~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t801~0#1.base| |ULTIMATE.start_main_~#t804~0#1.base|)) (not (= |ULTIMATE.start_main_~#t802~0#1.base| |ULTIMATE.start_main_~#t804~0#1.base|))), 212#true]) [2022-11-25 16:58:21,315 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2022-11-25 16:58:21,315 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-11-25 16:58:21,315 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-11-25 16:58:21,315 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-11-25 16:58:21,316 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([426] L782-->L789: Formula: (let ((.cse0 (not (= (mod v_~a$r_buff1_thd2~0_20 256) 0))) (.cse1 (not (= (mod v_~a$w_buff0_used~0_85 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd2~0_22 256) 0)))) (let ((.cse3 (and (not (= (mod v_~a$w_buff0_used~0_86 256) 0)) .cse5)) (.cse2 (and .cse1 .cse5)) (.cse4 (and (not (= (mod v_~a$w_buff1_used~0_75 256) 0)) .cse0))) (and (= v_~a$r_buff1_thd2~0_19 (ite (or (and (not (= (mod v_~a$w_buff1_used~0_74 256) 0)) .cse0) (and .cse1 (not (= (mod v_~a$r_buff0_thd2~0_21 256) 0)))) 0 v_~a$r_buff1_thd2~0_20)) (= v_~a$r_buff0_thd2~0_21 (ite .cse2 0 v_~a$r_buff0_thd2~0_22)) (= v_~a$w_buff0_used~0_85 (ite .cse3 0 v_~a$w_buff0_used~0_86)) (= v_~a~0_42 (ite .cse3 v_~a$w_buff0~0_32 (ite .cse4 v_~a$w_buff1~0_27 v_~a~0_43))) (= (ite (or .cse2 .cse4) 0 v_~a$w_buff1_used~0_75) v_~a$w_buff1_used~0_74)))) InVars {~a~0=v_~a~0_43, ~a$w_buff1~0=v_~a$w_buff1~0_27, ~a$w_buff0~0=v_~a$w_buff0~0_32, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_20, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_22, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_86, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_75} OutVars{~a~0=v_~a~0_42, ~a$w_buff1~0=v_~a$w_buff1~0_27, ~a$w_buff0~0=v_~a$w_buff0~0_32, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_19, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_21, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_85, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_74} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd2~0, ~a$r_buff0_thd2~0, ~a$w_buff0_used~0, ~a$w_buff1_used~0][37], [P0Thread1of1ForFork1InUse, Black: 194#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 162#true, 193#(= ~y~0 1), Black: 191#true, 137#L789true, 53#P2EXITtrue, Black: 201#(= ~y~0 0), Black: 199#true, Black: 169#true, Black: 209#(= ~x~0 0), Black: 177#(<= ~__unbuffered_p3_EAX~0 0), Black: 175#true, 85#L2true, 39#L769true, 46#L822true, P1Thread1of1ForFork3InUse, 207#true, P3Thread1of1ForFork0InUse, 202#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), P2Thread1of1ForFork2InUse, 188#(and (not (= |ULTIMATE.start_main_~#t803~0#1.base| |ULTIMATE.start_main_~#t804~0#1.base|)) (not (= |ULTIMATE.start_main_~#t802~0#1.base| |ULTIMATE.start_main_~#t801~0#1.base|)) (not (= |ULTIMATE.start_main_~#t803~0#1.base| |ULTIMATE.start_main_~#t801~0#1.base|)) (not (= |ULTIMATE.start_main_~#t803~0#1.base| |ULTIMATE.start_main_~#t802~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t802~0#1.base| 0) |ULTIMATE.start_main_~#t801~0#1.base| 0) |ULTIMATE.start_main_~#t803~0#1.base| 0) |ULTIMATE.start_main_~#t804~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t801~0#1.base| |ULTIMATE.start_main_~#t804~0#1.base|)) (not (= |ULTIMATE.start_main_~#t802~0#1.base| |ULTIMATE.start_main_~#t804~0#1.base|))), 178#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 212#true]) [2022-11-25 16:58:21,316 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2022-11-25 16:58:21,316 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-11-25 16:58:21,316 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-11-25 16:58:21,316 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-11-25 16:58:21,317 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([440] L822-->L838: Formula: (let ((.cse9 (= (mod v_~a$r_buff1_thd4~0_56 256) 0)) (.cse10 (= (mod v_~a$r_buff0_thd4~0_60 256) 0))) (let ((.cse11 (not .cse10)) (.cse4 (and .cse10 (= (mod v_~a$w_buff1_used~0_131 256) 0))) (.cse12 (= (mod v_~a$w_buff0_used~0_150 256) 0)) (.cse6 (and .cse9 .cse10))) (let ((.cse1 (or .cse4 .cse12 .cse6)) (.cse2 (and (not .cse12) .cse11))) (let ((.cse3 (ite .cse1 v_~a~0_87 (ite .cse2 v_~a$w_buff0~0_71 v_~a$w_buff1~0_62))) (.cse0 (not (= (mod v_~weak$$choice2~0_34 256) 0))) (.cse8 (= (mod v_~a$w_buff1_used~0_130 256) 0)) (.cse5 (= (mod v_~a$w_buff0_used~0_149 256) 0))) (and (= (ite .cse0 v_~a$w_buff0_used~0_150 (ite .cse1 v_~a$w_buff0_used~0_150 (ite .cse2 0 v_~a$w_buff0_used~0_150))) v_~a$w_buff0_used~0_149) (= v_~a~0_86 (ite .cse0 v_~a$mem_tmp~0_14 .cse3)) (= v_~weak$$choice2~0_34 |v_P3Thread1of1ForFork0_#t~nondet4_1|) (= v_~a$flush_delayed~0_21 0) (= (ite .cse0 v_~a$w_buff1_used~0_131 (ite (or .cse4 .cse5 .cse6) v_~a$w_buff1_used~0_131 0)) v_~a$w_buff1_used~0_130) (= .cse3 v_~__unbuffered_p3_EBX~0_10) (= v_~weak$$choice0~0_7 |v_P3Thread1of1ForFork0_#t~nondet3_1|) (= v_~a$w_buff0~0_71 v_~a$w_buff0~0_70) (= v_~a~0_87 v_~a$mem_tmp~0_14) (= v_~a$w_buff1~0_62 v_~a$w_buff1~0_61) (= (ite .cse0 v_~a$r_buff1_thd4~0_56 (ite (let ((.cse7 (= (mod v_~a$r_buff0_thd4~0_59 256) 0))) (or (and .cse7 .cse8) .cse5 (and .cse7 .cse9))) v_~a$r_buff1_thd4~0_56 0)) v_~a$r_buff1_thd4~0_55) (= (ite .cse0 v_~a$r_buff0_thd4~0_60 (ite (or (and .cse10 .cse8) .cse5 .cse6) v_~a$r_buff0_thd4~0_60 (ite (and .cse11 (not .cse5)) 0 v_~a$r_buff0_thd4~0_60))) v_~a$r_buff0_thd4~0_59)))))) InVars {~a~0=v_~a~0_87, ~a$w_buff1~0=v_~a$w_buff1~0_62, ~a$w_buff0~0=v_~a$w_buff0~0_71, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_56, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_150, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_131, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_60, P3Thread1of1ForFork0_#t~nondet3=|v_P3Thread1of1ForFork0_#t~nondet3_1|, P3Thread1of1ForFork0_#t~nondet4=|v_P3Thread1of1ForFork0_#t~nondet4_1|} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_55, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_149, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_59, ~a~0=v_~a~0_86, ~a$mem_tmp~0=v_~a$mem_tmp~0_14, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~a$w_buff1~0=v_~a$w_buff1~0_61, ~a$flush_delayed~0=v_~a$flush_delayed~0_21, ~a$w_buff0~0=v_~a$w_buff0~0_70, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_130, ~weak$$choice2~0=v_~weak$$choice2~0_34} 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, P3Thread1of1ForFork0_#t~nondet3, P3Thread1of1ForFork0_#t~nondet4][146], [P0Thread1of1ForFork1InUse, 42#L880true, Black: 194#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 162#true, 193#(= ~y~0 1), Black: 191#true, 53#P2EXITtrue, Black: 201#(= ~y~0 0), Black: 171#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 202#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 51#L782true, Black: 209#(= ~x~0 0), Black: 177#(<= ~__unbuffered_p3_EAX~0 0), 141#L838true, Black: 178#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 199#true, 175#true, P1Thread1of1ForFork3InUse, 207#true, P3Thread1of1ForFork0InUse, P2Thread1of1ForFork2InUse, 89#L762true, 188#(and (not (= |ULTIMATE.start_main_~#t803~0#1.base| |ULTIMATE.start_main_~#t804~0#1.base|)) (not (= |ULTIMATE.start_main_~#t802~0#1.base| |ULTIMATE.start_main_~#t801~0#1.base|)) (not (= |ULTIMATE.start_main_~#t803~0#1.base| |ULTIMATE.start_main_~#t801~0#1.base|)) (not (= |ULTIMATE.start_main_~#t803~0#1.base| |ULTIMATE.start_main_~#t802~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t802~0#1.base| 0) |ULTIMATE.start_main_~#t801~0#1.base| 0) |ULTIMATE.start_main_~#t803~0#1.base| 0) |ULTIMATE.start_main_~#t804~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t801~0#1.base| |ULTIMATE.start_main_~#t804~0#1.base|)) (not (= |ULTIMATE.start_main_~#t802~0#1.base| |ULTIMATE.start_main_~#t804~0#1.base|))), 212#true]) [2022-11-25 16:58:21,317 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2022-11-25 16:58:21,317 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-11-25 16:58:21,317 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-11-25 16:58:21,318 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-11-25 16:58:21,528 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([440] L822-->L838: Formula: (let ((.cse9 (= (mod v_~a$r_buff1_thd4~0_56 256) 0)) (.cse10 (= (mod v_~a$r_buff0_thd4~0_60 256) 0))) (let ((.cse11 (not .cse10)) (.cse4 (and .cse10 (= (mod v_~a$w_buff1_used~0_131 256) 0))) (.cse12 (= (mod v_~a$w_buff0_used~0_150 256) 0)) (.cse6 (and .cse9 .cse10))) (let ((.cse1 (or .cse4 .cse12 .cse6)) (.cse2 (and (not .cse12) .cse11))) (let ((.cse3 (ite .cse1 v_~a~0_87 (ite .cse2 v_~a$w_buff0~0_71 v_~a$w_buff1~0_62))) (.cse0 (not (= (mod v_~weak$$choice2~0_34 256) 0))) (.cse8 (= (mod v_~a$w_buff1_used~0_130 256) 0)) (.cse5 (= (mod v_~a$w_buff0_used~0_149 256) 0))) (and (= (ite .cse0 v_~a$w_buff0_used~0_150 (ite .cse1 v_~a$w_buff0_used~0_150 (ite .cse2 0 v_~a$w_buff0_used~0_150))) v_~a$w_buff0_used~0_149) (= v_~a~0_86 (ite .cse0 v_~a$mem_tmp~0_14 .cse3)) (= v_~weak$$choice2~0_34 |v_P3Thread1of1ForFork0_#t~nondet4_1|) (= v_~a$flush_delayed~0_21 0) (= (ite .cse0 v_~a$w_buff1_used~0_131 (ite (or .cse4 .cse5 .cse6) v_~a$w_buff1_used~0_131 0)) v_~a$w_buff1_used~0_130) (= .cse3 v_~__unbuffered_p3_EBX~0_10) (= v_~weak$$choice0~0_7 |v_P3Thread1of1ForFork0_#t~nondet3_1|) (= v_~a$w_buff0~0_71 v_~a$w_buff0~0_70) (= v_~a~0_87 v_~a$mem_tmp~0_14) (= v_~a$w_buff1~0_62 v_~a$w_buff1~0_61) (= (ite .cse0 v_~a$r_buff1_thd4~0_56 (ite (let ((.cse7 (= (mod v_~a$r_buff0_thd4~0_59 256) 0))) (or (and .cse7 .cse8) .cse5 (and .cse7 .cse9))) v_~a$r_buff1_thd4~0_56 0)) v_~a$r_buff1_thd4~0_55) (= (ite .cse0 v_~a$r_buff0_thd4~0_60 (ite (or (and .cse10 .cse8) .cse5 .cse6) v_~a$r_buff0_thd4~0_60 (ite (and .cse11 (not .cse5)) 0 v_~a$r_buff0_thd4~0_60))) v_~a$r_buff0_thd4~0_59)))))) InVars {~a~0=v_~a~0_87, ~a$w_buff1~0=v_~a$w_buff1~0_62, ~a$w_buff0~0=v_~a$w_buff0~0_71, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_56, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_150, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_131, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_60, P3Thread1of1ForFork0_#t~nondet3=|v_P3Thread1of1ForFork0_#t~nondet3_1|, P3Thread1of1ForFork0_#t~nondet4=|v_P3Thread1of1ForFork0_#t~nondet4_1|} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_55, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_149, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_59, ~a~0=v_~a~0_86, ~a$mem_tmp~0=v_~a$mem_tmp~0_14, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~a$w_buff1~0=v_~a$w_buff1~0_61, ~a$flush_delayed~0=v_~a$flush_delayed~0_21, ~a$w_buff0~0=v_~a$w_buff0~0_70, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_130, ~weak$$choice2~0=v_~weak$$choice2~0_34} 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, P3Thread1of1ForFork0_#t~nondet3, P3Thread1of1ForFork0_#t~nondet4][146], [P0Thread1of1ForFork1InUse, 42#L880true, Black: 194#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 162#true, 193#(= ~y~0 1), Black: 191#true, 53#P2EXITtrue, Black: 201#(= ~y~0 0), Black: 171#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 202#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 51#L782true, Black: 209#(= ~x~0 0), Black: 177#(<= ~__unbuffered_p3_EAX~0 0), 141#L838true, Black: 178#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 39#L769true, 199#true, 175#true, P1Thread1of1ForFork3InUse, 207#true, P3Thread1of1ForFork0InUse, P2Thread1of1ForFork2InUse, 188#(and (not (= |ULTIMATE.start_main_~#t803~0#1.base| |ULTIMATE.start_main_~#t804~0#1.base|)) (not (= |ULTIMATE.start_main_~#t802~0#1.base| |ULTIMATE.start_main_~#t801~0#1.base|)) (not (= |ULTIMATE.start_main_~#t803~0#1.base| |ULTIMATE.start_main_~#t801~0#1.base|)) (not (= |ULTIMATE.start_main_~#t803~0#1.base| |ULTIMATE.start_main_~#t802~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t802~0#1.base| 0) |ULTIMATE.start_main_~#t801~0#1.base| 0) |ULTIMATE.start_main_~#t803~0#1.base| 0) |ULTIMATE.start_main_~#t804~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t801~0#1.base| |ULTIMATE.start_main_~#t804~0#1.base|)) (not (= |ULTIMATE.start_main_~#t802~0#1.base| |ULTIMATE.start_main_~#t804~0#1.base|))), 212#true]) [2022-11-25 16:58:21,528 INFO L383 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2022-11-25 16:58:21,528 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-11-25 16:58:21,528 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-11-25 16:58:21,528 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-11-25 16:58:21,529 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([426] L782-->L789: Formula: (let ((.cse0 (not (= (mod v_~a$r_buff1_thd2~0_20 256) 0))) (.cse1 (not (= (mod v_~a$w_buff0_used~0_85 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd2~0_22 256) 0)))) (let ((.cse3 (and (not (= (mod v_~a$w_buff0_used~0_86 256) 0)) .cse5)) (.cse2 (and .cse1 .cse5)) (.cse4 (and (not (= (mod v_~a$w_buff1_used~0_75 256) 0)) .cse0))) (and (= v_~a$r_buff1_thd2~0_19 (ite (or (and (not (= (mod v_~a$w_buff1_used~0_74 256) 0)) .cse0) (and .cse1 (not (= (mod v_~a$r_buff0_thd2~0_21 256) 0)))) 0 v_~a$r_buff1_thd2~0_20)) (= v_~a$r_buff0_thd2~0_21 (ite .cse2 0 v_~a$r_buff0_thd2~0_22)) (= v_~a$w_buff0_used~0_85 (ite .cse3 0 v_~a$w_buff0_used~0_86)) (= v_~a~0_42 (ite .cse3 v_~a$w_buff0~0_32 (ite .cse4 v_~a$w_buff1~0_27 v_~a~0_43))) (= (ite (or .cse2 .cse4) 0 v_~a$w_buff1_used~0_75) v_~a$w_buff1_used~0_74)))) InVars {~a~0=v_~a~0_43, ~a$w_buff1~0=v_~a$w_buff1~0_27, ~a$w_buff0~0=v_~a$w_buff0~0_32, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_20, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_22, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_86, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_75} OutVars{~a~0=v_~a~0_42, ~a$w_buff1~0=v_~a$w_buff1~0_27, ~a$w_buff0~0=v_~a$w_buff0~0_32, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_19, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_21, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_85, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_74} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd2~0, ~a$r_buff0_thd2~0, ~a$w_buff0_used~0, ~a$w_buff1_used~0][37], [P0Thread1of1ForFork1InUse, 42#L880true, Black: 194#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 162#true, 193#(= ~y~0 1), Black: 191#true, 137#L789true, 53#P2EXITtrue, Black: 201#(= ~y~0 0), Black: 199#true, Black: 169#true, Black: 209#(= ~x~0 0), Black: 177#(<= ~__unbuffered_p3_EAX~0 0), Black: 175#true, 39#L769true, 46#L822true, P1Thread1of1ForFork3InUse, 207#true, P3Thread1of1ForFork0InUse, 202#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), P2Thread1of1ForFork2InUse, 188#(and (not (= |ULTIMATE.start_main_~#t803~0#1.base| |ULTIMATE.start_main_~#t804~0#1.base|)) (not (= |ULTIMATE.start_main_~#t802~0#1.base| |ULTIMATE.start_main_~#t801~0#1.base|)) (not (= |ULTIMATE.start_main_~#t803~0#1.base| |ULTIMATE.start_main_~#t801~0#1.base|)) (not (= |ULTIMATE.start_main_~#t803~0#1.base| |ULTIMATE.start_main_~#t802~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t802~0#1.base| 0) |ULTIMATE.start_main_~#t801~0#1.base| 0) |ULTIMATE.start_main_~#t803~0#1.base| 0) |ULTIMATE.start_main_~#t804~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t801~0#1.base| |ULTIMATE.start_main_~#t804~0#1.base|)) (not (= |ULTIMATE.start_main_~#t802~0#1.base| |ULTIMATE.start_main_~#t804~0#1.base|))), 178#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 212#true]) [2022-11-25 16:58:21,529 INFO L383 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2022-11-25 16:58:21,529 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-11-25 16:58:21,529 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-11-25 16:58:21,529 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-11-25 16:58:21,921 INFO L130 PetriNetUnfolder]: 13143/19441 cut-off events. [2022-11-25 16:58:21,921 INFO L131 PetriNetUnfolder]: For 60616/63187 co-relation queries the response was YES. [2022-11-25 16:58:22,007 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61114 conditions, 19441 events. 13143/19441 cut-off events. For 60616/63187 co-relation queries the response was YES. Maximal size of possible extension queue 1030. Compared 128411 event pairs, 1974 based on Foata normal form. 1962/21014 useless extension candidates. Maximal degree in co-relation 61099. Up to 11998 conditions per place. [2022-11-25 16:58:22,072 INFO L137 encePairwiseOnDemand]: 283/290 looper letters, 134 selfloop transitions, 10 changer transitions 0/169 dead transitions. [2022-11-25 16:58:22,073 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 169 transitions, 1887 flow [2022-11-25 16:58:22,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 16:58:22,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-25 16:58:22,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 707 transitions. [2022-11-25 16:58:22,076 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.48758620689655174 [2022-11-25 16:58:22,076 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 707 transitions. [2022-11-25 16:58:22,076 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 707 transitions. [2022-11-25 16:58:22,077 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 16:58:22,077 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 707 transitions. [2022-11-25 16:58:22,079 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 141.4) internal successors, (707), 5 states have internal predecessors, (707), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:58:22,081 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 290.0) internal successors, (1740), 6 states have internal predecessors, (1740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:58:22,082 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 290.0) internal successors, (1740), 6 states have internal predecessors, (1740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:58:22,082 INFO L175 Difference]: Start difference. First operand has 61 places, 68 transitions, 696 flow. Second operand 5 states and 707 transitions. [2022-11-25 16:58:22,082 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 169 transitions, 1887 flow [2022-11-25 16:58:22,130 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 169 transitions, 1867 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-25 16:58:22,132 INFO L231 Difference]: Finished difference. Result has 67 places, 77 transitions, 761 flow [2022-11-25 16:58:22,132 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=290, PETRI_DIFFERENCE_MINUEND_FLOW=686, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=761, PETRI_PLACES=67, PETRI_TRANSITIONS=77} [2022-11-25 16:58:22,133 INFO L288 CegarLoopForPetriNet]: 53 programPoint places, 14 predicate places. [2022-11-25 16:58:22,133 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 77 transitions, 761 flow [2022-11-25 16:58:22,134 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 130.5) internal successors, (522), 4 states have internal predecessors, (522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:58:22,134 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 16:58:22,134 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:58:22,134 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-25 16:58:22,134 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-11-25 16:58:22,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:58:22,135 INFO L85 PathProgramCache]: Analyzing trace with hash -1078709716, now seen corresponding path program 1 times [2022-11-25 16:58:22,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:58:22,135 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938700125] [2022-11-25 16:58:22,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:58:22,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:58:22,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:58: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-11-25 16:58:22,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:58:22,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938700125] [2022-11-25 16:58:22,331 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [938700125] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:58:22,331 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:58:22,331 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 16:58:22,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711654976] [2022-11-25 16:58:22,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:58:22,332 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 16:58:22,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:58:22,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 16:58:22,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-25 16:58:22,346 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 290 [2022-11-25 16:58:22,347 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 77 transitions, 761 flow. Second operand has 5 states, 5 states have (on average 130.2) internal successors, (651), 5 states have internal predecessors, (651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:58:22,347 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 16:58:22,348 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 290 [2022-11-25 16:58:22,348 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 16:58:24,603 INFO L130 PetriNetUnfolder]: 10691/16229 cut-off events. [2022-11-25 16:58:24,603 INFO L131 PetriNetUnfolder]: For 56067/57915 co-relation queries the response was YES. [2022-11-25 16:58:24,652 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61935 conditions, 16229 events. 10691/16229 cut-off events. For 56067/57915 co-relation queries the response was YES. Maximal size of possible extension queue 876. Compared 109754 event pairs, 924 based on Foata normal form. 1378/17295 useless extension candidates. Maximal degree in co-relation 61917. Up to 5141 conditions per place. [2022-11-25 16:58:24,681 INFO L137 encePairwiseOnDemand]: 283/290 looper letters, 180 selfloop transitions, 19 changer transitions 2/226 dead transitions. [2022-11-25 16:58:24,682 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 226 transitions, 2539 flow [2022-11-25 16:58:24,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 16:58:24,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-25 16:58:24,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 992 transitions. [2022-11-25 16:58:24,685 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4886699507389163 [2022-11-25 16:58:24,685 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 992 transitions. [2022-11-25 16:58:24,685 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 992 transitions. [2022-11-25 16:58:24,686 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 16:58:24,686 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 992 transitions. [2022-11-25 16:58:24,688 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 141.71428571428572) internal successors, (992), 7 states have internal predecessors, (992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:58:24,691 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 290.0) internal successors, (2320), 8 states have internal predecessors, (2320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:58:24,692 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 290.0) internal successors, (2320), 8 states have internal predecessors, (2320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:58:24,692 INFO L175 Difference]: Start difference. First operand has 67 places, 77 transitions, 761 flow. Second operand 7 states and 992 transitions. [2022-11-25 16:58:24,693 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 226 transitions, 2539 flow [2022-11-25 16:58:24,862 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 226 transitions, 2534 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-25 16:58:24,865 INFO L231 Difference]: Finished difference. Result has 75 places, 86 transitions, 890 flow [2022-11-25 16:58:24,866 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=290, PETRI_DIFFERENCE_MINUEND_FLOW=756, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=890, PETRI_PLACES=75, PETRI_TRANSITIONS=86} [2022-11-25 16:58:24,867 INFO L288 CegarLoopForPetriNet]: 53 programPoint places, 22 predicate places. [2022-11-25 16:58:24,867 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 86 transitions, 890 flow [2022-11-25 16:58:24,868 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 130.2) internal successors, (651), 5 states have internal predecessors, (651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:58:24,868 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 16:58:24,868 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-11-25 16:58:24,868 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-25 16:58:24,868 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-11-25 16:58:24,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:58:24,870 INFO L85 PathProgramCache]: Analyzing trace with hash 1761446412, now seen corresponding path program 1 times [2022-11-25 16:58:24,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:58:24,870 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271375174] [2022-11-25 16:58:24,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:58:24,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:58:24,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:58:25,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:58:25,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:58:25,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271375174] [2022-11-25 16:58:25,063 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1271375174] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:58:25,063 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:58:25,063 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 16:58:25,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442010722] [2022-11-25 16:58:25,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:58:25,064 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 16:58:25,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:58:25,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 16:58:25,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 16:58:25,070 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 290 [2022-11-25 16:58:25,071 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 86 transitions, 890 flow. Second operand has 3 states, 3 states have (on average 136.33333333333334) internal successors, (409), 3 states have internal predecessors, (409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:58:25,071 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 16:58:25,071 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 290 [2022-11-25 16:58:25,071 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 16:58:28,312 INFO L130 PetriNetUnfolder]: 17416/26441 cut-off events. [2022-11-25 16:58:28,313 INFO L131 PetriNetUnfolder]: For 119830/121489 co-relation queries the response was YES. [2022-11-25 16:58:28,439 INFO L83 FinitePrefix]: Finished finitePrefix Result has 117681 conditions, 26441 events. 17416/26441 cut-off events. For 119830/121489 co-relation queries the response was YES. Maximal size of possible extension queue 1378. Compared 187838 event pairs, 7559 based on Foata normal form. 725/26508 useless extension candidates. Maximal degree in co-relation 117660. Up to 13631 conditions per place. [2022-11-25 16:58:28,472 INFO L137 encePairwiseOnDemand]: 287/290 looper letters, 86 selfloop transitions, 12 changer transitions 22/132 dead transitions. [2022-11-25 16:58:28,472 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 132 transitions, 1497 flow [2022-11-25 16:58:28,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 16:58:28,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 16:58:28,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 436 transitions. [2022-11-25 16:58:28,474 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5011494252873563 [2022-11-25 16:58:28,474 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 436 transitions. [2022-11-25 16:58:28,474 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 436 transitions. [2022-11-25 16:58:28,474 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 16:58:28,475 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 436 transitions. [2022-11-25 16:58:28,475 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 145.33333333333334) internal successors, (436), 3 states have internal predecessors, (436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:58:28,477 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 290.0) internal successors, (1160), 4 states have internal predecessors, (1160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:58:28,478 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 290.0) internal successors, (1160), 4 states have internal predecessors, (1160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:58:28,478 INFO L175 Difference]: Start difference. First operand has 75 places, 86 transitions, 890 flow. Second operand 3 states and 436 transitions. [2022-11-25 16:58:28,478 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 132 transitions, 1497 flow [2022-11-25 16:58:32,693 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 132 transitions, 1399 flow, removed 34 selfloop flow, removed 3 redundant places. [2022-11-25 16:58:32,694 INFO L231 Difference]: Finished difference. Result has 75 places, 77 transitions, 770 flow [2022-11-25 16:58:32,694 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=290, PETRI_DIFFERENCE_MINUEND_FLOW=840, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=770, PETRI_PLACES=75, PETRI_TRANSITIONS=77} [2022-11-25 16:58:32,695 INFO L288 CegarLoopForPetriNet]: 53 programPoint places, 22 predicate places. [2022-11-25 16:58:32,695 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 77 transitions, 770 flow [2022-11-25 16:58:32,695 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 136.33333333333334) internal successors, (409), 3 states have internal predecessors, (409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:58:32,695 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 16:58:32,695 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-11-25 16:58:32,695 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-25 16:58:32,695 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-11-25 16:58:32,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:58:32,696 INFO L85 PathProgramCache]: Analyzing trace with hash -937594730, now seen corresponding path program 1 times [2022-11-25 16:58:32,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:58:32,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635948473] [2022-11-25 16:58:32,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:58:32,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:58:32,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:58:32,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:58:32,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:58:32,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635948473] [2022-11-25 16:58:32,925 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1635948473] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:58:32,925 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:58:32,926 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 16:58:32,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610189669] [2022-11-25 16:58:32,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:58:32,926 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 16:58:32,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:58:32,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 16:58:32,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-25 16:58:32,948 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 290 [2022-11-25 16:58:32,949 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 77 transitions, 770 flow. Second operand has 6 states, 6 states have (on average 130.0) internal successors, (780), 6 states have internal predecessors, (780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:58:32,950 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 16:58:32,950 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 290 [2022-11-25 16:58:32,950 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 16:58:36,128 INFO L130 PetriNetUnfolder]: 12387/18970 cut-off events. [2022-11-25 16:58:36,128 INFO L131 PetriNetUnfolder]: For 74462/76265 co-relation queries the response was YES. [2022-11-25 16:58:36,234 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75262 conditions, 18970 events. 12387/18970 cut-off events. For 74462/76265 co-relation queries the response was YES. Maximal size of possible extension queue 1050. Compared 133882 event pairs, 1056 based on Foata normal form. 944/19413 useless extension candidates. Maximal degree in co-relation 75240. Up to 4389 conditions per place. [2022-11-25 16:58:36,264 INFO L137 encePairwiseOnDemand]: 283/290 looper letters, 170 selfloop transitions, 25 changer transitions 42/256 dead transitions. [2022-11-25 16:58:36,264 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 256 transitions, 2986 flow [2022-11-25 16:58:36,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-25 16:58:36,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-25 16:58:36,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1272 transitions. [2022-11-25 16:58:36,269 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.48735632183908045 [2022-11-25 16:58:36,270 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1272 transitions. [2022-11-25 16:58:36,270 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1272 transitions. [2022-11-25 16:58:36,271 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 16:58:36,271 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1272 transitions. [2022-11-25 16:58:36,273 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 141.33333333333334) internal successors, (1272), 9 states have internal predecessors, (1272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:58:36,277 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 290.0) internal successors, (2900), 10 states have internal predecessors, (2900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:58:36,279 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 290.0) internal successors, (2900), 10 states have internal predecessors, (2900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:58:36,279 INFO L175 Difference]: Start difference. First operand has 75 places, 77 transitions, 770 flow. Second operand 9 states and 1272 transitions. [2022-11-25 16:58:36,279 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 256 transitions, 2986 flow [2022-11-25 16:58:37,684 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 256 transitions, 2895 flow, removed 26 selfloop flow, removed 1 redundant places. [2022-11-25 16:58:37,687 INFO L231 Difference]: Finished difference. Result has 85 places, 84 transitions, 888 flow [2022-11-25 16:58:37,688 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=290, PETRI_DIFFERENCE_MINUEND_FLOW=750, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=888, PETRI_PLACES=85, PETRI_TRANSITIONS=84} [2022-11-25 16:58:37,688 INFO L288 CegarLoopForPetriNet]: 53 programPoint places, 32 predicate places. [2022-11-25 16:58:37,688 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 84 transitions, 888 flow [2022-11-25 16:58:37,689 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 130.0) internal successors, (780), 6 states have internal predecessors, (780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:58:37,689 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 16:58:37,689 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-11-25 16:58:37,689 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-25 16:58:37,690 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-11-25 16:58:37,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:58:37,690 INFO L85 PathProgramCache]: Analyzing trace with hash 1881669710, now seen corresponding path program 1 times [2022-11-25 16:58:37,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:58:37,691 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599477737] [2022-11-25 16:58:37,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:58:37,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:58:37,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:58:38,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:58:38,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:58:38,003 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599477737] [2022-11-25 16:58:38,003 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599477737] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:58:38,003 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:58:38,003 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 16:58:38,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082285976] [2022-11-25 16:58:38,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:58:38,004 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 16:58:38,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:58:38,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 16:58:38,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-25 16:58:38,022 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 290 [2022-11-25 16:58:38,023 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 84 transitions, 888 flow. Second operand has 7 states, 7 states have (on average 130.0) internal successors, (910), 7 states have internal predecessors, (910), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:58:38,023 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 16:58:38,023 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 290 [2022-11-25 16:58:38,023 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 16:58:41,111 INFO L130 PetriNetUnfolder]: 12092/18510 cut-off events. [2022-11-25 16:58:41,111 INFO L131 PetriNetUnfolder]: For 78461/80140 co-relation queries the response was YES. [2022-11-25 16:58:41,209 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80079 conditions, 18510 events. 12092/18510 cut-off events. For 78461/80140 co-relation queries the response was YES. Maximal size of possible extension queue 1050. Compared 130845 event pairs, 1019 based on Foata normal form. 455/18466 useless extension candidates. Maximal degree in co-relation 80054. Up to 4252 conditions per place. [2022-11-25 16:58:41,226 INFO L137 encePairwiseOnDemand]: 283/290 looper letters, 93 selfloop transitions, 23 changer transitions 120/247 dead transitions. [2022-11-25 16:58:41,226 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 247 transitions, 2807 flow [2022-11-25 16:58:41,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-25 16:58:41,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-11-25 16:58:41,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1527 transitions. [2022-11-25 16:58:41,231 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4786833855799373 [2022-11-25 16:58:41,232 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1527 transitions. [2022-11-25 16:58:41,232 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1527 transitions. [2022-11-25 16:58:41,233 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 16:58:41,233 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1527 transitions. [2022-11-25 16:58:41,236 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 138.8181818181818) internal successors, (1527), 11 states have internal predecessors, (1527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:58:41,240 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 290.0) internal successors, (3480), 12 states have internal predecessors, (3480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:58:41,241 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 290.0) internal successors, (3480), 12 states have internal predecessors, (3480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:58:41,241 INFO L175 Difference]: Start difference. First operand has 85 places, 84 transitions, 888 flow. Second operand 11 states and 1527 transitions. [2022-11-25 16:58:41,241 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 247 transitions, 2807 flow [2022-11-25 16:58:45,733 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 247 transitions, 2705 flow, removed 37 selfloop flow, removed 5 redundant places. [2022-11-25 16:58:45,735 INFO L231 Difference]: Finished difference. Result has 93 places, 61 transitions, 576 flow [2022-11-25 16:58:45,736 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=290, PETRI_DIFFERENCE_MINUEND_FLOW=786, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=576, PETRI_PLACES=93, PETRI_TRANSITIONS=61} [2022-11-25 16:58:45,736 INFO L288 CegarLoopForPetriNet]: 53 programPoint places, 40 predicate places. [2022-11-25 16:58:45,736 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 61 transitions, 576 flow [2022-11-25 16:58:45,737 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 130.0) internal successors, (910), 7 states have internal predecessors, (910), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:58:45,737 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 16:58:45,737 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-11-25 16:58:45,737 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-25 16:58:45,737 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-11-25 16:58:45,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:58:45,738 INFO L85 PathProgramCache]: Analyzing trace with hash 1785408405, now seen corresponding path program 1 times [2022-11-25 16:58:45,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:58:45,738 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933382685] [2022-11-25 16:58:45,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:58:45,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:58:45,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:58:46,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:58:46,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:58:46,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933382685] [2022-11-25 16:58:46,037 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933382685] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:58:46,037 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:58:46,037 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 16:58:46,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830011005] [2022-11-25 16:58:46,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:58:46,038 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 16:58:46,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:58:46,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 16:58:46,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-25 16:58:46,057 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 290 [2022-11-25 16:58:46,058 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 61 transitions, 576 flow. Second operand has 5 states, 5 states have (on average 126.6) internal successors, (633), 5 states have internal predecessors, (633), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:58:46,058 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 16:58:46,058 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 290 [2022-11-25 16:58:46,058 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 16:58:47,019 INFO L130 PetriNetUnfolder]: 3196/5000 cut-off events. [2022-11-25 16:58:47,020 INFO L131 PetriNetUnfolder]: For 21583/21583 co-relation queries the response was YES. [2022-11-25 16:58:47,049 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21276 conditions, 5000 events. 3196/5000 cut-off events. For 21583/21583 co-relation queries the response was YES. Maximal size of possible extension queue 259. Compared 27860 event pairs, 348 based on Foata normal form. 2/5002 useless extension candidates. Maximal degree in co-relation 21248. Up to 2091 conditions per place. [2022-11-25 16:58:47,054 INFO L137 encePairwiseOnDemand]: 281/290 looper letters, 58 selfloop transitions, 6 changer transitions 79/143 dead transitions. [2022-11-25 16:58:47,054 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 143 transitions, 1512 flow [2022-11-25 16:58:47,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 16:58:47,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-25 16:58:47,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 678 transitions. [2022-11-25 16:58:47,064 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4675862068965517 [2022-11-25 16:58:47,064 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 678 transitions. [2022-11-25 16:58:47,064 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 678 transitions. [2022-11-25 16:58:47,065 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 16:58:47,065 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 678 transitions. [2022-11-25 16:58:47,067 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 135.6) internal successors, (678), 5 states have internal predecessors, (678), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:58:47,069 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 290.0) internal successors, (1740), 6 states have internal predecessors, (1740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:58:47,069 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 290.0) internal successors, (1740), 6 states have internal predecessors, (1740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:58:47,070 INFO L175 Difference]: Start difference. First operand has 93 places, 61 transitions, 576 flow. Second operand 5 states and 678 transitions. [2022-11-25 16:58:47,070 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 143 transitions, 1512 flow [2022-11-25 16:58:47,166 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 143 transitions, 1149 flow, removed 76 selfloop flow, removed 20 redundant places. [2022-11-25 16:58:47,168 INFO L231 Difference]: Finished difference. Result has 76 places, 40 transitions, 241 flow [2022-11-25 16:58:47,168 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=290, PETRI_DIFFERENCE_MINUEND_FLOW=416, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=241, PETRI_PLACES=76, PETRI_TRANSITIONS=40} [2022-11-25 16:58:47,169 INFO L288 CegarLoopForPetriNet]: 53 programPoint places, 23 predicate places. [2022-11-25 16:58:47,169 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 40 transitions, 241 flow [2022-11-25 16:58:47,169 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 126.6) internal successors, (633), 5 states have internal predecessors, (633), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:58:47,169 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 16:58:47,170 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-11-25 16:58:47,170 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-25 16:58:47,170 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-11-25 16:58:47,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:58:47,171 INFO L85 PathProgramCache]: Analyzing trace with hash -1346393677, now seen corresponding path program 2 times [2022-11-25 16:58:47,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:58:47,171 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645169899] [2022-11-25 16:58:47,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:58:47,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:58:47,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:58:48,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:58:48,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:58:48,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645169899] [2022-11-25 16:58:48,512 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645169899] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:58:48,512 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:58:48,512 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 16:58:48,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390596342] [2022-11-25 16:58:48,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:58:48,513 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-25 16:58:48,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:58:48,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-25 16:58:48,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-25 16:58:48,580 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 290 [2022-11-25 16:58:48,581 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 40 transitions, 241 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-11-25 16:58:48,581 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 16:58:48,581 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 290 [2022-11-25 16:58:48,581 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 16:58:49,030 INFO L130 PetriNetUnfolder]: 751/1224 cut-off events. [2022-11-25 16:58:49,030 INFO L131 PetriNetUnfolder]: For 2110/2149 co-relation queries the response was YES. [2022-11-25 16:58:49,032 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4361 conditions, 1224 events. 751/1224 cut-off events. For 2110/2149 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 5391 event pairs, 143 based on Foata normal form. 1/1224 useless extension candidates. Maximal degree in co-relation 4341. Up to 566 conditions per place. [2022-11-25 16:58:49,035 INFO L137 encePairwiseOnDemand]: 283/290 looper letters, 71 selfloop transitions, 5 changer transitions 31/111 dead transitions. [2022-11-25 16:58:49,035 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 111 transitions, 826 flow [2022-11-25 16:58:49,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 16:58:49,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-25 16:58:49,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 840 transitions. [2022-11-25 16:58:49,038 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4827586206896552 [2022-11-25 16:58:49,038 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 840 transitions. [2022-11-25 16:58:49,038 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 840 transitions. [2022-11-25 16:58:49,039 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 16:58:49,039 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 840 transitions. [2022-11-25 16:58:49,041 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 140.0) internal successors, (840), 6 states have internal predecessors, (840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:58:49,043 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 290.0) internal successors, (2030), 7 states have internal predecessors, (2030), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:58:49,044 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 290.0) internal successors, (2030), 7 states have internal predecessors, (2030), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:58:49,044 INFO L175 Difference]: Start difference. First operand has 76 places, 40 transitions, 241 flow. Second operand 6 states and 840 transitions. [2022-11-25 16:58:49,044 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 111 transitions, 826 flow [2022-11-25 16:58:49,057 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 111 transitions, 673 flow, removed 32 selfloop flow, removed 18 redundant places. [2022-11-25 16:58:49,058 INFO L231 Difference]: Finished difference. Result has 58 places, 43 transitions, 192 flow [2022-11-25 16:58:49,059 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=290, PETRI_DIFFERENCE_MINUEND_FLOW=161, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=192, PETRI_PLACES=58, PETRI_TRANSITIONS=43} [2022-11-25 16:58:49,059 INFO L288 CegarLoopForPetriNet]: 53 programPoint places, 5 predicate places. [2022-11-25 16:58:49,060 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 43 transitions, 192 flow [2022-11-25 16:58:49,060 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-11-25 16:58:49,060 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 16:58:49,061 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-11-25 16:58:49,061 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-25 16:58:49,061 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-25 16:58:49,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:58:49,062 INFO L85 PathProgramCache]: Analyzing trace with hash 982429835, now seen corresponding path program 3 times [2022-11-25 16:58:49,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:58:49,062 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234091377] [2022-11-25 16:58:49,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:58:49,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:58:49,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 16:58:49,151 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 16:58:49,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 16:58:49,285 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 16:58:49,288 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-11-25 16:58:49,290 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (15 of 16 remaining) [2022-11-25 16:58:49,292 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (14 of 16 remaining) [2022-11-25 16:58:49,292 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2022-11-25 16:58:49,293 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining) [2022-11-25 16:58:49,293 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2022-11-25 16:58:49,293 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2022-11-25 16:58:49,293 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2022-11-25 16:58:49,293 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2022-11-25 16:58:49,294 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2022-11-25 16:58:49,294 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2022-11-25 16:58:49,295 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (5 of 16 remaining) [2022-11-25 16:58:49,295 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 16 remaining) [2022-11-25 16:58:49,295 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 16 remaining) [2022-11-25 16:58:49,295 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 16 remaining) [2022-11-25 16:58:49,295 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 16 remaining) [2022-11-25 16:58:49,296 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2022-11-25 16:58:49,296 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-25 16:58:49,296 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:58:49,302 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-25 16:58:49,302 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-25 16:58:49,430 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 04:58:49 BasicIcfg [2022-11-25 16:58:49,432 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-25 16:58:49,433 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-25 16:58:49,433 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-25 16:58:49,433 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-25 16:58:49,434 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 04:57:41" (3/4) ... [2022-11-25 16:58:49,436 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-25 16:58:49,437 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-25 16:58:49,437 INFO L158 Benchmark]: Toolchain (without parser) took 70052.97ms. Allocated memory was 153.1MB in the beginning and 7.3GB in the end (delta: 7.2GB). Free memory was 108.2MB in the beginning and 6.6GB in the end (delta: -6.5GB). Peak memory consumption was 725.5MB. Max. memory is 16.1GB. [2022-11-25 16:58:49,438 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 153.1MB. Free memory is still 99.1MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 16:58:49,438 INFO L158 Benchmark]: CACSL2BoogieTranslator took 650.72ms. Allocated memory is still 153.1MB. Free memory was 107.8MB in the beginning and 79.7MB in the end (delta: 28.1MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2022-11-25 16:58:49,438 INFO L158 Benchmark]: Boogie Procedure Inliner took 97.01ms. Allocated memory is still 153.1MB. Free memory was 79.7MB in the beginning and 77.2MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 16:58:49,439 INFO L158 Benchmark]: Boogie Preprocessor took 67.72ms. Allocated memory is still 153.1MB. Free memory was 77.2MB in the beginning and 75.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 16:58:49,439 INFO L158 Benchmark]: RCFGBuilder took 918.27ms. Allocated memory was 153.1MB in the beginning and 226.5MB in the end (delta: 73.4MB). Free memory was 75.1MB in the beginning and 170.4MB in the end (delta: -95.2MB). Peak memory consumption was 19.1MB. Max. memory is 16.1GB. [2022-11-25 16:58:49,440 INFO L158 Benchmark]: TraceAbstraction took 68307.42ms. Allocated memory was 226.5MB in the beginning and 7.3GB in the end (delta: 7.1GB). Free memory was 169.1MB in the beginning and 6.6GB in the end (delta: -6.4GB). Peak memory consumption was 708.4MB. Max. memory is 16.1GB. [2022-11-25 16:58:49,440 INFO L158 Benchmark]: Witness Printer took 4.07ms. Allocated memory is still 7.3GB. Free memory was 6.6GB in the beginning and 6.6GB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 16:58:49,442 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.28ms. Allocated memory is still 153.1MB. Free memory is still 99.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 650.72ms. Allocated memory is still 153.1MB. Free memory was 107.8MB in the beginning and 79.7MB in the end (delta: 28.1MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 97.01ms. Allocated memory is still 153.1MB. Free memory was 79.7MB in the beginning and 77.2MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 67.72ms. Allocated memory is still 153.1MB. Free memory was 77.2MB in the beginning and 75.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 918.27ms. Allocated memory was 153.1MB in the beginning and 226.5MB in the end (delta: 73.4MB). Free memory was 75.1MB in the beginning and 170.4MB in the end (delta: -95.2MB). Peak memory consumption was 19.1MB. Max. memory is 16.1GB. * TraceAbstraction took 68307.42ms. Allocated memory was 226.5MB in the beginning and 7.3GB in the end (delta: 7.1GB). Free memory was 169.1MB in the beginning and 6.6GB in the end (delta: -6.4GB). Peak memory consumption was 708.4MB. Max. memory is 16.1GB. * Witness Printer took 4.07ms. Allocated memory is still 7.3GB. Free memory was 6.6GB in the beginning and 6.6GB 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: 6.4s, 155 PlacesBefore, 53 PlacesAfterwards, 144 TransitionsBefore, 41 TransitionsAfterwards, 3764 CoEnabledTransitionPairs, 7 FixpointIterations, 57 TrivialSequentialCompositions, 78 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 1 ChoiceCompositions, 142 TotalNumberOfCompositions, 10926 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 5700, independent: 5456, independent conditional: 0, independent unconditional: 5456, dependent: 244, dependent conditional: 0, dependent unconditional: 244, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2943, independent: 2850, independent conditional: 0, independent unconditional: 2850, dependent: 93, dependent conditional: 0, dependent unconditional: 93, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2943, independent: 2804, independent conditional: 0, independent unconditional: 2804, dependent: 139, dependent conditional: 0, dependent unconditional: 139, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 139, independent: 46, independent conditional: 0, independent unconditional: 46, dependent: 93, dependent conditional: 0, dependent unconditional: 93, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 630, independent: 80, independent conditional: 0, independent unconditional: 80, dependent: 551, dependent conditional: 0, dependent unconditional: 551, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 5700, independent: 2606, independent conditional: 0, independent unconditional: 2606, dependent: 151, dependent conditional: 0, dependent unconditional: 151, unknown: 2943, unknown conditional: 0, unknown unconditional: 2943] , Statistics on independence cache: Total cache size (in pairs): 422, Positive cache size: 391, Positive conditional cache size: 0, Positive unconditional cache size: 391, Negative cache size: 31, Negative conditional cache size: 0, Negative unconditional cache size: 31, 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_p3_EAX = 0; [L714] 0 int __unbuffered_p3_EBX = 0; [L716] 0 int a = 0; [L717] 0 _Bool a$flush_delayed; [L718] 0 int a$mem_tmp; [L719] 0 _Bool a$r_buff0_thd0; [L720] 0 _Bool a$r_buff0_thd1; [L721] 0 _Bool a$r_buff0_thd2; [L722] 0 _Bool a$r_buff0_thd3; [L723] 0 _Bool a$r_buff0_thd4; [L724] 0 _Bool a$r_buff1_thd0; [L725] 0 _Bool a$r_buff1_thd1; [L726] 0 _Bool a$r_buff1_thd2; [L727] 0 _Bool a$r_buff1_thd3; [L728] 0 _Bool a$r_buff1_thd4; [L729] 0 _Bool a$read_delayed; [L730] 0 int *a$read_delayed_var; [L731] 0 int a$w_buff0; [L732] 0 _Bool a$w_buff0_used; [L733] 0 int a$w_buff1; [L734] 0 _Bool a$w_buff1_used; [L735] 0 _Bool main$tmp_guard0; [L736] 0 _Bool main$tmp_guard1; [L738] 0 int x = 0; [L740] 0 int y = 0; [L742] 0 int z = 0; [L743] 0 _Bool weak$$choice0; [L744] 0 _Bool weak$$choice2; [L862] 0 pthread_t t801; [L863] FCALL, FORK 0 pthread_create(&t801, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=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(&t801, ((void *)0), P0, ((void *)0))=-2, t801={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L864] 0 pthread_t t802; [L865] FCALL, FORK 0 pthread_create(&t802, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=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(&t802, ((void *)0), P1, ((void *)0))=-1, t801={5:0}, t802={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L866] 0 pthread_t t803; [L867] FCALL, FORK 0 pthread_create(&t803, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=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(&t803, ((void *)0), P2, ((void *)0))=0, t801={5:0}, t802={6:0}, t803={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L868] 0 pthread_t t804; [L869] FCALL, FORK 0 pthread_create(&t804, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=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(&t804, ((void *)0), P3, ((void *)0))=1, t801={5:0}, t802={6:0}, t803={7:0}, t804={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L748] 1 a$w_buff1 = a$w_buff0 [L749] 1 a$w_buff0 = 1 [L750] 1 a$w_buff1_used = a$w_buff0_used [L751] 1 a$w_buff0_used = (_Bool)1 [L752] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L752] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L753] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L754] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L755] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L756] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L757] 1 a$r_buff1_thd4 = a$r_buff0_thd4 [L758] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=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] [L761] 1 x = 1 VAL [__unbuffered_cnt=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] [L778] 2 x = 2 VAL [__unbuffered_cnt=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] [L781] 2 y = 1 VAL [__unbuffered_cnt=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] [L798] 3 y = 2 VAL [__unbuffered_cnt=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=2, z=0] [L801] 3 z = 1 VAL [__unbuffered_cnt=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=2, z=1] [L818] 4 z = 2 VAL [__unbuffered_cnt=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=2, z=2] [L821] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=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=2, z=2] [L824] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L825] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L826] 4 a$flush_delayed = weak$$choice2 [L827] 4 a$mem_tmp = a [L828] 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) [L829] 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)) [L830] 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)) [L831] 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)) [L832] 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)) [L833] 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)) [L834] 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)) [L835] 4 __unbuffered_p3_EBX = a [L836] 4 a = a$flush_delayed ? a$mem_tmp : a [L837] 4 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=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=2, z=2] [L840] 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) [L841] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L842] 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 [L843] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L844] 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_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=2, z=2] [L764] 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) [L765] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L766] 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 [L767] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L768] 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_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=2, z=2] [L771] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L773] 1 return 0; [L784] 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) [L785] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L786] 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 [L787] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L788] 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_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=2, z=2] [L791] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L793] 2 return 0; [L804] 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) [L805] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L806] 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 [L807] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L808] 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_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=2, z=2] [L811] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L813] 3 return 0; [L847] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L849] 4 return 0; [L871] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L873] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L873] RET 0 assume_abort_if_not(main$tmp_guard0) [L875] 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) [L876] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L877] 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 [L878] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L879] 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_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, t801={5:0}, t802={6:0}, t803={7:0}, t804={3:0}, weak$$choice0=49, weak$$choice2=0, x=2, y=2, z=2] [L882] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2 && __unbuffered_p3_EAX == 2 && __unbuffered_p3_EBX == 0) [L884] 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_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=2, 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: 860]: 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: 863]: 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, 185 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: 68.0s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 55.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1023 SdHoareTripleChecker+Valid, 3.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 837 mSDsluCounter, 249 SdHoareTripleChecker+Invalid, 2.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 187 mSDsCounter, 133 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2364 IncrementalHoareTripleChecker+Invalid, 2497 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 133 mSolverCounterUnsat, 62 mSDtfsCounter, 2364 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 58 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=890occurred in iteration=10, InterpolantAutomatonStates: 76, 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.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 4.8s InterpolantComputationTime, 265 NumberOfCodeBlocks, 265 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 222 ConstructedInterpolants, 0 QuantifiedInterpolants, 1698 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 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-11-25 16:58:49,484 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e025b304-97e6-42d7-a3ce-aa44b34f6f9b/bin/uautomizer-ZsLfNo2U6R/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_e025b304-97e6-42d7-a3ce-aa44b34f6f9b/bin/uautomizer-ZsLfNo2U6R/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e025b304-97e6-42d7-a3ce-aa44b34f6f9b/bin/uautomizer-ZsLfNo2U6R/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e025b304-97e6-42d7-a3ce-aa44b34f6f9b/bin/uautomizer-ZsLfNo2U6R/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e025b304-97e6-42d7-a3ce-aa44b34f6f9b/bin/uautomizer-ZsLfNo2U6R/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix030_power.oepc_pso.oepc_rmo.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e025b304-97e6-42d7-a3ce-aa44b34f6f9b/bin/uautomizer-ZsLfNo2U6R/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e025b304-97e6-42d7-a3ce-aa44b34f6f9b/bin/uautomizer-ZsLfNo2U6R --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 a6d0914923ba77f2cbf67d52dc6ec759519359118cb2f8fd5f254f95bf2b938e --- 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-38b53e6 [2022-11-25 16:58:52,380 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 16:58:52,383 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 16:58:52,438 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 16:58:52,438 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 16:58:52,440 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 16:58:52,441 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 16:58:52,443 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 16:58:52,445 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 16:58:52,446 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 16:58:52,447 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 16:58:52,449 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 16:58:52,449 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 16:58:52,450 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 16:58:52,452 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 16:58:52,457 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 16:58:52,460 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 16:58:52,464 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 16:58:52,466 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 16:58:52,470 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 16:58:52,475 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 16:58:52,477 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 16:58:52,480 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 16:58:52,482 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 16:58:52,486 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 16:58:52,490 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 16:58:52,491 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 16:58:52,492 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 16:58:52,494 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 16:58:52,495 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 16:58:52,495 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 16:58:52,496 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 16:58:52,498 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 16:58:52,499 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 16:58:52,501 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 16:58:52,501 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 16:58:52,502 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 16:58:52,503 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 16:58:52,503 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 16:58:52,504 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 16:58:52,505 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 16:58:52,506 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e025b304-97e6-42d7-a3ce-aa44b34f6f9b/bin/uautomizer-ZsLfNo2U6R/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-11-25 16:58:52,545 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 16:58:52,546 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 16:58:52,547 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 16:58:52,547 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 16:58:52,548 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 16:58:52,548 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 16:58:52,549 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 16:58:52,549 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 16:58:52,550 INFO L138 SettingsManager]: * Use SBE=true [2022-11-25 16:58:52,550 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 16:58:52,551 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 16:58:52,551 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-25 16:58:52,552 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 16:58:52,552 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 16:58:52,552 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 16:58:52,552 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-25 16:58:52,552 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-25 16:58:52,553 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-25 16:58:52,553 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 16:58:52,553 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-25 16:58:52,553 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-25 16:58:52,553 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-25 16:58:52,554 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 16:58:52,554 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 16:58:52,554 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 16:58:52,554 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-25 16:58:52,555 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 16:58:52,555 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 16:58:52,555 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 16:58:52,555 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 16:58:52,556 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-11-25 16:58:52,556 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-25 16:58:52,556 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-25 16:58:52,556 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-25 16:58:52,557 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-25 16:58:52,557 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2022-11-25 16:58:52,557 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_e025b304-97e6-42d7-a3ce-aa44b34f6f9b/bin/uautomizer-ZsLfNo2U6R/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_e025b304-97e6-42d7-a3ce-aa44b34f6f9b/bin/uautomizer-ZsLfNo2U6R 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 -> a6d0914923ba77f2cbf67d52dc6ec759519359118cb2f8fd5f254f95bf2b938e [2022-11-25 16:58:53,017 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 16:58:53,052 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 16:58:53,056 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 16:58:53,058 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 16:58:53,058 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 16:58:53,060 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e025b304-97e6-42d7-a3ce-aa44b34f6f9b/bin/uautomizer-ZsLfNo2U6R/../../sv-benchmarks/c/pthread-wmm/mix030_power.oepc_pso.oepc_rmo.oepc.i [2022-11-25 16:58:56,428 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 16:58:56,728 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 16:58:56,729 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e025b304-97e6-42d7-a3ce-aa44b34f6f9b/sv-benchmarks/c/pthread-wmm/mix030_power.oepc_pso.oepc_rmo.oepc.i [2022-11-25 16:58:56,742 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e025b304-97e6-42d7-a3ce-aa44b34f6f9b/bin/uautomizer-ZsLfNo2U6R/data/f8005e12d/39932710a45b466683f584f138beb753/FLAG3235cb179 [2022-11-25 16:58:56,765 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e025b304-97e6-42d7-a3ce-aa44b34f6f9b/bin/uautomizer-ZsLfNo2U6R/data/f8005e12d/39932710a45b466683f584f138beb753 [2022-11-25 16:58:56,768 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 16:58:56,770 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 16:58:56,771 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 16:58:56,771 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 16:58:56,775 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 16:58:56,776 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 04:58:56" (1/1) ... [2022-11-25 16:58:56,777 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@701abf51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:58:56, skipping insertion in model container [2022-11-25 16:58:56,778 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 04:58:56" (1/1) ... [2022-11-25 16:58:56,786 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 16:58:56,854 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 16:58:57,085 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_e025b304-97e6-42d7-a3ce-aa44b34f6f9b/sv-benchmarks/c/pthread-wmm/mix030_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2022-11-25 16:58:57,340 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:58:57,344 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:58:57,345 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:58:57,345 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:58:57,346 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:58:57,354 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:58:57,354 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:58:57,355 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:58:57,357 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:58:57,357 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:58:57,358 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:58:57,359 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:58:57,360 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:58:57,395 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:58:57,396 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:58:57,396 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:58:57,401 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:58:57,402 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:58:57,403 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:58:57,403 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:58:57,404 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:58:57,407 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:58:57,408 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:58:57,409 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:58:57,426 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:58:57,427 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:58:57,427 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:58:57,428 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:58:57,428 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:58:57,441 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:58:57,444 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:58:57,447 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:58:57,448 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:58:57,450 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:58:57,465 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:58:57,466 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:58:57,467 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:58:57,472 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:58:57,475 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:58:57,476 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:58:57,478 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 16:58:57,497 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 16:58:57,513 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_e025b304-97e6-42d7-a3ce-aa44b34f6f9b/sv-benchmarks/c/pthread-wmm/mix030_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2022-11-25 16:58:57,554 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:58:57,559 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:58:57,559 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:58:57,560 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:58:57,560 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:58:57,564 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:58:57,565 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:58:57,565 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:58:57,566 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:58:57,567 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:58:57,567 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:58:57,568 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:58:57,568 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:58:57,574 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:58:57,575 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:58:57,575 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:58:57,577 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:58:57,577 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:58:57,578 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:58:57,578 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:58:57,579 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:58:57,582 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:58:57,583 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:58:57,583 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:58:57,585 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:58:57,586 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:58:57,587 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:58:57,588 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:58:57,589 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:58:57,595 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:58:57,600 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:58:57,602 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:58:57,604 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:58:57,605 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:58:57,608 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:58:57,612 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:58:57,613 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:58:57,625 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:58:57,626 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:58:57,626 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:58:57,627 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 16:58:57,671 INFO L208 MainTranslator]: Completed translation [2022-11-25 16:58:57,672 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:58:57 WrapperNode [2022-11-25 16:58:57,672 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 16:58:57,673 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 16:58:57,673 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 16:58:57,674 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 16:58:57,680 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:58:57" (1/1) ... [2022-11-25 16:58:57,699 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:58:57" (1/1) ... [2022-11-25 16:58:57,724 INFO L138 Inliner]: procedures = 180, calls = 69, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 144 [2022-11-25 16:58:57,724 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 16:58:57,725 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 16:58:57,725 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 16:58:57,725 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 16:58:57,734 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:58:57" (1/1) ... [2022-11-25 16:58:57,735 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:58:57" (1/1) ... [2022-11-25 16:58:57,740 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:58:57" (1/1) ... [2022-11-25 16:58:57,740 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:58:57" (1/1) ... [2022-11-25 16:58:57,757 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:58:57" (1/1) ... [2022-11-25 16:58:57,760 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:58:57" (1/1) ... [2022-11-25 16:58:57,762 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:58:57" (1/1) ... [2022-11-25 16:58:57,764 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:58:57" (1/1) ... [2022-11-25 16:58:57,768 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 16:58:57,769 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 16:58:57,769 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 16:58:57,769 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 16:58:57,770 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:58:57" (1/1) ... [2022-11-25 16:58:57,776 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 16:58:57,797 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e025b304-97e6-42d7-a3ce-aa44b34f6f9b/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:58:57,809 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e025b304-97e6-42d7-a3ce-aa44b34f6f9b/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 16:58:57,821 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e025b304-97e6-42d7-a3ce-aa44b34f6f9b/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 16:58:57,864 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-25 16:58:57,864 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 16:58:57,864 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-25 16:58:57,864 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-25 16:58:57,865 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-11-25 16:58:57,865 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-25 16:58:57,865 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-25 16:58:57,865 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-25 16:58:57,865 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-25 16:58:57,866 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-25 16:58:57,867 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-25 16:58:57,867 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-25 16:58:57,867 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-11-25 16:58:57,868 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-11-25 16:58:57,868 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-25 16:58:57,868 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 16:58:57,869 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 16:58:57,870 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-25 16:58:58,052 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 16:58:58,054 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 16:58:58,559 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 16:58:58,844 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 16:58:58,844 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-25 16:58:58,847 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 04:58:58 BoogieIcfgContainer [2022-11-25 16:58:58,848 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 16:58:58,851 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 16:58:58,852 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 16:58:58,855 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 16:58:58,856 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 04:58:56" (1/3) ... [2022-11-25 16:58:58,858 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d5b91dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 04:58:58, skipping insertion in model container [2022-11-25 16:58:58,858 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:58:57" (2/3) ... [2022-11-25 16:58:58,860 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d5b91dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 04:58:58, skipping insertion in model container [2022-11-25 16:58:58,861 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 04:58:58" (3/3) ... [2022-11-25 16:58:58,864 INFO L112 eAbstractionObserver]: Analyzing ICFG mix030_power.oepc_pso.oepc_rmo.oepc.i [2022-11-25 16:58:58,885 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 16:58:58,885 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2022-11-25 16:58:58,885 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-25 16:58:58,994 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-25 16:58:59,042 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 160 places, 149 transitions, 318 flow [2022-11-25 16:58:59,147 INFO L130 PetriNetUnfolder]: 2/145 cut-off events. [2022-11-25 16:58:59,147 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 16:58:59,154 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 104 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-11-25 16:58:59,160 INFO L82 GeneralOperation]: Start removeDead. Operand has 160 places, 149 transitions, 318 flow [2022-11-25 16:58:59,170 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 156 places, 145 transitions, 302 flow [2022-11-25 16:58:59,175 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-25 16:58:59,195 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 156 places, 145 transitions, 302 flow [2022-11-25 16:58:59,197 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 156 places, 145 transitions, 302 flow [2022-11-25 16:58:59,198 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 156 places, 145 transitions, 302 flow [2022-11-25 16:58:59,233 INFO L130 PetriNetUnfolder]: 2/145 cut-off events. [2022-11-25 16:58:59,233 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 16:58:59,234 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 104 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-11-25 16:58:59,237 INFO L119 LiptonReduction]: Number of co-enabled transitions 3764 [2022-11-25 16:59:09,084 INFO L134 LiptonReduction]: Checked pairs total: 10741 [2022-11-25 16:59:09,084 INFO L136 LiptonReduction]: Total number of compositions: 139 [2022-11-25 16:59:09,101 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 16:59:09,107 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;@1a2c8939, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 16:59:09,107 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2022-11-25 16:59:09,109 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2022-11-25 16:59:09,109 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 16:59:09,109 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 16:59:09,110 INFO L209 CegarLoopForPetriNet]: trace histogram [1] [2022-11-25 16:59:09,111 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-11-25 16:59:09,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:59:09,116 INFO L85 PathProgramCache]: Analyzing trace with hash 624, now seen corresponding path program 1 times [2022-11-25 16:59:09,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 16:59:09,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [514312842] [2022-11-25 16:59:09,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:59:09,129 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-11-25 16:59:09,129 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e025b304-97e6-42d7-a3ce-aa44b34f6f9b/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 16:59:09,139 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e025b304-97e6-42d7-a3ce-aa44b34f6f9b/bin/uautomizer-ZsLfNo2U6R/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-11-25 16:59:09,189 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e025b304-97e6-42d7-a3ce-aa44b34f6f9b/bin/uautomizer-ZsLfNo2U6R/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-11-25 16:59:09,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:59:09,281 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2022-11-25 16:59:09,284 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 16:59:09,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:59:09,289 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 16:59:09,290 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 16:59:09,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [514312842] [2022-11-25 16:59:09,291 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [514312842] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:59:09,291 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:59:09,291 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-25 16:59:09,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183289513] [2022-11-25 16:59:09,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:59:09,301 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-25 16:59:09,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 16:59:09,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-25 16:59:09,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-25 16:59:09,327 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 288 [2022-11-25 16:59:09,331 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-11-25 16:59:09,331 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 16:59:09,331 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 288 [2022-11-25 16:59:09,332 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 16:59:11,564 INFO L130 PetriNetUnfolder]: 8719/11875 cut-off events. [2022-11-25 16:59:11,564 INFO L131 PetriNetUnfolder]: For 55/55 co-relation queries the response was YES. [2022-11-25 16:59:11,594 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23823 conditions, 11875 events. 8719/11875 cut-off events. For 55/55 co-relation queries the response was YES. Maximal size of possible extension queue 540. Compared 62110 event pairs, 8719 based on Foata normal form. 0/10353 useless extension candidates. Maximal degree in co-relation 23811. Up to 11731 conditions per place. [2022-11-25 16:59:11,655 INFO L137 encePairwiseOnDemand]: 279/288 looper letters, 28 selfloop transitions, 0 changer transitions 0/32 dead transitions. [2022-11-25 16:59:11,655 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 32 transitions, 132 flow [2022-11-25 16:59:11,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 16:59:11,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-11-25 16:59:11,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 305 transitions. [2022-11-25 16:59:11,676 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5295138888888888 [2022-11-25 16:59:11,677 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 305 transitions. [2022-11-25 16:59:11,678 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 305 transitions. [2022-11-25 16:59:11,680 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 16:59:11,682 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 305 transitions. [2022-11-25 16:59:11,685 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-11-25 16:59:11,691 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 288.0) internal successors, (864), 3 states have internal predecessors, (864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:59:11,691 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 288.0) internal successors, (864), 3 states have internal predecessors, (864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:59:11,693 INFO L175 Difference]: Start difference. First operand has 53 places, 41 transitions, 94 flow. Second operand 2 states and 305 transitions. [2022-11-25 16:59:11,695 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 32 transitions, 132 flow [2022-11-25 16:59:11,703 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 32 transitions, 128 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-25 16:59:11,705 INFO L231 Difference]: Finished difference. Result has 42 places, 32 transitions, 72 flow [2022-11-25 16:59:11,708 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=288, 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-11-25 16:59:11,713 INFO L288 CegarLoopForPetriNet]: 53 programPoint places, -11 predicate places. [2022-11-25 16:59:11,714 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 32 transitions, 72 flow [2022-11-25 16:59:11,714 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-11-25 16:59:11,714 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 16:59:11,715 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-11-25 16:59:11,732 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e025b304-97e6-42d7-a3ce-aa44b34f6f9b/bin/uautomizer-ZsLfNo2U6R/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-11-25 16:59:11,926 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e025b304-97e6-42d7-a3ce-aa44b34f6f9b/bin/uautomizer-ZsLfNo2U6R/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-11-25 16:59:11,927 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-25 16:59:11,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:59:11,927 INFO L85 PathProgramCache]: Analyzing trace with hash 612268, now seen corresponding path program 1 times [2022-11-25 16:59:11,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 16:59:11,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [195680545] [2022-11-25 16:59:11,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:59:11,928 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-11-25 16:59:11,929 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e025b304-97e6-42d7-a3ce-aa44b34f6f9b/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 16:59:11,930 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e025b304-97e6-42d7-a3ce-aa44b34f6f9b/bin/uautomizer-ZsLfNo2U6R/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-11-25 16:59:11,967 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e025b304-97e6-42d7-a3ce-aa44b34f6f9b/bin/uautomizer-ZsLfNo2U6R/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-11-25 16:59:12,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:59:12,051 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-25 16:59:12,052 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 16:59:12,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:59:12,074 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 16:59:12,074 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 16:59:12,074 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [195680545] [2022-11-25 16:59:12,075 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [195680545] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:59:12,075 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:59:12,075 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-25 16:59:12,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702253442] [2022-11-25 16:59:12,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:59:12,077 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 16:59:12,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 16:59:12,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 16:59:12,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 16:59:12,085 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 288 [2022-11-25 16:59:12,085 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-11-25 16:59:12,086 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 16:59:12,086 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 288 [2022-11-25 16:59:12,086 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 16:59:13,739 INFO L130 PetriNetUnfolder]: 6855/9895 cut-off events. [2022-11-25 16:59:13,739 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 16:59:13,761 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19332 conditions, 9895 events. 6855/9895 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 466. Compared 60152 event pairs, 1263 based on Foata normal form. 0/9231 useless extension candidates. Maximal degree in co-relation 19329. Up to 7399 conditions per place. [2022-11-25 16:59:13,810 INFO L137 encePairwiseOnDemand]: 285/288 looper letters, 45 selfloop transitions, 2 changer transitions 2/53 dead transitions. [2022-11-25 16:59:13,811 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 53 transitions, 218 flow [2022-11-25 16:59:13,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 16:59:13,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 16:59:13,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 449 transitions. [2022-11-25 16:59:13,813 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5196759259259259 [2022-11-25 16:59:13,813 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 449 transitions. [2022-11-25 16:59:13,813 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 449 transitions. [2022-11-25 16:59:13,814 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 16:59:13,814 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 449 transitions. [2022-11-25 16:59:13,815 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-11-25 16:59:13,818 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 288.0) internal successors, (1152), 4 states have internal predecessors, (1152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:59:13,819 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 288.0) internal successors, (1152), 4 states have internal predecessors, (1152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:59:13,819 INFO L175 Difference]: Start difference. First operand has 42 places, 32 transitions, 72 flow. Second operand 3 states and 449 transitions. [2022-11-25 16:59:13,819 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 53 transitions, 218 flow [2022-11-25 16:59:13,820 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 53 transitions, 218 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-25 16:59:13,821 INFO L231 Difference]: Finished difference. Result has 43 places, 30 transitions, 72 flow [2022-11-25 16:59:13,822 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=288, 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-11-25 16:59:13,823 INFO L288 CegarLoopForPetriNet]: 53 programPoint places, -10 predicate places. [2022-11-25 16:59:13,823 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 30 transitions, 72 flow [2022-11-25 16:59:13,823 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-11-25 16:59:13,823 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 16:59:13,824 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:59:13,840 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e025b304-97e6-42d7-a3ce-aa44b34f6f9b/bin/uautomizer-ZsLfNo2U6R/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)] Forceful destruction successful, exit code 0 [2022-11-25 16:59:14,035 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e025b304-97e6-42d7-a3ce-aa44b34f6f9b/bin/uautomizer-ZsLfNo2U6R/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-11-25 16:59:14,035 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-25 16:59:14,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:59:14,036 INFO L85 PathProgramCache]: Analyzing trace with hash -904869440, now seen corresponding path program 1 times [2022-11-25 16:59:14,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 16:59:14,037 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [171009509] [2022-11-25 16:59:14,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:59:14,037 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-11-25 16:59:14,037 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e025b304-97e6-42d7-a3ce-aa44b34f6f9b/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 16:59:14,040 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e025b304-97e6-42d7-a3ce-aa44b34f6f9b/bin/uautomizer-ZsLfNo2U6R/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-11-25 16:59:14,044 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e025b304-97e6-42d7-a3ce-aa44b34f6f9b/bin/uautomizer-ZsLfNo2U6R/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-11-25 16:59:14,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:59:14,173 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-25 16:59:14,174 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 16:59:14,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:59:14,233 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 16:59:14,235 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 16:59:14,236 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [171009509] [2022-11-25 16:59:14,236 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [171009509] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:59:14,236 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:59:14,236 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 16:59:14,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860650902] [2022-11-25 16:59:14,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:59:14,237 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 16:59:14,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 16:59:14,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 16:59:14,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 16:59:14,252 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 288 [2022-11-25 16:59:14,253 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 30 transitions, 72 flow. Second operand has 3 states, 3 states have (on average 133.0) internal successors, (399), 3 states have internal predecessors, (399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:59:14,253 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 16:59:14,254 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 288 [2022-11-25 16:59:14,254 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 16:59:15,103 INFO L130 PetriNetUnfolder]: 3719/5312 cut-off events. [2022-11-25 16:59:15,103 INFO L131 PetriNetUnfolder]: For 341/341 co-relation queries the response was YES. [2022-11-25 16:59:15,119 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11097 conditions, 5312 events. 3719/5312 cut-off events. For 341/341 co-relation queries the response was YES. Maximal size of possible extension queue 268. Compared 27390 event pairs, 803 based on Foata normal form. 108/5187 useless extension candidates. Maximal degree in co-relation 11093. Up to 4756 conditions per place. [2022-11-25 16:59:15,144 INFO L137 encePairwiseOnDemand]: 282/288 looper letters, 40 selfloop transitions, 5 changer transitions 0/49 dead transitions. [2022-11-25 16:59:15,145 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 49 transitions, 208 flow [2022-11-25 16:59:15,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 16:59:15,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 16:59:15,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 433 transitions. [2022-11-25 16:59:15,147 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5011574074074074 [2022-11-25 16:59:15,147 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 433 transitions. [2022-11-25 16:59:15,147 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 433 transitions. [2022-11-25 16:59:15,148 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 16:59:15,148 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 433 transitions. [2022-11-25 16:59:15,149 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 144.33333333333334) internal successors, (433), 3 states have internal predecessors, (433), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:59:15,154 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 288.0) internal successors, (1152), 4 states have internal predecessors, (1152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:59:15,155 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 288.0) internal successors, (1152), 4 states have internal predecessors, (1152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:59:15,155 INFO L175 Difference]: Start difference. First operand has 43 places, 30 transitions, 72 flow. Second operand 3 states and 433 transitions. [2022-11-25 16:59:15,155 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 49 transitions, 208 flow [2022-11-25 16:59:15,157 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 49 transitions, 202 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-25 16:59:15,158 INFO L231 Difference]: Finished difference. Result has 43 places, 34 transitions, 101 flow [2022-11-25 16:59:15,158 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=288, 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=3, PETRI_FLOW=101, PETRI_PLACES=43, PETRI_TRANSITIONS=34} [2022-11-25 16:59:15,160 INFO L288 CegarLoopForPetriNet]: 53 programPoint places, -10 predicate places. [2022-11-25 16:59:15,161 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 34 transitions, 101 flow [2022-11-25 16:59:15,161 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 133.0) internal successors, (399), 3 states have internal predecessors, (399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:59:15,162 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 16:59:15,162 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:59:15,184 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e025b304-97e6-42d7-a3ce-aa44b34f6f9b/bin/uautomizer-ZsLfNo2U6R/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)] Forceful destruction successful, exit code 0 [2022-11-25 16:59:15,373 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e025b304-97e6-42d7-a3ce-aa44b34f6f9b/bin/uautomizer-ZsLfNo2U6R/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-11-25 16:59:15,374 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-25 16:59:15,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:59:15,374 INFO L85 PathProgramCache]: Analyzing trace with hash -1815905426, now seen corresponding path program 1 times [2022-11-25 16:59:15,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 16:59:15,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [433729036] [2022-11-25 16:59:15,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:59:15,376 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-11-25 16:59:15,376 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e025b304-97e6-42d7-a3ce-aa44b34f6f9b/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 16:59:15,381 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e025b304-97e6-42d7-a3ce-aa44b34f6f9b/bin/uautomizer-ZsLfNo2U6R/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-11-25 16:59:15,427 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e025b304-97e6-42d7-a3ce-aa44b34f6f9b/bin/uautomizer-ZsLfNo2U6R/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-11-25 16:59:15,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:59:15,527 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-25 16:59:15,529 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 16:59:15,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:59:15,590 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 16:59:15,590 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 16:59:15,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [433729036] [2022-11-25 16:59:15,591 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [433729036] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:59:15,591 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:59:15,591 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 16:59:15,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277767017] [2022-11-25 16:59:15,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:59:15,593 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 16:59:15,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 16:59:15,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 16:59:15,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 16:59:15,620 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 288 [2022-11-25 16:59:15,622 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 34 transitions, 101 flow. Second operand has 4 states, 4 states have (on average 132.75) internal successors, (531), 4 states have internal predecessors, (531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:59:15,622 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 16:59:15,622 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 288 [2022-11-25 16:59:15,622 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 16:59:16,232 INFO L130 PetriNetUnfolder]: 1694/2612 cut-off events. [2022-11-25 16:59:16,232 INFO L131 PetriNetUnfolder]: For 319/319 co-relation queries the response was YES. [2022-11-25 16:59:16,240 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6269 conditions, 2612 events. 1694/2612 cut-off events. For 319/319 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 13169 event pairs, 402 based on Foata normal form. 135/2649 useless extension candidates. Maximal degree in co-relation 6264. Up to 1426 conditions per place. [2022-11-25 16:59:16,252 INFO L137 encePairwiseOnDemand]: 282/288 looper letters, 53 selfloop transitions, 9 changer transitions 0/66 dead transitions. [2022-11-25 16:59:16,252 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 66 transitions, 307 flow [2022-11-25 16:59:16,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 16:59:16,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-25 16:59:16,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 579 transitions. [2022-11-25 16:59:16,255 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5026041666666666 [2022-11-25 16:59:16,256 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 579 transitions. [2022-11-25 16:59:16,256 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 579 transitions. [2022-11-25 16:59:16,256 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 16:59:16,257 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 579 transitions. [2022-11-25 16:59:16,258 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 144.75) internal successors, (579), 4 states have internal predecessors, (579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:59:16,261 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 288.0) internal successors, (1440), 5 states have internal predecessors, (1440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:59:16,263 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 288.0) internal successors, (1440), 5 states have internal predecessors, (1440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:59:16,263 INFO L175 Difference]: Start difference. First operand has 43 places, 34 transitions, 101 flow. Second operand 4 states and 579 transitions. [2022-11-25 16:59:16,263 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 66 transitions, 307 flow [2022-11-25 16:59:16,264 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 66 transitions, 302 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-25 16:59:16,266 INFO L231 Difference]: Finished difference. Result has 46 places, 38 transitions, 148 flow [2022-11-25 16:59:16,266 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=288, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=42, 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=4, PETRI_FLOW=148, PETRI_PLACES=46, PETRI_TRANSITIONS=38} [2022-11-25 16:59:16,267 INFO L288 CegarLoopForPetriNet]: 53 programPoint places, -7 predicate places. [2022-11-25 16:59:16,267 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 38 transitions, 148 flow [2022-11-25 16:59:16,268 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 132.75) internal successors, (531), 4 states have internal predecessors, (531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:59:16,268 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 16:59:16,268 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:59:16,285 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e025b304-97e6-42d7-a3ce-aa44b34f6f9b/bin/uautomizer-ZsLfNo2U6R/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)] Forceful destruction successful, exit code 0 [2022-11-25 16:59:16,480 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e025b304-97e6-42d7-a3ce-aa44b34f6f9b/bin/uautomizer-ZsLfNo2U6R/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-11-25 16:59:16,481 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-11-25 16:59:16,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:59:16,481 INFO L85 PathProgramCache]: Analyzing trace with hash 1456938910, now seen corresponding path program 1 times [2022-11-25 16:59:16,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 16:59:16,482 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1671964234] [2022-11-25 16:59:16,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:59:16,482 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-11-25 16:59:16,483 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e025b304-97e6-42d7-a3ce-aa44b34f6f9b/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 16:59:16,485 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e025b304-97e6-42d7-a3ce-aa44b34f6f9b/bin/uautomizer-ZsLfNo2U6R/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-11-25 16:59:16,521 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e025b304-97e6-42d7-a3ce-aa44b34f6f9b/bin/uautomizer-ZsLfNo2U6R/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-11-25 16:59:16,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:59:16,634 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-25 16:59:16,636 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 16:59:16,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:59:16,707 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 16:59:16,707 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 16:59:16,708 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1671964234] [2022-11-25 16:59:16,708 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1671964234] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:59:16,708 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:59:16,708 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 16:59:16,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786794709] [2022-11-25 16:59:16,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:59:16,709 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 16:59:16,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 16:59:16,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 16:59:16,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 16:59:16,738 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 288 [2022-11-25 16:59:16,739 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 38 transitions, 148 flow. Second operand has 5 states, 5 states have (on average 132.6) internal successors, (663), 5 states have internal predecessors, (663), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:59:16,740 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 16:59:16,740 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 288 [2022-11-25 16:59:16,740 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 16:59:17,309 INFO L130 PetriNetUnfolder]: 1064/1667 cut-off events. [2022-11-25 16:59:17,309 INFO L131 PetriNetUnfolder]: For 1134/1134 co-relation queries the response was YES. [2022-11-25 16:59:17,315 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4538 conditions, 1667 events. 1064/1667 cut-off events. For 1134/1134 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 7955 event pairs, 331 based on Foata normal form. 63/1695 useless extension candidates. Maximal degree in co-relation 4532. Up to 630 conditions per place. [2022-11-25 16:59:17,324 INFO L137 encePairwiseOnDemand]: 282/288 looper letters, 64 selfloop transitions, 13 changer transitions 0/81 dead transitions. [2022-11-25 16:59:17,324 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 81 transitions, 416 flow [2022-11-25 16:59:17,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 16:59:17,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-25 16:59:17,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 723 transitions. [2022-11-25 16:59:17,328 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5020833333333333 [2022-11-25 16:59:17,328 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 723 transitions. [2022-11-25 16:59:17,328 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 723 transitions. [2022-11-25 16:59:17,329 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 16:59:17,329 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 723 transitions. [2022-11-25 16:59:17,331 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 144.6) internal successors, (723), 5 states have internal predecessors, (723), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:59:17,335 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 288.0) internal successors, (1728), 6 states have internal predecessors, (1728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:59:17,336 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 288.0) internal successors, (1728), 6 states have internal predecessors, (1728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:59:17,337 INFO L175 Difference]: Start difference. First operand has 46 places, 38 transitions, 148 flow. Second operand 5 states and 723 transitions. [2022-11-25 16:59:17,337 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 81 transitions, 416 flow [2022-11-25 16:59:17,341 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 81 transitions, 398 flow, removed 4 selfloop flow, removed 2 redundant places. [2022-11-25 16:59:17,343 INFO L231 Difference]: Finished difference. Result has 49 places, 42 transitions, 198 flow [2022-11-25 16:59:17,343 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=288, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=44, 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=5, PETRI_FLOW=198, PETRI_PLACES=49, PETRI_TRANSITIONS=42} [2022-11-25 16:59:17,344 INFO L288 CegarLoopForPetriNet]: 53 programPoint places, -4 predicate places. [2022-11-25 16:59:17,344 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 42 transitions, 198 flow [2022-11-25 16:59:17,345 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 132.6) internal successors, (663), 5 states have internal predecessors, (663), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:59:17,345 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 16:59:17,346 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] [2022-11-25 16:59:17,363 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e025b304-97e6-42d7-a3ce-aa44b34f6f9b/bin/uautomizer-ZsLfNo2U6R/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)] Forceful destruction successful, exit code 0 [2022-11-25 16:59:17,555 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e025b304-97e6-42d7-a3ce-aa44b34f6f9b/bin/uautomizer-ZsLfNo2U6R/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-11-25 16:59:17,555 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-25 16:59:17,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:59:17,556 INFO L85 PathProgramCache]: Analyzing trace with hash 1612220618, now seen corresponding path program 1 times [2022-11-25 16:59:17,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 16:59:17,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [450579802] [2022-11-25 16:59:17,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:59:17,557 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-11-25 16:59:17,557 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e025b304-97e6-42d7-a3ce-aa44b34f6f9b/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 16:59:17,559 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e025b304-97e6-42d7-a3ce-aa44b34f6f9b/bin/uautomizer-ZsLfNo2U6R/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-11-25 16:59:17,601 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e025b304-97e6-42d7-a3ce-aa44b34f6f9b/bin/uautomizer-ZsLfNo2U6R/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-11-25 16:59:17,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:59:17,714 INFO L263 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-25 16:59:17,716 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 16:59:17,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:59:17,814 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 16:59:17,814 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 16:59:17,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [450579802] [2022-11-25 16:59:17,814 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [450579802] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:59:17,815 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:59:17,815 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 16:59:17,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050406722] [2022-11-25 16:59:17,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:59:17,816 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 16:59:17,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 16:59:17,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 16:59:17,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-25 16:59:17,852 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 288 [2022-11-25 16:59:17,855 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 42 transitions, 198 flow. Second operand has 6 states, 6 states have (on average 132.5) internal successors, (795), 6 states have internal predecessors, (795), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:59:17,855 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 16:59:17,855 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 288 [2022-11-25 16:59:17,855 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 16:59:18,553 INFO L130 PetriNetUnfolder]: 999/1537 cut-off events. [2022-11-25 16:59:18,553 INFO L131 PetriNetUnfolder]: For 1297/1297 co-relation queries the response was YES. [2022-11-25 16:59:18,557 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4345 conditions, 1537 events. 999/1537 cut-off events. For 1297/1297 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 7312 event pairs, 326 based on Foata normal form. 13/1528 useless extension candidates. Maximal degree in co-relation 4338. Up to 630 conditions per place. [2022-11-25 16:59:18,563 INFO L137 encePairwiseOnDemand]: 282/288 looper letters, 60 selfloop transitions, 17 changer transitions 0/81 dead transitions. [2022-11-25 16:59:18,563 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 81 transitions, 442 flow [2022-11-25 16:59:18,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 16:59:18,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-25 16:59:18,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 852 transitions. [2022-11-25 16:59:18,566 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4930555555555556 [2022-11-25 16:59:18,567 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 852 transitions. [2022-11-25 16:59:18,567 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 852 transitions. [2022-11-25 16:59:18,567 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 16:59:18,568 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 852 transitions. [2022-11-25 16:59:18,570 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 142.0) internal successors, (852), 6 states have internal predecessors, (852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:59:18,573 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 288.0) internal successors, (2016), 7 states have internal predecessors, (2016), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:59:18,574 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 288.0) internal successors, (2016), 7 states have internal predecessors, (2016), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:59:18,574 INFO L175 Difference]: Start difference. First operand has 49 places, 42 transitions, 198 flow. Second operand 6 states and 852 transitions. [2022-11-25 16:59:18,574 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 81 transitions, 442 flow [2022-11-25 16:59:18,587 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 81 transitions, 408 flow, removed 8 selfloop flow, removed 3 redundant places. [2022-11-25 16:59:18,589 INFO L231 Difference]: Finished difference. Result has 52 places, 42 transitions, 208 flow [2022-11-25 16:59:18,589 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=288, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=46, 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=6, PETRI_FLOW=208, PETRI_PLACES=52, PETRI_TRANSITIONS=42} [2022-11-25 16:59:18,590 INFO L288 CegarLoopForPetriNet]: 53 programPoint places, -1 predicate places. [2022-11-25 16:59:18,590 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 42 transitions, 208 flow [2022-11-25 16:59:18,590 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 132.5) internal successors, (795), 6 states have internal predecessors, (795), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:59:18,591 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 16:59:18,591 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, 1] [2022-11-25 16:59:18,604 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e025b304-97e6-42d7-a3ce-aa44b34f6f9b/bin/uautomizer-ZsLfNo2U6R/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-11-25 16:59:18,803 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e025b304-97e6-42d7-a3ce-aa44b34f6f9b/bin/uautomizer-ZsLfNo2U6R/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-11-25 16:59:18,803 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-25 16:59:18,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:59:18,804 INFO L85 PathProgramCache]: Analyzing trace with hash 505263087, now seen corresponding path program 1 times [2022-11-25 16:59:18,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 16:59:18,805 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [422546234] [2022-11-25 16:59:18,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:59:18,805 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-11-25 16:59:18,805 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e025b304-97e6-42d7-a3ce-aa44b34f6f9b/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 16:59:18,807 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e025b304-97e6-42d7-a3ce-aa44b34f6f9b/bin/uautomizer-ZsLfNo2U6R/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-11-25 16:59:18,835 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e025b304-97e6-42d7-a3ce-aa44b34f6f9b/bin/uautomizer-ZsLfNo2U6R/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-11-25 16:59:19,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:59:19,090 INFO L263 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 17 conjunts are in the unsatisfiable core [2022-11-25 16:59:19,093 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 16:59:19,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:59:19,860 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 16:59:19,861 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 16:59:19,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [422546234] [2022-11-25 16:59:19,861 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [422546234] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:59:19,861 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:59:19,861 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 16:59:19,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012284644] [2022-11-25 16:59:19,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:59:19,862 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 16:59:19,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 16:59:19,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 16:59:19,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-25 16:59:20,816 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 288 [2022-11-25 16:59:20,817 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 42 transitions, 208 flow. Second operand has 6 states, 6 states have (on average 118.16666666666667) internal successors, (709), 6 states have internal predecessors, (709), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:59:20,817 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 16:59:20,817 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 288 [2022-11-25 16:59:20,817 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 16:59:21,633 INFO L130 PetriNetUnfolder]: 999/1575 cut-off events. [2022-11-25 16:59:21,633 INFO L131 PetriNetUnfolder]: For 1966/1966 co-relation queries the response was YES. [2022-11-25 16:59:21,637 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4468 conditions, 1575 events. 999/1575 cut-off events. For 1966/1966 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 7743 event pairs, 7 based on Foata normal form. 0/1575 useless extension candidates. Maximal degree in co-relation 4460. Up to 1252 conditions per place. [2022-11-25 16:59:21,645 INFO L137 encePairwiseOnDemand]: 283/288 looper letters, 59 selfloop transitions, 4 changer transitions 0/67 dead transitions. [2022-11-25 16:59:21,645 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 67 transitions, 465 flow [2022-11-25 16:59:21,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 16:59:21,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-25 16:59:21,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 728 transitions. [2022-11-25 16:59:21,648 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4212962962962963 [2022-11-25 16:59:21,649 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 728 transitions. [2022-11-25 16:59:21,649 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 728 transitions. [2022-11-25 16:59:21,649 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 16:59:21,649 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 728 transitions. [2022-11-25 16:59:21,651 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 121.33333333333333) internal successors, (728), 6 states have internal predecessors, (728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:59:21,654 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 288.0) internal successors, (2016), 7 states have internal predecessors, (2016), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:59:21,655 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 288.0) internal successors, (2016), 7 states have internal predecessors, (2016), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:59:21,655 INFO L175 Difference]: Start difference. First operand has 52 places, 42 transitions, 208 flow. Second operand 6 states and 728 transitions. [2022-11-25 16:59:21,655 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 67 transitions, 465 flow [2022-11-25 16:59:21,661 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 67 transitions, 390 flow, removed 12 selfloop flow, removed 4 redundant places. [2022-11-25 16:59:21,662 INFO L231 Difference]: Finished difference. Result has 52 places, 41 transitions, 164 flow [2022-11-25 16:59:21,663 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=288, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=164, PETRI_PLACES=52, PETRI_TRANSITIONS=41} [2022-11-25 16:59:21,663 INFO L288 CegarLoopForPetriNet]: 53 programPoint places, -1 predicate places. [2022-11-25 16:59:21,664 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 41 transitions, 164 flow [2022-11-25 16:59:21,664 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 118.16666666666667) internal successors, (709), 6 states have internal predecessors, (709), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:59:21,664 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 16:59:21,664 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, 1] [2022-11-25 16:59:21,678 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e025b304-97e6-42d7-a3ce-aa44b34f6f9b/bin/uautomizer-ZsLfNo2U6R/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)] Forceful destruction successful, exit code 0 [2022-11-25 16:59:21,877 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e025b304-97e6-42d7-a3ce-aa44b34f6f9b/bin/uautomizer-ZsLfNo2U6R/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-11-25 16:59:21,878 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-11-25 16:59:21,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:59:21,878 INFO L85 PathProgramCache]: Analyzing trace with hash -1079740682, now seen corresponding path program 1 times [2022-11-25 16:59:21,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 16:59:21,880 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1814591702] [2022-11-25 16:59:21,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:59:21,880 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-11-25 16:59:21,880 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e025b304-97e6-42d7-a3ce-aa44b34f6f9b/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 16:59:21,881 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e025b304-97e6-42d7-a3ce-aa44b34f6f9b/bin/uautomizer-ZsLfNo2U6R/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-11-25 16:59:21,887 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e025b304-97e6-42d7-a3ce-aa44b34f6f9b/bin/uautomizer-ZsLfNo2U6R/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-11-25 16:59:22,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:59:22,044 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-25 16:59:22,045 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 16:59:22,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:59:22,094 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 16:59:22,094 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 16:59:22,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1814591702] [2022-11-25 16:59:22,095 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1814591702] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:59:22,095 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:59:22,095 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 16:59:22,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358962028] [2022-11-25 16:59:22,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:59:22,096 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 16:59:22,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 16:59:22,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 16:59:22,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 16:59:22,112 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 288 [2022-11-25 16:59:22,113 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 41 transitions, 164 flow. Second operand has 4 states, 4 states have (on average 136.5) internal successors, (546), 4 states have internal predecessors, (546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:59:22,113 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 16:59:22,113 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 288 [2022-11-25 16:59:22,114 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 16:59:22,602 INFO L130 PetriNetUnfolder]: 1792/2754 cut-off events. [2022-11-25 16:59:22,602 INFO L131 PetriNetUnfolder]: For 1672/1672 co-relation queries the response was YES. [2022-11-25 16:59:22,609 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7438 conditions, 2754 events. 1792/2754 cut-off events. For 1672/1672 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 14708 event pairs, 784 based on Foata normal form. 1/2724 useless extension candidates. Maximal degree in co-relation 7430. Up to 1562 conditions per place. [2022-11-25 16:59:22,616 INFO L137 encePairwiseOnDemand]: 284/288 looper letters, 57 selfloop transitions, 2 changer transitions 12/74 dead transitions. [2022-11-25 16:59:22,616 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 74 transitions, 448 flow [2022-11-25 16:59:22,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 16:59:22,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-25 16:59:22,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 568 transitions. [2022-11-25 16:59:22,619 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4930555555555556 [2022-11-25 16:59:22,619 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 568 transitions. [2022-11-25 16:59:22,619 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 568 transitions. [2022-11-25 16:59:22,620 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 16:59:22,620 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 568 transitions. [2022-11-25 16:59:22,621 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 142.0) internal successors, (568), 4 states have internal predecessors, (568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:59:22,624 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 288.0) internal successors, (1440), 5 states have internal predecessors, (1440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:59:22,625 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 288.0) internal successors, (1440), 5 states have internal predecessors, (1440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:59:22,625 INFO L175 Difference]: Start difference. First operand has 52 places, 41 transitions, 164 flow. Second operand 4 states and 568 transitions. [2022-11-25 16:59:22,625 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 74 transitions, 448 flow [2022-11-25 16:59:22,651 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 74 transitions, 436 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-25 16:59:22,652 INFO L231 Difference]: Finished difference. Result has 53 places, 41 transitions, 167 flow [2022-11-25 16:59:22,652 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=288, PETRI_DIFFERENCE_MINUEND_FLOW=157, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=167, PETRI_PLACES=53, PETRI_TRANSITIONS=41} [2022-11-25 16:59:22,653 INFO L288 CegarLoopForPetriNet]: 53 programPoint places, 0 predicate places. [2022-11-25 16:59:22,653 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 41 transitions, 167 flow [2022-11-25 16:59:22,654 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 136.5) internal successors, (546), 4 states have internal predecessors, (546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:59:22,654 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 16:59:22,654 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, 1] [2022-11-25 16:59:22,667 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e025b304-97e6-42d7-a3ce-aa44b34f6f9b/bin/uautomizer-ZsLfNo2U6R/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-11-25 16:59:22,866 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e025b304-97e6-42d7-a3ce-aa44b34f6f9b/bin/uautomizer-ZsLfNo2U6R/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-11-25 16:59:22,867 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-11-25 16:59:22,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:59:22,867 INFO L85 PathProgramCache]: Analyzing trace with hash 445690322, now seen corresponding path program 2 times [2022-11-25 16:59:22,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 16:59:22,868 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1442007045] [2022-11-25 16:59:22,868 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-25 16:59:22,868 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-11-25 16:59:22,868 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e025b304-97e6-42d7-a3ce-aa44b34f6f9b/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 16:59:22,870 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e025b304-97e6-42d7-a3ce-aa44b34f6f9b/bin/uautomizer-ZsLfNo2U6R/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-11-25 16:59:22,913 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e025b304-97e6-42d7-a3ce-aa44b34f6f9b/bin/uautomizer-ZsLfNo2U6R/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-11-25 16:59:23,047 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-25 16:59:23,047 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 16:59:23,055 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 17 conjunts are in the unsatisfiable core [2022-11-25 16:59:23,058 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 16:59:23,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:59:23,561 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 16:59:23,561 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 16:59:23,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1442007045] [2022-11-25 16:59:23,562 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1442007045] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:59:23,562 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:59:23,562 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-25 16:59:23,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964305969] [2022-11-25 16:59:23,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:59:23,563 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-25 16:59:23,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 16:59:23,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-25 16:59:23,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-11-25 16:59:23,696 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 288 [2022-11-25 16:59:23,697 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 41 transitions, 167 flow. Second operand has 9 states, 9 states have (on average 129.77777777777777) internal successors, (1168), 9 states have internal predecessors, (1168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:59:23,698 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 16:59:23,698 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 288 [2022-11-25 16:59:23,698 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 16:59:24,514 INFO L130 PetriNetUnfolder]: 928/1496 cut-off events. [2022-11-25 16:59:24,514 INFO L131 PetriNetUnfolder]: For 979/979 co-relation queries the response was YES. [2022-11-25 16:59:24,517 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4358 conditions, 1496 events. 928/1496 cut-off events. For 979/979 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 7258 event pairs, 48 based on Foata normal form. 1/1495 useless extension candidates. Maximal degree in co-relation 4348. Up to 773 conditions per place. [2022-11-25 16:59:24,522 INFO L137 encePairwiseOnDemand]: 281/288 looper letters, 62 selfloop transitions, 4 changer transitions 32/102 dead transitions. [2022-11-25 16:59:24,522 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 102 transitions, 623 flow [2022-11-25 16:59:24,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 16:59:24,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-11-25 16:59:24,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1083 transitions. [2022-11-25 16:59:24,527 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4700520833333333 [2022-11-25 16:59:24,527 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1083 transitions. [2022-11-25 16:59:24,527 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1083 transitions. [2022-11-25 16:59:24,528 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 16:59:24,528 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1083 transitions. [2022-11-25 16:59:24,532 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 135.375) internal successors, (1083), 8 states have internal predecessors, (1083), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:59:24,536 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 288.0) internal successors, (2592), 9 states have internal predecessors, (2592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:59:24,538 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 288.0) internal successors, (2592), 9 states have internal predecessors, (2592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:59:24,538 INFO L175 Difference]: Start difference. First operand has 53 places, 41 transitions, 167 flow. Second operand 8 states and 1083 transitions. [2022-11-25 16:59:24,538 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 102 transitions, 623 flow [2022-11-25 16:59:24,551 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 102 transitions, 609 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-11-25 16:59:24,553 INFO L231 Difference]: Finished difference. Result has 59 places, 41 transitions, 175 flow [2022-11-25 16:59:24,554 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=288, PETRI_DIFFERENCE_MINUEND_FLOW=159, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=175, PETRI_PLACES=59, PETRI_TRANSITIONS=41} [2022-11-25 16:59:24,554 INFO L288 CegarLoopForPetriNet]: 53 programPoint places, 6 predicate places. [2022-11-25 16:59:24,555 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 41 transitions, 175 flow [2022-11-25 16:59:24,555 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 129.77777777777777) internal successors, (1168), 9 states have internal predecessors, (1168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:59:24,556 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 16:59:24,556 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, 1] [2022-11-25 16:59:24,569 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e025b304-97e6-42d7-a3ce-aa44b34f6f9b/bin/uautomizer-ZsLfNo2U6R/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)] Forceful destruction successful, exit code 0 [2022-11-25 16:59:24,768 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e025b304-97e6-42d7-a3ce-aa44b34f6f9b/bin/uautomizer-ZsLfNo2U6R/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-11-25 16:59:24,769 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-11-25 16:59:24,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:59:24,769 INFO L85 PathProgramCache]: Analyzing trace with hash 627301618, now seen corresponding path program 3 times [2022-11-25 16:59:24,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 16:59:24,770 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1035447740] [2022-11-25 16:59:24,770 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-25 16:59:24,770 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-11-25 16:59:24,770 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e025b304-97e6-42d7-a3ce-aa44b34f6f9b/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 16:59:24,771 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e025b304-97e6-42d7-a3ce-aa44b34f6f9b/bin/uautomizer-ZsLfNo2U6R/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-11-25 16:59:24,775 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e025b304-97e6-42d7-a3ce-aa44b34f6f9b/bin/uautomizer-ZsLfNo2U6R/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-11-25 16:59:24,948 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-11-25 16:59:24,948 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 16:59:24,955 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-25 16:59:24,957 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 16:59:24,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:59:24,989 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 16:59:24,989 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 16:59:24,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1035447740] [2022-11-25 16:59:24,990 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1035447740] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:59:24,990 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:59:24,990 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 16:59:24,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921379145] [2022-11-25 16:59:24,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:59:24,991 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 16:59:24,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 16:59:24,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 16:59:24,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 16:59:25,011 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 288 [2022-11-25 16:59:25,014 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 41 transitions, 175 flow. Second operand has 4 states, 4 states have (on average 136.5) internal successors, (546), 4 states have internal predecessors, (546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:59:25,014 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 16:59:25,014 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 288 [2022-11-25 16:59:25,014 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 16:59:25,447 INFO L130 PetriNetUnfolder]: 1262/2015 cut-off events. [2022-11-25 16:59:25,447 INFO L131 PetriNetUnfolder]: For 2004/2005 co-relation queries the response was YES. [2022-11-25 16:59:25,454 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5847 conditions, 2015 events. 1262/2015 cut-off events. For 2004/2005 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 10195 event pairs, 542 based on Foata normal form. 1/2003 useless extension candidates. Maximal degree in co-relation 5836. Up to 1159 conditions per place. [2022-11-25 16:59:25,457 INFO L137 encePairwiseOnDemand]: 284/288 looper letters, 54 selfloop transitions, 2 changer transitions 12/71 dead transitions. [2022-11-25 16:59:25,457 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 71 transitions, 450 flow [2022-11-25 16:59:25,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 16:59:25,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-25 16:59:25,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 565 transitions. [2022-11-25 16:59:25,464 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4904513888888889 [2022-11-25 16:59:25,464 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 565 transitions. [2022-11-25 16:59:25,464 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 565 transitions. [2022-11-25 16:59:25,465 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 16:59:25,465 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 565 transitions. [2022-11-25 16:59:25,466 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 141.25) internal successors, (565), 4 states have internal predecessors, (565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:59:25,469 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 288.0) internal successors, (1440), 5 states have internal predecessors, (1440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:59:25,469 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 288.0) internal successors, (1440), 5 states have internal predecessors, (1440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:59:25,470 INFO L175 Difference]: Start difference. First operand has 59 places, 41 transitions, 175 flow. Second operand 4 states and 565 transitions. [2022-11-25 16:59:25,470 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 71 transitions, 450 flow [2022-11-25 16:59:25,487 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 71 transitions, 432 flow, removed 3 selfloop flow, removed 6 redundant places. [2022-11-25 16:59:25,488 INFO L231 Difference]: Finished difference. Result has 55 places, 41 transitions, 173 flow [2022-11-25 16:59:25,489 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=288, PETRI_DIFFERENCE_MINUEND_FLOW=163, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=173, PETRI_PLACES=55, PETRI_TRANSITIONS=41} [2022-11-25 16:59:25,490 INFO L288 CegarLoopForPetriNet]: 53 programPoint places, 2 predicate places. [2022-11-25 16:59:25,491 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 41 transitions, 173 flow [2022-11-25 16:59:25,491 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 136.5) internal successors, (546), 4 states have internal predecessors, (546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:59:25,491 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 16:59:25,491 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, 1] [2022-11-25 16:59:25,509 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e025b304-97e6-42d7-a3ce-aa44b34f6f9b/bin/uautomizer-ZsLfNo2U6R/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)] Forceful destruction successful, exit code 0 [2022-11-25 16:59:25,704 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e025b304-97e6-42d7-a3ce-aa44b34f6f9b/bin/uautomizer-ZsLfNo2U6R/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-11-25 16:59:25,704 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-11-25 16:59:25,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:59:25,704 INFO L85 PathProgramCache]: Analyzing trace with hash -1902011656, now seen corresponding path program 4 times [2022-11-25 16:59:25,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 16:59:25,705 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1141077535] [2022-11-25 16:59:25,705 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-25 16:59:25,705 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-11-25 16:59:25,705 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e025b304-97e6-42d7-a3ce-aa44b34f6f9b/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 16:59:25,707 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e025b304-97e6-42d7-a3ce-aa44b34f6f9b/bin/uautomizer-ZsLfNo2U6R/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-11-25 16:59:25,719 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e025b304-97e6-42d7-a3ce-aa44b34f6f9b/bin/uautomizer-ZsLfNo2U6R/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-11-25 16:59:25,860 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-25 16:59:25,867 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 16:59:25,874 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-25 16:59:25,875 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 16:59:25,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:59:25,910 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 16:59:25,911 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 16:59:25,911 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1141077535] [2022-11-25 16:59:25,911 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1141077535] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:59:25,911 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:59:25,911 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 16:59:25,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398926197] [2022-11-25 16:59:25,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:59:25,912 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 16:59:25,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 16:59:25,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 16:59:25,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 16:59:25,936 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 288 [2022-11-25 16:59:25,937 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 41 transitions, 173 flow. Second operand has 4 states, 4 states have (on average 136.5) internal successors, (546), 4 states have internal predecessors, (546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:59:25,937 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 16:59:25,938 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 288 [2022-11-25 16:59:25,938 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 16:59:26,258 INFO L130 PetriNetUnfolder]: 847/1381 cut-off events. [2022-11-25 16:59:26,258 INFO L131 PetriNetUnfolder]: For 1217/1221 co-relation queries the response was YES. [2022-11-25 16:59:26,263 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4039 conditions, 1381 events. 847/1381 cut-off events. For 1217/1221 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 6150 event pairs, 343 based on Foata normal form. 1/1375 useless extension candidates. Maximal degree in co-relation 4028. Up to 780 conditions per place. [2022-11-25 16:59:26,265 INFO L137 encePairwiseOnDemand]: 284/288 looper letters, 44 selfloop transitions, 2 changer transitions 19/68 dead transitions. [2022-11-25 16:59:26,265 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 68 transitions, 430 flow [2022-11-25 16:59:26,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 16:59:26,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-25 16:59:26,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 562 transitions. [2022-11-25 16:59:26,268 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4878472222222222 [2022-11-25 16:59:26,268 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 562 transitions. [2022-11-25 16:59:26,268 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 562 transitions. [2022-11-25 16:59:26,268 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 16:59:26,269 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 562 transitions. [2022-11-25 16:59:26,270 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 140.5) internal successors, (562), 4 states have internal predecessors, (562), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:59:26,272 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 288.0) internal successors, (1440), 5 states have internal predecessors, (1440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:59:26,273 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 288.0) internal successors, (1440), 5 states have internal predecessors, (1440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:59:26,273 INFO L175 Difference]: Start difference. First operand has 55 places, 41 transitions, 173 flow. Second operand 4 states and 562 transitions. [2022-11-25 16:59:26,273 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 68 transitions, 430 flow [2022-11-25 16:59:26,282 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 68 transitions, 420 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-11-25 16:59:26,283 INFO L231 Difference]: Finished difference. Result has 56 places, 41 transitions, 175 flow [2022-11-25 16:59:26,283 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=288, PETRI_DIFFERENCE_MINUEND_FLOW=165, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=175, PETRI_PLACES=56, PETRI_TRANSITIONS=41} [2022-11-25 16:59:26,284 INFO L288 CegarLoopForPetriNet]: 53 programPoint places, 3 predicate places. [2022-11-25 16:59:26,284 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 41 transitions, 175 flow [2022-11-25 16:59:26,284 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 136.5) internal successors, (546), 4 states have internal predecessors, (546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:59:26,284 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 16:59:26,285 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, 1] [2022-11-25 16:59:26,301 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e025b304-97e6-42d7-a3ce-aa44b34f6f9b/bin/uautomizer-ZsLfNo2U6R/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)] Forceful destruction successful, exit code 0 [2022-11-25 16:59:26,501 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e025b304-97e6-42d7-a3ce-aa44b34f6f9b/bin/uautomizer-ZsLfNo2U6R/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-11-25 16:59:26,501 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-11-25 16:59:26,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:59:26,502 INFO L85 PathProgramCache]: Analyzing trace with hash -1075618320, now seen corresponding path program 5 times [2022-11-25 16:59:26,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 16:59:26,503 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1015567329] [2022-11-25 16:59:26,504 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-25 16:59:26,504 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-11-25 16:59:26,504 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e025b304-97e6-42d7-a3ce-aa44b34f6f9b/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 16:59:26,505 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e025b304-97e6-42d7-a3ce-aa44b34f6f9b/bin/uautomizer-ZsLfNo2U6R/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-11-25 16:59:26,511 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e025b304-97e6-42d7-a3ce-aa44b34f6f9b/bin/uautomizer-ZsLfNo2U6R/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 (13)] Waiting until timeout for monitored process [2022-11-25 16:59:26,705 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-25 16:59:26,705 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-11-25 16:59:26,705 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 16:59:26,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 16:59:26,890 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-11-25 16:59:26,891 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-11-25 16:59:26,892 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (15 of 16 remaining) [2022-11-25 16:59:26,894 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (14 of 16 remaining) [2022-11-25 16:59:26,894 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2022-11-25 16:59:26,894 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining) [2022-11-25 16:59:26,894 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2022-11-25 16:59:26,895 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2022-11-25 16:59:26,895 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2022-11-25 16:59:26,895 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2022-11-25 16:59:26,895 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2022-11-25 16:59:26,895 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2022-11-25 16:59:26,895 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (5 of 16 remaining) [2022-11-25 16:59:26,896 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 16 remaining) [2022-11-25 16:59:26,896 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 16 remaining) [2022-11-25 16:59:26,896 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 16 remaining) [2022-11-25 16:59:26,896 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 16 remaining) [2022-11-25 16:59:26,896 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2022-11-25 16:59:26,915 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e025b304-97e6-42d7-a3ce-aa44b34f6f9b/bin/uautomizer-ZsLfNo2U6R/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 (13)] Forceful destruction successful, exit code 0 [2022-11-25 16:59:27,115 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e025b304-97e6-42d7-a3ce-aa44b34f6f9b/bin/uautomizer-ZsLfNo2U6R/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-11-25 16:59:27,116 INFO L445 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:59:27,120 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-25 16:59:27,121 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-25 16:59:27,210 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 04:59:27 BasicIcfg [2022-11-25 16:59:27,210 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-25 16:59:27,211 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-25 16:59:27,211 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-25 16:59:27,211 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-25 16:59:27,212 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 04:58:58" (3/4) ... [2022-11-25 16:59:27,214 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-25 16:59:27,215 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-25 16:59:27,215 INFO L158 Benchmark]: Toolchain (without parser) took 30445.60ms. Allocated memory was 73.4MB in the beginning and 1.4GB in the end (delta: 1.3GB). Free memory was 49.5MB in the beginning and 955.6MB in the end (delta: -906.1MB). Peak memory consumption was 379.6MB. Max. memory is 16.1GB. [2022-11-25 16:59:27,216 INFO L158 Benchmark]: CDTParser took 0.33ms. Allocated memory is still 73.4MB. Free memory is still 51.3MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 16:59:27,216 INFO L158 Benchmark]: CACSL2BoogieTranslator took 901.36ms. Allocated memory was 73.4MB in the beginning and 88.1MB in the end (delta: 14.7MB). Free memory was 49.3MB in the beginning and 52.2MB in the end (delta: -2.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-11-25 16:59:27,216 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.11ms. Allocated memory is still 88.1MB. Free memory was 52.2MB in the beginning and 49.5MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 16:59:27,217 INFO L158 Benchmark]: Boogie Preprocessor took 43.78ms. Allocated memory is still 88.1MB. Free memory was 49.5MB in the beginning and 47.1MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 16:59:27,217 INFO L158 Benchmark]: RCFGBuilder took 1079.01ms. Allocated memory is still 88.1MB. Free memory was 47.1MB in the beginning and 52.6MB in the end (delta: -5.5MB). Peak memory consumption was 17.8MB. Max. memory is 16.1GB. [2022-11-25 16:59:27,217 INFO L158 Benchmark]: TraceAbstraction took 28358.93ms. Allocated memory was 88.1MB in the beginning and 1.4GB in the end (delta: 1.3GB). Free memory was 52.1MB in the beginning and 955.6MB in the end (delta: -903.5MB). Peak memory consumption was 366.2MB. Max. memory is 16.1GB. [2022-11-25 16:59:27,218 INFO L158 Benchmark]: Witness Printer took 3.97ms. Allocated memory is still 1.4GB. Free memory is still 955.6MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 16:59:27,220 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.33ms. Allocated memory is still 73.4MB. Free memory is still 51.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 901.36ms. Allocated memory was 73.4MB in the beginning and 88.1MB in the end (delta: 14.7MB). Free memory was 49.3MB in the beginning and 52.2MB in the end (delta: -2.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.11ms. Allocated memory is still 88.1MB. Free memory was 52.2MB in the beginning and 49.5MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 43.78ms. Allocated memory is still 88.1MB. Free memory was 49.5MB in the beginning and 47.1MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1079.01ms. Allocated memory is still 88.1MB. Free memory was 47.1MB in the beginning and 52.6MB in the end (delta: -5.5MB). Peak memory consumption was 17.8MB. Max. memory is 16.1GB. * TraceAbstraction took 28358.93ms. Allocated memory was 88.1MB in the beginning and 1.4GB in the end (delta: 1.3GB). Free memory was 52.1MB in the beginning and 955.6MB in the end (delta: -903.5MB). Peak memory consumption was 366.2MB. Max. memory is 16.1GB. * Witness Printer took 3.97ms. Allocated memory is still 1.4GB. Free memory is still 955.6MB. 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: 9.9s, 156 PlacesBefore, 53 PlacesAfterwards, 145 TransitionsBefore, 41 TransitionsAfterwards, 3764 CoEnabledTransitionPairs, 7 FixpointIterations, 54 TrivialSequentialCompositions, 76 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 1 ChoiceCompositions, 139 TotalNumberOfCompositions, 10741 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 5255, independent: 5021, independent conditional: 0, independent unconditional: 5021, dependent: 234, dependent conditional: 0, dependent unconditional: 234, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2750, independent: 2679, independent conditional: 0, independent unconditional: 2679, dependent: 71, dependent conditional: 0, dependent unconditional: 71, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2750, independent: 2653, independent conditional: 0, independent unconditional: 2653, dependent: 97, dependent conditional: 0, dependent unconditional: 97, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 97, independent: 26, independent conditional: 0, independent unconditional: 26, dependent: 71, dependent conditional: 0, dependent unconditional: 71, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 446, independent: 68, independent conditional: 0, independent unconditional: 68, dependent: 378, dependent conditional: 0, dependent unconditional: 378, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 5255, independent: 2342, independent conditional: 0, independent unconditional: 2342, dependent: 163, dependent conditional: 0, dependent unconditional: 163, unknown: 2750, unknown conditional: 0, unknown unconditional: 2750] , Statistics on independence cache: Total cache size (in pairs): 351, Positive cache size: 315, Positive conditional cache size: 0, Positive unconditional cache size: 315, Negative cache size: 36, Negative conditional cache size: 0, Negative unconditional cache size: 36, 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_p3_EAX = 0; [L714] 0 int __unbuffered_p3_EBX = 0; [L716] 0 int a = 0; [L717] 0 _Bool a$flush_delayed; [L718] 0 int a$mem_tmp; [L719] 0 _Bool a$r_buff0_thd0; [L720] 0 _Bool a$r_buff0_thd1; [L721] 0 _Bool a$r_buff0_thd2; [L722] 0 _Bool a$r_buff0_thd3; [L723] 0 _Bool a$r_buff0_thd4; [L724] 0 _Bool a$r_buff1_thd0; [L725] 0 _Bool a$r_buff1_thd1; [L726] 0 _Bool a$r_buff1_thd2; [L727] 0 _Bool a$r_buff1_thd3; [L728] 0 _Bool a$r_buff1_thd4; [L729] 0 _Bool a$read_delayed; [L730] 0 int *a$read_delayed_var; [L731] 0 int a$w_buff0; [L732] 0 _Bool a$w_buff0_used; [L733] 0 int a$w_buff1; [L734] 0 _Bool a$w_buff1_used; [L735] 0 _Bool main$tmp_guard0; [L736] 0 _Bool main$tmp_guard1; [L738] 0 int x = 0; [L740] 0 int y = 0; [L742] 0 int z = 0; [L743] 0 _Bool weak$$choice0; [L744] 0 _Bool weak$$choice2; [L862] 0 pthread_t t801; [L863] FCALL, FORK 0 pthread_create(&t801, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=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(&t801, ((void *)0), P0, ((void *)0))=8191, t801={-16:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L864] 0 pthread_t t802; [L748] 1 a$w_buff1 = a$w_buff0 [L749] 1 a$w_buff0 = 1 [L750] 1 a$w_buff1_used = a$w_buff0_used [L751] 1 a$w_buff0_used = (_Bool)1 [L752] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L752] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L753] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L754] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L755] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L756] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L757] 1 a$r_buff1_thd4 = a$r_buff0_thd4 [L758] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=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] [L865] FCALL, FORK 0 pthread_create(&t802, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=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(&t802, ((void *)0), P1, ((void *)0))=8192, t801={-16:0}, t802={-12:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L761] 1 x = 1 VAL [__unbuffered_cnt=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] [L866] 0 pthread_t t803; [L778] 2 x = 2 VAL [__unbuffered_cnt=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] [L781] 2 y = 1 VAL [__unbuffered_cnt=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=1, z=0] [L784] 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) [L785] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L786] 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 [L787] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L788] 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_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=1, z=0] [L867] FCALL, FORK 0 pthread_create(&t803, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=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(&t803, ((void *)0), P2, ((void *)0))=8193, t801={-16:0}, t802={-12:0}, t803={-2:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L868] 0 pthread_t t804; [L869] FCALL, FORK 0 pthread_create(&t804, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=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, pthread_create(&t804, ((void *)0), P3, ((void *)0))=8194, t801={-16:0}, t802={-12:0}, t803={-2:0}, t804={-4:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L798] 3 y = 2 VAL [__unbuffered_cnt=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=2, z=0] [L801] 3 z = 1 VAL [__unbuffered_cnt=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=2, z=1] [L804] 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) [L805] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L806] 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 [L807] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L808] 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_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=2, z=1] [L818] 4 z = 2 VAL [__unbuffered_cnt=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=2, z=2] [L821] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=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=2, z=2] [L824] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L825] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L826] 4 a$flush_delayed = weak$$choice2 [L827] 4 a$mem_tmp = a [L828] 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) [L829] 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)) [L830] 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)) [L831] 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)) [L832] 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)) [L833] 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)) [L834] 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)) [L835] 4 __unbuffered_p3_EBX = a [L836] 4 a = a$flush_delayed ? a$mem_tmp : a [L837] 4 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=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=2, z=2] [L764] 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) [L765] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L766] 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 [L767] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L768] 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_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=2, z=2] [L771] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L773] 1 return 0; [L791] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L793] 2 return 0; [L840] 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) [L841] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L842] 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 [L843] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L844] 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_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=2, z=2] [L847] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L849] 4 return 0; [L811] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L813] 3 return 0; [L871] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L873] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L873] RET 0 assume_abort_if_not(main$tmp_guard0) [L875] 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) [L876] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L877] 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 [L878] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L879] 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_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, t801={-16:0}, t802={-12:0}, t803={-2:0}, t804={-4:0}, weak$$choice0=2, weak$$choice2=0, x=2, y=2, z=2] [L882] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2 && __unbuffered_p3_EAX == 2 && __unbuffered_p3_EBX == 0) [L884] 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_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=2, 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: 860]: 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: 863]: 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: 28.1s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 11.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 10.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 480 SdHoareTripleChecker+Valid, 4.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 352 mSDsluCounter, 214 SdHoareTripleChecker+Invalid, 3.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 186 mSDsCounter, 72 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2094 IncrementalHoareTripleChecker+Invalid, 2166 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 72 mSolverCounterUnsat, 28 mSDtfsCounter, 2094 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 216 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=208occurred in iteration=6, InterpolantAutomatonStates: 49, 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.3s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 250 NumberOfCodeBlocks, 250 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 210 ConstructedInterpolants, 21 QuantifiedInterpolants, 1915 SizeOfPredicates, 24 NumberOfNonLiveVariables, 1727 ConjunctsInSsa, 81 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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-11-25 16:59:27,244 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e025b304-97e6-42d7-a3ce-aa44b34f6f9b/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample