./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/mix026_pso.opt_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd5b8763-06ab-4261-aa22-c5aed923bf3a/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd5b8763-06ab-4261-aa22-c5aed923bf3a/bin/uautomizer-uyxdKDjOR8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd5b8763-06ab-4261-aa22-c5aed923bf3a/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd5b8763-06ab-4261-aa22-c5aed923bf3a/bin/uautomizer-uyxdKDjOR8/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix026_pso.opt_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd5b8763-06ab-4261-aa22-c5aed923bf3a/bin/uautomizer-uyxdKDjOR8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd5b8763-06ab-4261-aa22-c5aed923bf3a/bin/uautomizer-uyxdKDjOR8 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a0c922061e4dc1feb6389a43fa3f654e69e326084cac4d5446a529710663ff29 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-2329fc7 [2022-12-13 16:25:26,201 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 16:25:26,202 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 16:25:26,215 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 16:25:26,216 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 16:25:26,216 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 16:25:26,217 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 16:25:26,218 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 16:25:26,219 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 16:25:26,219 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 16:25:26,220 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 16:25:26,221 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 16:25:26,221 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 16:25:26,222 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 16:25:26,223 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 16:25:26,223 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 16:25:26,224 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 16:25:26,224 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 16:25:26,225 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 16:25:26,226 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 16:25:26,227 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 16:25:26,228 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 16:25:26,229 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 16:25:26,229 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 16:25:26,231 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 16:25:26,231 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 16:25:26,232 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 16:25:26,232 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 16:25:26,232 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 16:25:26,233 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 16:25:26,233 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 16:25:26,234 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 16:25:26,234 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 16:25:26,235 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 16:25:26,235 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 16:25:26,235 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 16:25:26,236 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 16:25:26,236 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 16:25:26,236 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 16:25:26,237 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 16:25:26,237 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 16:25:26,238 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd5b8763-06ab-4261-aa22-c5aed923bf3a/bin/uautomizer-uyxdKDjOR8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-12-13 16:25:26,253 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 16:25:26,254 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 16:25:26,254 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 16:25:26,254 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 16:25:26,254 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 16:25:26,254 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 16:25:26,255 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 16:25:26,255 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 16:25:26,255 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 16:25:26,255 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 16:25:26,255 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 16:25:26,255 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-13 16:25:26,255 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 16:25:26,256 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 16:25:26,256 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 16:25:26,256 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-12-13 16:25:26,256 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-12-13 16:25:26,256 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-12-13 16:25:26,256 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 16:25:26,256 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-12-13 16:25:26,256 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 16:25:26,256 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 16:25:26,256 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 16:25:26,256 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 16:25:26,257 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 16:25:26,257 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 16:25:26,257 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 16:25:26,257 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 16:25:26,257 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 16:25:26,257 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 16:25:26,257 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 16:25:26,257 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 16:25:26,257 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 16:25:26,257 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 16:25:26,258 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_bd5b8763-06ab-4261-aa22-c5aed923bf3a/bin/uautomizer-uyxdKDjOR8/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd5b8763-06ab-4261-aa22-c5aed923bf3a/bin/uautomizer-uyxdKDjOR8 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a0c922061e4dc1feb6389a43fa3f654e69e326084cac4d5446a529710663ff29 [2022-12-13 16:25:26,458 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 16:25:26,476 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 16:25:26,478 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 16:25:26,478 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 16:25:26,479 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 16:25:26,480 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd5b8763-06ab-4261-aa22-c5aed923bf3a/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/pthread-wmm/mix026_pso.opt_rmo.opt.i [2022-12-13 16:25:29,111 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 16:25:29,337 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 16:25:29,338 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd5b8763-06ab-4261-aa22-c5aed923bf3a/sv-benchmarks/c/pthread-wmm/mix026_pso.opt_rmo.opt.i [2022-12-13 16:25:29,349 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd5b8763-06ab-4261-aa22-c5aed923bf3a/bin/uautomizer-uyxdKDjOR8/data/218926858/c035489ebd594a98994e35f12a1d761f/FLAG136ca5d44 [2022-12-13 16:25:29,362 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd5b8763-06ab-4261-aa22-c5aed923bf3a/bin/uautomizer-uyxdKDjOR8/data/218926858/c035489ebd594a98994e35f12a1d761f [2022-12-13 16:25:29,364 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 16:25:29,365 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 16:25:29,366 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 16:25:29,366 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 16:25:29,369 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 16:25:29,369 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 04:25:29" (1/1) ... [2022-12-13 16:25:29,370 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75d46b40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:25:29, skipping insertion in model container [2022-12-13 16:25:29,371 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 04:25:29" (1/1) ... [2022-12-13 16:25:29,376 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 16:25:29,409 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 16:25:29,540 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_bd5b8763-06ab-4261-aa22-c5aed923bf3a/sv-benchmarks/c/pthread-wmm/mix026_pso.opt_rmo.opt.i[956,969] [2022-12-13 16:25:29,661 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:25:29,661 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:25:29,662 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:25:29,662 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:25:29,662 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:25:29,663 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:25:29,663 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:25:29,663 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:25:29,664 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:25:29,664 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:25:29,664 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:25:29,674 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:25:29,675 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:25:29,675 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:25:29,675 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:25:29,675 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:25:29,676 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:25:29,678 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:25:29,679 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:25:29,679 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:25:29,679 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:25:29,682 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:25:29,682 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:25:29,683 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:25:29,684 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:25:29,684 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:25:29,684 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:25:29,685 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:25:29,685 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:25:29,685 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:25:29,686 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:25:29,689 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:25:29,689 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:25:29,689 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:25:29,696 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:25:29,697 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:25:29,697 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:25:29,700 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:25:29,701 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:25:29,701 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:25:29,702 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 16:25:29,713 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 16:25:29,722 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_bd5b8763-06ab-4261-aa22-c5aed923bf3a/sv-benchmarks/c/pthread-wmm/mix026_pso.opt_rmo.opt.i[956,969] [2022-12-13 16:25:29,745 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:25:29,746 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:25:29,746 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:25:29,747 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:25:29,747 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:25:29,747 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:25:29,747 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:25:29,748 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:25:29,748 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:25:29,748 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:25:29,749 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:25:29,756 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:25:29,756 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:25:29,756 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:25:29,756 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:25:29,757 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:25:29,757 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:25:29,759 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:25:29,759 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:25:29,759 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:25:29,759 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:25:29,762 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:25:29,762 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:25:29,762 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:25:29,763 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:25:29,763 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:25:29,763 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:25:29,764 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:25:29,764 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:25:29,764 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:25:29,765 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:25:29,767 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:25:29,767 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:25:29,767 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:25:29,771 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:25:29,772 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:25:29,772 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:25:29,774 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:25:29,774 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:25:29,775 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:25:29,776 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 16:25:29,799 INFO L208 MainTranslator]: Completed translation [2022-12-13 16:25:29,800 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:25:29 WrapperNode [2022-12-13 16:25:29,800 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 16:25:29,801 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 16:25:29,801 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 16:25:29,801 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 16:25:29,806 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:25:29" (1/1) ... [2022-12-13 16:25:29,820 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:25:29" (1/1) ... [2022-12-13 16:25:29,843 INFO L138 Inliner]: procedures = 177, calls = 69, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 145 [2022-12-13 16:25:29,843 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 16:25:29,844 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 16:25:29,844 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 16:25:29,844 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 16:25:29,852 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:25:29" (1/1) ... [2022-12-13 16:25:29,852 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:25:29" (1/1) ... [2022-12-13 16:25:29,856 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:25:29" (1/1) ... [2022-12-13 16:25:29,856 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:25:29" (1/1) ... [2022-12-13 16:25:29,864 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:25:29" (1/1) ... [2022-12-13 16:25:29,866 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:25:29" (1/1) ... [2022-12-13 16:25:29,868 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:25:29" (1/1) ... [2022-12-13 16:25:29,870 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:25:29" (1/1) ... [2022-12-13 16:25:29,873 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 16:25:29,874 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 16:25:29,874 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 16:25:29,874 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 16:25:29,875 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:25:29" (1/1) ... [2022-12-13 16:25:29,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 16:25:29,893 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd5b8763-06ab-4261-aa22-c5aed923bf3a/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 16:25:29,904 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd5b8763-06ab-4261-aa22-c5aed923bf3a/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 16:25:29,906 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd5b8763-06ab-4261-aa22-c5aed923bf3a/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 16:25:29,938 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 16:25:29,938 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 16:25:29,938 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 16:25:29,938 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 16:25:29,938 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 16:25:29,938 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 16:25:29,939 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 16:25:29,939 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 16:25:29,939 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 16:25:29,939 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-13 16:25:29,939 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-13 16:25:29,939 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-12-13 16:25:29,939 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-12-13 16:25:29,939 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 16:25:29,939 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 16:25:29,940 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 16:25:29,940 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 16:25:29,941 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-12-13 16:25:30,035 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 16:25:30,037 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 16:25:30,311 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 16:25:30,409 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 16:25:30,409 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 16:25:30,412 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 04:25:30 BoogieIcfgContainer [2022-12-13 16:25:30,412 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 16:25:30,415 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 16:25:30,415 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 16:25:30,418 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 16:25:30,418 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 04:25:29" (1/3) ... [2022-12-13 16:25:30,418 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c91979b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 04:25:30, skipping insertion in model container [2022-12-13 16:25:30,419 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:25:29" (2/3) ... [2022-12-13 16:25:30,419 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c91979b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 04:25:30, skipping insertion in model container [2022-12-13 16:25:30,419 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 04:25:30" (3/3) ... [2022-12-13 16:25:30,420 INFO L112 eAbstractionObserver]: Analyzing ICFG mix026_pso.opt_rmo.opt.i [2022-12-13 16:25:30,436 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 16:25:30,437 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2022-12-13 16:25:30,437 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 16:25:30,496 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 16:25:30,534 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 159 places, 148 transitions, 316 flow [2022-12-13 16:25:30,585 INFO L130 PetriNetUnfolder]: 2/144 cut-off events. [2022-12-13 16:25:30,586 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 16:25:30,591 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 99 event pairs, 0 based on Foata normal form. 0/131 useless extension candidates. Maximal degree in co-relation 99. Up to 2 conditions per place. [2022-12-13 16:25:30,592 INFO L82 GeneralOperation]: Start removeDead. Operand has 159 places, 148 transitions, 316 flow [2022-12-13 16:25:30,596 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 155 places, 144 transitions, 300 flow [2022-12-13 16:25:30,600 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-12-13 16:25:30,610 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 155 places, 144 transitions, 300 flow [2022-12-13 16:25:30,613 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 155 places, 144 transitions, 300 flow [2022-12-13 16:25:30,614 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 155 places, 144 transitions, 300 flow [2022-12-13 16:25:30,643 INFO L130 PetriNetUnfolder]: 2/144 cut-off events. [2022-12-13 16:25:30,644 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 16:25:30,644 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 99 event pairs, 0 based on Foata normal form. 0/131 useless extension candidates. Maximal degree in co-relation 99. Up to 2 conditions per place. [2022-12-13 16:25:30,647 INFO L119 LiptonReduction]: Number of co-enabled transitions 3396 [2022-12-13 16:25:34,039 INFO L134 LiptonReduction]: Checked pairs total: 8809 [2022-12-13 16:25:34,039 INFO L136 LiptonReduction]: Total number of compositions: 141 [2022-12-13 16:25:34,049 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 16:25:34,054 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;@642d8dd8, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 16:25:34,054 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2022-12-13 16:25:34,055 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2022-12-13 16:25:34,055 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 16:25:34,055 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 16:25:34,055 INFO L209 CegarLoopForPetriNet]: trace histogram [1] [2022-12-13 16:25:34,056 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-12-13 16:25:34,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:25:34,059 INFO L85 PathProgramCache]: Analyzing trace with hash 604, now seen corresponding path program 1 times [2022-12-13 16:25:34,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:25:34,066 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057757525] [2022-12-13 16:25:34,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:25:34,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:25:34,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:25:34,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:25:34,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:25:34,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057757525] [2022-12-13 16:25:34,157 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2057757525] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:25:34,157 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:25:34,157 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-12-13 16:25:34,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329224718] [2022-12-13 16:25:34,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:25:34,166 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-13 16:25:34,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:25:34,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-13 16:25:34,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-13 16:25:34,190 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 289 [2022-12-13 16:25:34,192 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 39 transitions, 90 flow. Second operand has 2 states, 2 states have (on average 135.5) internal successors, (271), 2 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:25:34,192 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 16:25:34,192 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 289 [2022-12-13 16:25:34,193 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 16:25:35,073 INFO L130 PetriNetUnfolder]: 5049/7086 cut-off events. [2022-12-13 16:25:35,074 INFO L131 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2022-12-13 16:25:35,091 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14124 conditions, 7086 events. 5049/7086 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 385. Compared 37322 event pairs, 5049 based on Foata normal form. 0/6053 useless extension candidates. Maximal degree in co-relation 14112. Up to 6881 conditions per place. [2022-12-13 16:25:35,124 INFO L137 encePairwiseOnDemand]: 280/289 looper letters, 26 selfloop transitions, 0 changer transitions 0/30 dead transitions. [2022-12-13 16:25:35,124 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 30 transitions, 124 flow [2022-12-13 16:25:35,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 16:25:35,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-12-13 16:25:35,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 305 transitions. [2022-12-13 16:25:35,133 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.527681660899654 [2022-12-13 16:25:35,134 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 305 transitions. [2022-12-13 16:25:35,134 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 305 transitions. [2022-12-13 16:25:35,136 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 16:25:35,138 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 305 transitions. [2022-12-13 16:25:35,141 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 152.5) internal successors, (305), 2 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:25:35,146 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 289.0) internal successors, (867), 3 states have internal predecessors, (867), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:25:35,146 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 289.0) internal successors, (867), 3 states have internal predecessors, (867), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:25:35,148 INFO L175 Difference]: Start difference. First operand has 51 places, 39 transitions, 90 flow. Second operand 2 states and 305 transitions. [2022-12-13 16:25:35,148 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 30 transitions, 124 flow [2022-12-13 16:25:35,153 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 30 transitions, 120 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-13 16:25:35,154 INFO L231 Difference]: Finished difference. Result has 40 places, 30 transitions, 68 flow [2022-12-13 16:25:35,156 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=289, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=68, PETRI_PLACES=40, PETRI_TRANSITIONS=30} [2022-12-13 16:25:35,158 INFO L288 CegarLoopForPetriNet]: 51 programPoint places, -11 predicate places. [2022-12-13 16:25:35,159 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 30 transitions, 68 flow [2022-12-13 16:25:35,159 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 135.5) internal successors, (271), 2 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:25:35,159 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 16:25:35,159 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:25:35,159 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 16:25:35,160 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P2Err0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-12-13 16:25:35,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:25:35,160 INFO L85 PathProgramCache]: Analyzing trace with hash 90507593, now seen corresponding path program 1 times [2022-12-13 16:25:35,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:25:35,161 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76122714] [2022-12-13 16:25:35,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:25:35,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:25:35,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:25:35,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:25:35,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:25:35,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76122714] [2022-12-13 16:25:35,425 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [76122714] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:25:35,425 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:25:35,425 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 16:25:35,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784424609] [2022-12-13 16:25:35,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:25:35,426 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 16:25:35,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:25:35,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 16:25:35,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 16:25:35,430 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 289 [2022-12-13 16:25:35,430 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 30 transitions, 68 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-12-13 16:25:35,430 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 16:25:35,430 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 289 [2022-12-13 16:25:35,431 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 16:25:36,097 INFO L130 PetriNetUnfolder]: 3975/5688 cut-off events. [2022-12-13 16:25:36,097 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 16:25:36,106 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11265 conditions, 5688 events. 3975/5688 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 322. Compared 30116 event pairs, 1089 based on Foata normal form. 0/5255 useless extension candidates. Maximal degree in co-relation 11262. Up to 4303 conditions per place. [2022-12-13 16:25:36,129 INFO L137 encePairwiseOnDemand]: 286/289 looper letters, 37 selfloop transitions, 2 changer transitions 2/45 dead transitions. [2022-12-13 16:25:36,129 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 45 transitions, 182 flow [2022-12-13 16:25:36,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 16:25:36,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 16:25:36,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 444 transitions. [2022-12-13 16:25:36,132 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5121107266435986 [2022-12-13 16:25:36,132 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 444 transitions. [2022-12-13 16:25:36,133 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 444 transitions. [2022-12-13 16:25:36,133 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 16:25:36,133 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 444 transitions. [2022-12-13 16:25:36,135 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 148.0) internal successors, (444), 3 states have internal predecessors, (444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:25:36,137 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 289.0) internal successors, (1156), 4 states have internal predecessors, (1156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:25:36,138 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 289.0) internal successors, (1156), 4 states have internal predecessors, (1156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:25:36,138 INFO L175 Difference]: Start difference. First operand has 40 places, 30 transitions, 68 flow. Second operand 3 states and 444 transitions. [2022-12-13 16:25:36,138 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 45 transitions, 182 flow [2022-12-13 16:25:36,139 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 45 transitions, 182 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-13 16:25:36,139 INFO L231 Difference]: Finished difference. Result has 41 places, 28 transitions, 68 flow [2022-12-13 16:25:36,140 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=289, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=68, PETRI_PLACES=41, PETRI_TRANSITIONS=28} [2022-12-13 16:25:36,140 INFO L288 CegarLoopForPetriNet]: 51 programPoint places, -10 predicate places. [2022-12-13 16:25:36,140 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 28 transitions, 68 flow [2022-12-13 16:25:36,141 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-12-13 16:25:36,141 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 16:25:36,141 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:25:36,141 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 16:25:36,141 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-12-13 16:25:36,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:25:36,142 INFO L85 PathProgramCache]: Analyzing trace with hash 1385033402, now seen corresponding path program 1 times [2022-12-13 16:25:36,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:25:36,142 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277578505] [2022-12-13 16:25:36,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:25:36,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:25:36,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:25:36,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:25:36,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:25:36,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277578505] [2022-12-13 16:25:36,340 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277578505] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:25:36,340 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:25:36,340 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 16:25:36,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839362775] [2022-12-13 16:25:36,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:25:36,341 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 16:25:36,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:25:36,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 16:25:36,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 16:25:36,358 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 289 [2022-12-13 16:25:36,359 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 28 transitions, 68 flow. Second operand has 3 states, 3 states have (on average 128.66666666666666) internal successors, (386), 3 states have internal predecessors, (386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:25:36,359 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 16:25:36,359 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 289 [2022-12-13 16:25:36,359 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 16:25:37,769 INFO L130 PetriNetUnfolder]: 14435/19592 cut-off events. [2022-12-13 16:25:37,769 INFO L131 PetriNetUnfolder]: For 784/784 co-relation queries the response was YES. [2022-12-13 16:25:37,786 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40251 conditions, 19592 events. 14435/19592 cut-off events. For 784/784 co-relation queries the response was YES. Maximal size of possible extension queue 687. Compared 101943 event pairs, 5075 based on Foata normal form. 0/19132 useless extension candidates. Maximal degree in co-relation 40247. Up to 12481 conditions per place. [2022-12-13 16:25:37,837 INFO L137 encePairwiseOnDemand]: 280/289 looper letters, 45 selfloop transitions, 8 changer transitions 0/53 dead transitions. [2022-12-13 16:25:37,837 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 53 transitions, 232 flow [2022-12-13 16:25:37,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 16:25:37,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 16:25:37,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 429 transitions. [2022-12-13 16:25:37,839 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.49480968858131485 [2022-12-13 16:25:37,839 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 429 transitions. [2022-12-13 16:25:37,839 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 429 transitions. [2022-12-13 16:25:37,839 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 16:25:37,839 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 429 transitions. [2022-12-13 16:25:37,840 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 143.0) internal successors, (429), 3 states have internal predecessors, (429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:25:37,842 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 289.0) internal successors, (1156), 4 states have internal predecessors, (1156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:25:37,842 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 289.0) internal successors, (1156), 4 states have internal predecessors, (1156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:25:37,842 INFO L175 Difference]: Start difference. First operand has 41 places, 28 transitions, 68 flow. Second operand 3 states and 429 transitions. [2022-12-13 16:25:37,842 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 53 transitions, 232 flow [2022-12-13 16:25:37,843 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 53 transitions, 226 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 16:25:37,844 INFO L231 Difference]: Finished difference. Result has 42 places, 35 transitions, 126 flow [2022-12-13 16:25:37,844 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=289, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=126, PETRI_PLACES=42, PETRI_TRANSITIONS=35} [2022-12-13 16:25:37,845 INFO L288 CegarLoopForPetriNet]: 51 programPoint places, -9 predicate places. [2022-12-13 16:25:37,845 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 35 transitions, 126 flow [2022-12-13 16:25:37,845 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 128.66666666666666) internal successors, (386), 3 states have internal predecessors, (386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:25:37,845 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 16:25:37,845 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:25:37,845 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 16:25:37,845 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-12-13 16:25:37,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:25:37,846 INFO L85 PathProgramCache]: Analyzing trace with hash -13640321, now seen corresponding path program 1 times [2022-12-13 16:25:37,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:25:37,846 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617483968] [2022-12-13 16:25:37,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:25:37,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:25:37,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:25:38,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:25:38,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:25:38,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617483968] [2022-12-13 16:25:38,017 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617483968] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:25:38,017 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:25:38,017 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 16:25:38,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97138448] [2022-12-13 16:25:38,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:25:38,018 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 16:25:38,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:25:38,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 16:25:38,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 16:25:38,036 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 289 [2022-12-13 16:25:38,037 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 35 transitions, 126 flow. Second operand has 4 states, 4 states have (on average 128.0) internal successors, (512), 4 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:25:38,037 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 16:25:38,037 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 289 [2022-12-13 16:25:38,038 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 16:25:39,560 INFO L130 PetriNetUnfolder]: 13807/18740 cut-off events. [2022-12-13 16:25:39,560 INFO L131 PetriNetUnfolder]: For 7365/7365 co-relation queries the response was YES. [2022-12-13 16:25:39,578 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47273 conditions, 18740 events. 13807/18740 cut-off events. For 7365/7365 co-relation queries the response was YES. Maximal size of possible extension queue 642. Compared 94539 event pairs, 3411 based on Foata normal form. 140/18880 useless extension candidates. Maximal degree in co-relation 47268. Up to 8513 conditions per place. [2022-12-13 16:25:39,618 INFO L137 encePairwiseOnDemand]: 281/289 looper letters, 57 selfloop transitions, 8 changer transitions 0/65 dead transitions. [2022-12-13 16:25:39,618 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 65 transitions, 340 flow [2022-12-13 16:25:39,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 16:25:39,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 16:25:39,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 560 transitions. [2022-12-13 16:25:39,620 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4844290657439446 [2022-12-13 16:25:39,620 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 560 transitions. [2022-12-13 16:25:39,620 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 560 transitions. [2022-12-13 16:25:39,620 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 16:25:39,620 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 560 transitions. [2022-12-13 16:25:39,621 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 140.0) internal successors, (560), 4 states have internal predecessors, (560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:25:39,623 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 289.0) internal successors, (1445), 5 states have internal predecessors, (1445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:25:39,623 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 289.0) internal successors, (1445), 5 states have internal predecessors, (1445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:25:39,623 INFO L175 Difference]: Start difference. First operand has 42 places, 35 transitions, 126 flow. Second operand 4 states and 560 transitions. [2022-12-13 16:25:39,623 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 65 transitions, 340 flow [2022-12-13 16:25:39,646 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 65 transitions, 316 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 16:25:39,647 INFO L231 Difference]: Finished difference. Result has 46 places, 39 transitions, 168 flow [2022-12-13 16:25:39,647 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=289, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=168, PETRI_PLACES=46, PETRI_TRANSITIONS=39} [2022-12-13 16:25:39,648 INFO L288 CegarLoopForPetriNet]: 51 programPoint places, -5 predicate places. [2022-12-13 16:25:39,648 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 39 transitions, 168 flow [2022-12-13 16:25:39,648 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 128.0) internal successors, (512), 4 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:25:39,648 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 16:25:39,648 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:25:39,648 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 16:25:39,648 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-12-13 16:25:39,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:25:39,649 INFO L85 PathProgramCache]: Analyzing trace with hash -13636667, now seen corresponding path program 1 times [2022-12-13 16:25:39,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:25:39,649 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553796353] [2022-12-13 16:25:39,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:25:39,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:25:39,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:25:40,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:25:40,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:25:40,081 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553796353] [2022-12-13 16:25:40,081 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553796353] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:25:40,081 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:25:40,081 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 16:25:40,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112173782] [2022-12-13 16:25:40,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:25:40,082 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 16:25:40,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:25:40,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 16:25:40,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 16:25:40,383 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 289 [2022-12-13 16:25:40,384 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 39 transitions, 168 flow. Second operand has 7 states, 7 states have (on average 117.71428571428571) internal successors, (824), 7 states have internal predecessors, (824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:25:40,384 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 16:25:40,384 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 289 [2022-12-13 16:25:40,384 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 16:25:41,498 INFO L130 PetriNetUnfolder]: 8087/11704 cut-off events. [2022-12-13 16:25:41,499 INFO L131 PetriNetUnfolder]: For 6338/6875 co-relation queries the response was YES. [2022-12-13 16:25:41,512 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29956 conditions, 11704 events. 8087/11704 cut-off events. For 6338/6875 co-relation queries the response was YES. Maximal size of possible extension queue 619. Compared 68381 event pairs, 1462 based on Foata normal form. 758/12139 useless extension candidates. Maximal degree in co-relation 29949. Up to 7219 conditions per place. [2022-12-13 16:25:41,533 INFO L137 encePairwiseOnDemand]: 283/289 looper letters, 38 selfloop transitions, 4 changer transitions 17/69 dead transitions. [2022-12-13 16:25:41,534 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 69 transitions, 374 flow [2022-12-13 16:25:41,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 16:25:41,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 16:25:41,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 862 transitions. [2022-12-13 16:25:41,537 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.42609985170538806 [2022-12-13 16:25:41,537 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 862 transitions. [2022-12-13 16:25:41,537 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 862 transitions. [2022-12-13 16:25:41,538 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 16:25:41,538 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 862 transitions. [2022-12-13 16:25:41,540 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 123.14285714285714) internal successors, (862), 7 states have internal predecessors, (862), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:25:41,543 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 289.0) internal successors, (2312), 8 states have internal predecessors, (2312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:25:41,545 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 289.0) internal successors, (2312), 8 states have internal predecessors, (2312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:25:41,545 INFO L175 Difference]: Start difference. First operand has 46 places, 39 transitions, 168 flow. Second operand 7 states and 862 transitions. [2022-12-13 16:25:41,545 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 69 transitions, 374 flow [2022-12-13 16:25:41,576 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 69 transitions, 371 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 16:25:41,577 INFO L231 Difference]: Finished difference. Result has 50 places, 35 transitions, 153 flow [2022-12-13 16:25:41,577 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=289, PETRI_DIFFERENCE_MINUEND_FLOW=163, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=153, PETRI_PLACES=50, PETRI_TRANSITIONS=35} [2022-12-13 16:25:41,578 INFO L288 CegarLoopForPetriNet]: 51 programPoint places, -1 predicate places. [2022-12-13 16:25:41,578 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 35 transitions, 153 flow [2022-12-13 16:25:41,578 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 117.71428571428571) internal successors, (824), 7 states have internal predecessors, (824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:25:41,579 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 16:25:41,579 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:25:41,579 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 16:25:41,579 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-12-13 16:25:41,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:25:41,579 INFO L85 PathProgramCache]: Analyzing trace with hash -425909591, now seen corresponding path program 1 times [2022-12-13 16:25:41,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:25:41,580 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31910218] [2022-12-13 16:25:41,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:25:41,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:25:41,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:25:41,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:25:41,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:25:41,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31910218] [2022-12-13 16:25:41,757 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [31910218] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:25:41,757 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:25:41,757 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 16:25:41,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023427890] [2022-12-13 16:25:41,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:25:41,757 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 16:25:41,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:25:41,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 16:25:41,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 16:25:41,768 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 289 [2022-12-13 16:25:41,769 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 35 transitions, 153 flow. Second operand has 4 states, 4 states have (on average 132.0) internal successors, (528), 4 states have internal predecessors, (528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:25:41,769 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 16:25:41,769 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 289 [2022-12-13 16:25:41,769 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 16:25:42,546 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([422] L832-->L839: Formula: (let ((.cse4 (not (= (mod v_~y$r_buff1_thd4~0_24 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd4~0_26 256) 0))) (.cse3 (not (= (mod v_~y$w_buff0_used~0_99 256) 0)))) (let ((.cse1 (and .cse5 .cse3)) (.cse2 (and (not (= (mod v_~y$w_buff0_used~0_100 256) 0)) .cse5)) (.cse0 (and (not (= (mod v_~y$w_buff1_used~0_83 256) 0)) .cse4))) (and (= v_~y$w_buff1_used~0_82 (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_83)) (= v_~y$w_buff0_used~0_99 (ite .cse2 0 v_~y$w_buff0_used~0_100)) (= (ite .cse1 0 v_~y$r_buff0_thd4~0_26) v_~y$r_buff0_thd4~0_25) (= (ite (or (and (not (= (mod v_~y$r_buff0_thd4~0_25 256) 0)) .cse3) (and (not (= (mod v_~y$w_buff1_used~0_82 256) 0)) .cse4)) 0 v_~y$r_buff1_thd4~0_24) v_~y$r_buff1_thd4~0_23) (= (ite .cse2 v_~y$w_buff0~0_46 (ite .cse0 v_~y$w_buff1~0_45 v_~y~0_63)) v_~y~0_62)))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_26, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_24, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_100, ~y$w_buff1~0=v_~y$w_buff1~0_45, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_63, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_83} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_25, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_23, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_99, ~y$w_buff1~0=v_~y$w_buff1~0_45, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_62, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_82} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, ~y~0, ~y$w_buff1_used~0][70], [P2Thread1of1ForFork0InUse, 162#true, 191#true, Black: 171#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 65#L839true, 69#P2EXITtrue, 5#L867-1true, Black: 177#(= ~__unbuffered_p3_EAX~0 0), Black: 178#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 175#true, 138#L784true, P0Thread1of1ForFork3InUse, P3Thread1of1ForFork2InUse, 126#L756true, P1Thread1of1ForFork1InUse, 188#(and (not (= |ULTIMATE.start_main_~#t696~0#1.base| |ULTIMATE.start_main_~#t693~0#1.base|)) (= |ULTIMATE.start_main_old_#valid#1| (store (store (store (store |#valid| |ULTIMATE.start_main_~#t696~0#1.base| 0) |ULTIMATE.start_main_~#t693~0#1.base| 0) |ULTIMATE.start_main_~#t695~0#1.base| 0) |ULTIMATE.start_main_~#t694~0#1.base| 0)) (not (= |ULTIMATE.start_main_~#t696~0#1.base| |ULTIMATE.start_main_~#t695~0#1.base|)) (not (= |ULTIMATE.start_main_~#t695~0#1.base| |ULTIMATE.start_main_~#t694~0#1.base|)) (not (= |ULTIMATE.start_main_~#t695~0#1.base| |ULTIMATE.start_main_~#t693~0#1.base|)) (not (= |ULTIMATE.start_main_~#t694~0#1.base| |ULTIMATE.start_main_~#t693~0#1.base|)) (not (= |ULTIMATE.start_main_~#t696~0#1.base| |ULTIMATE.start_main_~#t694~0#1.base|)))]) [2022-12-13 16:25:42,546 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2022-12-13 16:25:42,547 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-13 16:25:42,547 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-13 16:25:42,547 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-13 16:25:42,626 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([422] L832-->L839: Formula: (let ((.cse4 (not (= (mod v_~y$r_buff1_thd4~0_24 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd4~0_26 256) 0))) (.cse3 (not (= (mod v_~y$w_buff0_used~0_99 256) 0)))) (let ((.cse1 (and .cse5 .cse3)) (.cse2 (and (not (= (mod v_~y$w_buff0_used~0_100 256) 0)) .cse5)) (.cse0 (and (not (= (mod v_~y$w_buff1_used~0_83 256) 0)) .cse4))) (and (= v_~y$w_buff1_used~0_82 (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_83)) (= v_~y$w_buff0_used~0_99 (ite .cse2 0 v_~y$w_buff0_used~0_100)) (= (ite .cse1 0 v_~y$r_buff0_thd4~0_26) v_~y$r_buff0_thd4~0_25) (= (ite (or (and (not (= (mod v_~y$r_buff0_thd4~0_25 256) 0)) .cse3) (and (not (= (mod v_~y$w_buff1_used~0_82 256) 0)) .cse4)) 0 v_~y$r_buff1_thd4~0_24) v_~y$r_buff1_thd4~0_23) (= (ite .cse2 v_~y$w_buff0~0_46 (ite .cse0 v_~y$w_buff1~0_45 v_~y~0_63)) v_~y~0_62)))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_26, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_24, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_100, ~y$w_buff1~0=v_~y$w_buff1~0_45, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_63, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_83} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_25, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_23, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_99, ~y$w_buff1~0=v_~y$w_buff1~0_45, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_62, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_82} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, ~y~0, ~y$w_buff1_used~0][70], [P2Thread1of1ForFork0InUse, 162#true, 110#P1EXITtrue, 191#true, Black: 171#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 65#L839true, 69#P2EXITtrue, 5#L867-1true, Black: 177#(= ~__unbuffered_p3_EAX~0 0), Black: 178#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 175#true, P0Thread1of1ForFork3InUse, P3Thread1of1ForFork2InUse, 126#L756true, P1Thread1of1ForFork1InUse, 188#(and (not (= |ULTIMATE.start_main_~#t696~0#1.base| |ULTIMATE.start_main_~#t693~0#1.base|)) (= |ULTIMATE.start_main_old_#valid#1| (store (store (store (store |#valid| |ULTIMATE.start_main_~#t696~0#1.base| 0) |ULTIMATE.start_main_~#t693~0#1.base| 0) |ULTIMATE.start_main_~#t695~0#1.base| 0) |ULTIMATE.start_main_~#t694~0#1.base| 0)) (not (= |ULTIMATE.start_main_~#t696~0#1.base| |ULTIMATE.start_main_~#t695~0#1.base|)) (not (= |ULTIMATE.start_main_~#t695~0#1.base| |ULTIMATE.start_main_~#t694~0#1.base|)) (not (= |ULTIMATE.start_main_~#t695~0#1.base| |ULTIMATE.start_main_~#t693~0#1.base|)) (not (= |ULTIMATE.start_main_~#t694~0#1.base| |ULTIMATE.start_main_~#t693~0#1.base|)) (not (= |ULTIMATE.start_main_~#t696~0#1.base| |ULTIMATE.start_main_~#t694~0#1.base|)))]) [2022-12-13 16:25:42,626 INFO L383 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2022-12-13 16:25:42,626 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-13 16:25:42,626 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-13 16:25:42,626 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-13 16:25:42,627 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([422] L832-->L839: Formula: (let ((.cse4 (not (= (mod v_~y$r_buff1_thd4~0_24 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd4~0_26 256) 0))) (.cse3 (not (= (mod v_~y$w_buff0_used~0_99 256) 0)))) (let ((.cse1 (and .cse5 .cse3)) (.cse2 (and (not (= (mod v_~y$w_buff0_used~0_100 256) 0)) .cse5)) (.cse0 (and (not (= (mod v_~y$w_buff1_used~0_83 256) 0)) .cse4))) (and (= v_~y$w_buff1_used~0_82 (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_83)) (= v_~y$w_buff0_used~0_99 (ite .cse2 0 v_~y$w_buff0_used~0_100)) (= (ite .cse1 0 v_~y$r_buff0_thd4~0_26) v_~y$r_buff0_thd4~0_25) (= (ite (or (and (not (= (mod v_~y$r_buff0_thd4~0_25 256) 0)) .cse3) (and (not (= (mod v_~y$w_buff1_used~0_82 256) 0)) .cse4)) 0 v_~y$r_buff1_thd4~0_24) v_~y$r_buff1_thd4~0_23) (= (ite .cse2 v_~y$w_buff0~0_46 (ite .cse0 v_~y$w_buff1~0_45 v_~y~0_63)) v_~y~0_62)))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_26, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_24, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_100, ~y$w_buff1~0=v_~y$w_buff1~0_45, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_63, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_83} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_25, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_23, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_99, ~y$w_buff1~0=v_~y$w_buff1~0_45, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_62, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_82} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, ~y~0, ~y$w_buff1_used~0][70], [P2Thread1of1ForFork0InUse, 162#true, 191#true, Black: 171#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 87#L874true, 69#P2EXITtrue, 65#L839true, Black: 177#(= ~__unbuffered_p3_EAX~0 0), Black: 178#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 175#true, 138#L784true, P0Thread1of1ForFork3InUse, P3Thread1of1ForFork2InUse, 126#L756true, P1Thread1of1ForFork1InUse, 188#(and (not (= |ULTIMATE.start_main_~#t696~0#1.base| |ULTIMATE.start_main_~#t693~0#1.base|)) (= |ULTIMATE.start_main_old_#valid#1| (store (store (store (store |#valid| |ULTIMATE.start_main_~#t696~0#1.base| 0) |ULTIMATE.start_main_~#t693~0#1.base| 0) |ULTIMATE.start_main_~#t695~0#1.base| 0) |ULTIMATE.start_main_~#t694~0#1.base| 0)) (not (= |ULTIMATE.start_main_~#t696~0#1.base| |ULTIMATE.start_main_~#t695~0#1.base|)) (not (= |ULTIMATE.start_main_~#t695~0#1.base| |ULTIMATE.start_main_~#t694~0#1.base|)) (not (= |ULTIMATE.start_main_~#t695~0#1.base| |ULTIMATE.start_main_~#t693~0#1.base|)) (not (= |ULTIMATE.start_main_~#t694~0#1.base| |ULTIMATE.start_main_~#t693~0#1.base|)) (not (= |ULTIMATE.start_main_~#t696~0#1.base| |ULTIMATE.start_main_~#t694~0#1.base|)))]) [2022-12-13 16:25:42,628 INFO L383 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2022-12-13 16:25:42,628 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-13 16:25:42,628 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-13 16:25:42,628 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-13 16:25:42,628 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([556] L874-->ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK: Formula: (and (= (mod v_~main$tmp_guard1~0_16 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_19|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_19| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_27|) (= (ite (= (ite (not (and (= 2 v_~__unbuffered_p3_EAX~0_16) (= v_~__unbuffered_p1_EAX~0_22 0) (= v_~z~0_18 2) (= 0 v_~__unbuffered_p3_EBX~0_12) (= v_~__unbuffered_p0_EAX~0_16 0))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_16) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_27| 0)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_16, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_22, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_16, ~z~0=v_~z~0_18, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_12} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_27|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_16, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_19|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_22, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_16, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_16, ~z~0=v_~z~0_18, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_12} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~main$tmp_guard1~0][75], [P2Thread1of1ForFork0InUse, 162#true, 70#ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAKtrue, 191#true, Black: 171#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 136#L832true, 69#P2EXITtrue, Black: 177#(= ~__unbuffered_p3_EAX~0 0), Black: 178#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 175#true, 138#L784true, P0Thread1of1ForFork3InUse, P3Thread1of1ForFork2InUse, 126#L756true, P1Thread1of1ForFork1InUse, 188#(and (not (= |ULTIMATE.start_main_~#t696~0#1.base| |ULTIMATE.start_main_~#t693~0#1.base|)) (= |ULTIMATE.start_main_old_#valid#1| (store (store (store (store |#valid| |ULTIMATE.start_main_~#t696~0#1.base| 0) |ULTIMATE.start_main_~#t693~0#1.base| 0) |ULTIMATE.start_main_~#t695~0#1.base| 0) |ULTIMATE.start_main_~#t694~0#1.base| 0)) (not (= |ULTIMATE.start_main_~#t696~0#1.base| |ULTIMATE.start_main_~#t695~0#1.base|)) (not (= |ULTIMATE.start_main_~#t695~0#1.base| |ULTIMATE.start_main_~#t694~0#1.base|)) (not (= |ULTIMATE.start_main_~#t695~0#1.base| |ULTIMATE.start_main_~#t693~0#1.base|)) (not (= |ULTIMATE.start_main_~#t694~0#1.base| |ULTIMATE.start_main_~#t693~0#1.base|)) (not (= |ULTIMATE.start_main_~#t696~0#1.base| |ULTIMATE.start_main_~#t694~0#1.base|)))]) [2022-12-13 16:25:42,628 INFO L383 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2022-12-13 16:25:42,628 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-13 16:25:42,628 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-13 16:25:42,629 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-13 16:25:42,679 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([422] L832-->L839: Formula: (let ((.cse4 (not (= (mod v_~y$r_buff1_thd4~0_24 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd4~0_26 256) 0))) (.cse3 (not (= (mod v_~y$w_buff0_used~0_99 256) 0)))) (let ((.cse1 (and .cse5 .cse3)) (.cse2 (and (not (= (mod v_~y$w_buff0_used~0_100 256) 0)) .cse5)) (.cse0 (and (not (= (mod v_~y$w_buff1_used~0_83 256) 0)) .cse4))) (and (= v_~y$w_buff1_used~0_82 (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_83)) (= v_~y$w_buff0_used~0_99 (ite .cse2 0 v_~y$w_buff0_used~0_100)) (= (ite .cse1 0 v_~y$r_buff0_thd4~0_26) v_~y$r_buff0_thd4~0_25) (= (ite (or (and (not (= (mod v_~y$r_buff0_thd4~0_25 256) 0)) .cse3) (and (not (= (mod v_~y$w_buff1_used~0_82 256) 0)) .cse4)) 0 v_~y$r_buff1_thd4~0_24) v_~y$r_buff1_thd4~0_23) (= (ite .cse2 v_~y$w_buff0~0_46 (ite .cse0 v_~y$w_buff1~0_45 v_~y~0_63)) v_~y~0_62)))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_26, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_24, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_100, ~y$w_buff1~0=v_~y$w_buff1~0_45, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_63, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_83} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_25, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_23, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_99, ~y$w_buff1~0=v_~y$w_buff1~0_45, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_62, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_82} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, ~y~0, ~y$w_buff1_used~0][70], [P2Thread1of1ForFork0InUse, 162#true, 110#P1EXITtrue, 191#true, 87#L874true, Black: 171#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 69#P2EXITtrue, 65#L839true, Black: 177#(= ~__unbuffered_p3_EAX~0 0), Black: 178#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 175#true, P0Thread1of1ForFork3InUse, P3Thread1of1ForFork2InUse, 126#L756true, P1Thread1of1ForFork1InUse, 188#(and (not (= |ULTIMATE.start_main_~#t696~0#1.base| |ULTIMATE.start_main_~#t693~0#1.base|)) (= |ULTIMATE.start_main_old_#valid#1| (store (store (store (store |#valid| |ULTIMATE.start_main_~#t696~0#1.base| 0) |ULTIMATE.start_main_~#t693~0#1.base| 0) |ULTIMATE.start_main_~#t695~0#1.base| 0) |ULTIMATE.start_main_~#t694~0#1.base| 0)) (not (= |ULTIMATE.start_main_~#t696~0#1.base| |ULTIMATE.start_main_~#t695~0#1.base|)) (not (= |ULTIMATE.start_main_~#t695~0#1.base| |ULTIMATE.start_main_~#t694~0#1.base|)) (not (= |ULTIMATE.start_main_~#t695~0#1.base| |ULTIMATE.start_main_~#t693~0#1.base|)) (not (= |ULTIMATE.start_main_~#t694~0#1.base| |ULTIMATE.start_main_~#t693~0#1.base|)) (not (= |ULTIMATE.start_main_~#t696~0#1.base| |ULTIMATE.start_main_~#t694~0#1.base|)))]) [2022-12-13 16:25:42,679 INFO L383 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2022-12-13 16:25:42,679 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 16:25:42,679 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 16:25:42,679 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 16:25:42,680 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([556] L874-->ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK: Formula: (and (= (mod v_~main$tmp_guard1~0_16 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_19|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_19| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_27|) (= (ite (= (ite (not (and (= 2 v_~__unbuffered_p3_EAX~0_16) (= v_~__unbuffered_p1_EAX~0_22 0) (= v_~z~0_18 2) (= 0 v_~__unbuffered_p3_EBX~0_12) (= v_~__unbuffered_p0_EAX~0_16 0))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_16) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_27| 0)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_16, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_22, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_16, ~z~0=v_~z~0_18, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_12} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_27|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_16, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_19|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_22, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_16, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_16, ~z~0=v_~z~0_18, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_12} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~main$tmp_guard1~0][75], [P2Thread1of1ForFork0InUse, 162#true, 110#P1EXITtrue, 70#ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAKtrue, 191#true, Black: 171#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 69#P2EXITtrue, 136#L832true, Black: 177#(= ~__unbuffered_p3_EAX~0 0), Black: 178#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 175#true, P0Thread1of1ForFork3InUse, P3Thread1of1ForFork2InUse, 126#L756true, 188#(and (not (= |ULTIMATE.start_main_~#t696~0#1.base| |ULTIMATE.start_main_~#t693~0#1.base|)) (= |ULTIMATE.start_main_old_#valid#1| (store (store (store (store |#valid| |ULTIMATE.start_main_~#t696~0#1.base| 0) |ULTIMATE.start_main_~#t693~0#1.base| 0) |ULTIMATE.start_main_~#t695~0#1.base| 0) |ULTIMATE.start_main_~#t694~0#1.base| 0)) (not (= |ULTIMATE.start_main_~#t696~0#1.base| |ULTIMATE.start_main_~#t695~0#1.base|)) (not (= |ULTIMATE.start_main_~#t695~0#1.base| |ULTIMATE.start_main_~#t694~0#1.base|)) (not (= |ULTIMATE.start_main_~#t695~0#1.base| |ULTIMATE.start_main_~#t693~0#1.base|)) (not (= |ULTIMATE.start_main_~#t694~0#1.base| |ULTIMATE.start_main_~#t693~0#1.base|)) (not (= |ULTIMATE.start_main_~#t696~0#1.base| |ULTIMATE.start_main_~#t694~0#1.base|))), P1Thread1of1ForFork1InUse]) [2022-12-13 16:25:42,680 INFO L383 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2022-12-13 16:25:42,680 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 16:25:42,680 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 16:25:42,680 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 16:25:42,712 INFO L130 PetriNetUnfolder]: 5047/7553 cut-off events. [2022-12-13 16:25:42,713 INFO L131 PetriNetUnfolder]: For 2646/2775 co-relation queries the response was YES. [2022-12-13 16:25:42,723 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17832 conditions, 7553 events. 5047/7553 cut-off events. For 2646/2775 co-relation queries the response was YES. Maximal size of possible extension queue 519. Compared 45105 event pairs, 929 based on Foata normal form. 594/7862 useless extension candidates. Maximal degree in co-relation 17824. Up to 4925 conditions per place. [2022-12-13 16:25:42,742 INFO L137 encePairwiseOnDemand]: 282/289 looper letters, 64 selfloop transitions, 10 changer transitions 0/84 dead transitions. [2022-12-13 16:25:42,743 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 84 transitions, 459 flow [2022-12-13 16:25:42,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 16:25:42,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 16:25:42,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 709 transitions. [2022-12-13 16:25:42,746 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4906574394463668 [2022-12-13 16:25:42,746 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 709 transitions. [2022-12-13 16:25:42,746 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 709 transitions. [2022-12-13 16:25:42,747 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 16:25:42,747 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 709 transitions. [2022-12-13 16:25:42,749 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 141.8) internal successors, (709), 5 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-12-13 16:25:42,752 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 289.0) internal successors, (1734), 6 states have internal predecessors, (1734), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:25:42,752 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 289.0) internal successors, (1734), 6 states have internal predecessors, (1734), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:25:42,752 INFO L175 Difference]: Start difference. First operand has 50 places, 35 transitions, 153 flow. Second operand 5 states and 709 transitions. [2022-12-13 16:25:42,753 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 84 transitions, 459 flow [2022-12-13 16:25:42,756 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 84 transitions, 447 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-13 16:25:42,758 INFO L231 Difference]: Finished difference. Result has 51 places, 44 transitions, 221 flow [2022-12-13 16:25:42,758 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=289, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=221, PETRI_PLACES=51, PETRI_TRANSITIONS=44} [2022-12-13 16:25:42,758 INFO L288 CegarLoopForPetriNet]: 51 programPoint places, 0 predicate places. [2022-12-13 16:25:42,759 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 44 transitions, 221 flow [2022-12-13 16:25:42,759 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 132.0) internal successors, (528), 4 states have internal predecessors, (528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:25:42,759 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 16:25:42,759 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:25:42,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 16:25:42,760 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-12-13 16:25:42,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:25:42,760 INFO L85 PathProgramCache]: Analyzing trace with hash -44457579, now seen corresponding path program 1 times [2022-12-13 16:25:42,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:25:42,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618055155] [2022-12-13 16:25:42,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:25:42,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:25:42,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:25:42,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:25:42,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:25:42,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618055155] [2022-12-13 16:25:42,960 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1618055155] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:25:42,961 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:25:42,961 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 16:25:42,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546862742] [2022-12-13 16:25:42,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:25:42,961 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 16:25:42,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:25:42,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 16:25:42,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 16:25:42,980 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 289 [2022-12-13 16:25:42,981 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 44 transitions, 221 flow. Second operand has 5 states, 5 states have (on average 131.8) internal successors, (659), 5 states have internal predecessors, (659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:25:42,981 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 16:25:42,981 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 289 [2022-12-13 16:25:42,982 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 16:25:43,753 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([422] L832-->L839: Formula: (let ((.cse4 (not (= (mod v_~y$r_buff1_thd4~0_24 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd4~0_26 256) 0))) (.cse3 (not (= (mod v_~y$w_buff0_used~0_99 256) 0)))) (let ((.cse1 (and .cse5 .cse3)) (.cse2 (and (not (= (mod v_~y$w_buff0_used~0_100 256) 0)) .cse5)) (.cse0 (and (not (= (mod v_~y$w_buff1_used~0_83 256) 0)) .cse4))) (and (= v_~y$w_buff1_used~0_82 (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_83)) (= v_~y$w_buff0_used~0_99 (ite .cse2 0 v_~y$w_buff0_used~0_100)) (= (ite .cse1 0 v_~y$r_buff0_thd4~0_26) v_~y$r_buff0_thd4~0_25) (= (ite (or (and (not (= (mod v_~y$r_buff0_thd4~0_25 256) 0)) .cse3) (and (not (= (mod v_~y$w_buff1_used~0_82 256) 0)) .cse4)) 0 v_~y$r_buff1_thd4~0_24) v_~y$r_buff1_thd4~0_23) (= (ite .cse2 v_~y$w_buff0~0_46 (ite .cse0 v_~y$w_buff1~0_45 v_~y~0_63)) v_~y~0_62)))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_26, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_24, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_100, ~y$w_buff1~0=v_~y$w_buff1~0_45, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_63, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_83} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_25, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_23, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_99, ~y$w_buff1~0=v_~y$w_buff1~0_45, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_62, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_82} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, ~y~0, ~y$w_buff1_used~0][75], [P2Thread1of1ForFork0InUse, 162#true, Black: 194#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 193#(= ~__unbuffered_cnt~0 0), Black: 196#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 191#true, Black: 171#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 209#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 69#P2EXITtrue, 5#L867-1true, 65#L839true, Black: 177#(= ~__unbuffered_p3_EAX~0 0), Black: 178#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 175#true, 138#L784true, P0Thread1of1ForFork3InUse, P3Thread1of1ForFork2InUse, 126#L756true, 188#(and (not (= |ULTIMATE.start_main_~#t696~0#1.base| |ULTIMATE.start_main_~#t693~0#1.base|)) (= |ULTIMATE.start_main_old_#valid#1| (store (store (store (store |#valid| |ULTIMATE.start_main_~#t696~0#1.base| 0) |ULTIMATE.start_main_~#t693~0#1.base| 0) |ULTIMATE.start_main_~#t695~0#1.base| 0) |ULTIMATE.start_main_~#t694~0#1.base| 0)) (not (= |ULTIMATE.start_main_~#t696~0#1.base| |ULTIMATE.start_main_~#t695~0#1.base|)) (not (= |ULTIMATE.start_main_~#t695~0#1.base| |ULTIMATE.start_main_~#t694~0#1.base|)) (not (= |ULTIMATE.start_main_~#t695~0#1.base| |ULTIMATE.start_main_~#t693~0#1.base|)) (not (= |ULTIMATE.start_main_~#t694~0#1.base| |ULTIMATE.start_main_~#t693~0#1.base|)) (not (= |ULTIMATE.start_main_~#t696~0#1.base| |ULTIMATE.start_main_~#t694~0#1.base|))), P1Thread1of1ForFork1InUse]) [2022-12-13 16:25:43,753 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2022-12-13 16:25:43,753 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-13 16:25:43,753 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-13 16:25:43,753 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-13 16:25:43,812 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([422] L832-->L839: Formula: (let ((.cse4 (not (= (mod v_~y$r_buff1_thd4~0_24 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd4~0_26 256) 0))) (.cse3 (not (= (mod v_~y$w_buff0_used~0_99 256) 0)))) (let ((.cse1 (and .cse5 .cse3)) (.cse2 (and (not (= (mod v_~y$w_buff0_used~0_100 256) 0)) .cse5)) (.cse0 (and (not (= (mod v_~y$w_buff1_used~0_83 256) 0)) .cse4))) (and (= v_~y$w_buff1_used~0_82 (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_83)) (= v_~y$w_buff0_used~0_99 (ite .cse2 0 v_~y$w_buff0_used~0_100)) (= (ite .cse1 0 v_~y$r_buff0_thd4~0_26) v_~y$r_buff0_thd4~0_25) (= (ite (or (and (not (= (mod v_~y$r_buff0_thd4~0_25 256) 0)) .cse3) (and (not (= (mod v_~y$w_buff1_used~0_82 256) 0)) .cse4)) 0 v_~y$r_buff1_thd4~0_24) v_~y$r_buff1_thd4~0_23) (= (ite .cse2 v_~y$w_buff0~0_46 (ite .cse0 v_~y$w_buff1~0_45 v_~y~0_63)) v_~y~0_62)))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_26, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_24, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_100, ~y$w_buff1~0=v_~y$w_buff1~0_45, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_63, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_83} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_25, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_23, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_99, ~y$w_buff1~0=v_~y$w_buff1~0_45, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_62, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_82} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, ~y~0, ~y$w_buff1_used~0][103], [P2Thread1of1ForFork0InUse, 205#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), 162#true, Black: 194#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), 110#P1EXITtrue, Black: 193#(= ~__unbuffered_cnt~0 0), Black: 196#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 191#true, Black: 171#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 69#P2EXITtrue, 65#L839true, 5#L867-1true, Black: 177#(= ~__unbuffered_p3_EAX~0 0), Black: 178#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 175#true, P0Thread1of1ForFork3InUse, P3Thread1of1ForFork2InUse, 126#L756true, 188#(and (not (= |ULTIMATE.start_main_~#t696~0#1.base| |ULTIMATE.start_main_~#t693~0#1.base|)) (= |ULTIMATE.start_main_old_#valid#1| (store (store (store (store |#valid| |ULTIMATE.start_main_~#t696~0#1.base| 0) |ULTIMATE.start_main_~#t693~0#1.base| 0) |ULTIMATE.start_main_~#t695~0#1.base| 0) |ULTIMATE.start_main_~#t694~0#1.base| 0)) (not (= |ULTIMATE.start_main_~#t696~0#1.base| |ULTIMATE.start_main_~#t695~0#1.base|)) (not (= |ULTIMATE.start_main_~#t695~0#1.base| |ULTIMATE.start_main_~#t694~0#1.base|)) (not (= |ULTIMATE.start_main_~#t695~0#1.base| |ULTIMATE.start_main_~#t693~0#1.base|)) (not (= |ULTIMATE.start_main_~#t694~0#1.base| |ULTIMATE.start_main_~#t693~0#1.base|)) (not (= |ULTIMATE.start_main_~#t696~0#1.base| |ULTIMATE.start_main_~#t694~0#1.base|))), P1Thread1of1ForFork1InUse]) [2022-12-13 16:25:43,812 INFO L383 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2022-12-13 16:25:43,812 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-13 16:25:43,812 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-13 16:25:43,812 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-13 16:25:43,883 INFO L130 PetriNetUnfolder]: 4011/6223 cut-off events. [2022-12-13 16:25:43,883 INFO L131 PetriNetUnfolder]: For 4644/4719 co-relation queries the response was YES. [2022-12-13 16:25:43,895 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19325 conditions, 6223 events. 4011/6223 cut-off events. For 4644/4719 co-relation queries the response was YES. Maximal size of possible extension queue 418. Compared 38115 event pairs, 409 based on Foata normal form. 416/6446 useless extension candidates. Maximal degree in co-relation 19314. Up to 2171 conditions per place. [2022-12-13 16:25:43,910 INFO L137 encePairwiseOnDemand]: 282/289 looper letters, 87 selfloop transitions, 19 changer transitions 1/117 dead transitions. [2022-12-13 16:25:43,910 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 117 transitions, 723 flow [2022-12-13 16:25:43,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 16:25:43,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 16:25:43,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 994 transitions. [2022-12-13 16:25:43,913 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4913494809688581 [2022-12-13 16:25:43,913 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 994 transitions. [2022-12-13 16:25:43,914 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 994 transitions. [2022-12-13 16:25:43,914 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 16:25:43,914 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 994 transitions. [2022-12-13 16:25:43,917 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 142.0) internal successors, (994), 7 states have internal predecessors, (994), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:25:43,919 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 289.0) internal successors, (2312), 8 states have internal predecessors, (2312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:25:43,920 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 289.0) internal successors, (2312), 8 states have internal predecessors, (2312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:25:43,920 INFO L175 Difference]: Start difference. First operand has 51 places, 44 transitions, 221 flow. Second operand 7 states and 994 transitions. [2022-12-13 16:25:43,920 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 117 transitions, 723 flow [2022-12-13 16:25:43,935 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 117 transitions, 718 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 16:25:43,937 INFO L231 Difference]: Finished difference. Result has 59 places, 53 transitions, 350 flow [2022-12-13 16:25:43,937 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=289, PETRI_DIFFERENCE_MINUEND_FLOW=216, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=350, PETRI_PLACES=59, PETRI_TRANSITIONS=53} [2022-12-13 16:25:43,937 INFO L288 CegarLoopForPetriNet]: 51 programPoint places, 8 predicate places. [2022-12-13 16:25:43,937 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 53 transitions, 350 flow [2022-12-13 16:25:43,938 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 131.8) internal successors, (659), 5 states have internal predecessors, (659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:25:43,938 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 16:25:43,938 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:25:43,938 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 16:25:43,938 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-12-13 16:25:43,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:25:43,939 INFO L85 PathProgramCache]: Analyzing trace with hash 2095044241, now seen corresponding path program 1 times [2022-12-13 16:25:43,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:25:43,939 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133538849] [2022-12-13 16:25:43,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:25:43,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:25:43,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:25:44,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:25:44,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:25:44,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133538849] [2022-12-13 16:25:44,083 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133538849] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:25:44,083 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:25:44,083 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 16:25:44,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655690162] [2022-12-13 16:25:44,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:25:44,084 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 16:25:44,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:25:44,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 16:25:44,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 16:25:44,092 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 289 [2022-12-13 16:25:44,092 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 53 transitions, 350 flow. Second operand has 4 states, 4 states have (on average 135.5) internal successors, (542), 4 states have internal predecessors, (542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:25:44,092 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 16:25:44,093 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 289 [2022-12-13 16:25:44,093 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 16:25:44,985 INFO L130 PetriNetUnfolder]: 5872/9138 cut-off events. [2022-12-13 16:25:44,985 INFO L131 PetriNetUnfolder]: For 19439/19768 co-relation queries the response was YES. [2022-12-13 16:25:45,000 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35281 conditions, 9138 events. 5872/9138 cut-off events. For 19439/19768 co-relation queries the response was YES. Maximal size of possible extension queue 528. Compared 59704 event pairs, 988 based on Foata normal form. 169/8864 useless extension candidates. Maximal degree in co-relation 35267. Up to 4741 conditions per place. [2022-12-13 16:25:45,011 INFO L137 encePairwiseOnDemand]: 286/289 looper letters, 76 selfloop transitions, 3 changer transitions 36/122 dead transitions. [2022-12-13 16:25:45,011 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 122 transitions, 1057 flow [2022-12-13 16:25:45,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 16:25:45,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 16:25:45,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 579 transitions. [2022-12-13 16:25:45,013 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5008650519031141 [2022-12-13 16:25:45,013 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 579 transitions. [2022-12-13 16:25:45,013 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 579 transitions. [2022-12-13 16:25:45,013 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 16:25:45,013 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 579 transitions. [2022-12-13 16:25:45,014 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-12-13 16:25:45,015 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 289.0) internal successors, (1445), 5 states have internal predecessors, (1445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:25:45,015 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 289.0) internal successors, (1445), 5 states have internal predecessors, (1445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:25:45,015 INFO L175 Difference]: Start difference. First operand has 59 places, 53 transitions, 350 flow. Second operand 4 states and 579 transitions. [2022-12-13 16:25:45,015 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 122 transitions, 1057 flow [2022-12-13 16:25:45,225 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 122 transitions, 922 flow, removed 47 selfloop flow, removed 3 redundant places. [2022-12-13 16:25:45,226 INFO L231 Difference]: Finished difference. Result has 61 places, 51 transitions, 301 flow [2022-12-13 16:25:45,226 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=289, PETRI_DIFFERENCE_MINUEND_FLOW=300, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=301, PETRI_PLACES=61, PETRI_TRANSITIONS=51} [2022-12-13 16:25:45,227 INFO L288 CegarLoopForPetriNet]: 51 programPoint places, 10 predicate places. [2022-12-13 16:25:45,227 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 51 transitions, 301 flow [2022-12-13 16:25:45,227 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 135.5) internal successors, (542), 4 states have internal predecessors, (542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:25:45,227 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 16:25:45,227 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:25:45,227 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 16:25:45,227 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-12-13 16:25:45,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:25:45,228 INFO L85 PathProgramCache]: Analyzing trace with hash -1521912260, now seen corresponding path program 1 times [2022-12-13 16:25:45,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:25:45,228 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045470411] [2022-12-13 16:25:45,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:25:45,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:25:45,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:25:45,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:25:45,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:25:45,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045470411] [2022-12-13 16:25:45,361 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2045470411] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:25:45,361 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:25:45,361 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 16:25:45,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144190585] [2022-12-13 16:25:45,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:25:45,362 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 16:25:45,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:25:45,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 16:25:45,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-13 16:25:45,375 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 289 [2022-12-13 16:25:45,376 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 51 transitions, 301 flow. Second operand has 6 states, 6 states have (on average 131.83333333333334) internal successors, (791), 6 states have internal predecessors, (791), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:25:45,376 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 16:25:45,377 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 289 [2022-12-13 16:25:45,377 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 16:25:46,219 INFO L130 PetriNetUnfolder]: 3998/6456 cut-off events. [2022-12-13 16:25:46,219 INFO L131 PetriNetUnfolder]: For 10435/10503 co-relation queries the response was YES. [2022-12-13 16:25:46,231 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21995 conditions, 6456 events. 3998/6456 cut-off events. For 10435/10503 co-relation queries the response was YES. Maximal size of possible extension queue 463. Compared 42654 event pairs, 342 based on Foata normal form. 295/6545 useless extension candidates. Maximal degree in co-relation 21979. Up to 1615 conditions per place. [2022-12-13 16:25:46,241 INFO L137 encePairwiseOnDemand]: 282/289 looper letters, 95 selfloop transitions, 24 changer transitions 13/144 dead transitions. [2022-12-13 16:25:46,241 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 144 transitions, 991 flow [2022-12-13 16:25:46,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 16:25:46,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 16:25:46,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1273 transitions. [2022-12-13 16:25:46,244 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.48942714340638216 [2022-12-13 16:25:46,244 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1273 transitions. [2022-12-13 16:25:46,244 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1273 transitions. [2022-12-13 16:25:46,245 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 16:25:46,245 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1273 transitions. [2022-12-13 16:25:46,246 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 141.44444444444446) internal successors, (1273), 9 states have internal predecessors, (1273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:25:46,248 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 289.0) internal successors, (2890), 10 states have internal predecessors, (2890), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:25:46,248 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 289.0) internal successors, (2890), 10 states have internal predecessors, (2890), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:25:46,248 INFO L175 Difference]: Start difference. First operand has 61 places, 51 transitions, 301 flow. Second operand 9 states and 1273 transitions. [2022-12-13 16:25:46,248 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 144 transitions, 991 flow [2022-12-13 16:25:46,380 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 144 transitions, 983 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 16:25:46,382 INFO L231 Difference]: Finished difference. Result has 71 places, 60 transitions, 469 flow [2022-12-13 16:25:46,382 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=289, PETRI_DIFFERENCE_MINUEND_FLOW=300, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=469, PETRI_PLACES=71, PETRI_TRANSITIONS=60} [2022-12-13 16:25:46,382 INFO L288 CegarLoopForPetriNet]: 51 programPoint places, 20 predicate places. [2022-12-13 16:25:46,382 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 60 transitions, 469 flow [2022-12-13 16:25:46,383 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 131.83333333333334) internal successors, (791), 6 states have internal predecessors, (791), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:25:46,383 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 16:25:46,383 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-12-13 16:25:46,383 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 16:25:46,383 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-12-13 16:25:46,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:25:46,383 INFO L85 PathProgramCache]: Analyzing trace with hash -142816897, now seen corresponding path program 1 times [2022-12-13 16:25:46,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:25:46,384 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383215498] [2022-12-13 16:25:46,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:25:46,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:25:46,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:25:46,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:25:46,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:25:46,641 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383215498] [2022-12-13 16:25:46,641 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383215498] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:25:46,641 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:25:46,641 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 16:25:46,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361616634] [2022-12-13 16:25:46,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:25:46,642 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 16:25:46,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:25:46,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 16:25:46,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-13 16:25:46,665 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 289 [2022-12-13 16:25:46,666 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 60 transitions, 469 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-12-13 16:25:46,666 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 16:25:46,667 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 289 [2022-12-13 16:25:46,667 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 16:25:47,886 INFO L130 PetriNetUnfolder]: 6480/10392 cut-off events. [2022-12-13 16:25:47,886 INFO L131 PetriNetUnfolder]: For 30675/30969 co-relation queries the response was YES. [2022-12-13 16:25:47,910 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41979 conditions, 10392 events. 6480/10392 cut-off events. For 30675/30969 co-relation queries the response was YES. Maximal size of possible extension queue 603. Compared 70416 event pairs, 883 based on Foata normal form. 61/10176 useless extension candidates. Maximal degree in co-relation 41960. Up to 5180 conditions per place. [2022-12-13 16:25:47,921 INFO L137 encePairwiseOnDemand]: 281/289 looper letters, 112 selfloop transitions, 20 changer transitions 57/199 dead transitions. [2022-12-13 16:25:47,921 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 199 transitions, 1766 flow [2022-12-13 16:25:47,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 16:25:47,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 16:25:47,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1246 transitions. [2022-12-13 16:25:47,923 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4790465205690119 [2022-12-13 16:25:47,924 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1246 transitions. [2022-12-13 16:25:47,924 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1246 transitions. [2022-12-13 16:25:47,924 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 16:25:47,924 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1246 transitions. [2022-12-13 16:25:47,925 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 138.44444444444446) internal successors, (1246), 9 states have internal predecessors, (1246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:25:47,927 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 289.0) internal successors, (2890), 10 states have internal predecessors, (2890), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:25:47,928 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 289.0) internal successors, (2890), 10 states have internal predecessors, (2890), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:25:47,928 INFO L175 Difference]: Start difference. First operand has 71 places, 60 transitions, 469 flow. Second operand 9 states and 1246 transitions. [2022-12-13 16:25:47,928 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 199 transitions, 1766 flow [2022-12-13 16:25:48,574 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 199 transitions, 1492 flow, removed 94 selfloop flow, removed 4 redundant places. [2022-12-13 16:25:48,575 INFO L231 Difference]: Finished difference. Result has 82 places, 81 transitions, 582 flow [2022-12-13 16:25:48,576 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=289, PETRI_DIFFERENCE_MINUEND_FLOW=379, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=582, PETRI_PLACES=82, PETRI_TRANSITIONS=81} [2022-12-13 16:25:48,576 INFO L288 CegarLoopForPetriNet]: 51 programPoint places, 31 predicate places. [2022-12-13 16:25:48,576 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 81 transitions, 582 flow [2022-12-13 16:25:48,576 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-12-13 16:25:48,576 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 16:25:48,576 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:25:48,577 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 16:25:48,577 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-12-13 16:25:48,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:25:48,577 INFO L85 PathProgramCache]: Analyzing trace with hash 597997436, now seen corresponding path program 1 times [2022-12-13 16:25:48,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:25:48,577 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482727752] [2022-12-13 16:25:48,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:25:48,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:25:48,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:25:48,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:25:48,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:25:48,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482727752] [2022-12-13 16:25:48,806 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1482727752] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:25:48,806 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:25:48,806 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 16:25:48,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811075395] [2022-12-13 16:25:48,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:25:48,807 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 16:25:48,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:25:48,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 16:25:48,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 16:25:48,818 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 289 [2022-12-13 16:25:48,819 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 81 transitions, 582 flow. Second operand has 5 states, 5 states have (on average 134.0) internal successors, (670), 5 states have internal predecessors, (670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:25:48,819 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 16:25:48,819 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 289 [2022-12-13 16:25:48,819 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 16:25:50,148 INFO L130 PetriNetUnfolder]: 6891/11901 cut-off events. [2022-12-13 16:25:50,149 INFO L131 PetriNetUnfolder]: For 37735/38331 co-relation queries the response was YES. [2022-12-13 16:25:50,183 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50494 conditions, 11901 events. 6891/11901 cut-off events. For 37735/38331 co-relation queries the response was YES. Maximal size of possible extension queue 809. Compared 94247 event pairs, 1200 based on Foata normal form. 155/11527 useless extension candidates. Maximal degree in co-relation 50467. Up to 5595 conditions per place. [2022-12-13 16:25:50,198 INFO L137 encePairwiseOnDemand]: 283/289 looper letters, 102 selfloop transitions, 26 changer transitions 83/224 dead transitions. [2022-12-13 16:25:50,198 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 224 transitions, 1995 flow [2022-12-13 16:25:50,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 16:25:50,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 16:25:50,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 850 transitions. [2022-12-13 16:25:50,201 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.49019607843137253 [2022-12-13 16:25:50,201 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 850 transitions. [2022-12-13 16:25:50,201 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 850 transitions. [2022-12-13 16:25:50,201 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 16:25:50,202 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 850 transitions. [2022-12-13 16:25:50,203 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 141.66666666666666) internal successors, (850), 6 states have internal predecessors, (850), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:25:50,206 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 289.0) internal successors, (2023), 7 states have internal predecessors, (2023), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:25:50,206 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 289.0) internal successors, (2023), 7 states have internal predecessors, (2023), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:25:50,206 INFO L175 Difference]: Start difference. First operand has 82 places, 81 transitions, 582 flow. Second operand 6 states and 850 transitions. [2022-12-13 16:25:50,206 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 224 transitions, 1995 flow [2022-12-13 16:25:50,760 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 224 transitions, 1963 flow, removed 16 selfloop flow, removed 3 redundant places. [2022-12-13 16:25:50,761 INFO L231 Difference]: Finished difference. Result has 84 places, 92 transitions, 780 flow [2022-12-13 16:25:50,761 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=289, PETRI_DIFFERENCE_MINUEND_FLOW=574, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=780, PETRI_PLACES=84, PETRI_TRANSITIONS=92} [2022-12-13 16:25:50,762 INFO L288 CegarLoopForPetriNet]: 51 programPoint places, 33 predicate places. [2022-12-13 16:25:50,762 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 92 transitions, 780 flow [2022-12-13 16:25:50,762 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 134.0) internal successors, (670), 5 states have internal predecessors, (670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:25:50,762 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 16:25:50,762 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:25:50,762 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 16:25:50,762 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-12-13 16:25:50,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:25:50,763 INFO L85 PathProgramCache]: Analyzing trace with hash -614259934, now seen corresponding path program 2 times [2022-12-13 16:25:50,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:25:50,763 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618960106] [2022-12-13 16:25:50,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:25:50,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:25:50,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:25:50,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:25:50,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:25:50,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618960106] [2022-12-13 16:25:50,919 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1618960106] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:25:50,919 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:25:50,919 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 16:25:50,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13677206] [2022-12-13 16:25:50,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:25:50,919 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 16:25:50,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:25:50,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 16:25:50,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 16:25:50,925 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 289 [2022-12-13 16:25:50,926 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 92 transitions, 780 flow. Second operand has 3 states, 3 states have (on average 139.0) internal successors, (417), 3 states have internal predecessors, (417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:25:50,926 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 16:25:50,926 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 289 [2022-12-13 16:25:50,926 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 16:25:52,328 INFO L130 PetriNetUnfolder]: 8147/13932 cut-off events. [2022-12-13 16:25:52,328 INFO L131 PetriNetUnfolder]: For 49088/49673 co-relation queries the response was YES. [2022-12-13 16:25:52,373 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62970 conditions, 13932 events. 8147/13932 cut-off events. For 49088/49673 co-relation queries the response was YES. Maximal size of possible extension queue 951. Compared 109825 event pairs, 1866 based on Foata normal form. 93/13377 useless extension candidates. Maximal degree in co-relation 62942. Up to 8103 conditions per place. [2022-12-13 16:25:52,387 INFO L137 encePairwiseOnDemand]: 286/289 looper letters, 88 selfloop transitions, 5 changer transitions 51/150 dead transitions. [2022-12-13 16:25:52,387 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 150 transitions, 1532 flow [2022-12-13 16:25:52,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 16:25:52,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 16:25:52,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 434 transitions. [2022-12-13 16:25:52,388 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5005767012687428 [2022-12-13 16:25:52,388 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 434 transitions. [2022-12-13 16:25:52,388 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 434 transitions. [2022-12-13 16:25:52,389 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 16:25:52,389 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 434 transitions. [2022-12-13 16:25:52,389 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-12-13 16:25:52,390 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 289.0) internal successors, (1156), 4 states have internal predecessors, (1156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:25:52,390 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 289.0) internal successors, (1156), 4 states have internal predecessors, (1156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:25:52,391 INFO L175 Difference]: Start difference. First operand has 84 places, 92 transitions, 780 flow. Second operand 3 states and 434 transitions. [2022-12-13 16:25:52,391 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 150 transitions, 1532 flow [2022-12-13 16:25:53,011 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 150 transitions, 1526 flow, removed 3 selfloop flow, removed 1 redundant places. [2022-12-13 16:25:53,012 INFO L231 Difference]: Finished difference. Result has 84 places, 73 transitions, 595 flow [2022-12-13 16:25:53,012 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=289, PETRI_DIFFERENCE_MINUEND_FLOW=776, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=595, PETRI_PLACES=84, PETRI_TRANSITIONS=73} [2022-12-13 16:25:53,013 INFO L288 CegarLoopForPetriNet]: 51 programPoint places, 33 predicate places. [2022-12-13 16:25:53,013 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 73 transitions, 595 flow [2022-12-13 16:25:53,013 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 139.0) internal successors, (417), 3 states have internal predecessors, (417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:25:53,013 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 16:25:53,013 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] [2022-12-13 16:25:53,013 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 16:25:53,013 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-12-13 16:25:53,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:25:53,014 INFO L85 PathProgramCache]: Analyzing trace with hash -1763605392, now seen corresponding path program 1 times [2022-12-13 16:25:53,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:25:53,014 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232538589] [2022-12-13 16:25:53,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:25:53,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:25:53,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:25:53,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:25:53,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:25:53,167 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232538589] [2022-12-13 16:25:53,167 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1232538589] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:25:53,167 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:25:53,167 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 16:25:53,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117151057] [2022-12-13 16:25:53,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:25:53,168 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 16:25:53,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:25:53,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 16:25:53,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-13 16:25:53,188 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 289 [2022-12-13 16:25:53,189 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 73 transitions, 595 flow. Second operand has 7 states, 7 states have (on average 131.71428571428572) internal successors, (922), 7 states have internal predecessors, (922), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:25:53,189 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 16:25:53,189 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 289 [2022-12-13 16:25:53,189 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 16:25:53,964 INFO L130 PetriNetUnfolder]: 3431/5919 cut-off events. [2022-12-13 16:25:53,964 INFO L131 PetriNetUnfolder]: For 22053/22412 co-relation queries the response was YES. [2022-12-13 16:25:53,978 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26149 conditions, 5919 events. 3431/5919 cut-off events. For 22053/22412 co-relation queries the response was YES. Maximal size of possible extension queue 435. Compared 42479 event pairs, 274 based on Foata normal form. 275/5962 useless extension candidates. Maximal degree in co-relation 26120. Up to 1740 conditions per place. [2022-12-13 16:25:53,982 INFO L137 encePairwiseOnDemand]: 282/289 looper letters, 48 selfloop transitions, 17 changer transitions 115/184 dead transitions. [2022-12-13 16:25:53,982 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 184 transitions, 1817 flow [2022-12-13 16:25:53,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 16:25:53,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 16:25:53,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1250 transitions. [2022-12-13 16:25:53,984 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4805843906189927 [2022-12-13 16:25:53,984 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1250 transitions. [2022-12-13 16:25:53,984 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1250 transitions. [2022-12-13 16:25:53,984 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 16:25:53,984 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1250 transitions. [2022-12-13 16:25:53,986 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 138.88888888888889) internal successors, (1250), 9 states have internal predecessors, (1250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:25:53,987 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 289.0) internal successors, (2890), 10 states have internal predecessors, (2890), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:25:53,988 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 289.0) internal successors, (2890), 10 states have internal predecessors, (2890), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:25:53,988 INFO L175 Difference]: Start difference. First operand has 84 places, 73 transitions, 595 flow. Second operand 9 states and 1250 transitions. [2022-12-13 16:25:53,988 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 184 transitions, 1817 flow [2022-12-13 16:25:54,145 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 184 transitions, 1766 flow, removed 17 selfloop flow, removed 6 redundant places. [2022-12-13 16:25:54,147 INFO L231 Difference]: Finished difference. Result has 85 places, 46 transitions, 359 flow [2022-12-13 16:25:54,147 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=289, PETRI_DIFFERENCE_MINUEND_FLOW=547, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=359, PETRI_PLACES=85, PETRI_TRANSITIONS=46} [2022-12-13 16:25:54,147 INFO L288 CegarLoopForPetriNet]: 51 programPoint places, 34 predicate places. [2022-12-13 16:25:54,147 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 46 transitions, 359 flow [2022-12-13 16:25:54,147 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 131.71428571428572) internal successors, (922), 7 states have internal predecessors, (922), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:25:54,147 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 16:25:54,148 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] [2022-12-13 16:25:54,148 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-13 16:25:54,148 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-12-13 16:25:54,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:25:54,148 INFO L85 PathProgramCache]: Analyzing trace with hash -467386580, now seen corresponding path program 1 times [2022-12-13 16:25:54,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:25:54,148 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613601050] [2022-12-13 16:25:54,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:25:54,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:25:54,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:25:54,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:25:54,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:25:54,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613601050] [2022-12-13 16:25:54,523 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [613601050] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:25:54,523 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:25:54,523 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 16:25:54,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901094039] [2022-12-13 16:25:54,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:25:54,524 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 16:25:54,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:25:54,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 16:25:54,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-13 16:25:54,553 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 289 [2022-12-13 16:25:54,553 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 46 transitions, 359 flow. Second operand has 7 states, 7 states have (on average 132.14285714285714) internal successors, (925), 7 states have internal predecessors, (925), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:25:54,553 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 16:25:54,553 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 289 [2022-12-13 16:25:54,553 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 16:25:54,754 INFO L130 PetriNetUnfolder]: 315/576 cut-off events. [2022-12-13 16:25:54,754 INFO L131 PetriNetUnfolder]: For 1823/1857 co-relation queries the response was YES. [2022-12-13 16:25:54,755 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2646 conditions, 576 events. 315/576 cut-off events. For 1823/1857 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 2310 event pairs, 47 based on Foata normal form. 14/575 useless extension candidates. Maximal degree in co-relation 2619. Up to 333 conditions per place. [2022-12-13 16:25:54,756 INFO L137 encePairwiseOnDemand]: 283/289 looper letters, 46 selfloop transitions, 4 changer transitions 30/84 dead transitions. [2022-12-13 16:25:54,756 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 84 transitions, 818 flow [2022-12-13 16:25:54,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 16:25:54,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 16:25:54,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 946 transitions. [2022-12-13 16:25:54,758 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.467622343054869 [2022-12-13 16:25:54,758 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 946 transitions. [2022-12-13 16:25:54,758 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 946 transitions. [2022-12-13 16:25:54,758 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 16:25:54,758 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 946 transitions. [2022-12-13 16:25:54,759 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 135.14285714285714) internal successors, (946), 7 states have internal predecessors, (946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:25:54,761 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 289.0) internal successors, (2312), 8 states have internal predecessors, (2312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:25:54,761 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 289.0) internal successors, (2312), 8 states have internal predecessors, (2312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:25:54,761 INFO L175 Difference]: Start difference. First operand has 85 places, 46 transitions, 359 flow. Second operand 7 states and 946 transitions. [2022-12-13 16:25:54,761 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 84 transitions, 818 flow [2022-12-13 16:25:54,765 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 84 transitions, 619 flow, removed 53 selfloop flow, removed 16 redundant places. [2022-12-13 16:25:54,766 INFO L231 Difference]: Finished difference. Result has 69 places, 42 transitions, 238 flow [2022-12-13 16:25:54,766 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=289, PETRI_DIFFERENCE_MINUEND_FLOW=252, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=238, PETRI_PLACES=69, PETRI_TRANSITIONS=42} [2022-12-13 16:25:54,766 INFO L288 CegarLoopForPetriNet]: 51 programPoint places, 18 predicate places. [2022-12-13 16:25:54,767 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 42 transitions, 238 flow [2022-12-13 16:25:54,767 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 132.14285714285714) internal successors, (925), 7 states have internal predecessors, (925), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:25:54,767 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 16:25:54,767 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] [2022-12-13 16:25:54,767 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-13 16:25:54,767 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-12-13 16:25:54,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:25:54,768 INFO L85 PathProgramCache]: Analyzing trace with hash -781344750, now seen corresponding path program 2 times [2022-12-13 16:25:54,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:25:54,768 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122522521] [2022-12-13 16:25:54,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:25:54,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:25:54,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 16:25:54,793 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 16:25:54,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 16:25:54,836 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 16:25:54,836 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 16:25:54,837 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (15 of 16 remaining) [2022-12-13 16:25:54,838 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (14 of 16 remaining) [2022-12-13 16:25:54,839 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2022-12-13 16:25:54,839 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining) [2022-12-13 16:25:54,839 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2022-12-13 16:25:54,839 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2022-12-13 16:25:54,839 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2022-12-13 16:25:54,839 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2022-12-13 16:25:54,839 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2022-12-13 16:25:54,839 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2022-12-13 16:25:54,839 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (5 of 16 remaining) [2022-12-13 16:25:54,840 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 16 remaining) [2022-12-13 16:25:54,840 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 16 remaining) [2022-12-13 16:25:54,840 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 16 remaining) [2022-12-13 16:25:54,840 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 16 remaining) [2022-12-13 16:25:54,840 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2022-12-13 16:25:54,840 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-13 16:25:54,840 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:25:54,845 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 16:25:54,845 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 16:25:54,890 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 04:25:54 BasicIcfg [2022-12-13 16:25:54,890 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 16:25:54,891 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-13 16:25:54,891 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-13 16:25:54,891 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-13 16:25:54,891 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 04:25:30" (3/4) ... [2022-12-13 16:25:54,893 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-12-13 16:25:54,893 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-13 16:25:54,894 INFO L158 Benchmark]: Toolchain (without parser) took 25528.90ms. Allocated memory was 125.8MB in the beginning and 1.8GB in the end (delta: 1.7GB). Free memory was 90.0MB in the beginning and 498.3MB in the end (delta: -408.4MB). Peak memory consumption was 1.3GB. Max. memory is 16.1GB. [2022-12-13 16:25:54,894 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 125.8MB. Free memory is still 97.3MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 16:25:54,894 INFO L158 Benchmark]: CACSL2BoogieTranslator took 434.15ms. Allocated memory is still 125.8MB. Free memory was 90.0MB in the beginning and 62.6MB in the end (delta: 27.4MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2022-12-13 16:25:54,894 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.74ms. Allocated memory is still 125.8MB. Free memory was 62.6MB in the beginning and 59.9MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 16:25:54,894 INFO L158 Benchmark]: Boogie Preprocessor took 29.14ms. Allocated memory is still 125.8MB. Free memory was 59.9MB in the beginning and 58.2MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 16:25:54,895 INFO L158 Benchmark]: RCFGBuilder took 538.23ms. Allocated memory was 125.8MB in the beginning and 163.6MB in the end (delta: 37.7MB). Free memory was 58.2MB in the beginning and 112.6MB in the end (delta: -54.5MB). Peak memory consumption was 22.1MB. Max. memory is 16.1GB. [2022-12-13 16:25:54,895 INFO L158 Benchmark]: TraceAbstraction took 24475.62ms. Allocated memory was 163.6MB in the beginning and 1.8GB in the end (delta: 1.6GB). Free memory was 111.4MB in the beginning and 498.3MB in the end (delta: -386.9MB). Peak memory consumption was 1.3GB. Max. memory is 16.1GB. [2022-12-13 16:25:54,895 INFO L158 Benchmark]: Witness Printer took 2.72ms. Allocated memory is still 1.8GB. Free memory is still 498.3MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 16:25:54,897 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 125.8MB. Free memory is still 97.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 434.15ms. Allocated memory is still 125.8MB. Free memory was 90.0MB in the beginning and 62.6MB in the end (delta: 27.4MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.74ms. Allocated memory is still 125.8MB. Free memory was 62.6MB in the beginning and 59.9MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 29.14ms. Allocated memory is still 125.8MB. Free memory was 59.9MB in the beginning and 58.2MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 538.23ms. Allocated memory was 125.8MB in the beginning and 163.6MB in the end (delta: 37.7MB). Free memory was 58.2MB in the beginning and 112.6MB in the end (delta: -54.5MB). Peak memory consumption was 22.1MB. Max. memory is 16.1GB. * TraceAbstraction took 24475.62ms. Allocated memory was 163.6MB in the beginning and 1.8GB in the end (delta: 1.6GB). Free memory was 111.4MB in the beginning and 498.3MB in the end (delta: -386.9MB). Peak memory consumption was 1.3GB. Max. memory is 16.1GB. * Witness Printer took 2.72ms. Allocated memory is still 1.8GB. Free memory is still 498.3MB. 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: 3.4s, 155 PlacesBefore, 51 PlacesAfterwards, 144 TransitionsBefore, 39 TransitionsAfterwards, 3396 CoEnabledTransitionPairs, 7 FixpointIterations, 51 TrivialSequentialCompositions, 81 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 1 ChoiceCompositions, 141 TotalNumberOfCompositions, 8809 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4029, independent: 3814, independent conditional: 0, independent unconditional: 3814, dependent: 215, dependent conditional: 0, dependent unconditional: 215, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1798, independent: 1761, independent conditional: 0, independent unconditional: 1761, dependent: 37, dependent conditional: 0, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 4029, independent: 2053, independent conditional: 0, independent unconditional: 2053, dependent: 178, dependent conditional: 0, dependent unconditional: 178, unknown: 1798, unknown conditional: 0, unknown unconditional: 1798] , Statistics on independence cache: Total cache size (in pairs): 161, Positive cache size: 143, Positive conditional cache size: 0, Positive unconditional cache size: 143, Negative cache size: 18, Negative conditional cache size: 0, Negative unconditional cache size: 18, 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_p0_EAX = 0; [L714] 0 int __unbuffered_p1_EAX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int __unbuffered_p3_EBX = 0; [L720] 0 int a = 0; [L721] 0 _Bool main$tmp_guard0; [L722] 0 _Bool main$tmp_guard1; [L724] 0 int x = 0; [L726] 0 int y = 0; [L727] 0 _Bool y$flush_delayed; [L728] 0 int y$mem_tmp; [L729] 0 _Bool y$r_buff0_thd0; [L730] 0 _Bool y$r_buff0_thd1; [L731] 0 _Bool y$r_buff0_thd2; [L732] 0 _Bool y$r_buff0_thd3; [L733] 0 _Bool y$r_buff0_thd4; [L734] 0 _Bool y$r_buff1_thd0; [L735] 0 _Bool y$r_buff1_thd1; [L736] 0 _Bool y$r_buff1_thd2; [L737] 0 _Bool y$r_buff1_thd3; [L738] 0 _Bool y$r_buff1_thd4; [L739] 0 _Bool y$read_delayed; [L740] 0 int *y$read_delayed_var; [L741] 0 int y$w_buff0; [L742] 0 _Bool y$w_buff0_used; [L743] 0 int y$w_buff1; [L744] 0 _Bool y$w_buff1_used; [L746] 0 int z = 0; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice2; [L856] 0 pthread_t t693; [L857] FCALL, FORK 0 pthread_create(&t693, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t693, ((void *)0), P0, ((void *)0))=-2, t693={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L858] 0 pthread_t t694; [L859] FCALL, FORK 0 pthread_create(&t694, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t694, ((void *)0), P1, ((void *)0))=-1, t693={5:0}, t694={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L860] 0 pthread_t t695; [L861] FCALL, FORK 0 pthread_create(&t695, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t695, ((void *)0), P2, ((void *)0))=0, t693={5:0}, t694={6:0}, t695={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L862] 0 pthread_t t696; [L863] FCALL, FORK 0 pthread_create(&t696, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t696, ((void *)0), P3, ((void *)0))=1, t693={5:0}, t694={6:0}, t695={7:0}, t696={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L795] 3 y$w_buff1 = y$w_buff0 [L796] 3 y$w_buff0 = 1 [L797] 3 y$w_buff1_used = y$w_buff0_used [L798] 3 y$w_buff0_used = (_Bool)1 [L799] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L799] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L800] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L801] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L802] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L803] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L804] 3 y$r_buff1_thd4 = y$r_buff0_thd4 [L805] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L808] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L825] 4 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L828] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L831] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L752] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, 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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L755] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, 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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L767] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, 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=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L770] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L771] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L772] 2 y$flush_delayed = weak$$choice2 [L773] 2 y$mem_tmp = y [L774] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L775] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L776] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L777] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L778] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L779] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L780] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L781] 2 __unbuffered_p1_EAX = y [L782] 2 y = y$flush_delayed ? y$mem_tmp : y [L783] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, 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=255, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L834] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L835] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L836] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L837] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L838] 4 y$r_buff1_thd4 = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, 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=255, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L811] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L812] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L813] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L814] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L815] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, 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=255, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L818] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L820] 3 return 0; [L760] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L762] 1 return 0; [L788] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L790] 2 return 0; [L841] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L843] 4 return 0; [L865] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L867] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L867] RET 0 assume_abort_if_not(main$tmp_guard0) [L869] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L870] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L871] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L872] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L873] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, 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, t693={5:0}, t694={6:0}, t695={7:0}, t696={3:0}, weak$$choice0=49, weak$$choice2=255, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L876] 0 main$tmp_guard1 = !(z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 2 && __unbuffered_p3_EBX == 0) [L878] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] - UnprovableResult [Line: 18]: Unable to prove that 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: 854]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 857]: 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. - UnprovableResult [Line: 859]: 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: 861]: 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, 183 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: 24.3s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 17.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 826 SdHoareTripleChecker+Valid, 2.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 681 mSDsluCounter, 188 SdHoareTripleChecker+Invalid, 1.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 149 mSDsCounter, 88 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2331 IncrementalHoareTripleChecker+Invalid, 2419 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 88 mSolverCounterUnsat, 39 mSDtfsCounter, 2331 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 62 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=780occurred in iteration=11, InterpolantAutomatonStates: 78, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 255 NumberOfCodeBlocks, 255 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 215 ConstructedInterpolants, 0 QuantifiedInterpolants, 1643 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-12-13 16:25:54,912 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd5b8763-06ab-4261-aa22-c5aed923bf3a/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd5b8763-06ab-4261-aa22-c5aed923bf3a/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd5b8763-06ab-4261-aa22-c5aed923bf3a/bin/uautomizer-uyxdKDjOR8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd5b8763-06ab-4261-aa22-c5aed923bf3a/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd5b8763-06ab-4261-aa22-c5aed923bf3a/bin/uautomizer-uyxdKDjOR8/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix026_pso.opt_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd5b8763-06ab-4261-aa22-c5aed923bf3a/bin/uautomizer-uyxdKDjOR8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd5b8763-06ab-4261-aa22-c5aed923bf3a/bin/uautomizer-uyxdKDjOR8 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a0c922061e4dc1feb6389a43fa3f654e69e326084cac4d5446a529710663ff29 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-2329fc7 [2022-12-13 16:25:56,607 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 16:25:56,608 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 16:25:56,621 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 16:25:56,621 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 16:25:56,622 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 16:25:56,622 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 16:25:56,623 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 16:25:56,624 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 16:25:56,625 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 16:25:56,626 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 16:25:56,627 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 16:25:56,627 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 16:25:56,627 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 16:25:56,628 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 16:25:56,629 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 16:25:56,629 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 16:25:56,630 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 16:25:56,631 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 16:25:56,632 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 16:25:56,633 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 16:25:56,635 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 16:25:56,636 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 16:25:56,638 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 16:25:56,644 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 16:25:56,644 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 16:25:56,645 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 16:25:56,645 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 16:25:56,645 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 16:25:56,646 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 16:25:56,646 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 16:25:56,647 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 16:25:56,647 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 16:25:56,648 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 16:25:56,657 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 16:25:56,657 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 16:25:56,658 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 16:25:56,658 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 16:25:56,659 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 16:25:56,659 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 16:25:56,660 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 16:25:56,661 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd5b8763-06ab-4261-aa22-c5aed923bf3a/bin/uautomizer-uyxdKDjOR8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-12-13 16:25:56,677 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 16:25:56,677 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 16:25:56,677 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 16:25:56,677 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 16:25:56,678 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 16:25:56,678 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 16:25:56,678 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 16:25:56,679 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 16:25:56,679 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 16:25:56,679 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 16:25:56,679 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 16:25:56,679 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-13 16:25:56,680 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 16:25:56,680 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 16:25:56,680 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 16:25:56,680 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-12-13 16:25:56,680 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-12-13 16:25:56,680 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-12-13 16:25:56,681 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 16:25:56,681 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-12-13 16:25:56,681 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-12-13 16:25:56,681 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-12-13 16:25:56,681 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 16:25:56,681 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 16:25:56,681 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 16:25:56,682 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 16:25:56,682 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 16:25:56,682 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 16:25:56,682 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 16:25:56,682 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 16:25:56,682 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-12-13 16:25:56,683 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-12-13 16:25:56,683 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 16:25:56,683 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 16:25:56,683 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 16:25:56,683 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2022-12-13 16:25:56,683 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 16:25:56,684 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_bd5b8763-06ab-4261-aa22-c5aed923bf3a/bin/uautomizer-uyxdKDjOR8/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd5b8763-06ab-4261-aa22-c5aed923bf3a/bin/uautomizer-uyxdKDjOR8 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a0c922061e4dc1feb6389a43fa3f654e69e326084cac4d5446a529710663ff29 [2022-12-13 16:25:56,888 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 16:25:56,904 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 16:25:56,906 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 16:25:56,907 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 16:25:56,907 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 16:25:56,908 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd5b8763-06ab-4261-aa22-c5aed923bf3a/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/pthread-wmm/mix026_pso.opt_rmo.opt.i [2022-12-13 16:25:59,534 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 16:25:59,733 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 16:25:59,734 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd5b8763-06ab-4261-aa22-c5aed923bf3a/sv-benchmarks/c/pthread-wmm/mix026_pso.opt_rmo.opt.i [2022-12-13 16:25:59,743 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd5b8763-06ab-4261-aa22-c5aed923bf3a/bin/uautomizer-uyxdKDjOR8/data/49aa78f6a/a802ef385d6c48a188c6ee895fb3d6f6/FLAG615d914e4 [2022-12-13 16:25:59,755 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd5b8763-06ab-4261-aa22-c5aed923bf3a/bin/uautomizer-uyxdKDjOR8/data/49aa78f6a/a802ef385d6c48a188c6ee895fb3d6f6 [2022-12-13 16:25:59,757 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 16:25:59,758 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 16:25:59,759 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 16:25:59,760 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 16:25:59,762 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 16:25:59,763 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 04:25:59" (1/1) ... [2022-12-13 16:25:59,764 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1469c7ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:25:59, skipping insertion in model container [2022-12-13 16:25:59,764 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 04:25:59" (1/1) ... [2022-12-13 16:25:59,770 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 16:25:59,807 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 16:25:59,941 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_bd5b8763-06ab-4261-aa22-c5aed923bf3a/sv-benchmarks/c/pthread-wmm/mix026_pso.opt_rmo.opt.i[956,969] [2022-12-13 16:26:00,078 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:26:00,078 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:26:00,079 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:26:00,079 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:26:00,079 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:26:00,079 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:26:00,079 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:26:00,080 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:26:00,080 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:26:00,081 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:26:00,081 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:26:00,089 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:26:00,089 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:26:00,090 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:26:00,090 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:26:00,090 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:26:00,091 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:26:00,093 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:26:00,093 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:26:00,094 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:26:00,094 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:26:00,097 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:26:00,097 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:26:00,097 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:26:00,098 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:26:00,099 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:26:00,099 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:26:00,099 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:26:00,100 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:26:00,100 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:26:00,100 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:26:00,103 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:26:00,103 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:26:00,103 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:26:00,111 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:26:00,111 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:26:00,112 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:26:00,114 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:26:00,114 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:26:00,115 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:26:00,116 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 16:26:00,130 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 16:26:00,139 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_bd5b8763-06ab-4261-aa22-c5aed923bf3a/sv-benchmarks/c/pthread-wmm/mix026_pso.opt_rmo.opt.i[956,969] [2022-12-13 16:26:00,164 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:26:00,164 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:26:00,165 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:26:00,165 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:26:00,165 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:26:00,166 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:26:00,166 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:26:00,166 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:26:00,167 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:26:00,167 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:26:00,167 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:26:00,172 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:26:00,172 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:26:00,173 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:26:00,173 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:26:00,173 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:26:00,174 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:26:00,175 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:26:00,175 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:26:00,175 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:26:00,176 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:26:00,177 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:26:00,178 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:26:00,178 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:26:00,178 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:26:00,179 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:26:00,179 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:26:00,179 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:26:00,179 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:26:00,180 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:26:00,180 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:26:00,181 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:26:00,182 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:26:00,182 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:26:00,185 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:26:00,186 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:26:00,186 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:26:00,188 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:26:00,188 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:26:00,189 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:26:00,190 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 16:26:00,233 INFO L208 MainTranslator]: Completed translation [2022-12-13 16:26:00,233 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:26:00 WrapperNode [2022-12-13 16:26:00,233 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 16:26:00,234 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 16:26:00,234 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 16:26:00,234 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 16:26:00,240 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:26:00" (1/1) ... [2022-12-13 16:26:00,264 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:26:00" (1/1) ... [2022-12-13 16:26:00,280 INFO L138 Inliner]: procedures = 180, calls = 69, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 146 [2022-12-13 16:26:00,280 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 16:26:00,280 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 16:26:00,280 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 16:26:00,280 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 16:26:00,287 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:26:00" (1/1) ... [2022-12-13 16:26:00,287 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:26:00" (1/1) ... [2022-12-13 16:26:00,290 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:26:00" (1/1) ... [2022-12-13 16:26:00,290 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:26:00" (1/1) ... [2022-12-13 16:26:00,296 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:26:00" (1/1) ... [2022-12-13 16:26:00,297 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:26:00" (1/1) ... [2022-12-13 16:26:00,299 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:26:00" (1/1) ... [2022-12-13 16:26:00,300 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:26:00" (1/1) ... [2022-12-13 16:26:00,302 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 16:26:00,303 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 16:26:00,303 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 16:26:00,303 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 16:26:00,303 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:26:00" (1/1) ... [2022-12-13 16:26:00,308 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 16:26:00,317 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd5b8763-06ab-4261-aa22-c5aed923bf3a/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 16:26:00,326 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd5b8763-06ab-4261-aa22-c5aed923bf3a/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 16:26:00,329 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd5b8763-06ab-4261-aa22-c5aed923bf3a/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 16:26:00,357 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 16:26:00,357 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 16:26:00,357 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 16:26:00,357 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 16:26:00,357 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-12-13 16:26:00,357 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-12-13 16:26:00,357 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 16:26:00,357 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 16:26:00,357 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 16:26:00,357 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 16:26:00,358 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-13 16:26:00,358 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-13 16:26:00,358 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-12-13 16:26:00,358 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-12-13 16:26:00,358 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 16:26:00,358 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 16:26:00,358 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 16:26:00,359 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-12-13 16:26:00,472 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 16:26:00,474 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 16:26:00,802 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 16:26:00,895 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 16:26:00,896 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 16:26:00,898 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 04:26:00 BoogieIcfgContainer [2022-12-13 16:26:00,898 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 16:26:00,901 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 16:26:00,901 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 16:26:00,904 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 16:26:00,904 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 04:25:59" (1/3) ... [2022-12-13 16:26:00,905 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ac6262a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 04:26:00, skipping insertion in model container [2022-12-13 16:26:00,905 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:26:00" (2/3) ... [2022-12-13 16:26:00,905 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ac6262a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 04:26:00, skipping insertion in model container [2022-12-13 16:26:00,905 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 04:26:00" (3/3) ... [2022-12-13 16:26:00,907 INFO L112 eAbstractionObserver]: Analyzing ICFG mix026_pso.opt_rmo.opt.i [2022-12-13 16:26:00,921 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 16:26:00,921 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2022-12-13 16:26:00,921 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 16:26:00,978 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 16:26:01,008 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 160 places, 149 transitions, 318 flow [2022-12-13 16:26:01,055 INFO L130 PetriNetUnfolder]: 2/145 cut-off events. [2022-12-13 16:26:01,055 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 16:26:01,059 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 99 event pairs, 0 based on Foata normal form. 0/132 useless extension candidates. Maximal degree in co-relation 99. Up to 2 conditions per place. [2022-12-13 16:26:01,059 INFO L82 GeneralOperation]: Start removeDead. Operand has 160 places, 149 transitions, 318 flow [2022-12-13 16:26:01,063 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 156 places, 145 transitions, 302 flow [2022-12-13 16:26:01,065 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-12-13 16:26:01,073 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 156 places, 145 transitions, 302 flow [2022-12-13 16:26:01,075 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 156 places, 145 transitions, 302 flow [2022-12-13 16:26:01,075 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 156 places, 145 transitions, 302 flow [2022-12-13 16:26:01,097 INFO L130 PetriNetUnfolder]: 2/145 cut-off events. [2022-12-13 16:26:01,097 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 16:26:01,098 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 100 event pairs, 0 based on Foata normal form. 0/132 useless extension candidates. Maximal degree in co-relation 99. Up to 2 conditions per place. [2022-12-13 16:26:01,099 INFO L119 LiptonReduction]: Number of co-enabled transitions 3396 [2022-12-13 16:26:07,933 INFO L134 LiptonReduction]: Checked pairs total: 8807 [2022-12-13 16:26:07,933 INFO L136 LiptonReduction]: Total number of compositions: 142 [2022-12-13 16:26:07,947 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 16:26:07,952 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;@753a9a90, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 16:26:07,952 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2022-12-13 16:26:07,954 INFO L130 PetriNetUnfolder]: 0/1 cut-off events. [2022-12-13 16:26:07,955 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 16:26:07,955 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 16:26:07,955 INFO L209 CegarLoopForPetriNet]: trace histogram [1] [2022-12-13 16:26:07,956 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-12-13 16:26:07,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:26:07,960 INFO L85 PathProgramCache]: Analyzing trace with hash 607, now seen corresponding path program 1 times [2022-12-13 16:26:07,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 16:26:07,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1327331086] [2022-12-13 16:26:07,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:26:07,968 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 16:26:07,968 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd5b8763-06ab-4261-aa22-c5aed923bf3a/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 16:26:07,969 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd5b8763-06ab-4261-aa22-c5aed923bf3a/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 16:26:07,997 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd5b8763-06ab-4261-aa22-c5aed923bf3a/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-12-13 16:26:08,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:26:08,044 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2022-12-13 16:26:08,046 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:26:08,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:26:08,049 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 16:26:08,050 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 16:26:08,050 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1327331086] [2022-12-13 16:26:08,050 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1327331086] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:26:08,050 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:26:08,050 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-12-13 16:26:08,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474609506] [2022-12-13 16:26:08,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:26:08,057 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-13 16:26:08,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 16:26:08,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-13 16:26:08,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-13 16:26:08,075 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 291 [2022-12-13 16:26:08,077 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 39 transitions, 90 flow. Second operand has 2 states, 2 states have (on average 136.5) internal successors, (273), 2 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:26:08,077 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 16:26:08,077 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 291 [2022-12-13 16:26:08,078 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 16:26:08,967 INFO L130 PetriNetUnfolder]: 5049/7086 cut-off events. [2022-12-13 16:26:08,967 INFO L131 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2022-12-13 16:26:08,979 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14124 conditions, 7086 events. 5049/7086 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 386. Compared 37285 event pairs, 5049 based on Foata normal form. 0/6053 useless extension candidates. Maximal degree in co-relation 14112. Up to 6881 conditions per place. [2022-12-13 16:26:09,000 INFO L137 encePairwiseOnDemand]: 282/291 looper letters, 26 selfloop transitions, 0 changer transitions 0/30 dead transitions. [2022-12-13 16:26:09,001 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 30 transitions, 124 flow [2022-12-13 16:26:09,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 16:26:09,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-12-13 16:26:09,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 307 transitions. [2022-12-13 16:26:09,011 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5274914089347079 [2022-12-13 16:26:09,011 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 307 transitions. [2022-12-13 16:26:09,011 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 307 transitions. [2022-12-13 16:26:09,013 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 16:26:09,014 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 307 transitions. [2022-12-13 16:26:09,016 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 153.5) internal successors, (307), 2 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:26:09,020 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 291.0) internal successors, (873), 3 states have internal predecessors, (873), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:26:09,021 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 291.0) internal successors, (873), 3 states have internal predecessors, (873), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:26:09,022 INFO L175 Difference]: Start difference. First operand has 51 places, 39 transitions, 90 flow. Second operand 2 states and 307 transitions. [2022-12-13 16:26:09,023 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 30 transitions, 124 flow [2022-12-13 16:26:09,027 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 30 transitions, 120 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-13 16:26:09,028 INFO L231 Difference]: Finished difference. Result has 40 places, 30 transitions, 68 flow [2022-12-13 16:26:09,029 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=291, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=68, PETRI_PLACES=40, PETRI_TRANSITIONS=30} [2022-12-13 16:26:09,031 INFO L288 CegarLoopForPetriNet]: 51 programPoint places, -11 predicate places. [2022-12-13 16:26:09,032 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 30 transitions, 68 flow [2022-12-13 16:26:09,032 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 136.5) internal successors, (273), 2 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:26:09,032 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 16:26:09,032 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:26:09,043 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd5b8763-06ab-4261-aa22-c5aed923bf3a/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-12-13 16:26:09,233 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd5b8763-06ab-4261-aa22-c5aed923bf3a/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 16:26:09,233 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P2Err0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-12-13 16:26:09,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:26:09,234 INFO L85 PathProgramCache]: Analyzing trace with hash 1037180108, now seen corresponding path program 1 times [2022-12-13 16:26:09,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 16:26:09,234 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1502651317] [2022-12-13 16:26:09,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:26:09,234 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 16:26:09,235 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd5b8763-06ab-4261-aa22-c5aed923bf3a/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 16:26:09,236 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd5b8763-06ab-4261-aa22-c5aed923bf3a/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 16:26:09,236 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd5b8763-06ab-4261-aa22-c5aed923bf3a/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-12-13 16:26:09,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:26:09,311 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-13 16:26:09,312 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:26:09,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:26:09,337 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 16:26:09,337 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 16:26:09,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1502651317] [2022-12-13 16:26:09,337 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1502651317] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:26:09,337 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:26:09,338 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 16:26:09,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880497607] [2022-12-13 16:26:09,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:26:09,339 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 16:26:09,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 16:26:09,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 16:26:09,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 16:26:09,344 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 291 [2022-12-13 16:26:09,345 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 30 transitions, 68 flow. Second operand has 3 states, 3 states have (on average 137.33333333333334) internal successors, (412), 3 states have internal predecessors, (412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:26:09,345 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 16:26:09,345 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 291 [2022-12-13 16:26:09,345 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 16:26:09,972 INFO L130 PetriNetUnfolder]: 3975/5856 cut-off events. [2022-12-13 16:26:09,973 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 16:26:09,983 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11433 conditions, 5856 events. 3975/5856 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 335. Compared 33729 event pairs, 753 based on Foata normal form. 0/5423 useless extension candidates. Maximal degree in co-relation 11430. Up to 4303 conditions per place. [2022-12-13 16:26:10,001 INFO L137 encePairwiseOnDemand]: 288/291 looper letters, 37 selfloop transitions, 2 changer transitions 2/45 dead transitions. [2022-12-13 16:26:10,002 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 45 transitions, 182 flow [2022-12-13 16:26:10,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 16:26:10,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 16:26:10,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 447 transitions. [2022-12-13 16:26:10,006 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5120274914089347 [2022-12-13 16:26:10,006 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 447 transitions. [2022-12-13 16:26:10,006 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 447 transitions. [2022-12-13 16:26:10,006 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 16:26:10,007 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 447 transitions. [2022-12-13 16:26:10,008 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 149.0) internal successors, (447), 3 states have internal predecessors, (447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:26:10,011 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 291.0) internal successors, (1164), 4 states have internal predecessors, (1164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:26:10,012 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 291.0) internal successors, (1164), 4 states have internal predecessors, (1164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:26:10,012 INFO L175 Difference]: Start difference. First operand has 40 places, 30 transitions, 68 flow. Second operand 3 states and 447 transitions. [2022-12-13 16:26:10,012 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 45 transitions, 182 flow [2022-12-13 16:26:10,013 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 45 transitions, 182 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-13 16:26:10,014 INFO L231 Difference]: Finished difference. Result has 41 places, 28 transitions, 68 flow [2022-12-13 16:26:10,014 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=291, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=68, PETRI_PLACES=41, PETRI_TRANSITIONS=28} [2022-12-13 16:26:10,015 INFO L288 CegarLoopForPetriNet]: 51 programPoint places, -10 predicate places. [2022-12-13 16:26:10,015 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 28 transitions, 68 flow [2022-12-13 16:26:10,015 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 137.33333333333334) internal successors, (412), 3 states have internal predecessors, (412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:26:10,015 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 16:26:10,015 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:26:10,023 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd5b8763-06ab-4261-aa22-c5aed923bf3a/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2022-12-13 16:26:10,216 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd5b8763-06ab-4261-aa22-c5aed923bf3a/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 16:26:10,216 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-12-13 16:26:10,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:26:10,217 INFO L85 PathProgramCache]: Analyzing trace with hash -1623709153, now seen corresponding path program 1 times [2022-12-13 16:26:10,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 16:26:10,217 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2067920543] [2022-12-13 16:26:10,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:26:10,218 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 16:26:10,218 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd5b8763-06ab-4261-aa22-c5aed923bf3a/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 16:26:10,219 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd5b8763-06ab-4261-aa22-c5aed923bf3a/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 16:26:10,220 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd5b8763-06ab-4261-aa22-c5aed923bf3a/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-12-13 16:26:10,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:26:10,288 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-13 16:26:10,289 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:26:10,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:26:10,325 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 16:26:10,325 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 16:26:10,325 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2067920543] [2022-12-13 16:26:10,325 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2067920543] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:26:10,325 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:26:10,325 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 16:26:10,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432081859] [2022-12-13 16:26:10,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:26:10,326 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 16:26:10,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 16:26:10,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 16:26:10,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 16:26:10,351 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 291 [2022-12-13 16:26:10,352 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 28 transitions, 68 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-12-13 16:26:10,352 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 16:26:10,352 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 291 [2022-12-13 16:26:10,352 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 16:26:10,806 INFO L130 PetriNetUnfolder]: 2757/4002 cut-off events. [2022-12-13 16:26:10,806 INFO L131 PetriNetUnfolder]: For 264/264 co-relation queries the response was YES. [2022-12-13 16:26:10,810 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8363 conditions, 4002 events. 2757/4002 cut-off events. For 264/264 co-relation queries the response was YES. Maximal size of possible extension queue 253. Compared 20763 event pairs, 542 based on Foata normal form. 192/4026 useless extension candidates. Maximal degree in co-relation 8359. Up to 3074 conditions per place. [2022-12-13 16:26:10,819 INFO L137 encePairwiseOnDemand]: 284/291 looper letters, 36 selfloop transitions, 5 changer transitions 23/68 dead transitions. [2022-12-13 16:26:10,819 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 68 transitions, 288 flow [2022-12-13 16:26:10,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 16:26:10,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 16:26:10,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 716 transitions. [2022-12-13 16:26:10,822 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.49209621993127145 [2022-12-13 16:26:10,822 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 716 transitions. [2022-12-13 16:26:10,822 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 716 transitions. [2022-12-13 16:26:10,822 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 16:26:10,822 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 716 transitions. [2022-12-13 16:26:10,823 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 143.2) internal successors, (716), 5 states have internal predecessors, (716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:26:10,826 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 291.0) internal successors, (1746), 6 states have internal predecessors, (1746), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:26:10,826 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 291.0) internal successors, (1746), 6 states have internal predecessors, (1746), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:26:10,827 INFO L175 Difference]: Start difference. First operand has 41 places, 28 transitions, 68 flow. Second operand 5 states and 716 transitions. [2022-12-13 16:26:10,827 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 68 transitions, 288 flow [2022-12-13 16:26:10,827 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 68 transitions, 278 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 16:26:10,828 INFO L231 Difference]: Finished difference. Result has 45 places, 32 transitions, 109 flow [2022-12-13 16:26:10,828 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=291, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=109, PETRI_PLACES=45, PETRI_TRANSITIONS=32} [2022-12-13 16:26:10,829 INFO L288 CegarLoopForPetriNet]: 51 programPoint places, -6 predicate places. [2022-12-13 16:26:10,829 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 32 transitions, 109 flow [2022-12-13 16:26:10,829 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-12-13 16:26:10,829 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 16:26:10,829 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:26:10,839 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd5b8763-06ab-4261-aa22-c5aed923bf3a/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2022-12-13 16:26:11,030 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd5b8763-06ab-4261-aa22-c5aed923bf3a/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 16:26:11,032 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-12-13 16:26:11,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:26:11,033 INFO L85 PathProgramCache]: Analyzing trace with hash 1481070636, now seen corresponding path program 1 times [2022-12-13 16:26:11,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 16:26:11,035 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [847257198] [2022-12-13 16:26:11,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:26:11,036 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 16:26:11,037 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd5b8763-06ab-4261-aa22-c5aed923bf3a/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 16:26:11,039 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd5b8763-06ab-4261-aa22-c5aed923bf3a/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 16:26:11,043 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd5b8763-06ab-4261-aa22-c5aed923bf3a/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-12-13 16:26:11,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:26:11,170 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 16:26:11,171 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:26:11,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:26:11,209 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 16:26:11,209 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 16:26:11,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [847257198] [2022-12-13 16:26:11,209 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [847257198] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:26:11,209 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:26:11,209 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 16:26:11,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125319630] [2022-12-13 16:26:11,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:26:11,210 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 16:26:11,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 16:26:11,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 16:26:11,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 16:26:11,235 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 291 [2022-12-13 16:26:11,236 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 32 transitions, 109 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-12-13 16:26:11,236 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 16:26:11,236 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 291 [2022-12-13 16:26:11,237 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 16:26:11,613 INFO L130 PetriNetUnfolder]: 1407/2193 cut-off events. [2022-12-13 16:26:11,613 INFO L131 PetriNetUnfolder]: For 891/891 co-relation queries the response was YES. [2022-12-13 16:26:11,616 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5962 conditions, 2193 events. 1407/2193 cut-off events. For 891/891 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 11058 event pairs, 231 based on Foata normal form. 138/2258 useless extension candidates. Maximal degree in co-relation 5955. Up to 1054 conditions per place. [2022-12-13 16:26:11,622 INFO L137 encePairwiseOnDemand]: 284/291 looper letters, 47 selfloop transitions, 9 changer transitions 23/83 dead transitions. [2022-12-13 16:26:11,622 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 83 transitions, 429 flow [2022-12-13 16:26:11,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 16:26:11,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 16:26:11,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 861 transitions. [2022-12-13 16:26:11,624 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.49312714776632305 [2022-12-13 16:26:11,624 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 861 transitions. [2022-12-13 16:26:11,624 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 861 transitions. [2022-12-13 16:26:11,624 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 16:26:11,624 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 861 transitions. [2022-12-13 16:26:11,626 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 143.5) internal successors, (861), 6 states have internal predecessors, (861), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:26:11,627 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 291.0) internal successors, (2037), 7 states have internal predecessors, (2037), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:26:11,628 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 291.0) internal successors, (2037), 7 states have internal predecessors, (2037), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:26:11,628 INFO L175 Difference]: Start difference. First operand has 45 places, 32 transitions, 109 flow. Second operand 6 states and 861 transitions. [2022-12-13 16:26:11,628 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 83 transitions, 429 flow [2022-12-13 16:26:11,633 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 83 transitions, 422 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-12-13 16:26:11,635 INFO L231 Difference]: Finished difference. Result has 49 places, 36 transitions, 174 flow [2022-12-13 16:26:11,635 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=291, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=174, PETRI_PLACES=49, PETRI_TRANSITIONS=36} [2022-12-13 16:26:11,636 INFO L288 CegarLoopForPetriNet]: 51 programPoint places, -2 predicate places. [2022-12-13 16:26:11,636 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 36 transitions, 174 flow [2022-12-13 16:26:11,636 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-12-13 16:26:11,637 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 16:26:11,637 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:26:11,648 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd5b8763-06ab-4261-aa22-c5aed923bf3a/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2022-12-13 16:26:11,837 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd5b8763-06ab-4261-aa22-c5aed923bf3a/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 16:26:11,839 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-12-13 16:26:11,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:26:11,840 INFO L85 PathProgramCache]: Analyzing trace with hash -401383994, now seen corresponding path program 1 times [2022-12-13 16:26:11,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 16:26:11,842 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [496245005] [2022-12-13 16:26:11,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:26:11,842 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 16:26:11,843 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd5b8763-06ab-4261-aa22-c5aed923bf3a/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 16:26:11,845 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd5b8763-06ab-4261-aa22-c5aed923bf3a/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 16:26:11,849 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd5b8763-06ab-4261-aa22-c5aed923bf3a/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-12-13 16:26:11,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:26:11,969 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-13 16:26:11,970 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:26:12,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:26:12,012 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 16:26:12,012 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 16:26:12,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [496245005] [2022-12-13 16:26:12,012 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [496245005] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:26:12,012 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:26:12,012 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 16:26:12,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436484578] [2022-12-13 16:26:12,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:26:12,013 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 16:26:12,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 16:26:12,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 16:26:12,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 16:26:12,044 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 291 [2022-12-13 16:26:12,046 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 36 transitions, 174 flow. Second operand has 6 states, 6 states have (on average 132.66666666666666) internal successors, (796), 6 states have internal predecessors, (796), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:26:12,046 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 16:26:12,046 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 291 [2022-12-13 16:26:12,046 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 16:26:12,457 INFO L130 PetriNetUnfolder]: 759/1239 cut-off events. [2022-12-13 16:26:12,457 INFO L131 PetriNetUnfolder]: For 1315/1315 co-relation queries the response was YES. [2022-12-13 16:26:12,459 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3897 conditions, 1239 events. 759/1239 cut-off events. For 1315/1315 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 5649 event pairs, 169 based on Foata normal form. 57/1270 useless extension candidates. Maximal degree in co-relation 3888. Up to 419 conditions per place. [2022-12-13 16:26:12,462 INFO L137 encePairwiseOnDemand]: 284/291 looper letters, 56 selfloop transitions, 13 changer transitions 23/96 dead transitions. [2022-12-13 16:26:12,462 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 96 transitions, 590 flow [2022-12-13 16:26:12,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 16:26:12,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 16:26:12,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1004 transitions. [2022-12-13 16:26:12,465 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.49288168875797744 [2022-12-13 16:26:12,465 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1004 transitions. [2022-12-13 16:26:12,465 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1004 transitions. [2022-12-13 16:26:12,465 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 16:26:12,465 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1004 transitions. [2022-12-13 16:26:12,467 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 143.42857142857142) internal successors, (1004), 7 states have internal predecessors, (1004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:26:12,468 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 291.0) internal successors, (2328), 8 states have internal predecessors, (2328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:26:12,469 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 291.0) internal successors, (2328), 8 states have internal predecessors, (2328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:26:12,469 INFO L175 Difference]: Start difference. First operand has 49 places, 36 transitions, 174 flow. Second operand 7 states and 1004 transitions. [2022-12-13 16:26:12,469 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 96 transitions, 590 flow [2022-12-13 16:26:12,476 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 96 transitions, 528 flow, removed 26 selfloop flow, removed 4 redundant places. [2022-12-13 16:26:12,477 INFO L231 Difference]: Finished difference. Result has 52 places, 40 transitions, 224 flow [2022-12-13 16:26:12,477 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=291, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=224, PETRI_PLACES=52, PETRI_TRANSITIONS=40} [2022-12-13 16:26:12,478 INFO L288 CegarLoopForPetriNet]: 51 programPoint places, 1 predicate places. [2022-12-13 16:26:12,478 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 40 transitions, 224 flow [2022-12-13 16:26:12,478 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 132.66666666666666) internal successors, (796), 6 states have internal predecessors, (796), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:26:12,478 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 16:26:12,478 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:26:12,486 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd5b8763-06ab-4261-aa22-c5aed923bf3a/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2022-12-13 16:26:12,679 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd5b8763-06ab-4261-aa22-c5aed923bf3a/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 16:26:12,680 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-12-13 16:26:12,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:26:12,681 INFO L85 PathProgramCache]: Analyzing trace with hash -1165444531, now seen corresponding path program 1 times [2022-12-13 16:26:12,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 16:26:12,683 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1372013602] [2022-12-13 16:26:12,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:26:12,684 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 16:26:12,684 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd5b8763-06ab-4261-aa22-c5aed923bf3a/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 16:26:12,687 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd5b8763-06ab-4261-aa22-c5aed923bf3a/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 16:26:12,690 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd5b8763-06ab-4261-aa22-c5aed923bf3a/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-12-13 16:26:12,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:26:12,836 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-13 16:26:12,837 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:26:12,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:26:12,878 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 16:26:12,878 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 16:26:12,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1372013602] [2022-12-13 16:26:12,879 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1372013602] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:26:12,879 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:26:12,879 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 16:26:12,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141949522] [2022-12-13 16:26:12,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:26:12,879 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 16:26:12,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 16:26:12,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 16:26:12,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 16:26:12,907 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 291 [2022-12-13 16:26:12,908 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 40 transitions, 224 flow. Second operand has 7 states, 7 states have (on average 132.71428571428572) internal successors, (929), 7 states have internal predecessors, (929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:26:12,908 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 16:26:12,908 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 291 [2022-12-13 16:26:12,908 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 16:26:13,317 INFO L130 PetriNetUnfolder]: 625/1005 cut-off events. [2022-12-13 16:26:13,317 INFO L131 PetriNetUnfolder]: For 1022/1022 co-relation queries the response was YES. [2022-12-13 16:26:13,319 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3037 conditions, 1005 events. 625/1005 cut-off events. For 1022/1022 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 4435 event pairs, 164 based on Foata normal form. 12/1002 useless extension candidates. Maximal degree in co-relation 3027. Up to 400 conditions per place. [2022-12-13 16:26:13,321 INFO L137 encePairwiseOnDemand]: 284/291 looper letters, 52 selfloop transitions, 17 changer transitions 12/85 dead transitions. [2022-12-13 16:26:13,321 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 85 transitions, 534 flow [2022-12-13 16:26:13,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 16:26:13,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 16:26:13,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1123 transitions. [2022-12-13 16:26:13,324 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.48238831615120276 [2022-12-13 16:26:13,324 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1123 transitions. [2022-12-13 16:26:13,324 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1123 transitions. [2022-12-13 16:26:13,325 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 16:26:13,325 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1123 transitions. [2022-12-13 16:26:13,327 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 140.375) internal successors, (1123), 8 states have internal predecessors, (1123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:26:13,329 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 291.0) internal successors, (2619), 9 states have internal predecessors, (2619), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:26:13,330 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 291.0) internal successors, (2619), 9 states have internal predecessors, (2619), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:26:13,330 INFO L175 Difference]: Start difference. First operand has 52 places, 40 transitions, 224 flow. Second operand 8 states and 1123 transitions. [2022-12-13 16:26:13,330 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 85 transitions, 534 flow [2022-12-13 16:26:13,338 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 85 transitions, 472 flow, removed 22 selfloop flow, removed 5 redundant places. [2022-12-13 16:26:13,339 INFO L231 Difference]: Finished difference. Result has 55 places, 40 transitions, 218 flow [2022-12-13 16:26:13,339 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=291, PETRI_DIFFERENCE_MINUEND_FLOW=170, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=218, PETRI_PLACES=55, PETRI_TRANSITIONS=40} [2022-12-13 16:26:13,340 INFO L288 CegarLoopForPetriNet]: 51 programPoint places, 4 predicate places. [2022-12-13 16:26:13,340 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 40 transitions, 218 flow [2022-12-13 16:26:13,340 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 132.71428571428572) internal successors, (929), 7 states have internal predecessors, (929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:26:13,340 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 16:26:13,341 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] [2022-12-13 16:26:13,348 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd5b8763-06ab-4261-aa22-c5aed923bf3a/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2022-12-13 16:26:13,541 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd5b8763-06ab-4261-aa22-c5aed923bf3a/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 16:26:13,543 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-12-13 16:26:13,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:26:13,544 INFO L85 PathProgramCache]: Analyzing trace with hash 2014966598, now seen corresponding path program 1 times [2022-12-13 16:26:13,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 16:26:13,547 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [499536877] [2022-12-13 16:26:13,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:26:13,548 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 16:26:13,548 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd5b8763-06ab-4261-aa22-c5aed923bf3a/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 16:26:13,551 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd5b8763-06ab-4261-aa22-c5aed923bf3a/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 16:26:13,554 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd5b8763-06ab-4261-aa22-c5aed923bf3a/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-12-13 16:26:13,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:26:13,743 INFO L263 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 16:26:13,744 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:26:13,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:26:13,774 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 16:26:13,774 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 16:26:13,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [499536877] [2022-12-13 16:26:13,774 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [499536877] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:26:13,774 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:26:13,775 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 16:26:13,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392412643] [2022-12-13 16:26:13,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:26:13,775 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 16:26:13,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 16:26:13,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 16:26:13,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 16:26:13,784 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 291 [2022-12-13 16:26:13,785 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 40 transitions, 218 flow. Second operand has 4 states, 4 states have (on average 137.75) internal successors, (551), 4 states have internal predecessors, (551), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:26:13,785 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 16:26:13,785 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 291 [2022-12-13 16:26:13,785 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 16:26:14,066 INFO L130 PetriNetUnfolder]: 879/1431 cut-off events. [2022-12-13 16:26:14,066 INFO L131 PetriNetUnfolder]: For 1906/1906 co-relation queries the response was YES. [2022-12-13 16:26:14,070 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4308 conditions, 1431 events. 879/1431 cut-off events. For 1906/1906 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 6862 event pairs, 174 based on Foata normal form. 0/1423 useless extension candidates. Maximal degree in co-relation 4297. Up to 777 conditions per place. [2022-12-13 16:26:14,074 INFO L137 encePairwiseOnDemand]: 288/291 looper letters, 82 selfloop transitions, 2 changer transitions 0/87 dead transitions. [2022-12-13 16:26:14,074 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 87 transitions, 663 flow [2022-12-13 16:26:14,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 16:26:14,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 16:26:14,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 583 transitions. [2022-12-13 16:26:14,077 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5008591065292096 [2022-12-13 16:26:14,077 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 583 transitions. [2022-12-13 16:26:14,077 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 583 transitions. [2022-12-13 16:26:14,077 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 16:26:14,077 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 583 transitions. [2022-12-13 16:26:14,078 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 145.75) internal successors, (583), 4 states have internal predecessors, (583), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:26:14,079 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 291.0) internal successors, (1455), 5 states have internal predecessors, (1455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:26:14,080 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 291.0) internal successors, (1455), 5 states have internal predecessors, (1455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:26:14,080 INFO L175 Difference]: Start difference. First operand has 55 places, 40 transitions, 218 flow. Second operand 4 states and 583 transitions. [2022-12-13 16:26:14,080 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 87 transitions, 663 flow [2022-12-13 16:26:14,088 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 87 transitions, 522 flow, removed 38 selfloop flow, removed 7 redundant places. [2022-12-13 16:26:14,089 INFO L231 Difference]: Finished difference. Result has 51 places, 41 transitions, 167 flow [2022-12-13 16:26:14,089 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=291, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=167, PETRI_PLACES=51, PETRI_TRANSITIONS=41} [2022-12-13 16:26:14,090 INFO L288 CegarLoopForPetriNet]: 51 programPoint places, 0 predicate places. [2022-12-13 16:26:14,090 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 41 transitions, 167 flow [2022-12-13 16:26:14,090 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 137.75) internal successors, (551), 4 states have internal predecessors, (551), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:26:14,090 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 16:26:14,090 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] [2022-12-13 16:26:14,102 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd5b8763-06ab-4261-aa22-c5aed923bf3a/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2022-12-13 16:26:14,291 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd5b8763-06ab-4261-aa22-c5aed923bf3a/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 16:26:14,292 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-12-13 16:26:14,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:26:14,293 INFO L85 PathProgramCache]: Analyzing trace with hash -1854562472, now seen corresponding path program 2 times [2022-12-13 16:26:14,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 16:26:14,294 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1504838960] [2022-12-13 16:26:14,294 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 16:26:14,294 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 16:26:14,295 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd5b8763-06ab-4261-aa22-c5aed923bf3a/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 16:26:14,297 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd5b8763-06ab-4261-aa22-c5aed923bf3a/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 16:26:14,299 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd5b8763-06ab-4261-aa22-c5aed923bf3a/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-12-13 16:26:14,470 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-12-13 16:26:14,470 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 16:26:14,475 INFO L263 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 16:26:14,477 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:26:14,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:26:14,507 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 16:26:14,507 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 16:26:14,507 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1504838960] [2022-12-13 16:26:14,507 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1504838960] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:26:14,507 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:26:14,508 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 16:26:14,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046195633] [2022-12-13 16:26:14,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:26:14,508 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 16:26:14,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 16:26:14,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 16:26:14,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 16:26:14,517 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 291 [2022-12-13 16:26:14,518 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 41 transitions, 167 flow. Second operand has 4 states, 4 states have (on average 137.75) internal successors, (551), 4 states have internal predecessors, (551), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:26:14,518 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 16:26:14,518 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 291 [2022-12-13 16:26:14,518 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 16:26:14,821 INFO L130 PetriNetUnfolder]: 1515/2357 cut-off events. [2022-12-13 16:26:14,822 INFO L131 PetriNetUnfolder]: For 1867/1867 co-relation queries the response was YES. [2022-12-13 16:26:14,824 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6731 conditions, 2357 events. 1515/2357 cut-off events. For 1867/1867 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 12482 event pairs, 164 based on Foata normal form. 1/2324 useless extension candidates. Maximal degree in co-relation 6721. Up to 1266 conditions per place. [2022-12-13 16:26:14,829 INFO L137 encePairwiseOnDemand]: 288/291 looper letters, 83 selfloop transitions, 2 changer transitions 0/89 dead transitions. [2022-12-13 16:26:14,829 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 89 transitions, 544 flow [2022-12-13 16:26:14,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 16:26:14,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 16:26:14,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 584 transitions. [2022-12-13 16:26:14,830 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5017182130584192 [2022-12-13 16:26:14,831 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 584 transitions. [2022-12-13 16:26:14,831 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 584 transitions. [2022-12-13 16:26:14,831 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 16:26:14,831 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 584 transitions. [2022-12-13 16:26:14,832 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 146.0) internal successors, (584), 4 states have internal predecessors, (584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:26:14,832 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 291.0) internal successors, (1455), 5 states have internal predecessors, (1455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:26:14,833 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 291.0) internal successors, (1455), 5 states have internal predecessors, (1455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:26:14,833 INFO L175 Difference]: Start difference. First operand has 51 places, 41 transitions, 167 flow. Second operand 4 states and 584 transitions. [2022-12-13 16:26:14,833 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 89 transitions, 544 flow [2022-12-13 16:26:14,845 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 89 transitions, 542 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 16:26:14,846 INFO L231 Difference]: Finished difference. Result has 55 places, 42 transitions, 179 flow [2022-12-13 16:26:14,846 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=291, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=179, PETRI_PLACES=55, PETRI_TRANSITIONS=42} [2022-12-13 16:26:14,847 INFO L288 CegarLoopForPetriNet]: 51 programPoint places, 4 predicate places. [2022-12-13 16:26:14,847 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 42 transitions, 179 flow [2022-12-13 16:26:14,847 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 137.75) internal successors, (551), 4 states have internal predecessors, (551), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:26:14,847 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 16:26:14,847 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] [2022-12-13 16:26:14,855 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd5b8763-06ab-4261-aa22-c5aed923bf3a/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-12-13 16:26:15,048 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd5b8763-06ab-4261-aa22-c5aed923bf3a/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 16:26:15,049 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-12-13 16:26:15,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:26:15,051 INFO L85 PathProgramCache]: Analyzing trace with hash -493283258, now seen corresponding path program 3 times [2022-12-13 16:26:15,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 16:26:15,052 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [50123681] [2022-12-13 16:26:15,053 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 16:26:15,053 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 16:26:15,053 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd5b8763-06ab-4261-aa22-c5aed923bf3a/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 16:26:15,056 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd5b8763-06ab-4261-aa22-c5aed923bf3a/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 16:26:15,059 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd5b8763-06ab-4261-aa22-c5aed923bf3a/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-12-13 16:26:15,174 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-12-13 16:26:15,174 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 16:26:15,179 INFO L263 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 14 conjunts are in the unsatisfiable core [2022-12-13 16:26:15,180 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:26:15,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:26:15,369 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 16:26:15,369 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 16:26:15,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [50123681] [2022-12-13 16:26:15,370 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [50123681] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:26:15,370 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:26:15,370 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 16:26:15,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695876209] [2022-12-13 16:26:15,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:26:15,370 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 16:26:15,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 16:26:15,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 16:26:15,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-13 16:26:15,419 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 291 [2022-12-13 16:26:15,420 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 42 transitions, 179 flow. Second operand has 7 states, 7 states have (on average 133.14285714285714) internal successors, (932), 7 states have internal predecessors, (932), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:26:15,420 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 16:26:15,420 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 291 [2022-12-13 16:26:15,420 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 16:26:15,808 INFO L130 PetriNetUnfolder]: 1441/2411 cut-off events. [2022-12-13 16:26:15,808 INFO L131 PetriNetUnfolder]: For 2354/2355 co-relation queries the response was YES. [2022-12-13 16:26:15,812 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7270 conditions, 2411 events. 1441/2411 cut-off events. For 2354/2355 co-relation queries the response was YES. Maximal size of possible extension queue 149. Compared 13536 event pairs, 190 based on Foata normal form. 1/2356 useless extension candidates. Maximal degree in co-relation 7258. Up to 872 conditions per place. [2022-12-13 16:26:15,817 INFO L137 encePairwiseOnDemand]: 285/291 looper letters, 87 selfloop transitions, 6 changer transitions 0/99 dead transitions. [2022-12-13 16:26:15,817 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 99 transitions, 633 flow [2022-12-13 16:26:15,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 16:26:15,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 16:26:15,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 968 transitions. [2022-12-13 16:26:15,819 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.47520864015709374 [2022-12-13 16:26:15,819 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 968 transitions. [2022-12-13 16:26:15,819 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 968 transitions. [2022-12-13 16:26:15,819 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 16:26:15,819 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 968 transitions. [2022-12-13 16:26:15,820 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 138.28571428571428) internal successors, (968), 7 states have internal predecessors, (968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:26:15,822 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 291.0) internal successors, (2328), 8 states have internal predecessors, (2328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:26:15,822 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 291.0) internal successors, (2328), 8 states have internal predecessors, (2328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:26:15,822 INFO L175 Difference]: Start difference. First operand has 55 places, 42 transitions, 179 flow. Second operand 7 states and 968 transitions. [2022-12-13 16:26:15,822 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 99 transitions, 633 flow [2022-12-13 16:26:15,839 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 99 transitions, 630 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 16:26:15,840 INFO L231 Difference]: Finished difference. Result has 62 places, 44 transitions, 202 flow [2022-12-13 16:26:15,840 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=291, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=202, PETRI_PLACES=62, PETRI_TRANSITIONS=44} [2022-12-13 16:26:15,841 INFO L288 CegarLoopForPetriNet]: 51 programPoint places, 11 predicate places. [2022-12-13 16:26:15,841 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 44 transitions, 202 flow [2022-12-13 16:26:15,841 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 133.14285714285714) internal successors, (932), 7 states have internal predecessors, (932), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:26:15,841 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 16:26:15,841 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] [2022-12-13 16:26:15,851 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd5b8763-06ab-4261-aa22-c5aed923bf3a/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2022-12-13 16:26:16,041 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd5b8763-06ab-4261-aa22-c5aed923bf3a/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 16:26:16,042 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-12-13 16:26:16,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:26:16,042 INFO L85 PathProgramCache]: Analyzing trace with hash -634026736, now seen corresponding path program 4 times [2022-12-13 16:26:16,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 16:26:16,042 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [289200256] [2022-12-13 16:26:16,043 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-13 16:26:16,043 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 16:26:16,043 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd5b8763-06ab-4261-aa22-c5aed923bf3a/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 16:26:16,044 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd5b8763-06ab-4261-aa22-c5aed923bf3a/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 16:26:16,044 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd5b8763-06ab-4261-aa22-c5aed923bf3a/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-12-13 16:26:16,127 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-13 16:26:16,127 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 16:26:16,132 INFO L263 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-13 16:26:16,133 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:26:16,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:26:16,142 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 16:26:16,142 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 16:26:16,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [289200256] [2022-12-13 16:26:16,143 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [289200256] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:26:16,143 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:26:16,143 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 16:26:16,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502506774] [2022-12-13 16:26:16,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:26:16,143 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 16:26:16,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 16:26:16,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 16:26:16,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 16:26:16,149 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 291 [2022-12-13 16:26:16,150 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 44 transitions, 202 flow. Second operand has 3 states, 3 states have (on average 140.66666666666666) internal successors, (422), 3 states have internal predecessors, (422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:26:16,150 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 16:26:16,150 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 291 [2022-12-13 16:26:16,150 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 16:26:16,567 INFO L130 PetriNetUnfolder]: 2398/4030 cut-off events. [2022-12-13 16:26:16,567 INFO L131 PetriNetUnfolder]: For 4673/4674 co-relation queries the response was YES. [2022-12-13 16:26:16,574 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13133 conditions, 4030 events. 2398/4030 cut-off events. For 4673/4674 co-relation queries the response was YES. Maximal size of possible extension queue 258. Compared 25215 event pairs, 773 based on Foata normal form. 1/3918 useless extension candidates. Maximal degree in co-relation 13119. Up to 2035 conditions per place. [2022-12-13 16:26:16,582 INFO L137 encePairwiseOnDemand]: 288/291 looper letters, 67 selfloop transitions, 2 changer transitions 0/74 dead transitions. [2022-12-13 16:26:16,583 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 74 transitions, 484 flow [2022-12-13 16:26:16,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 16:26:16,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 16:26:16,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 441 transitions. [2022-12-13 16:26:16,584 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5051546391752577 [2022-12-13 16:26:16,584 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 441 transitions. [2022-12-13 16:26:16,584 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 441 transitions. [2022-12-13 16:26:16,584 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 16:26:16,584 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 441 transitions. [2022-12-13 16:26:16,585 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 147.0) internal successors, (441), 3 states have internal predecessors, (441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:26:16,586 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 291.0) internal successors, (1164), 4 states have internal predecessors, (1164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:26:16,586 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 291.0) internal successors, (1164), 4 states have internal predecessors, (1164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:26:16,586 INFO L175 Difference]: Start difference. First operand has 62 places, 44 transitions, 202 flow. Second operand 3 states and 441 transitions. [2022-12-13 16:26:16,586 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 74 transitions, 484 flow [2022-12-13 16:26:16,636 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 74 transitions, 476 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-13 16:26:16,637 INFO L231 Difference]: Finished difference. Result has 62 places, 45 transitions, 208 flow [2022-12-13 16:26:16,637 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=291, PETRI_DIFFERENCE_MINUEND_FLOW=196, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=208, PETRI_PLACES=62, PETRI_TRANSITIONS=45} [2022-12-13 16:26:16,638 INFO L288 CegarLoopForPetriNet]: 51 programPoint places, 11 predicate places. [2022-12-13 16:26:16,638 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 45 transitions, 208 flow [2022-12-13 16:26:16,638 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 140.66666666666666) internal successors, (422), 3 states have internal predecessors, (422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:26:16,638 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 16:26:16,638 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] [2022-12-13 16:26:16,646 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd5b8763-06ab-4261-aa22-c5aed923bf3a/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2022-12-13 16:26:16,839 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd5b8763-06ab-4261-aa22-c5aed923bf3a/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 16:26:16,839 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-12-13 16:26:16,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:26:16,840 INFO L85 PathProgramCache]: Analyzing trace with hash 1668201110, now seen corresponding path program 5 times [2022-12-13 16:26:16,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 16:26:16,840 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [625416281] [2022-12-13 16:26:16,840 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-13 16:26:16,840 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 16:26:16,840 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd5b8763-06ab-4261-aa22-c5aed923bf3a/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 16:26:16,841 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd5b8763-06ab-4261-aa22-c5aed923bf3a/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 16:26:16,842 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd5b8763-06ab-4261-aa22-c5aed923bf3a/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-12-13 16:26:16,972 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-12-13 16:26:16,972 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-12-13 16:26:16,972 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 16:26:17,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 16:26:17,089 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-12-13 16:26:17,090 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 16:26:17,090 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (15 of 16 remaining) [2022-12-13 16:26:17,091 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (14 of 16 remaining) [2022-12-13 16:26:17,092 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2022-12-13 16:26:17,092 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining) [2022-12-13 16:26:17,092 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2022-12-13 16:26:17,092 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2022-12-13 16:26:17,092 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2022-12-13 16:26:17,092 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2022-12-13 16:26:17,092 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2022-12-13 16:26:17,092 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2022-12-13 16:26:17,093 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (5 of 16 remaining) [2022-12-13 16:26:17,093 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 16 remaining) [2022-12-13 16:26:17,093 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 16 remaining) [2022-12-13 16:26:17,093 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 16 remaining) [2022-12-13 16:26:17,093 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 16 remaining) [2022-12-13 16:26:17,093 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2022-12-13 16:26:17,102 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd5b8763-06ab-4261-aa22-c5aed923bf3a/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2022-12-13 16:26:17,294 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd5b8763-06ab-4261-aa22-c5aed923bf3a/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 16:26:17,295 INFO L445 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1, 1, 1] [2022-12-13 16:26:17,310 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 16:26:17,311 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 16:26:17,386 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 04:26:17 BasicIcfg [2022-12-13 16:26:17,387 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 16:26:17,387 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-13 16:26:17,387 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-13 16:26:17,387 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-13 16:26:17,388 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 04:26:00" (3/4) ... [2022-12-13 16:26:17,390 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-12-13 16:26:17,390 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-13 16:26:17,391 INFO L158 Benchmark]: Toolchain (without parser) took 17632.45ms. Allocated memory was 86.0MB in the beginning and 576.7MB in the end (delta: 490.7MB). Free memory was 62.7MB in the beginning and 245.5MB in the end (delta: -182.7MB). Peak memory consumption was 310.5MB. Max. memory is 16.1GB. [2022-12-13 16:26:17,391 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 60.8MB. Free memory was 39.3MB in the beginning and 39.2MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 16:26:17,392 INFO L158 Benchmark]: CACSL2BoogieTranslator took 474.15ms. Allocated memory is still 86.0MB. Free memory was 62.7MB in the beginning and 64.5MB in the end (delta: -1.7MB). Peak memory consumption was 35.0MB. Max. memory is 16.1GB. [2022-12-13 16:26:17,392 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.78ms. Allocated memory is still 86.0MB. Free memory was 64.5MB in the beginning and 62.0MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 16:26:17,392 INFO L158 Benchmark]: Boogie Preprocessor took 22.05ms. Allocated memory is still 86.0MB. Free memory was 62.0MB in the beginning and 59.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 16:26:17,392 INFO L158 Benchmark]: RCFGBuilder took 595.45ms. Allocated memory is still 86.0MB. Free memory was 59.5MB in the beginning and 49.5MB in the end (delta: 10.0MB). Peak memory consumption was 32.4MB. Max. memory is 16.1GB. [2022-12-13 16:26:17,393 INFO L158 Benchmark]: TraceAbstraction took 16486.15ms. Allocated memory was 86.0MB in the beginning and 576.7MB in the end (delta: 490.7MB). Free memory was 48.8MB in the beginning and 246.5MB in the end (delta: -197.7MB). Peak memory consumption was 291.4MB. Max. memory is 16.1GB. [2022-12-13 16:26:17,393 INFO L158 Benchmark]: Witness Printer took 3.34ms. Allocated memory is still 576.7MB. Free memory was 246.5MB in the beginning and 245.5MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 16:26:17,395 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.14ms. Allocated memory is still 60.8MB. Free memory was 39.3MB in the beginning and 39.2MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 474.15ms. Allocated memory is still 86.0MB. Free memory was 62.7MB in the beginning and 64.5MB in the end (delta: -1.7MB). Peak memory consumption was 35.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.78ms. Allocated memory is still 86.0MB. Free memory was 64.5MB in the beginning and 62.0MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 22.05ms. Allocated memory is still 86.0MB. Free memory was 62.0MB in the beginning and 59.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 595.45ms. Allocated memory is still 86.0MB. Free memory was 59.5MB in the beginning and 49.5MB in the end (delta: 10.0MB). Peak memory consumption was 32.4MB. Max. memory is 16.1GB. * TraceAbstraction took 16486.15ms. Allocated memory was 86.0MB in the beginning and 576.7MB in the end (delta: 490.7MB). Free memory was 48.8MB in the beginning and 246.5MB in the end (delta: -197.7MB). Peak memory consumption was 291.4MB. Max. memory is 16.1GB. * Witness Printer took 3.34ms. Allocated memory is still 576.7MB. Free memory was 246.5MB in the beginning and 245.5MB 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.9s, 156 PlacesBefore, 51 PlacesAfterwards, 145 TransitionsBefore, 39 TransitionsAfterwards, 3396 CoEnabledTransitionPairs, 7 FixpointIterations, 54 TrivialSequentialCompositions, 79 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 1 ChoiceCompositions, 142 TotalNumberOfCompositions, 8807 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4020, independent: 3805, independent conditional: 0, independent unconditional: 3805, dependent: 215, dependent conditional: 0, dependent unconditional: 215, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1810, independent: 1772, independent conditional: 0, independent unconditional: 1772, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 4020, independent: 2033, independent conditional: 0, independent unconditional: 2033, dependent: 177, dependent conditional: 0, dependent unconditional: 177, unknown: 1810, unknown conditional: 0, unknown unconditional: 1810] , Statistics on independence cache: Total cache size (in pairs): 160, Positive cache size: 142, Positive conditional cache size: 0, Positive unconditional cache size: 142, Negative cache size: 18, Negative conditional cache size: 0, Negative unconditional cache size: 18, 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_p0_EAX = 0; [L714] 0 int __unbuffered_p1_EAX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int __unbuffered_p3_EBX = 0; [L720] 0 int a = 0; [L721] 0 _Bool main$tmp_guard0; [L722] 0 _Bool main$tmp_guard1; [L724] 0 int x = 0; [L726] 0 int y = 0; [L727] 0 _Bool y$flush_delayed; [L728] 0 int y$mem_tmp; [L729] 0 _Bool y$r_buff0_thd0; [L730] 0 _Bool y$r_buff0_thd1; [L731] 0 _Bool y$r_buff0_thd2; [L732] 0 _Bool y$r_buff0_thd3; [L733] 0 _Bool y$r_buff0_thd4; [L734] 0 _Bool y$r_buff1_thd0; [L735] 0 _Bool y$r_buff1_thd1; [L736] 0 _Bool y$r_buff1_thd2; [L737] 0 _Bool y$r_buff1_thd3; [L738] 0 _Bool y$r_buff1_thd4; [L739] 0 _Bool y$read_delayed; [L740] 0 int *y$read_delayed_var; [L741] 0 int y$w_buff0; [L742] 0 _Bool y$w_buff0_used; [L743] 0 int y$w_buff1; [L744] 0 _Bool y$w_buff1_used; [L746] 0 int z = 0; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice2; [L856] 0 pthread_t t693; [L857] FCALL, FORK 0 pthread_create(&t693, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t693, ((void *)0), P0, ((void *)0))=0, t693={11:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L858] 0 pthread_t t694; [L859] FCALL, FORK 0 pthread_create(&t694, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t694, ((void *)0), P1, ((void *)0))=1, t693={11:0}, t694={15:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L860] 0 pthread_t t695; [L861] FCALL, FORK 0 pthread_create(&t695, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t695, ((void *)0), P2, ((void *)0))=2, t693={11:0}, t694={15:0}, t695={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L795] 3 y$w_buff1 = y$w_buff0 [L796] 3 y$w_buff0 = 1 [L797] 3 y$w_buff1_used = y$w_buff0_used [L798] 3 y$w_buff0_used = (_Bool)1 [L799] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L799] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L800] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L801] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L802] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L803] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L804] 3 y$r_buff1_thd4 = y$r_buff0_thd4 [L805] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L862] 0 pthread_t t696; [L863] FCALL, FORK 0 pthread_create(&t696, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t696, ((void *)0), P3, ((void *)0))=3, t693={11:0}, t694={15:0}, t695={7:0}, t696={-2147483637:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L808] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L825] 4 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L828] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L831] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L752] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, 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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L755] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, 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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L767] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, 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=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L760] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L762] 1 return 0; [L770] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L771] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L772] 2 y$flush_delayed = weak$$choice2 [L773] 2 y$mem_tmp = y [L774] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L775] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L776] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L777] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L778] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L779] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L780] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L781] 2 __unbuffered_p1_EAX = y [L782] 2 y = y$flush_delayed ? y$mem_tmp : y [L783] 2 y$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, 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=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L788] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L790] 2 return 0; [L811] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L812] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L813] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L814] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L815] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, 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=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L834] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L835] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L836] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L837] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L838] 4 y$r_buff1_thd4 = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, 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=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L818] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L820] 3 return 0; [L841] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L843] 4 return 0; [L865] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L867] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L867] RET 0 assume_abort_if_not(main$tmp_guard0) [L869] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L870] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L871] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L872] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L873] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, 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, t693={11:0}, t694={15:0}, t695={7:0}, t696={-2147483637:0}, weak$$choice0=2, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L876] 0 main$tmp_guard1 = !(z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 2 && __unbuffered_p3_EBX == 0) [L878] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, 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=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] - UnprovableResult [Line: 18]: Unable to prove that 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: 854]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 857]: 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. - UnprovableResult [Line: 859]: 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: 861]: 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, 184 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: 16.3s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 5.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.9s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 410 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 342 mSDsluCounter, 140 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 131 mSDsCounter, 52 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1714 IncrementalHoareTripleChecker+Invalid, 1766 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 52 mSolverCounterUnsat, 9 mSDtfsCounter, 1714 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 173 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=224occurred in iteration=5, 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.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 201 NumberOfCodeBlocks, 201 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 165 ConstructedInterpolants, 0 QuantifiedInterpolants, 661 SizeOfPredicates, 18 NumberOfNonLiveVariables, 1488 ConjunctsInSsa, 63 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-12-13 16:26:17,411 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd5b8763-06ab-4261-aa22-c5aed923bf3a/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample