./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/mix018_power.oepc_pso.oepc_rmo.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b6b6f65-d949-46c2-8021-d6bdb93b0c59/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b6b6f65-d949-46c2-8021-d6bdb93b0c59/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_7b6b6f65-d949-46c2-8021-d6bdb93b0c59/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b6b6f65-d949-46c2-8021-d6bdb93b0c59/bin/uautomizer-uyxdKDjOR8/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix018_power.oepc_pso.oepc_rmo.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b6b6f65-d949-46c2-8021-d6bdb93b0c59/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_7b6b6f65-d949-46c2-8021-d6bdb93b0c59/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 5a744aa24a15b244d86986861038a45981c329f5578e2da992d82373e2f73c5a --- 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 15:40:28,409 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 15:40:28,411 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 15:40:28,425 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 15:40:28,425 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 15:40:28,426 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 15:40:28,427 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 15:40:28,428 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 15:40:28,429 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 15:40:28,429 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 15:40:28,430 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 15:40:28,430 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 15:40:28,431 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 15:40:28,431 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 15:40:28,432 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 15:40:28,433 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 15:40:28,433 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 15:40:28,434 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 15:40:28,435 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 15:40:28,436 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 15:40:28,437 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 15:40:28,437 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 15:40:28,438 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 15:40:28,439 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 15:40:28,441 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 15:40:28,441 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 15:40:28,441 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 15:40:28,442 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 15:40:28,442 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 15:40:28,442 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 15:40:28,443 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 15:40:28,443 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 15:40:28,444 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 15:40:28,444 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 15:40:28,445 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 15:40:28,445 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 15:40:28,445 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 15:40:28,445 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 15:40:28,445 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 15:40:28,446 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 15:40:28,446 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 15:40:28,447 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b6b6f65-d949-46c2-8021-d6bdb93b0c59/bin/uautomizer-uyxdKDjOR8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-12-13 15:40:28,470 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 15:40:28,470 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 15:40:28,470 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 15:40:28,471 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 15:40:28,471 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 15:40:28,471 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 15:40:28,472 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 15:40:28,472 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 15:40:28,472 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 15:40:28,473 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 15:40:28,473 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 15:40:28,473 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-13 15:40:28,473 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 15:40:28,473 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 15:40:28,473 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 15:40:28,474 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-12-13 15:40:28,474 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-12-13 15:40:28,474 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-12-13 15:40:28,474 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 15:40:28,474 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-12-13 15:40:28,474 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 15:40:28,474 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 15:40:28,475 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 15:40:28,475 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 15:40:28,475 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 15:40:28,475 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 15:40:28,475 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 15:40:28,476 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 15:40:28,476 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 15:40:28,476 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 15:40:28,476 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 15:40:28,476 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 15:40:28,476 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 15:40:28,477 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 15:40:28,477 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_7b6b6f65-d949-46c2-8021-d6bdb93b0c59/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_7b6b6f65-d949-46c2-8021-d6bdb93b0c59/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 -> 5a744aa24a15b244d86986861038a45981c329f5578e2da992d82373e2f73c5a [2022-12-13 15:40:28,654 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 15:40:28,670 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 15:40:28,672 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 15:40:28,673 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 15:40:28,674 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 15:40:28,675 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b6b6f65-d949-46c2-8021-d6bdb93b0c59/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/pthread-wmm/mix018_power.oepc_pso.oepc_rmo.oepc.i [2022-12-13 15:40:31,230 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 15:40:31,455 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 15:40:31,456 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b6b6f65-d949-46c2-8021-d6bdb93b0c59/sv-benchmarks/c/pthread-wmm/mix018_power.oepc_pso.oepc_rmo.oepc.i [2022-12-13 15:40:31,469 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b6b6f65-d949-46c2-8021-d6bdb93b0c59/bin/uautomizer-uyxdKDjOR8/data/9ba05e1c0/6b9adba6e56c4b4c99582222642eeb48/FLAGd7d8782f0 [2022-12-13 15:40:31,839 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b6b6f65-d949-46c2-8021-d6bdb93b0c59/bin/uautomizer-uyxdKDjOR8/data/9ba05e1c0/6b9adba6e56c4b4c99582222642eeb48 [2022-12-13 15:40:31,843 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 15:40:31,845 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 15:40:31,847 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 15:40:31,847 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 15:40:31,851 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 15:40:31,852 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 03:40:31" (1/1) ... [2022-12-13 15:40:31,853 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@680cb5ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:40:31, skipping insertion in model container [2022-12-13 15:40:31,854 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 03:40:31" (1/1) ... [2022-12-13 15:40:31,860 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 15:40:31,900 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 15:40:32,005 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_7b6b6f65-d949-46c2-8021-d6bdb93b0c59/sv-benchmarks/c/pthread-wmm/mix018_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2022-12-13 15:40:32,095 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:40:32,097 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:40:32,097 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:40:32,097 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:40:32,097 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:40:32,100 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:40:32,100 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:40:32,100 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:40:32,101 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:40:32,101 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:40:32,101 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:40:32,101 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:40:32,102 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:40:32,104 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:40:32,104 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:40:32,104 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:40:32,105 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:40:32,105 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:40:32,105 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:40:32,106 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:40:32,106 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:40:32,108 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:40:32,108 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:40:32,108 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:40:32,109 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:40:32,109 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:40:32,109 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:40:32,109 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:40:32,110 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:40:32,116 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:40:32,116 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:40:32,118 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:40:32,119 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:40:32,119 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:40:32,125 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:40:32,125 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:40:32,125 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:40:32,127 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:40:32,128 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:40:32,128 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:40:32,129 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 15:40:32,138 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 15:40:32,148 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_7b6b6f65-d949-46c2-8021-d6bdb93b0c59/sv-benchmarks/c/pthread-wmm/mix018_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2022-12-13 15:40:32,166 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:40:32,167 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:40:32,167 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:40:32,167 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:40:32,167 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:40:32,169 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:40:32,169 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:40:32,170 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:40:32,170 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:40:32,170 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:40:32,171 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:40:32,171 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:40:32,171 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:40:32,173 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:40:32,173 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:40:32,173 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:40:32,174 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:40:32,174 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:40:32,174 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:40:32,174 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:40:32,174 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:40:32,176 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:40:32,176 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:40:32,176 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:40:32,177 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:40:32,177 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:40:32,177 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:40:32,177 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:40:32,178 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:40:32,182 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:40:32,183 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:40:32,184 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:40:32,185 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:40:32,185 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:40:32,188 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:40:32,188 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:40:32,188 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:40:32,190 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:40:32,190 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:40:32,191 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:40:32,192 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 15:40:32,213 INFO L208 MainTranslator]: Completed translation [2022-12-13 15:40:32,213 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:40:32 WrapperNode [2022-12-13 15:40:32,213 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 15:40:32,214 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 15:40:32,214 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 15:40:32,214 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 15:40:32,220 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:40:32" (1/1) ... [2022-12-13 15:40:32,232 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:40:32" (1/1) ... [2022-12-13 15:40:32,251 INFO L138 Inliner]: procedures = 177, calls = 69, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 145 [2022-12-13 15:40:32,251 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 15:40:32,251 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 15:40:32,251 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 15:40:32,252 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 15:40:32,259 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:40:32" (1/1) ... [2022-12-13 15:40:32,259 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:40:32" (1/1) ... [2022-12-13 15:40:32,262 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:40:32" (1/1) ... [2022-12-13 15:40:32,262 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:40:32" (1/1) ... [2022-12-13 15:40:32,270 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:40:32" (1/1) ... [2022-12-13 15:40:32,271 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:40:32" (1/1) ... [2022-12-13 15:40:32,273 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:40:32" (1/1) ... [2022-12-13 15:40:32,274 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:40:32" (1/1) ... [2022-12-13 15:40:32,277 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 15:40:32,277 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 15:40:32,278 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 15:40:32,278 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 15:40:32,278 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:40:32" (1/1) ... [2022-12-13 15:40:32,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 15:40:32,293 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b6b6f65-d949-46c2-8021-d6bdb93b0c59/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 15:40:32,305 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b6b6f65-d949-46c2-8021-d6bdb93b0c59/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 15:40:32,307 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b6b6f65-d949-46c2-8021-d6bdb93b0c59/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 15:40:32,343 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 15:40:32,343 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 15:40:32,343 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 15:40:32,344 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 15:40:32,344 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 15:40:32,344 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 15:40:32,344 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 15:40:32,344 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 15:40:32,344 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 15:40:32,344 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-13 15:40:32,345 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-13 15:40:32,345 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-12-13 15:40:32,345 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-12-13 15:40:32,345 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 15:40:32,345 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 15:40:32,345 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 15:40:32,345 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 15:40:32,347 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 15:40:32,466 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 15:40:32,468 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 15:40:32,753 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 15:40:32,829 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 15:40:32,829 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 15:40:32,831 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 03:40:32 BoogieIcfgContainer [2022-12-13 15:40:32,831 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 15:40:32,833 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 15:40:32,833 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 15:40:32,836 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 15:40:32,836 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 03:40:31" (1/3) ... [2022-12-13 15:40:32,836 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26caf841 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 03:40:32, skipping insertion in model container [2022-12-13 15:40:32,836 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:40:32" (2/3) ... [2022-12-13 15:40:32,837 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26caf841 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 03:40:32, skipping insertion in model container [2022-12-13 15:40:32,837 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 03:40:32" (3/3) ... [2022-12-13 15:40:32,838 INFO L112 eAbstractionObserver]: Analyzing ICFG mix018_power.oepc_pso.oepc_rmo.oepc.i [2022-12-13 15:40:32,852 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 15:40:32,852 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2022-12-13 15:40:32,852 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 15:40:32,912 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 15:40:32,938 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 161 places, 150 transitions, 320 flow [2022-12-13 15:40:32,976 INFO L130 PetriNetUnfolder]: 2/146 cut-off events. [2022-12-13 15:40:32,976 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 15:40:32,980 INFO L83 FinitePrefix]: Finished finitePrefix Result has 159 conditions, 146 events. 2/146 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 102 event pairs, 0 based on Foata normal form. 0/133 useless extension candidates. Maximal degree in co-relation 101. Up to 2 conditions per place. [2022-12-13 15:40:32,980 INFO L82 GeneralOperation]: Start removeDead. Operand has 161 places, 150 transitions, 320 flow [2022-12-13 15:40:32,983 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 157 places, 146 transitions, 304 flow [2022-12-13 15:40:32,986 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-12-13 15:40:32,993 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 157 places, 146 transitions, 304 flow [2022-12-13 15:40:32,995 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 157 places, 146 transitions, 304 flow [2022-12-13 15:40:32,996 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 157 places, 146 transitions, 304 flow [2022-12-13 15:40:33,016 INFO L130 PetriNetUnfolder]: 2/146 cut-off events. [2022-12-13 15:40:33,017 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 15:40:33,017 INFO L83 FinitePrefix]: Finished finitePrefix Result has 159 conditions, 146 events. 2/146 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 102 event pairs, 0 based on Foata normal form. 0/133 useless extension candidates. Maximal degree in co-relation 101. Up to 2 conditions per place. [2022-12-13 15:40:33,019 INFO L119 LiptonReduction]: Number of co-enabled transitions 3764 [2022-12-13 15:40:36,654 INFO L134 LiptonReduction]: Checked pairs total: 10819 [2022-12-13 15:40:36,654 INFO L136 LiptonReduction]: Total number of compositions: 136 [2022-12-13 15:40:36,667 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 15:40:36,673 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;@3a784a02, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 15:40:36,673 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2022-12-13 15:40:36,674 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2022-12-13 15:40:36,675 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 15:40:36,675 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 15:40:36,675 INFO L209 CegarLoopForPetriNet]: trace histogram [1] [2022-12-13 15:40:36,675 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-12-13 15:40:36,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:40:36,679 INFO L85 PathProgramCache]: Analyzing trace with hash 622, now seen corresponding path program 1 times [2022-12-13 15:40:36,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:40:36,686 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088667437] [2022-12-13 15:40:36,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:40:36,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:40:36,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:40:36,761 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 15:40:36,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:40:36,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088667437] [2022-12-13 15:40:36,762 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088667437] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:40:36,762 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:40:36,762 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-12-13 15:40:36,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753589496] [2022-12-13 15:40:36,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:40:36,769 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-13 15:40:36,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:40:36,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-13 15:40:36,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-13 15:40:36,785 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 286 [2022-12-13 15:40:36,786 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 41 transitions, 94 flow. Second operand has 2 states, 2 states have (on average 135.5) internal successors, (271), 2 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:40:36,786 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 15:40:36,787 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 286 [2022-12-13 15:40:36,787 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 15:40:38,083 INFO L130 PetriNetUnfolder]: 8719/11811 cut-off events. [2022-12-13 15:40:38,083 INFO L131 PetriNetUnfolder]: For 47/47 co-relation queries the response was YES. [2022-12-13 15:40:38,104 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23759 conditions, 11811 events. 8719/11811 cut-off events. For 47/47 co-relation queries the response was YES. Maximal size of possible extension queue 540. Compared 61163 event pairs, 8719 based on Foata normal form. 0/10304 useless extension candidates. Maximal degree in co-relation 23747. Up to 11731 conditions per place. [2022-12-13 15:40:38,144 INFO L137 encePairwiseOnDemand]: 277/286 looper letters, 28 selfloop transitions, 0 changer transitions 0/32 dead transitions. [2022-12-13 15:40:38,144 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 32 transitions, 132 flow [2022-12-13 15:40:38,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 15:40:38,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-12-13 15:40:38,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 307 transitions. [2022-12-13 15:40:38,158 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5367132867132867 [2022-12-13 15:40:38,159 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 307 transitions. [2022-12-13 15:40:38,160 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 307 transitions. [2022-12-13 15:40:38,161 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 15:40:38,164 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 307 transitions. [2022-12-13 15:40:38,167 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 15:40:38,172 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 286.0) internal successors, (858), 3 states have internal predecessors, (858), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:40:38,173 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 286.0) internal successors, (858), 3 states have internal predecessors, (858), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:40:38,175 INFO L175 Difference]: Start difference. First operand has 53 places, 41 transitions, 94 flow. Second operand 2 states and 307 transitions. [2022-12-13 15:40:38,176 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 32 transitions, 132 flow [2022-12-13 15:40:38,181 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 32 transitions, 128 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-13 15:40:38,182 INFO L231 Difference]: Finished difference. Result has 42 places, 32 transitions, 72 flow [2022-12-13 15:40:38,183 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=286, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=72, PETRI_PLACES=42, PETRI_TRANSITIONS=32} [2022-12-13 15:40:38,186 INFO L288 CegarLoopForPetriNet]: 53 programPoint places, -11 predicate places. [2022-12-13 15:40:38,187 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 32 transitions, 72 flow [2022-12-13 15:40:38,187 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 15:40:38,187 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 15:40:38,187 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-12-13 15:40:38,187 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 15:40:38,187 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-12-13 15:40:38,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:40:38,188 INFO L85 PathProgramCache]: Analyzing trace with hash 611356, now seen corresponding path program 1 times [2022-12-13 15:40:38,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:40:38,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865135421] [2022-12-13 15:40:38,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:40:38,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:40:38,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:40:38,421 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 15:40:38,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:40:38,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865135421] [2022-12-13 15:40:38,421 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [865135421] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:40:38,421 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:40:38,422 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 15:40:38,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412878817] [2022-12-13 15:40:38,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:40:38,423 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 15:40:38,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:40:38,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 15:40:38,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 15:40:38,427 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 286 [2022-12-13 15:40:38,428 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 32 transitions, 72 flow. Second operand has 3 states, 3 states have (on average 135.0) internal successors, (405), 3 states have internal predecessors, (405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:40:38,428 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 15:40:38,428 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 286 [2022-12-13 15:40:38,428 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 15:40:39,543 INFO L130 PetriNetUnfolder]: 6855/9882 cut-off events. [2022-12-13 15:40:39,543 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 15:40:39,553 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19319 conditions, 9882 events. 6855/9882 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 468. Compared 60222 event pairs, 1263 based on Foata normal form. 0/9221 useless extension candidates. Maximal degree in co-relation 19316. Up to 7399 conditions per place. [2022-12-13 15:40:39,585 INFO L137 encePairwiseOnDemand]: 283/286 looper letters, 45 selfloop transitions, 2 changer transitions 2/53 dead transitions. [2022-12-13 15:40:39,585 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 53 transitions, 218 flow [2022-12-13 15:40:39,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 15:40:39,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 15:40:39,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 452 transitions. [2022-12-13 15:40:39,590 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5268065268065268 [2022-12-13 15:40:39,590 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 452 transitions. [2022-12-13 15:40:39,590 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 452 transitions. [2022-12-13 15:40:39,591 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 15:40:39,592 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 452 transitions. [2022-12-13 15:40:39,594 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 150.66666666666666) internal successors, (452), 3 states have internal predecessors, (452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:40:39,599 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 286.0) internal successors, (1144), 4 states have internal predecessors, (1144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:40:39,600 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 286.0) internal successors, (1144), 4 states have internal predecessors, (1144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:40:39,600 INFO L175 Difference]: Start difference. First operand has 42 places, 32 transitions, 72 flow. Second operand 3 states and 452 transitions. [2022-12-13 15:40:39,600 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 53 transitions, 218 flow [2022-12-13 15:40:39,601 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 53 transitions, 218 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-13 15:40:39,602 INFO L231 Difference]: Finished difference. Result has 43 places, 30 transitions, 72 flow [2022-12-13 15:40:39,603 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=286, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=72, PETRI_PLACES=43, PETRI_TRANSITIONS=30} [2022-12-13 15:40:39,603 INFO L288 CegarLoopForPetriNet]: 53 programPoint places, -10 predicate places. [2022-12-13 15:40:39,604 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 30 transitions, 72 flow [2022-12-13 15:40:39,604 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 135.0) internal successors, (405), 3 states have internal predecessors, (405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:40:39,604 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 15:40:39,605 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:40:39,605 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 15:40:39,605 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-12-13 15:40:39,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:40:39,605 INFO L85 PathProgramCache]: Analyzing trace with hash 1135046717, now seen corresponding path program 1 times [2022-12-13 15:40:39,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:40:39,606 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536248045] [2022-12-13 15:40:39,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:40:39,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:40:39,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:40:39,842 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 15:40:39,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:40:39,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536248045] [2022-12-13 15:40:39,842 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1536248045] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:40:39,842 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:40:39,843 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 15:40:39,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222368553] [2022-12-13 15:40:39,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:40:39,843 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 15:40:39,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:40:39,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 15:40:39,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 15:40:39,863 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 286 [2022-12-13 15:40:39,864 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 30 transitions, 72 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 15:40:39,864 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 15:40:39,864 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 286 [2022-12-13 15:40:39,864 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 15:40:42,206 INFO L130 PetriNetUnfolder]: 23689/31854 cut-off events. [2022-12-13 15:40:42,206 INFO L131 PetriNetUnfolder]: For 1249/1249 co-relation queries the response was YES. [2022-12-13 15:40:42,242 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65437 conditions, 31854 events. 23689/31854 cut-off events. For 1249/1249 co-relation queries the response was YES. Maximal size of possible extension queue 993. Compared 172409 event pairs, 8655 based on Foata normal form. 0/31124 useless extension candidates. Maximal degree in co-relation 65433. Up to 20183 conditions per place. [2022-12-13 15:40:42,339 INFO L137 encePairwiseOnDemand]: 277/286 looper letters, 47 selfloop transitions, 8 changer transitions 0/55 dead transitions. [2022-12-13 15:40:42,339 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 55 transitions, 238 flow [2022-12-13 15:40:42,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 15:40:42,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 15:40:42,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 431 transitions. [2022-12-13 15:40:42,341 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5023310023310024 [2022-12-13 15:40:42,341 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 431 transitions. [2022-12-13 15:40:42,341 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 431 transitions. [2022-12-13 15:40:42,341 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 15:40:42,341 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 431 transitions. [2022-12-13 15:40:42,343 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 143.66666666666666) internal successors, (431), 3 states have internal predecessors, (431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:40:42,344 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 286.0) internal successors, (1144), 4 states have internal predecessors, (1144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:40:42,345 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 286.0) internal successors, (1144), 4 states have internal predecessors, (1144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:40:42,345 INFO L175 Difference]: Start difference. First operand has 43 places, 30 transitions, 72 flow. Second operand 3 states and 431 transitions. [2022-12-13 15:40:42,345 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 55 transitions, 238 flow [2022-12-13 15:40:42,346 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 55 transitions, 232 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 15:40:42,347 INFO L231 Difference]: Finished difference. Result has 44 places, 37 transitions, 130 flow [2022-12-13 15:40:42,347 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=286, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=130, PETRI_PLACES=44, PETRI_TRANSITIONS=37} [2022-12-13 15:40:42,348 INFO L288 CegarLoopForPetriNet]: 53 programPoint places, -9 predicate places. [2022-12-13 15:40:42,348 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 37 transitions, 130 flow [2022-12-13 15:40:42,348 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 15:40:42,348 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 15:40:42,348 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:40:42,348 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 15:40:42,349 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-12-13 15:40:42,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:40:42,349 INFO L85 PathProgramCache]: Analyzing trace with hash 826708387, now seen corresponding path program 1 times [2022-12-13 15:40:42,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:40:42,349 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144422749] [2022-12-13 15:40:42,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:40:42,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:40:42,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:40:42,500 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 15:40:42,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:40:42,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144422749] [2022-12-13 15:40:42,501 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144422749] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:40:42,501 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:40:42,501 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 15:40:42,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929976837] [2022-12-13 15:40:42,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:40:42,502 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 15:40:42,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:40:42,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 15:40:42,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 15:40:42,519 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 286 [2022-12-13 15:40:42,520 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 37 transitions, 130 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 15:40:42,520 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 15:40:42,520 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 286 [2022-12-13 15:40:42,520 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 15:40:44,920 INFO L130 PetriNetUnfolder]: 22607/30404 cut-off events. [2022-12-13 15:40:44,920 INFO L131 PetriNetUnfolder]: For 11593/11593 co-relation queries the response was YES. [2022-12-13 15:40:44,955 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75812 conditions, 30404 events. 22607/30404 cut-off events. For 11593/11593 co-relation queries the response was YES. Maximal size of possible extension queue 936. Compared 158689 event pairs, 6116 based on Foata normal form. 230/30634 useless extension candidates. Maximal degree in co-relation 75807. Up to 13783 conditions per place. [2022-12-13 15:40:45,049 INFO L137 encePairwiseOnDemand]: 277/286 looper letters, 62 selfloop transitions, 9 changer transitions 0/71 dead transitions. [2022-12-13 15:40:45,049 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 71 transitions, 370 flow [2022-12-13 15:40:45,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 15:40:45,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 15:40:45,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 566 transitions. [2022-12-13 15:40:45,052 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.49475524475524474 [2022-12-13 15:40:45,053 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 566 transitions. [2022-12-13 15:40:45,053 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 566 transitions. [2022-12-13 15:40:45,054 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 15:40:45,054 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 566 transitions. [2022-12-13 15:40:45,057 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 141.5) internal successors, (566), 4 states have internal predecessors, (566), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:40:45,062 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 286.0) internal successors, (1430), 5 states have internal predecessors, (1430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:40:45,064 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 286.0) internal successors, (1430), 5 states have internal predecessors, (1430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:40:45,064 INFO L175 Difference]: Start difference. First operand has 44 places, 37 transitions, 130 flow. Second operand 4 states and 566 transitions. [2022-12-13 15:40:45,064 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 71 transitions, 370 flow [2022-12-13 15:40:45,185 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 71 transitions, 344 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 15:40:45,187 INFO L231 Difference]: Finished difference. Result has 48 places, 42 transitions, 182 flow [2022-12-13 15:40:45,187 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=286, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=182, PETRI_PLACES=48, PETRI_TRANSITIONS=42} [2022-12-13 15:40:45,188 INFO L288 CegarLoopForPetriNet]: 53 programPoint places, -5 predicate places. [2022-12-13 15:40:45,188 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 42 transitions, 182 flow [2022-12-13 15:40:45,189 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 15:40:45,189 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 15:40:45,189 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:40:45,189 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 15:40:45,189 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-12-13 15:40:45,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:40:45,190 INFO L85 PathProgramCache]: Analyzing trace with hash 826710738, now seen corresponding path program 1 times [2022-12-13 15:40:45,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:40:45,190 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580867747] [2022-12-13 15:40:45,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:40:45,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:40:45,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:40:45,803 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 15:40:45,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:40:45,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580867747] [2022-12-13 15:40:45,804 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1580867747] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:40:45,804 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:40:45,804 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 15:40:45,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188611309] [2022-12-13 15:40:45,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:40:45,805 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 15:40:45,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:40:45,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 15:40:45,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 15:40:46,115 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 286 [2022-12-13 15:40:46,118 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 42 transitions, 182 flow. Second operand has 7 states, 7 states have (on average 119.71428571428571) internal successors, (838), 7 states have internal predecessors, (838), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:40:46,118 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 15:40:46,118 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 286 [2022-12-13 15:40:46,118 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 15:40:48,683 INFO L130 PetriNetUnfolder]: 18004/25352 cut-off events. [2022-12-13 15:40:48,683 INFO L131 PetriNetUnfolder]: For 15015/15537 co-relation queries the response was YES. [2022-12-13 15:40:48,732 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63956 conditions, 25352 events. 18004/25352 cut-off events. For 15015/15537 co-relation queries the response was YES. Maximal size of possible extension queue 1004. Compared 151171 event pairs, 2981 based on Foata normal form. 1129/26045 useless extension candidates. Maximal degree in co-relation 63949. Up to 16518 conditions per place. [2022-12-13 15:40:48,794 INFO L137 encePairwiseOnDemand]: 279/286 looper letters, 56 selfloop transitions, 6 changer transitions 20/91 dead transitions. [2022-12-13 15:40:48,794 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 91 transitions, 490 flow [2022-12-13 15:40:48,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 15:40:48,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 15:40:48,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 898 transitions. [2022-12-13 15:40:48,797 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4485514485514486 [2022-12-13 15:40:48,797 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 898 transitions. [2022-12-13 15:40:48,797 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 898 transitions. [2022-12-13 15:40:48,798 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 15:40:48,798 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 898 transitions. [2022-12-13 15:40:48,799 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 128.28571428571428) internal successors, (898), 7 states have internal predecessors, (898), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:40:48,802 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 286.0) internal successors, (2288), 8 states have internal predecessors, (2288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:40:48,802 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 286.0) internal successors, (2288), 8 states have internal predecessors, (2288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:40:48,802 INFO L175 Difference]: Start difference. First operand has 48 places, 42 transitions, 182 flow. Second operand 7 states and 898 transitions. [2022-12-13 15:40:48,803 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 91 transitions, 490 flow [2022-12-13 15:40:48,870 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 91 transitions, 485 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 15:40:48,871 INFO L231 Difference]: Finished difference. Result has 55 places, 41 transitions, 192 flow [2022-12-13 15:40:48,871 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=286, PETRI_DIFFERENCE_MINUEND_FLOW=179, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=192, PETRI_PLACES=55, PETRI_TRANSITIONS=41} [2022-12-13 15:40:48,872 INFO L288 CegarLoopForPetriNet]: 53 programPoint places, 2 predicate places. [2022-12-13 15:40:48,872 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 41 transitions, 192 flow [2022-12-13 15:40:48,872 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 119.71428571428571) internal successors, (838), 7 states have internal predecessors, (838), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:40:48,872 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 15:40:48,872 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:40:48,872 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 15:40:48,872 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-12-13 15:40:48,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:40:48,873 INFO L85 PathProgramCache]: Analyzing trace with hash -219601776, now seen corresponding path program 1 times [2022-12-13 15:40:48,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:40:48,873 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96731808] [2022-12-13 15:40:48,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:40:48,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:40:48,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:40:48,965 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 15:40:48,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:40:48,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96731808] [2022-12-13 15:40:48,965 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [96731808] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:40:48,965 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:40:48,965 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 15:40:48,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906169513] [2022-12-13 15:40:48,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:40:48,966 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 15:40:48,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:40:48,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 15:40:48,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 15:40:48,981 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 286 [2022-12-13 15:40:48,982 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 41 transitions, 192 flow. Second operand has 4 states, 4 states have (on average 128.25) internal successors, (513), 4 states have internal predecessors, (513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:40:48,982 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 15:40:48,982 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 286 [2022-12-13 15:40:48,983 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 15:40:51,041 INFO L130 PetriNetUnfolder]: 19110/25827 cut-off events. [2022-12-13 15:40:51,041 INFO L131 PetriNetUnfolder]: For 19741/19741 co-relation queries the response was YES. [2022-12-13 15:40:51,078 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70758 conditions, 25827 events. 19110/25827 cut-off events. For 19741/19741 co-relation queries the response was YES. Maximal size of possible extension queue 779. Compared 136851 event pairs, 4769 based on Foata normal form. 40/25867 useless extension candidates. Maximal degree in co-relation 70748. Up to 15819 conditions per place. [2022-12-13 15:40:51,138 INFO L137 encePairwiseOnDemand]: 277/286 looper letters, 71 selfloop transitions, 18 changer transitions 0/89 dead transitions. [2022-12-13 15:40:51,139 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 89 transitions, 558 flow [2022-12-13 15:40:51,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 15:40:51,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 15:40:51,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 578 transitions. [2022-12-13 15:40:51,141 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5052447552447552 [2022-12-13 15:40:51,141 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 578 transitions. [2022-12-13 15:40:51,141 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 578 transitions. [2022-12-13 15:40:51,141 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 15:40:51,141 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 578 transitions. [2022-12-13 15:40:51,142 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 144.5) internal successors, (578), 4 states have internal predecessors, (578), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:40:51,143 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 286.0) internal successors, (1430), 5 states have internal predecessors, (1430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:40:51,144 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 286.0) internal successors, (1430), 5 states have internal predecessors, (1430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:40:51,144 INFO L175 Difference]: Start difference. First operand has 55 places, 41 transitions, 192 flow. Second operand 4 states and 578 transitions. [2022-12-13 15:40:51,144 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 89 transitions, 558 flow [2022-12-13 15:40:51,257 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 89 transitions, 526 flow, removed 3 selfloop flow, removed 6 redundant places. [2022-12-13 15:40:51,258 INFO L231 Difference]: Finished difference. Result has 54 places, 52 transitions, 340 flow [2022-12-13 15:40:51,258 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=286, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=340, PETRI_PLACES=54, PETRI_TRANSITIONS=52} [2022-12-13 15:40:51,259 INFO L288 CegarLoopForPetriNet]: 53 programPoint places, 1 predicate places. [2022-12-13 15:40:51,259 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 52 transitions, 340 flow [2022-12-13 15:40:51,259 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 128.25) internal successors, (513), 4 states have internal predecessors, (513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:40:51,259 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 15:40:51,259 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:40:51,259 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 15:40:51,259 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-12-13 15:40:51,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:40:51,260 INFO L85 PathProgramCache]: Analyzing trace with hash 1782338514, now seen corresponding path program 1 times [2022-12-13 15:40:51,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:40:51,260 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220796077] [2022-12-13 15:40:51,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:40:51,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:40:51,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:40:51,387 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 15:40:51,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:40:51,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220796077] [2022-12-13 15:40:51,387 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220796077] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:40:51,388 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:40:51,388 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 15:40:51,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915464192] [2022-12-13 15:40:51,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:40:51,388 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 15:40:51,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:40:51,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 15:40:51,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 15:40:51,397 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 286 [2022-12-13 15:40:51,398 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 52 transitions, 340 flow. Second operand has 4 states, 4 states have (on average 132.25) internal successors, (529), 4 states have internal predecessors, (529), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:40:51,398 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 15:40:51,398 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 286 [2022-12-13 15:40:51,398 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 15:40:53,277 INFO L130 PetriNetUnfolder]: 11061/16185 cut-off events. [2022-12-13 15:40:53,277 INFO L131 PetriNetUnfolder]: For 19171/19987 co-relation queries the response was YES. [2022-12-13 15:40:53,312 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43323 conditions, 16185 events. 11061/16185 cut-off events. For 19171/19987 co-relation queries the response was YES. Maximal size of possible extension queue 745. Compared 100341 event pairs, 2159 based on Foata normal form. 1247/17039 useless extension candidates. Maximal degree in co-relation 43312. Up to 11185 conditions per place. [2022-12-13 15:40:53,363 INFO L137 encePairwiseOnDemand]: 279/286 looper letters, 82 selfloop transitions, 10 changer transitions 2/111 dead transitions. [2022-12-13 15:40:53,363 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 111 transitions, 781 flow [2022-12-13 15:40:53,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 15:40:53,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 15:40:53,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 719 transitions. [2022-12-13 15:40:53,366 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5027972027972027 [2022-12-13 15:40:53,366 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 719 transitions. [2022-12-13 15:40:53,366 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 719 transitions. [2022-12-13 15:40:53,367 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 15:40:53,367 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 719 transitions. [2022-12-13 15:40:53,368 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 143.8) internal successors, (719), 5 states have internal predecessors, (719), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:40:53,370 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 286.0) internal successors, (1716), 6 states have internal predecessors, (1716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:40:53,370 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 286.0) internal successors, (1716), 6 states have internal predecessors, (1716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:40:53,371 INFO L175 Difference]: Start difference. First operand has 54 places, 52 transitions, 340 flow. Second operand 5 states and 719 transitions. [2022-12-13 15:40:53,371 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 111 transitions, 781 flow [2022-12-13 15:40:53,410 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 111 transitions, 781 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-13 15:40:53,411 INFO L231 Difference]: Finished difference. Result has 61 places, 61 transitions, 415 flow [2022-12-13 15:40:53,411 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=286, PETRI_DIFFERENCE_MINUEND_FLOW=340, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=415, PETRI_PLACES=61, PETRI_TRANSITIONS=61} [2022-12-13 15:40:53,412 INFO L288 CegarLoopForPetriNet]: 53 programPoint places, 8 predicate places. [2022-12-13 15:40:53,412 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 61 transitions, 415 flow [2022-12-13 15:40:53,412 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 132.25) internal successors, (529), 4 states have internal predecessors, (529), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:40:53,412 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 15:40:53,412 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:40:53,412 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 15:40:53,412 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-12-13 15:40:53,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:40:53,413 INFO L85 PathProgramCache]: Analyzing trace with hash -1990135694, now seen corresponding path program 1 times [2022-12-13 15:40:53,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:40:53,413 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880795589] [2022-12-13 15:40:53,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:40:53,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:40:53,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:40:53,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 15:40:53,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:40:53,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880795589] [2022-12-13 15:40:53,562 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880795589] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:40:53,562 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:40:53,562 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 15:40:53,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839933252] [2022-12-13 15:40:53,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:40:53,562 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 15:40:53,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:40:53,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 15:40:53,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 15:40:53,578 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 286 [2022-12-13 15:40:53,579 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 61 transitions, 415 flow. Second operand has 5 states, 5 states have (on average 132.2) internal successors, (661), 5 states have internal predecessors, (661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:40:53,579 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 15:40:53,579 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 286 [2022-12-13 15:40:53,580 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 15:40:54,880 INFO L130 PetriNetUnfolder]: 7335/11158 cut-off events. [2022-12-13 15:40:54,880 INFO L131 PetriNetUnfolder]: For 16192/16744 co-relation queries the response was YES. [2022-12-13 15:40:54,906 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36154 conditions, 11158 events. 7335/11158 cut-off events. For 16192/16744 co-relation queries the response was YES. Maximal size of possible extension queue 522. Compared 70417 event pairs, 975 based on Foata normal form. 817/11690 useless extension candidates. Maximal degree in co-relation 36139. Up to 3327 conditions per place. [2022-12-13 15:40:54,934 INFO L137 encePairwiseOnDemand]: 279/286 looper letters, 113 selfloop transitions, 19 changer transitions 0/148 dead transitions. [2022-12-13 15:40:54,934 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 148 transitions, 1107 flow [2022-12-13 15:40:54,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 15:40:54,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 15:40:54,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1008 transitions. [2022-12-13 15:40:54,937 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5034965034965035 [2022-12-13 15:40:54,937 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1008 transitions. [2022-12-13 15:40:54,937 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1008 transitions. [2022-12-13 15:40:54,937 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 15:40:54,937 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1008 transitions. [2022-12-13 15:40:54,939 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 144.0) internal successors, (1008), 7 states have internal predecessors, (1008), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:40:54,940 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 286.0) internal successors, (2288), 8 states have internal predecessors, (2288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:40:54,941 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 286.0) internal successors, (2288), 8 states have internal predecessors, (2288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:40:54,941 INFO L175 Difference]: Start difference. First operand has 61 places, 61 transitions, 415 flow. Second operand 7 states and 1008 transitions. [2022-12-13 15:40:54,941 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 148 transitions, 1107 flow [2022-12-13 15:40:55,002 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 148 transitions, 1102 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 15:40:55,003 INFO L231 Difference]: Finished difference. Result has 69 places, 68 transitions, 524 flow [2022-12-13 15:40:55,003 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=286, PETRI_DIFFERENCE_MINUEND_FLOW=390, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=524, PETRI_PLACES=69, PETRI_TRANSITIONS=68} [2022-12-13 15:40:55,003 INFO L288 CegarLoopForPetriNet]: 53 programPoint places, 16 predicate places. [2022-12-13 15:40:55,004 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 68 transitions, 524 flow [2022-12-13 15:40:55,004 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 132.2) internal successors, (661), 5 states have internal predecessors, (661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:40:55,004 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 15:40:55,004 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 15:40:55,004 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 15:40:55,004 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-12-13 15:40:55,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:40:55,004 INFO L85 PathProgramCache]: Analyzing trace with hash 172834070, now seen corresponding path program 1 times [2022-12-13 15:40:55,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:40:55,004 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565904786] [2022-12-13 15:40:55,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:40:55,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:40:55,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:40:55,136 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 15:40:55,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:40:55,137 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565904786] [2022-12-13 15:40:55,137 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565904786] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:40:55,137 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:40:55,137 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 15:40:55,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030918435] [2022-12-13 15:40:55,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:40:55,138 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 15:40:55,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:40:55,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 15:40:55,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-13 15:40:55,152 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 286 [2022-12-13 15:40:55,153 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 68 transitions, 524 flow. Second operand has 6 states, 6 states have (on average 132.0) internal successors, (792), 6 states have internal predecessors, (792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:40:55,153 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 15:40:55,153 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 286 [2022-12-13 15:40:55,154 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 15:40:56,439 INFO L130 PetriNetUnfolder]: 6353/9641 cut-off events. [2022-12-13 15:40:56,439 INFO L131 PetriNetUnfolder]: For 21047/21502 co-relation queries the response was YES. [2022-12-13 15:40:56,463 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35705 conditions, 9641 events. 6353/9641 cut-off events. For 21047/21502 co-relation queries the response was YES. Maximal size of possible extension queue 514. Compared 60000 event pairs, 782 based on Foata normal form. 360/9732 useless extension candidates. Maximal degree in co-relation 35687. Up to 3013 conditions per place. [2022-12-13 15:40:56,485 INFO L137 encePairwiseOnDemand]: 279/286 looper letters, 123 selfloop transitions, 28 changer transitions 12/179 dead transitions. [2022-12-13 15:40:56,485 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 179 transitions, 1429 flow [2022-12-13 15:40:56,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 15:40:56,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 15:40:56,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1295 transitions. [2022-12-13 15:40:56,488 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5031080031080031 [2022-12-13 15:40:56,488 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1295 transitions. [2022-12-13 15:40:56,488 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1295 transitions. [2022-12-13 15:40:56,489 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 15:40:56,489 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1295 transitions. [2022-12-13 15:40:56,490 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 143.88888888888889) internal successors, (1295), 9 states have internal predecessors, (1295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:40:56,493 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 286.0) internal successors, (2860), 10 states have internal predecessors, (2860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:40:56,493 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 286.0) internal successors, (2860), 10 states have internal predecessors, (2860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:40:56,493 INFO L175 Difference]: Start difference. First operand has 69 places, 68 transitions, 524 flow. Second operand 9 states and 1295 transitions. [2022-12-13 15:40:56,493 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 179 transitions, 1429 flow [2022-12-13 15:40:57,028 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 179 transitions, 1340 flow, removed 17 selfloop flow, removed 4 redundant places. [2022-12-13 15:40:57,029 INFO L231 Difference]: Finished difference. Result has 76 places, 75 transitions, 616 flow [2022-12-13 15:40:57,030 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=286, PETRI_DIFFERENCE_MINUEND_FLOW=438, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=616, PETRI_PLACES=76, PETRI_TRANSITIONS=75} [2022-12-13 15:40:57,030 INFO L288 CegarLoopForPetriNet]: 53 programPoint places, 23 predicate places. [2022-12-13 15:40:57,030 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 75 transitions, 616 flow [2022-12-13 15:40:57,030 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 132.0) internal successors, (792), 6 states have internal predecessors, (792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:40:57,030 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 15:40:57,030 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 15:40:57,030 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 15:40:57,031 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-12-13 15:40:57,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:40:57,031 INFO L85 PathProgramCache]: Analyzing trace with hash 478934742, now seen corresponding path program 1 times [2022-12-13 15:40:57,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:40:57,031 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196646152] [2022-12-13 15:40:57,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:40:57,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:40:57,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:40:57,514 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 15:40:57,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:40:57,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196646152] [2022-12-13 15:40:57,515 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196646152] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:40:57,515 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:40:57,515 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 15:40:57,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183022212] [2022-12-13 15:40:57,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:40:57,515 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 15:40:57,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:40:57,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 15:40:57,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-13 15:40:57,560 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 286 [2022-12-13 15:40:57,561 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 75 transitions, 616 flow. Second operand has 7 states, 7 states have (on average 133.0) internal successors, (931), 7 states have internal predecessors, (931), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:40:57,561 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 15:40:57,561 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 286 [2022-12-13 15:40:57,561 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 15:40:58,774 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([444] L826-->L842: Formula: (let ((.cse5 (= (mod v_~a$r_buff1_thd4~0_56 256) 0)) (.cse7 (= (mod v_~a$r_buff0_thd4~0_58 256) 0))) (let ((.cse9 (not .cse7)) (.cse11 (= (mod v_~a$w_buff0_used~0_140 256) 0)) (.cse10 (and .cse7 (= (mod v_~a$w_buff1_used~0_131 256) 0))) (.cse8 (and .cse7 .cse5))) (let ((.cse1 (or .cse11 .cse10 .cse8)) (.cse2 (and .cse9 (not .cse11))) (.cse4 (= (mod v_~a$w_buff1_used~0_130 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_32 256) 0))) (.cse6 (= (mod v_~a$w_buff0_used~0_139 256) 0))) (and (= v_~weak$$choice0~0_7 |v_P3Thread1of1ForFork1_#t~nondet3_1|) (= v_~a$w_buff1~0_48 v_~a$w_buff1~0_47) (= (ite .cse0 v_~a$w_buff0_used~0_140 (ite .cse1 v_~a$w_buff0_used~0_140 (ite .cse2 0 v_~a$w_buff0_used~0_140))) v_~a$w_buff0_used~0_139) (= v_~a$r_buff1_thd4~0_55 (ite .cse0 v_~a$r_buff1_thd4~0_56 (ite (let ((.cse3 (= (mod v_~a$r_buff0_thd4~0_57 256) 0))) (or (and .cse3 .cse4) (and .cse3 .cse5) .cse6)) v_~a$r_buff1_thd4~0_56 0))) (= v_~a~0_90 v_~a$mem_tmp~0_22) (= v_~weak$$choice2~0_32 |v_P3Thread1of1ForFork1_#t~nondet4_1|) (= v_~a$w_buff0~0_51 v_~a$w_buff0~0_50) (= v_~a~0_88 (ite .cse0 v_~a$mem_tmp~0_22 v_~__unbuffered_p3_EBX~0_14)) (= (ite .cse1 v_~a~0_90 (ite .cse2 v_~a$w_buff0~0_51 v_~a$w_buff1~0_48)) v_~__unbuffered_p3_EBX~0_14) (= v_~a$flush_delayed~0_35 0) (= v_~a$r_buff0_thd4~0_57 (ite .cse0 v_~a$r_buff0_thd4~0_58 (ite (or (and .cse7 .cse4) .cse8 .cse6) v_~a$r_buff0_thd4~0_58 (ite (and (not .cse6) .cse9) 0 v_~a$r_buff0_thd4~0_58)))) (= v_~a$w_buff1_used~0_130 (ite .cse0 v_~a$w_buff1_used~0_131 (ite (or .cse10 .cse8 .cse6) v_~a$w_buff1_used~0_131 0))))))) InVars {~a~0=v_~a~0_90, ~a$w_buff1~0=v_~a$w_buff1~0_48, ~a$w_buff0~0=v_~a$w_buff0~0_51, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_56, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_140, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_131, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_58, P3Thread1of1ForFork1_#t~nondet3=|v_P3Thread1of1ForFork1_#t~nondet3_1|, P3Thread1of1ForFork1_#t~nondet4=|v_P3Thread1of1ForFork1_#t~nondet4_1|} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_55, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_139, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_14, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_57, ~a~0=v_~a~0_88, ~a$mem_tmp~0=v_~a$mem_tmp~0_22, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~a$w_buff1~0=v_~a$w_buff1~0_47, ~a$flush_delayed~0=v_~a$flush_delayed~0_35, ~a$w_buff0~0=v_~a$w_buff0~0_50, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_130, ~weak$$choice2~0=v_~weak$$choice2~0_32} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork1_#t~nondet3, P3Thread1of1ForFork1_#t~nondet4][87], [Black: 190#(and (not (= |ULTIMATE.start_main_~#t468~0#1.base| |ULTIMATE.start_main_~#t465~0#1.base|)) (not (= |ULTIMATE.start_main_~#t467~0#1.base| |ULTIMATE.start_main_~#t465~0#1.base|)) (not (= |ULTIMATE.start_main_~#t466~0#1.base| |ULTIMATE.start_main_~#t465~0#1.base|)) (not (= |ULTIMATE.start_main_~#t468~0#1.base| |ULTIMATE.start_main_~#t466~0#1.base|)) (not (= ~__unbuffered_p3_EAX~0 1)) (= |ULTIMATE.start_main_old_#valid#1| (store (store (store (store |#valid| |ULTIMATE.start_main_~#t465~0#1.base| 0) |ULTIMATE.start_main_~#t467~0#1.base| 0) |ULTIMATE.start_main_~#t468~0#1.base| 0) |ULTIMATE.start_main_~#t466~0#1.base| 0)) (not (= |ULTIMATE.start_main_~#t467~0#1.base| |ULTIMATE.start_main_~#t466~0#1.base|)) (not (= |ULTIMATE.start_main_~#t468~0#1.base| |ULTIMATE.start_main_~#t467~0#1.base|))), 164#true, 229#(<= ~__unbuffered_cnt~0 1), 88#P0EXITtrue, Black: 198#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), Black: 197#(= ~x~0 0), 177#true, Black: 208#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 205#(= ~__unbuffered_cnt~0 0), Black: 206#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), 250#(and (not (= ~a$w_buff0~0 0)) (= ~a$r_buff1_thd4~0 0) (= ~a$r_buff1_thd2~0 0) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~a~0 0)) (= ~a$r_buff0_thd4~0 0)), 46#L873-3true, P3Thread1of1ForFork1InUse, P1Thread1of1ForFork0InUse, Black: 221#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), P2Thread1of1ForFork3InUse, Black: 217#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), P0Thread1of1ForFork2InUse, 9#L842true, Black: 231#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 230#(<= ~__unbuffered_cnt~0 2), Black: 173#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), 40#L793true, Black: 237#(and (<= ~__unbuffered_cnt~0 2) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 4#L806true, 195#true, Black: 179#(= ~__unbuffered_p3_EAX~0 0), Black: 180#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), 216#(<= ~__unbuffered_cnt~0 1)]) [2022-12-13 15:40:58,774 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is not cut-off event [2022-12-13 15:40:58,775 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is not cut-off event [2022-12-13 15:40:58,775 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is not cut-off event [2022-12-13 15:40:58,775 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is not cut-off event [2022-12-13 15:40:58,960 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([444] L826-->L842: Formula: (let ((.cse5 (= (mod v_~a$r_buff1_thd4~0_56 256) 0)) (.cse7 (= (mod v_~a$r_buff0_thd4~0_58 256) 0))) (let ((.cse9 (not .cse7)) (.cse11 (= (mod v_~a$w_buff0_used~0_140 256) 0)) (.cse10 (and .cse7 (= (mod v_~a$w_buff1_used~0_131 256) 0))) (.cse8 (and .cse7 .cse5))) (let ((.cse1 (or .cse11 .cse10 .cse8)) (.cse2 (and .cse9 (not .cse11))) (.cse4 (= (mod v_~a$w_buff1_used~0_130 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_32 256) 0))) (.cse6 (= (mod v_~a$w_buff0_used~0_139 256) 0))) (and (= v_~weak$$choice0~0_7 |v_P3Thread1of1ForFork1_#t~nondet3_1|) (= v_~a$w_buff1~0_48 v_~a$w_buff1~0_47) (= (ite .cse0 v_~a$w_buff0_used~0_140 (ite .cse1 v_~a$w_buff0_used~0_140 (ite .cse2 0 v_~a$w_buff0_used~0_140))) v_~a$w_buff0_used~0_139) (= v_~a$r_buff1_thd4~0_55 (ite .cse0 v_~a$r_buff1_thd4~0_56 (ite (let ((.cse3 (= (mod v_~a$r_buff0_thd4~0_57 256) 0))) (or (and .cse3 .cse4) (and .cse3 .cse5) .cse6)) v_~a$r_buff1_thd4~0_56 0))) (= v_~a~0_90 v_~a$mem_tmp~0_22) (= v_~weak$$choice2~0_32 |v_P3Thread1of1ForFork1_#t~nondet4_1|) (= v_~a$w_buff0~0_51 v_~a$w_buff0~0_50) (= v_~a~0_88 (ite .cse0 v_~a$mem_tmp~0_22 v_~__unbuffered_p3_EBX~0_14)) (= (ite .cse1 v_~a~0_90 (ite .cse2 v_~a$w_buff0~0_51 v_~a$w_buff1~0_48)) v_~__unbuffered_p3_EBX~0_14) (= v_~a$flush_delayed~0_35 0) (= v_~a$r_buff0_thd4~0_57 (ite .cse0 v_~a$r_buff0_thd4~0_58 (ite (or (and .cse7 .cse4) .cse8 .cse6) v_~a$r_buff0_thd4~0_58 (ite (and (not .cse6) .cse9) 0 v_~a$r_buff0_thd4~0_58)))) (= v_~a$w_buff1_used~0_130 (ite .cse0 v_~a$w_buff1_used~0_131 (ite (or .cse10 .cse8 .cse6) v_~a$w_buff1_used~0_131 0))))))) InVars {~a~0=v_~a~0_90, ~a$w_buff1~0=v_~a$w_buff1~0_48, ~a$w_buff0~0=v_~a$w_buff0~0_51, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_56, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_140, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_131, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_58, P3Thread1of1ForFork1_#t~nondet3=|v_P3Thread1of1ForFork1_#t~nondet3_1|, P3Thread1of1ForFork1_#t~nondet4=|v_P3Thread1of1ForFork1_#t~nondet4_1|} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_55, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_139, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_14, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_57, ~a~0=v_~a~0_88, ~a$mem_tmp~0=v_~a$mem_tmp~0_22, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~a$w_buff1~0=v_~a$w_buff1~0_47, ~a$flush_delayed~0=v_~a$flush_delayed~0_35, ~a$w_buff0~0=v_~a$w_buff0~0_50, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_130, ~weak$$choice2~0=v_~weak$$choice2~0_32} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork1_#t~nondet3, P3Thread1of1ForFork1_#t~nondet4][87], [Black: 190#(and (not (= |ULTIMATE.start_main_~#t468~0#1.base| |ULTIMATE.start_main_~#t465~0#1.base|)) (not (= |ULTIMATE.start_main_~#t467~0#1.base| |ULTIMATE.start_main_~#t465~0#1.base|)) (not (= |ULTIMATE.start_main_~#t466~0#1.base| |ULTIMATE.start_main_~#t465~0#1.base|)) (not (= |ULTIMATE.start_main_~#t468~0#1.base| |ULTIMATE.start_main_~#t466~0#1.base|)) (not (= ~__unbuffered_p3_EAX~0 1)) (= |ULTIMATE.start_main_old_#valid#1| (store (store (store (store |#valid| |ULTIMATE.start_main_~#t465~0#1.base| 0) |ULTIMATE.start_main_~#t467~0#1.base| 0) |ULTIMATE.start_main_~#t468~0#1.base| 0) |ULTIMATE.start_main_~#t466~0#1.base| 0)) (not (= |ULTIMATE.start_main_~#t467~0#1.base| |ULTIMATE.start_main_~#t466~0#1.base|)) (not (= |ULTIMATE.start_main_~#t468~0#1.base| |ULTIMATE.start_main_~#t467~0#1.base|))), 164#true, 88#P0EXITtrue, 47#P1EXITtrue, Black: 198#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), Black: 197#(= ~x~0 0), 177#true, Black: 208#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 205#(= ~__unbuffered_cnt~0 0), Black: 206#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), 250#(and (not (= ~a$w_buff0~0 0)) (= ~a$r_buff1_thd4~0 0) (= ~a$r_buff1_thd2~0 0) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~a~0 0)) (= ~a$r_buff0_thd4~0 0)), 46#L873-3true, P3Thread1of1ForFork1InUse, P1Thread1of1ForFork0InUse, Black: 221#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), P2Thread1of1ForFork3InUse, Black: 216#(<= ~__unbuffered_cnt~0 1), Black: 217#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), P0Thread1of1ForFork2InUse, 9#L842true, Black: 231#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 173#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), Black: 237#(and (<= ~__unbuffered_cnt~0 2) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 4#L806true, 195#true, Black: 179#(= ~__unbuffered_p3_EAX~0 0), Black: 180#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), 230#(<= ~__unbuffered_cnt~0 2)]) [2022-12-13 15:40:58,961 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is not cut-off event [2022-12-13 15:40:58,961 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is not cut-off event [2022-12-13 15:40:58,961 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is not cut-off event [2022-12-13 15:40:58,961 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is not cut-off event [2022-12-13 15:40:58,961 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([444] L826-->L842: Formula: (let ((.cse5 (= (mod v_~a$r_buff1_thd4~0_56 256) 0)) (.cse7 (= (mod v_~a$r_buff0_thd4~0_58 256) 0))) (let ((.cse9 (not .cse7)) (.cse11 (= (mod v_~a$w_buff0_used~0_140 256) 0)) (.cse10 (and .cse7 (= (mod v_~a$w_buff1_used~0_131 256) 0))) (.cse8 (and .cse7 .cse5))) (let ((.cse1 (or .cse11 .cse10 .cse8)) (.cse2 (and .cse9 (not .cse11))) (.cse4 (= (mod v_~a$w_buff1_used~0_130 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_32 256) 0))) (.cse6 (= (mod v_~a$w_buff0_used~0_139 256) 0))) (and (= v_~weak$$choice0~0_7 |v_P3Thread1of1ForFork1_#t~nondet3_1|) (= v_~a$w_buff1~0_48 v_~a$w_buff1~0_47) (= (ite .cse0 v_~a$w_buff0_used~0_140 (ite .cse1 v_~a$w_buff0_used~0_140 (ite .cse2 0 v_~a$w_buff0_used~0_140))) v_~a$w_buff0_used~0_139) (= v_~a$r_buff1_thd4~0_55 (ite .cse0 v_~a$r_buff1_thd4~0_56 (ite (let ((.cse3 (= (mod v_~a$r_buff0_thd4~0_57 256) 0))) (or (and .cse3 .cse4) (and .cse3 .cse5) .cse6)) v_~a$r_buff1_thd4~0_56 0))) (= v_~a~0_90 v_~a$mem_tmp~0_22) (= v_~weak$$choice2~0_32 |v_P3Thread1of1ForFork1_#t~nondet4_1|) (= v_~a$w_buff0~0_51 v_~a$w_buff0~0_50) (= v_~a~0_88 (ite .cse0 v_~a$mem_tmp~0_22 v_~__unbuffered_p3_EBX~0_14)) (= (ite .cse1 v_~a~0_90 (ite .cse2 v_~a$w_buff0~0_51 v_~a$w_buff1~0_48)) v_~__unbuffered_p3_EBX~0_14) (= v_~a$flush_delayed~0_35 0) (= v_~a$r_buff0_thd4~0_57 (ite .cse0 v_~a$r_buff0_thd4~0_58 (ite (or (and .cse7 .cse4) .cse8 .cse6) v_~a$r_buff0_thd4~0_58 (ite (and (not .cse6) .cse9) 0 v_~a$r_buff0_thd4~0_58)))) (= v_~a$w_buff1_used~0_130 (ite .cse0 v_~a$w_buff1_used~0_131 (ite (or .cse10 .cse8 .cse6) v_~a$w_buff1_used~0_131 0))))))) InVars {~a~0=v_~a~0_90, ~a$w_buff1~0=v_~a$w_buff1~0_48, ~a$w_buff0~0=v_~a$w_buff0~0_51, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_56, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_140, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_131, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_58, P3Thread1of1ForFork1_#t~nondet3=|v_P3Thread1of1ForFork1_#t~nondet3_1|, P3Thread1of1ForFork1_#t~nondet4=|v_P3Thread1of1ForFork1_#t~nondet4_1|} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_55, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_139, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_14, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_57, ~a~0=v_~a~0_88, ~a$mem_tmp~0=v_~a$mem_tmp~0_22, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~a$w_buff1~0=v_~a$w_buff1~0_47, ~a$flush_delayed~0=v_~a$flush_delayed~0_35, ~a$w_buff0~0=v_~a$w_buff0~0_50, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_130, ~weak$$choice2~0=v_~weak$$choice2~0_32} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork1_#t~nondet3, P3Thread1of1ForFork1_#t~nondet4][87], [Black: 190#(and (not (= |ULTIMATE.start_main_~#t468~0#1.base| |ULTIMATE.start_main_~#t465~0#1.base|)) (not (= |ULTIMATE.start_main_~#t467~0#1.base| |ULTIMATE.start_main_~#t465~0#1.base|)) (not (= |ULTIMATE.start_main_~#t466~0#1.base| |ULTIMATE.start_main_~#t465~0#1.base|)) (not (= |ULTIMATE.start_main_~#t468~0#1.base| |ULTIMATE.start_main_~#t466~0#1.base|)) (not (= ~__unbuffered_p3_EAX~0 1)) (= |ULTIMATE.start_main_old_#valid#1| (store (store (store (store |#valid| |ULTIMATE.start_main_~#t465~0#1.base| 0) |ULTIMATE.start_main_~#t467~0#1.base| 0) |ULTIMATE.start_main_~#t468~0#1.base| 0) |ULTIMATE.start_main_~#t466~0#1.base| 0)) (not (= |ULTIMATE.start_main_~#t467~0#1.base| |ULTIMATE.start_main_~#t466~0#1.base|)) (not (= |ULTIMATE.start_main_~#t468~0#1.base| |ULTIMATE.start_main_~#t467~0#1.base|))), 164#true, 88#P0EXITtrue, Black: 198#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), Black: 197#(= ~x~0 0), 177#true, Black: 208#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 205#(= ~__unbuffered_cnt~0 0), Black: 206#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), 250#(and (not (= ~a$w_buff0~0 0)) (= ~a$r_buff1_thd4~0 0) (= ~a$r_buff1_thd2~0 0) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~a~0 0)) (= ~a$r_buff0_thd4~0 0)), P3Thread1of1ForFork1InUse, P1Thread1of1ForFork0InUse, P2Thread1of1ForFork3InUse, Black: 216#(<= ~__unbuffered_cnt~0 1), Black: 217#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), 9#L842true, P0Thread1of1ForFork2InUse, 235#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 231#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 230#(<= ~__unbuffered_cnt~0 2), Black: 173#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), 40#L793true, Black: 237#(and (<= ~__unbuffered_cnt~0 2) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 4#L806true, 195#true, 85#L2true, Black: 179#(= ~__unbuffered_p3_EAX~0 0), 221#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 180#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)))]) [2022-12-13 15:40:58,961 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is not cut-off event [2022-12-13 15:40:58,961 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is not cut-off event [2022-12-13 15:40:58,961 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is not cut-off event [2022-12-13 15:40:58,962 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is not cut-off event [2022-12-13 15:40:59,131 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([444] L826-->L842: Formula: (let ((.cse5 (= (mod v_~a$r_buff1_thd4~0_56 256) 0)) (.cse7 (= (mod v_~a$r_buff0_thd4~0_58 256) 0))) (let ((.cse9 (not .cse7)) (.cse11 (= (mod v_~a$w_buff0_used~0_140 256) 0)) (.cse10 (and .cse7 (= (mod v_~a$w_buff1_used~0_131 256) 0))) (.cse8 (and .cse7 .cse5))) (let ((.cse1 (or .cse11 .cse10 .cse8)) (.cse2 (and .cse9 (not .cse11))) (.cse4 (= (mod v_~a$w_buff1_used~0_130 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_32 256) 0))) (.cse6 (= (mod v_~a$w_buff0_used~0_139 256) 0))) (and (= v_~weak$$choice0~0_7 |v_P3Thread1of1ForFork1_#t~nondet3_1|) (= v_~a$w_buff1~0_48 v_~a$w_buff1~0_47) (= (ite .cse0 v_~a$w_buff0_used~0_140 (ite .cse1 v_~a$w_buff0_used~0_140 (ite .cse2 0 v_~a$w_buff0_used~0_140))) v_~a$w_buff0_used~0_139) (= v_~a$r_buff1_thd4~0_55 (ite .cse0 v_~a$r_buff1_thd4~0_56 (ite (let ((.cse3 (= (mod v_~a$r_buff0_thd4~0_57 256) 0))) (or (and .cse3 .cse4) (and .cse3 .cse5) .cse6)) v_~a$r_buff1_thd4~0_56 0))) (= v_~a~0_90 v_~a$mem_tmp~0_22) (= v_~weak$$choice2~0_32 |v_P3Thread1of1ForFork1_#t~nondet4_1|) (= v_~a$w_buff0~0_51 v_~a$w_buff0~0_50) (= v_~a~0_88 (ite .cse0 v_~a$mem_tmp~0_22 v_~__unbuffered_p3_EBX~0_14)) (= (ite .cse1 v_~a~0_90 (ite .cse2 v_~a$w_buff0~0_51 v_~a$w_buff1~0_48)) v_~__unbuffered_p3_EBX~0_14) (= v_~a$flush_delayed~0_35 0) (= v_~a$r_buff0_thd4~0_57 (ite .cse0 v_~a$r_buff0_thd4~0_58 (ite (or (and .cse7 .cse4) .cse8 .cse6) v_~a$r_buff0_thd4~0_58 (ite (and (not .cse6) .cse9) 0 v_~a$r_buff0_thd4~0_58)))) (= v_~a$w_buff1_used~0_130 (ite .cse0 v_~a$w_buff1_used~0_131 (ite (or .cse10 .cse8 .cse6) v_~a$w_buff1_used~0_131 0))))))) InVars {~a~0=v_~a~0_90, ~a$w_buff1~0=v_~a$w_buff1~0_48, ~a$w_buff0~0=v_~a$w_buff0~0_51, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_56, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_140, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_131, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_58, P3Thread1of1ForFork1_#t~nondet3=|v_P3Thread1of1ForFork1_#t~nondet3_1|, P3Thread1of1ForFork1_#t~nondet4=|v_P3Thread1of1ForFork1_#t~nondet4_1|} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_55, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_139, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_14, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_57, ~a~0=v_~a~0_88, ~a$mem_tmp~0=v_~a$mem_tmp~0_22, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~a$w_buff1~0=v_~a$w_buff1~0_47, ~a$flush_delayed~0=v_~a$flush_delayed~0_35, ~a$w_buff0~0=v_~a$w_buff0~0_50, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_130, ~weak$$choice2~0=v_~weak$$choice2~0_32} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork1_#t~nondet3, P3Thread1of1ForFork1_#t~nondet4][87], [Black: 190#(and (not (= |ULTIMATE.start_main_~#t468~0#1.base| |ULTIMATE.start_main_~#t465~0#1.base|)) (not (= |ULTIMATE.start_main_~#t467~0#1.base| |ULTIMATE.start_main_~#t465~0#1.base|)) (not (= |ULTIMATE.start_main_~#t466~0#1.base| |ULTIMATE.start_main_~#t465~0#1.base|)) (not (= |ULTIMATE.start_main_~#t468~0#1.base| |ULTIMATE.start_main_~#t466~0#1.base|)) (not (= ~__unbuffered_p3_EAX~0 1)) (= |ULTIMATE.start_main_old_#valid#1| (store (store (store (store |#valid| |ULTIMATE.start_main_~#t465~0#1.base| 0) |ULTIMATE.start_main_~#t467~0#1.base| 0) |ULTIMATE.start_main_~#t468~0#1.base| 0) |ULTIMATE.start_main_~#t466~0#1.base| 0)) (not (= |ULTIMATE.start_main_~#t467~0#1.base| |ULTIMATE.start_main_~#t466~0#1.base|)) (not (= |ULTIMATE.start_main_~#t468~0#1.base| |ULTIMATE.start_main_~#t467~0#1.base|))), 164#true, 88#P0EXITtrue, 47#P1EXITtrue, Black: 198#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), Black: 197#(= ~x~0 0), 237#(and (<= ~__unbuffered_cnt~0 2) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 177#true, Black: 208#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 205#(= ~__unbuffered_cnt~0 0), Black: 206#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), 250#(and (not (= ~a$w_buff0~0 0)) (= ~a$r_buff1_thd4~0 0) (= ~a$r_buff1_thd2~0 0) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~a~0 0)) (= ~a$r_buff0_thd4~0 0)), P3Thread1of1ForFork1InUse, P1Thread1of1ForFork0InUse, Black: 221#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 216#(<= ~__unbuffered_cnt~0 1), P2Thread1of1ForFork3InUse, Black: 217#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), P0Thread1of1ForFork2InUse, 9#L842true, Black: 231#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 173#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), Black: 230#(<= ~__unbuffered_cnt~0 2), 4#L806true, 195#true, 85#L2true, Black: 179#(= ~__unbuffered_p3_EAX~0 0), Black: 180#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)))]) [2022-12-13 15:40:59,131 INFO L383 tUnfolder$Statistics]: this new event has 22 ancestors and is not cut-off event [2022-12-13 15:40:59,131 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is not cut-off event [2022-12-13 15:40:59,131 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is not cut-off event [2022-12-13 15:40:59,131 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is not cut-off event [2022-12-13 15:40:59,132 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([444] L826-->L842: Formula: (let ((.cse5 (= (mod v_~a$r_buff1_thd4~0_56 256) 0)) (.cse7 (= (mod v_~a$r_buff0_thd4~0_58 256) 0))) (let ((.cse9 (not .cse7)) (.cse11 (= (mod v_~a$w_buff0_used~0_140 256) 0)) (.cse10 (and .cse7 (= (mod v_~a$w_buff1_used~0_131 256) 0))) (.cse8 (and .cse7 .cse5))) (let ((.cse1 (or .cse11 .cse10 .cse8)) (.cse2 (and .cse9 (not .cse11))) (.cse4 (= (mod v_~a$w_buff1_used~0_130 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_32 256) 0))) (.cse6 (= (mod v_~a$w_buff0_used~0_139 256) 0))) (and (= v_~weak$$choice0~0_7 |v_P3Thread1of1ForFork1_#t~nondet3_1|) (= v_~a$w_buff1~0_48 v_~a$w_buff1~0_47) (= (ite .cse0 v_~a$w_buff0_used~0_140 (ite .cse1 v_~a$w_buff0_used~0_140 (ite .cse2 0 v_~a$w_buff0_used~0_140))) v_~a$w_buff0_used~0_139) (= v_~a$r_buff1_thd4~0_55 (ite .cse0 v_~a$r_buff1_thd4~0_56 (ite (let ((.cse3 (= (mod v_~a$r_buff0_thd4~0_57 256) 0))) (or (and .cse3 .cse4) (and .cse3 .cse5) .cse6)) v_~a$r_buff1_thd4~0_56 0))) (= v_~a~0_90 v_~a$mem_tmp~0_22) (= v_~weak$$choice2~0_32 |v_P3Thread1of1ForFork1_#t~nondet4_1|) (= v_~a$w_buff0~0_51 v_~a$w_buff0~0_50) (= v_~a~0_88 (ite .cse0 v_~a$mem_tmp~0_22 v_~__unbuffered_p3_EBX~0_14)) (= (ite .cse1 v_~a~0_90 (ite .cse2 v_~a$w_buff0~0_51 v_~a$w_buff1~0_48)) v_~__unbuffered_p3_EBX~0_14) (= v_~a$flush_delayed~0_35 0) (= v_~a$r_buff0_thd4~0_57 (ite .cse0 v_~a$r_buff0_thd4~0_58 (ite (or (and .cse7 .cse4) .cse8 .cse6) v_~a$r_buff0_thd4~0_58 (ite (and (not .cse6) .cse9) 0 v_~a$r_buff0_thd4~0_58)))) (= v_~a$w_buff1_used~0_130 (ite .cse0 v_~a$w_buff1_used~0_131 (ite (or .cse10 .cse8 .cse6) v_~a$w_buff1_used~0_131 0))))))) InVars {~a~0=v_~a~0_90, ~a$w_buff1~0=v_~a$w_buff1~0_48, ~a$w_buff0~0=v_~a$w_buff0~0_51, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_56, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_140, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_131, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_58, P3Thread1of1ForFork1_#t~nondet3=|v_P3Thread1of1ForFork1_#t~nondet3_1|, P3Thread1of1ForFork1_#t~nondet4=|v_P3Thread1of1ForFork1_#t~nondet4_1|} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_55, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_139, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_14, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_57, ~a~0=v_~a~0_88, ~a$mem_tmp~0=v_~a$mem_tmp~0_22, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~a$w_buff1~0=v_~a$w_buff1~0_47, ~a$flush_delayed~0=v_~a$flush_delayed~0_35, ~a$w_buff0~0=v_~a$w_buff0~0_50, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_130, ~weak$$choice2~0=v_~weak$$choice2~0_32} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork1_#t~nondet3, P3Thread1of1ForFork1_#t~nondet4][87], [Black: 190#(and (not (= |ULTIMATE.start_main_~#t468~0#1.base| |ULTIMATE.start_main_~#t465~0#1.base|)) (not (= |ULTIMATE.start_main_~#t467~0#1.base| |ULTIMATE.start_main_~#t465~0#1.base|)) (not (= |ULTIMATE.start_main_~#t466~0#1.base| |ULTIMATE.start_main_~#t465~0#1.base|)) (not (= |ULTIMATE.start_main_~#t468~0#1.base| |ULTIMATE.start_main_~#t466~0#1.base|)) (not (= ~__unbuffered_p3_EAX~0 1)) (= |ULTIMATE.start_main_old_#valid#1| (store (store (store (store |#valid| |ULTIMATE.start_main_~#t465~0#1.base| 0) |ULTIMATE.start_main_~#t467~0#1.base| 0) |ULTIMATE.start_main_~#t468~0#1.base| 0) |ULTIMATE.start_main_~#t466~0#1.base| 0)) (not (= |ULTIMATE.start_main_~#t467~0#1.base| |ULTIMATE.start_main_~#t466~0#1.base|)) (not (= |ULTIMATE.start_main_~#t468~0#1.base| |ULTIMATE.start_main_~#t467~0#1.base|))), 164#true, 88#P0EXITtrue, 47#P1EXITtrue, Black: 198#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), Black: 197#(= ~x~0 0), 237#(and (<= ~__unbuffered_cnt~0 2) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 177#true, Black: 208#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 205#(= ~__unbuffered_cnt~0 0), Black: 206#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), 250#(and (not (= ~a$w_buff0~0 0)) (= ~a$r_buff1_thd4~0 0) (= ~a$r_buff1_thd2~0 0) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~a~0 0)) (= ~a$r_buff0_thd4~0 0)), P3Thread1of1ForFork1InUse, P1Thread1of1ForFork0InUse, Black: 221#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), P2Thread1of1ForFork3InUse, Black: 216#(<= ~__unbuffered_cnt~0 1), P0Thread1of1ForFork2InUse, 9#L842true, 217#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 231#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 230#(<= ~__unbuffered_cnt~0 2), Black: 173#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), 4#L806true, 195#true, 85#L2true, Black: 179#(= ~__unbuffered_p3_EAX~0 0), Black: 180#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)))]) [2022-12-13 15:40:59,132 INFO L383 tUnfolder$Statistics]: this new event has 22 ancestors and is not cut-off event [2022-12-13 15:40:59,132 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is not cut-off event [2022-12-13 15:40:59,132 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is not cut-off event [2022-12-13 15:40:59,132 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is not cut-off event [2022-12-13 15:40:59,465 INFO L130 PetriNetUnfolder]: 10654/16877 cut-off events. [2022-12-13 15:40:59,466 INFO L131 PetriNetUnfolder]: For 51199/51723 co-relation queries the response was YES. [2022-12-13 15:40:59,514 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66947 conditions, 16877 events. 10654/16877 cut-off events. For 51199/51723 co-relation queries the response was YES. Maximal size of possible extension queue 904. Compared 121812 event pairs, 868 based on Foata normal form. 60/16646 useless extension candidates. Maximal degree in co-relation 66926. Up to 6170 conditions per place. [2022-12-13 15:40:59,547 INFO L137 encePairwiseOnDemand]: 278/286 looper letters, 241 selfloop transitions, 12 changer transitions 19/288 dead transitions. [2022-12-13 15:40:59,548 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 288 transitions, 2942 flow [2022-12-13 15:40:59,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 15:40:59,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 15:40:59,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1023 transitions. [2022-12-13 15:40:59,550 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.510989010989011 [2022-12-13 15:40:59,550 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1023 transitions. [2022-12-13 15:40:59,550 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1023 transitions. [2022-12-13 15:40:59,550 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 15:40:59,550 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1023 transitions. [2022-12-13 15:40:59,552 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 146.14285714285714) internal successors, (1023), 7 states have internal predecessors, (1023), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:40:59,554 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 286.0) internal successors, (2288), 8 states have internal predecessors, (2288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:40:59,554 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 286.0) internal successors, (2288), 8 states have internal predecessors, (2288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:40:59,554 INFO L175 Difference]: Start difference. First operand has 76 places, 75 transitions, 616 flow. Second operand 7 states and 1023 transitions. [2022-12-13 15:40:59,554 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 288 transitions, 2942 flow [2022-12-13 15:41:01,199 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 288 transitions, 2409 flow, removed 188 selfloop flow, removed 4 redundant places. [2022-12-13 15:41:01,200 INFO L231 Difference]: Finished difference. Result has 82 places, 85 transitions, 648 flow [2022-12-13 15:41:01,201 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=286, PETRI_DIFFERENCE_MINUEND_FLOW=519, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=648, PETRI_PLACES=82, PETRI_TRANSITIONS=85} [2022-12-13 15:41:01,201 INFO L288 CegarLoopForPetriNet]: 53 programPoint places, 29 predicate places. [2022-12-13 15:41:01,201 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 85 transitions, 648 flow [2022-12-13 15:41:01,201 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 133.0) internal successors, (931), 7 states have internal predecessors, (931), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:41:01,201 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 15:41:01,201 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:41:01,201 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 15:41:01,201 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-12-13 15:41:01,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:41:01,202 INFO L85 PathProgramCache]: Analyzing trace with hash -1024097207, now seen corresponding path program 1 times [2022-12-13 15:41:01,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:41:01,202 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539227253] [2022-12-13 15:41:01,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:41:01,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:41:01,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:41:01,355 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 15:41:01,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:41:01,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539227253] [2022-12-13 15:41:01,355 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1539227253] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:41:01,355 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:41:01,355 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 15:41:01,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315080238] [2022-12-13 15:41:01,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:41:01,356 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 15:41:01,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:41:01,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 15:41:01,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 15:41:01,362 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 286 [2022-12-13 15:41:01,363 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 85 transitions, 648 flow. Second operand has 4 states, 4 states have (on average 136.5) internal successors, (546), 4 states have internal predecessors, (546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:41:01,363 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 15:41:01,363 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 286 [2022-12-13 15:41:01,363 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 15:41:03,970 INFO L130 PetriNetUnfolder]: 16690/26004 cut-off events. [2022-12-13 15:41:03,971 INFO L131 PetriNetUnfolder]: For 68412/69492 co-relation queries the response was YES. [2022-12-13 15:41:04,067 INFO L83 FinitePrefix]: Finished finitePrefix Result has 103464 conditions, 26004 events. 16690/26004 cut-off events. For 68412/69492 co-relation queries the response was YES. Maximal size of possible extension queue 1307. Compared 193129 event pairs, 3025 based on Foata normal form. 279/25755 useless extension candidates. Maximal degree in co-relation 103438. Up to 12541 conditions per place. [2022-12-13 15:41:04,118 INFO L137 encePairwiseOnDemand]: 283/286 looper letters, 163 selfloop transitions, 4 changer transitions 11/191 dead transitions. [2022-12-13 15:41:04,118 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 191 transitions, 1796 flow [2022-12-13 15:41:04,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 15:41:04,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 15:41:04,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 587 transitions. [2022-12-13 15:41:04,120 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5131118881118881 [2022-12-13 15:41:04,120 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 587 transitions. [2022-12-13 15:41:04,120 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 587 transitions. [2022-12-13 15:41:04,120 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 15:41:04,120 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 587 transitions. [2022-12-13 15:41:04,121 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 146.75) internal successors, (587), 4 states have internal predecessors, (587), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:41:04,122 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 286.0) internal successors, (1430), 5 states have internal predecessors, (1430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:41:04,122 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 286.0) internal successors, (1430), 5 states have internal predecessors, (1430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:41:04,122 INFO L175 Difference]: Start difference. First operand has 82 places, 85 transitions, 648 flow. Second operand 4 states and 587 transitions. [2022-12-13 15:41:04,122 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 191 transitions, 1796 flow [2022-12-13 15:41:06,476 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 191 transitions, 1779 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 15:41:06,478 INFO L231 Difference]: Finished difference. Result has 85 places, 87 transitions, 679 flow [2022-12-13 15:41:06,478 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=286, PETRI_DIFFERENCE_MINUEND_FLOW=640, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=679, PETRI_PLACES=85, PETRI_TRANSITIONS=87} [2022-12-13 15:41:06,478 INFO L288 CegarLoopForPetriNet]: 53 programPoint places, 32 predicate places. [2022-12-13 15:41:06,478 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 87 transitions, 679 flow [2022-12-13 15:41:06,478 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 136.5) internal successors, (546), 4 states have internal predecessors, (546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:41:06,478 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 15:41:06,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, 1, 1, 1] [2022-12-13 15:41:06,478 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 15:41:06,479 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-12-13 15:41:06,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:41:06,479 INFO L85 PathProgramCache]: Analyzing trace with hash 554859200, now seen corresponding path program 2 times [2022-12-13 15:41:06,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:41:06,479 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082624484] [2022-12-13 15:41:06,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:41:06,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:41:06,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:41:06,693 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 15:41:06,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:41:06,693 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082624484] [2022-12-13 15:41:06,693 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082624484] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:41:06,693 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:41:06,693 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 15:41:06,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43028438] [2022-12-13 15:41:06,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:41:06,694 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 15:41:06,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:41:06,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 15:41:06,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-13 15:41:06,706 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 286 [2022-12-13 15:41:06,707 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 87 transitions, 679 flow. Second operand has 7 states, 7 states have (on average 132.0) internal successors, (924), 7 states have internal predecessors, (924), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:41:06,707 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 15:41:06,707 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 286 [2022-12-13 15:41:06,708 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 15:41:09,618 INFO L130 PetriNetUnfolder]: 15153/23658 cut-off events. [2022-12-13 15:41:09,618 INFO L131 PetriNetUnfolder]: For 58630/59362 co-relation queries the response was YES. [2022-12-13 15:41:09,693 INFO L83 FinitePrefix]: Finished finitePrefix Result has 92759 conditions, 23658 events. 15153/23658 cut-off events. For 58630/59362 co-relation queries the response was YES. Maximal size of possible extension queue 1323. Compared 178767 event pairs, 1134 based on Foata normal form. 353/23454 useless extension candidates. Maximal degree in co-relation 92731. Up to 5371 conditions per place. [2022-12-13 15:41:09,746 INFO L137 encePairwiseOnDemand]: 279/286 looper letters, 167 selfloop transitions, 32 changer transitions 18/235 dead transitions. [2022-12-13 15:41:09,746 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 235 transitions, 2043 flow [2022-12-13 15:41:09,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 15:41:09,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-13 15:41:09,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1553 transitions. [2022-12-13 15:41:09,749 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4936427209154482 [2022-12-13 15:41:09,749 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1553 transitions. [2022-12-13 15:41:09,749 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1553 transitions. [2022-12-13 15:41:09,750 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 15:41:09,750 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1553 transitions. [2022-12-13 15:41:09,753 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 141.1818181818182) internal successors, (1553), 11 states have internal predecessors, (1553), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:41:09,757 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 286.0) internal successors, (3432), 12 states have internal predecessors, (3432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:41:09,759 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 286.0) internal successors, (3432), 12 states have internal predecessors, (3432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:41:09,759 INFO L175 Difference]: Start difference. First operand has 85 places, 87 transitions, 679 flow. Second operand 11 states and 1553 transitions. [2022-12-13 15:41:09,759 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 235 transitions, 2043 flow [2022-12-13 15:41:13,167 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 235 transitions, 2018 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-13 15:41:13,169 INFO L231 Difference]: Finished difference. Result has 95 places, 86 transitions, 742 flow [2022-12-13 15:41:13,169 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=286, PETRI_DIFFERENCE_MINUEND_FLOW=642, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=742, PETRI_PLACES=95, PETRI_TRANSITIONS=86} [2022-12-13 15:41:13,169 INFO L288 CegarLoopForPetriNet]: 53 programPoint places, 42 predicate places. [2022-12-13 15:41:13,169 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 86 transitions, 742 flow [2022-12-13 15:41:13,169 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 132.0) internal successors, (924), 7 states have internal predecessors, (924), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:41:13,169 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 15:41:13,170 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:41:13,170 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 15:41:13,170 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-12-13 15:41:13,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:41:13,170 INFO L85 PathProgramCache]: Analyzing trace with hash 1396662571, now seen corresponding path program 1 times [2022-12-13 15:41:13,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:41:13,170 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077423303] [2022-12-13 15:41:13,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:41:13,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:41:13,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:41:13,433 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 15:41:13,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:41:13,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077423303] [2022-12-13 15:41:13,434 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077423303] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:41:13,434 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:41:13,434 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 15:41:13,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493801428] [2022-12-13 15:41:13,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:41:13,434 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 15:41:13,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:41:13,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 15:41:13,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-13 15:41:13,467 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 286 [2022-12-13 15:41:13,468 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 86 transitions, 742 flow. Second operand has 7 states, 7 states have (on average 123.0) internal successors, (861), 7 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 15:41:13,468 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 15:41:13,468 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 286 [2022-12-13 15:41:13,468 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 15:41:18,604 INFO L130 PetriNetUnfolder]: 31460/47270 cut-off events. [2022-12-13 15:41:18,604 INFO L131 PetriNetUnfolder]: For 184207/184207 co-relation queries the response was YES. [2022-12-13 15:41:18,847 INFO L83 FinitePrefix]: Finished finitePrefix Result has 214723 conditions, 47270 events. 31460/47270 cut-off events. For 184207/184207 co-relation queries the response was YES. Maximal size of possible extension queue 2029. Compared 345460 event pairs, 2769 based on Foata normal form. 1/47271 useless extension candidates. Maximal degree in co-relation 214694. Up to 17653 conditions per place. [2022-12-13 15:41:19,075 INFO L137 encePairwiseOnDemand]: 272/286 looper letters, 234 selfloop transitions, 93 changer transitions 81/408 dead transitions. [2022-12-13 15:41:19,075 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 408 transitions, 4029 flow [2022-12-13 15:41:19,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-13 15:41:19,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-13 15:41:19,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 2109 transitions. [2022-12-13 15:41:19,079 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.46088286713286714 [2022-12-13 15:41:19,079 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 2109 transitions. [2022-12-13 15:41:19,079 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 2109 transitions. [2022-12-13 15:41:19,080 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 15:41:19,080 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 2109 transitions. [2022-12-13 15:41:19,082 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 131.8125) internal successors, (2109), 16 states have internal predecessors, (2109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:41:19,086 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 286.0) internal successors, (4862), 17 states have internal predecessors, (4862), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:41:19,087 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 286.0) internal successors, (4862), 17 states have internal predecessors, (4862), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:41:19,087 INFO L175 Difference]: Start difference. First operand has 95 places, 86 transitions, 742 flow. Second operand 16 states and 2109 transitions. [2022-12-13 15:41:19,087 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 408 transitions, 4029 flow [2022-12-13 15:41:25,241 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 408 transitions, 3572 flow, removed 91 selfloop flow, removed 10 redundant places. [2022-12-13 15:41:25,243 INFO L231 Difference]: Finished difference. Result has 110 places, 162 transitions, 1673 flow [2022-12-13 15:41:25,244 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=286, PETRI_DIFFERENCE_MINUEND_FLOW=625, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=1673, PETRI_PLACES=110, PETRI_TRANSITIONS=162} [2022-12-13 15:41:25,244 INFO L288 CegarLoopForPetriNet]: 53 programPoint places, 57 predicate places. [2022-12-13 15:41:25,244 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 162 transitions, 1673 flow [2022-12-13 15:41:25,244 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 123.0) internal successors, (861), 7 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 15:41:25,244 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 15:41:25,244 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:41:25,244 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-13 15:41:25,245 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-12-13 15:41:25,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:41:25,245 INFO L85 PathProgramCache]: Analyzing trace with hash -987257543, now seen corresponding path program 2 times [2022-12-13 15:41:25,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:41:25,245 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013346219] [2022-12-13 15:41:25,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:41:25,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:41:25,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:41:25,893 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 15:41:25,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:41:25,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013346219] [2022-12-13 15:41:25,894 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013346219] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:41:25,894 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:41:25,894 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 15:41:25,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037723007] [2022-12-13 15:41:25,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:41:25,894 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 15:41:25,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:41:25,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 15:41:25,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-13 15:41:25,928 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 286 [2022-12-13 15:41:25,929 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 162 transitions, 1673 flow. Second operand has 8 states, 8 states have (on average 131.0) internal successors, (1048), 8 states have internal predecessors, (1048), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:41:25,929 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 15:41:25,929 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 286 [2022-12-13 15:41:25,929 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 15:41:28,543 INFO L130 PetriNetUnfolder]: 12008/19652 cut-off events. [2022-12-13 15:41:28,543 INFO L131 PetriNetUnfolder]: For 104414/105522 co-relation queries the response was YES. [2022-12-13 15:41:28,615 INFO L83 FinitePrefix]: Finished finitePrefix Result has 91695 conditions, 19652 events. 12008/19652 cut-off events. For 104414/105522 co-relation queries the response was YES. Maximal size of possible extension queue 1174. Compared 150326 event pairs, 2169 based on Foata normal form. 255/19514 useless extension candidates. Maximal degree in co-relation 91658. Up to 6686 conditions per place. [2022-12-13 15:41:28,677 INFO L137 encePairwiseOnDemand]: 279/286 looper letters, 182 selfloop transitions, 36 changer transitions 0/274 dead transitions. [2022-12-13 15:41:28,677 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 274 transitions, 2916 flow [2022-12-13 15:41:28,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 15:41:28,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 15:41:28,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 979 transitions. [2022-12-13 15:41:28,679 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.489010989010989 [2022-12-13 15:41:28,679 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 979 transitions. [2022-12-13 15:41:28,679 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 979 transitions. [2022-12-13 15:41:28,679 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 15:41:28,679 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 979 transitions. [2022-12-13 15:41:28,681 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 139.85714285714286) internal successors, (979), 7 states have internal predecessors, (979), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:41:28,682 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 286.0) internal successors, (2288), 8 states have internal predecessors, (2288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:41:28,683 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 286.0) internal successors, (2288), 8 states have internal predecessors, (2288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:41:28,683 INFO L175 Difference]: Start difference. First operand has 110 places, 162 transitions, 1673 flow. Second operand 7 states and 979 transitions. [2022-12-13 15:41:28,683 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 274 transitions, 2916 flow [2022-12-13 15:41:30,112 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 274 transitions, 2762 flow, removed 77 selfloop flow, removed 6 redundant places. [2022-12-13 15:41:30,115 INFO L231 Difference]: Finished difference. Result has 106 places, 175 transitions, 1791 flow [2022-12-13 15:41:30,115 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=286, PETRI_DIFFERENCE_MINUEND_FLOW=1561, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1791, PETRI_PLACES=106, PETRI_TRANSITIONS=175} [2022-12-13 15:41:30,115 INFO L288 CegarLoopForPetriNet]: 53 programPoint places, 53 predicate places. [2022-12-13 15:41:30,115 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 175 transitions, 1791 flow [2022-12-13 15:41:30,116 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 131.0) internal successors, (1048), 8 states have internal predecessors, (1048), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:41:30,116 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 15:41:30,116 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:41:30,116 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-13 15:41:30,116 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-12-13 15:41:30,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:41:30,116 INFO L85 PathProgramCache]: Analyzing trace with hash -694577145, now seen corresponding path program 3 times [2022-12-13 15:41:30,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:41:30,116 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705774887] [2022-12-13 15:41:30,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:41:30,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:41:30,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 15:41:30,166 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 15:41:30,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 15:41:30,239 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 15:41:30,239 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 15:41:30,240 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (15 of 16 remaining) [2022-12-13 15:41:30,242 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (14 of 16 remaining) [2022-12-13 15:41:30,242 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2022-12-13 15:41:30,243 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining) [2022-12-13 15:41:30,243 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2022-12-13 15:41:30,243 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2022-12-13 15:41:30,243 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2022-12-13 15:41:30,243 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2022-12-13 15:41:30,243 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2022-12-13 15:41:30,243 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2022-12-13 15:41:30,243 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (5 of 16 remaining) [2022-12-13 15:41:30,243 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 16 remaining) [2022-12-13 15:41:30,243 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 16 remaining) [2022-12-13 15:41:30,244 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 16 remaining) [2022-12-13 15:41:30,244 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 16 remaining) [2022-12-13 15:41:30,244 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2022-12-13 15:41:30,244 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-13 15:41:30,244 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:41:30,250 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 15:41:30,250 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 15:41:30,317 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 03:41:30 BasicIcfg [2022-12-13 15:41:30,317 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 15:41:30,317 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-13 15:41:30,317 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-13 15:41:30,317 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-13 15:41:30,317 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 03:40:32" (3/4) ... [2022-12-13 15:41:30,319 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-12-13 15:41:30,319 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-13 15:41:30,320 INFO L158 Benchmark]: Toolchain (without parser) took 58475.09ms. Allocated memory was 165.7MB in the beginning and 2.9GB in the end (delta: 2.8GB). Free memory was 128.2MB in the beginning and 943.0MB in the end (delta: -814.8MB). Peak memory consumption was 1.9GB. Max. memory is 16.1GB. [2022-12-13 15:41:30,320 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 165.7MB. Free memory is still 136.6MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 15:41:30,320 INFO L158 Benchmark]: CACSL2BoogieTranslator took 366.80ms. Allocated memory is still 165.7MB. Free memory was 128.2MB in the beginning and 100.3MB in the end (delta: 27.9MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2022-12-13 15:41:30,321 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.72ms. Allocated memory is still 165.7MB. Free memory was 100.3MB in the beginning and 97.4MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-12-13 15:41:30,321 INFO L158 Benchmark]: Boogie Preprocessor took 25.59ms. Allocated memory is still 165.7MB. Free memory was 97.4MB in the beginning and 95.9MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 15:41:30,321 INFO L158 Benchmark]: RCFGBuilder took 553.93ms. Allocated memory is still 165.7MB. Free memory was 95.3MB in the beginning and 57.5MB in the end (delta: 37.7MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. [2022-12-13 15:41:30,322 INFO L158 Benchmark]: TraceAbstraction took 57483.50ms. Allocated memory was 165.7MB in the beginning and 2.9GB in the end (delta: 2.8GB). Free memory was 56.9MB in the beginning and 943.0MB in the end (delta: -886.1MB). Peak memory consumption was 1.9GB. Max. memory is 16.1GB. [2022-12-13 15:41:30,322 INFO L158 Benchmark]: Witness Printer took 2.38ms. Allocated memory is still 2.9GB. Free memory is still 943.0MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 15:41:30,323 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 165.7MB. Free memory is still 136.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 366.80ms. Allocated memory is still 165.7MB. Free memory was 128.2MB in the beginning and 100.3MB in the end (delta: 27.9MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.72ms. Allocated memory is still 165.7MB. Free memory was 100.3MB in the beginning and 97.4MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 25.59ms. Allocated memory is still 165.7MB. Free memory was 97.4MB in the beginning and 95.9MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 553.93ms. Allocated memory is still 165.7MB. Free memory was 95.3MB in the beginning and 57.5MB in the end (delta: 37.7MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. * TraceAbstraction took 57483.50ms. Allocated memory was 165.7MB in the beginning and 2.9GB in the end (delta: 2.8GB). Free memory was 56.9MB in the beginning and 943.0MB in the end (delta: -886.1MB). Peak memory consumption was 1.9GB. Max. memory is 16.1GB. * Witness Printer took 2.38ms. Allocated memory is still 2.9GB. Free memory is still 943.0MB. 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.7s, 157 PlacesBefore, 53 PlacesAfterwards, 146 TransitionsBefore, 41 TransitionsAfterwards, 3764 CoEnabledTransitionPairs, 7 FixpointIterations, 53 TrivialSequentialCompositions, 74 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 1 ChoiceCompositions, 136 TotalNumberOfCompositions, 10819 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4820, independent: 4575, independent conditional: 0, independent unconditional: 4575, dependent: 245, dependent conditional: 0, dependent unconditional: 245, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 2058, independent: 1994, independent conditional: 0, independent unconditional: 1994, dependent: 64, dependent conditional: 0, dependent unconditional: 64, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 4820, independent: 2581, independent conditional: 0, independent unconditional: 2581, dependent: 181, dependent conditional: 0, dependent unconditional: 181, unknown: 2058, unknown conditional: 0, unknown unconditional: 2058] , Statistics on independence cache: Total cache size (in pairs): 223, Positive cache size: 202, Positive conditional cache size: 0, Positive unconditional cache size: 202, Negative cache size: 21, Negative conditional cache size: 0, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int __unbuffered_p3_EBX = 0; [L720] 0 int a = 0; [L721] 0 _Bool a$flush_delayed; [L722] 0 int a$mem_tmp; [L723] 0 _Bool a$r_buff0_thd0; [L724] 0 _Bool a$r_buff0_thd1; [L725] 0 _Bool a$r_buff0_thd2; [L726] 0 _Bool a$r_buff0_thd3; [L727] 0 _Bool a$r_buff0_thd4; [L728] 0 _Bool a$r_buff1_thd0; [L729] 0 _Bool a$r_buff1_thd1; [L730] 0 _Bool a$r_buff1_thd2; [L731] 0 _Bool a$r_buff1_thd3; [L732] 0 _Bool a$r_buff1_thd4; [L733] 0 _Bool a$read_delayed; [L734] 0 int *a$read_delayed_var; [L735] 0 int a$w_buff0; [L736] 0 _Bool a$w_buff0_used; [L737] 0 int a$w_buff1; [L738] 0 _Bool a$w_buff1_used; [L739] 0 _Bool main$tmp_guard0; [L740] 0 _Bool main$tmp_guard1; [L742] 0 int x = 0; [L744] 0 int y = 0; [L746] 0 int z = 0; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice2; [L866] 0 pthread_t t465; [L867] FCALL, FORK 0 pthread_create(&t465, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t465, ((void *)0), P0, ((void *)0))=-2, t465={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L868] 0 pthread_t t466; [L869] FCALL, FORK 0 pthread_create(&t466, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t466, ((void *)0), P1, ((void *)0))=-1, t465={5:0}, t466={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L870] 0 pthread_t t467; [L871] FCALL, FORK 0 pthread_create(&t467, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t467, ((void *)0), P2, ((void *)0))=0, t465={5:0}, t466={6:0}, t467={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L872] 0 pthread_t t468; [L873] FCALL, FORK 0 pthread_create(&t468, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t468, ((void *)0), P3, ((void *)0))=1, t465={5:0}, t466={6:0}, t467={7:0}, t468={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L752] 1 a$w_buff1 = a$w_buff0 [L753] 1 a$w_buff0 = 1 [L754] 1 a$w_buff1_used = a$w_buff0_used [L755] 1 a$w_buff0_used = (_Bool)1 [L756] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L756] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L757] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L758] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L759] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L760] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L761] 1 a$r_buff1_thd4 = a$r_buff0_thd4 [L762] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L765] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L782] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L785] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L802] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L805] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L788] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L789] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L790] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L791] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L792] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L808] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L809] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L810] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L811] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L812] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L822] 4 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L825] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L828] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L829] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L830] 4 a$flush_delayed = weak$$choice2 [L831] 4 a$mem_tmp = a [L832] 4 a = !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L833] 4 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L834] 4 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L835] 4 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L836] 4 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L837] 4 a$r_buff0_thd4 = weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L838] 4 a$r_buff1_thd4 = weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L839] 4 __unbuffered_p3_EBX = a [L840] 4 a = a$flush_delayed ? a$mem_tmp : a [L841] 4 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=1] [L795] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L797] 2 return 0; [L844] 4 a = a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L845] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L846] 4 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L847] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L848] 4 a$r_buff1_thd4 = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=1] [L815] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L817] 3 return 0; [L768] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L769] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L770] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L771] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L772] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=1] [L851] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L853] 4 return 0; [L775] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L777] 1 return 0; [L875] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L877] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L877] RET 0 assume_abort_if_not(main$tmp_guard0) [L879] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L880] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L881] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L882] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L883] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t465={5:0}, t466={6:0}, t467={7:0}, t468={3:0}, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=1] [L886] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L888] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=1] - 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: 864]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 873]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 869]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 871]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 867]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 187 locations, 16 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 57.3s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 49.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.7s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1210 SdHoareTripleChecker+Valid, 2.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1056 mSDsluCounter, 317 SdHoareTripleChecker+Invalid, 2.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 259 mSDsCounter, 121 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2952 IncrementalHoareTripleChecker+Invalid, 3073 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 121 mSolverCounterUnsat, 58 mSDtfsCounter, 2952 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 84 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1791occurred in iteration=14, InterpolantAutomatonStates: 89, 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.3s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 262 NumberOfCodeBlocks, 262 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 220 ConstructedInterpolants, 0 QuantifiedInterpolants, 1736 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 15:41:30,342 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b6b6f65-d949-46c2-8021-d6bdb93b0c59/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_7b6b6f65-d949-46c2-8021-d6bdb93b0c59/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b6b6f65-d949-46c2-8021-d6bdb93b0c59/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_7b6b6f65-d949-46c2-8021-d6bdb93b0c59/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b6b6f65-d949-46c2-8021-d6bdb93b0c59/bin/uautomizer-uyxdKDjOR8/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix018_power.oepc_pso.oepc_rmo.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b6b6f65-d949-46c2-8021-d6bdb93b0c59/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_7b6b6f65-d949-46c2-8021-d6bdb93b0c59/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 5a744aa24a15b244d86986861038a45981c329f5578e2da992d82373e2f73c5a --- 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 15:41:32,287 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 15:41:32,289 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 15:41:32,307 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 15:41:32,307 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 15:41:32,308 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 15:41:32,310 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 15:41:32,311 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 15:41:32,313 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 15:41:32,314 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 15:41:32,314 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 15:41:32,315 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 15:41:32,316 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 15:41:32,317 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 15:41:32,318 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 15:41:32,319 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 15:41:32,320 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 15:41:32,327 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 15:41:32,328 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 15:41:32,330 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 15:41:32,331 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 15:41:32,332 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 15:41:32,333 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 15:41:32,334 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 15:41:32,338 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 15:41:32,338 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 15:41:32,338 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 15:41:32,339 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 15:41:32,339 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 15:41:32,340 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 15:41:32,341 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 15:41:32,341 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 15:41:32,342 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 15:41:32,343 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 15:41:32,344 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 15:41:32,344 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 15:41:32,344 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 15:41:32,344 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 15:41:32,345 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 15:41:32,345 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 15:41:32,346 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 15:41:32,347 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b6b6f65-d949-46c2-8021-d6bdb93b0c59/bin/uautomizer-uyxdKDjOR8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-12-13 15:41:32,367 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 15:41:32,367 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 15:41:32,368 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 15:41:32,368 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 15:41:32,368 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 15:41:32,369 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 15:41:32,369 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 15:41:32,369 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 15:41:32,369 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 15:41:32,370 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 15:41:32,370 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 15:41:32,370 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-13 15:41:32,370 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 15:41:32,370 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 15:41:32,370 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 15:41:32,371 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-12-13 15:41:32,371 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-12-13 15:41:32,371 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-12-13 15:41:32,371 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 15:41:32,371 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-12-13 15:41:32,371 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-12-13 15:41:32,372 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-12-13 15:41:32,372 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 15:41:32,372 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 15:41:32,372 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 15:41:32,372 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 15:41:32,372 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 15:41:32,373 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 15:41:32,373 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 15:41:32,373 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 15:41:32,373 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-12-13 15:41:32,373 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-12-13 15:41:32,373 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 15:41:32,373 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 15:41:32,374 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 15:41:32,374 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2022-12-13 15:41:32,374 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 15:41:32,374 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_7b6b6f65-d949-46c2-8021-d6bdb93b0c59/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_7b6b6f65-d949-46c2-8021-d6bdb93b0c59/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 -> 5a744aa24a15b244d86986861038a45981c329f5578e2da992d82373e2f73c5a [2022-12-13 15:41:32,616 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 15:41:32,631 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 15:41:32,633 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 15:41:32,634 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 15:41:32,635 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 15:41:32,636 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b6b6f65-d949-46c2-8021-d6bdb93b0c59/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/pthread-wmm/mix018_power.oepc_pso.oepc_rmo.oepc.i [2022-12-13 15:41:35,273 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 15:41:35,496 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 15:41:35,496 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b6b6f65-d949-46c2-8021-d6bdb93b0c59/sv-benchmarks/c/pthread-wmm/mix018_power.oepc_pso.oepc_rmo.oepc.i [2022-12-13 15:41:35,515 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b6b6f65-d949-46c2-8021-d6bdb93b0c59/bin/uautomizer-uyxdKDjOR8/data/1f643ad1f/125e732ab9d04ea6b7142008c0753af4/FLAGc4bc1bd99 [2022-12-13 15:41:35,529 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b6b6f65-d949-46c2-8021-d6bdb93b0c59/bin/uautomizer-uyxdKDjOR8/data/1f643ad1f/125e732ab9d04ea6b7142008c0753af4 [2022-12-13 15:41:35,532 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 15:41:35,533 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 15:41:35,534 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 15:41:35,535 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 15:41:35,538 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 15:41:35,538 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 03:41:35" (1/1) ... [2022-12-13 15:41:35,539 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15816a4d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:41:35, skipping insertion in model container [2022-12-13 15:41:35,540 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 03:41:35" (1/1) ... [2022-12-13 15:41:35,546 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 15:41:35,581 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 15:41:35,710 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_7b6b6f65-d949-46c2-8021-d6bdb93b0c59/sv-benchmarks/c/pthread-wmm/mix018_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2022-12-13 15:41:35,829 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:41:35,831 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:41:35,831 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:41:35,832 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:41:35,832 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:41:35,834 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:41:35,834 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:41:35,834 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:41:35,835 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:41:35,835 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:41:35,835 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:41:35,836 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:41:35,836 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:41:35,839 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:41:35,839 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:41:35,839 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:41:35,840 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:41:35,841 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:41:35,841 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:41:35,841 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:41:35,841 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:41:35,844 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:41:35,844 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:41:35,845 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:41:35,846 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:41:35,846 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:41:35,846 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:41:35,847 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:41:35,847 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:41:35,855 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:41:35,866 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:41:35,868 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:41:35,868 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:41:35,869 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:41:35,875 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:41:35,876 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:41:35,876 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:41:35,878 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:41:35,879 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:41:35,879 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:41:35,880 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 15:41:35,894 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 15:41:35,907 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_7b6b6f65-d949-46c2-8021-d6bdb93b0c59/sv-benchmarks/c/pthread-wmm/mix018_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2022-12-13 15:41:35,929 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:41:35,930 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:41:35,931 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:41:35,931 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:41:35,931 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:41:35,933 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:41:35,933 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:41:35,933 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:41:35,934 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:41:35,934 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:41:35,935 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:41:35,935 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:41:35,935 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:41:35,937 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:41:35,937 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:41:35,937 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:41:35,938 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:41:35,938 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:41:35,939 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:41:35,939 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:41:35,939 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:41:35,941 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:41:35,941 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:41:35,941 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:41:35,942 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:41:35,942 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:41:35,942 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:41:35,943 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:41:35,943 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:41:35,947 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:41:35,947 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:41:35,949 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:41:35,949 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:41:35,950 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:41:35,953 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:41:35,954 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:41:35,954 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:41:35,956 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:41:35,956 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:41:35,957 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:41:35,958 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 15:41:35,997 INFO L208 MainTranslator]: Completed translation [2022-12-13 15:41:35,997 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:41:35 WrapperNode [2022-12-13 15:41:35,997 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 15:41:35,998 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 15:41:35,998 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 15:41:35,999 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 15:41:36,006 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:41:35" (1/1) ... [2022-12-13 15:41:36,025 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:41:35" (1/1) ... [2022-12-13 15:41:36,047 INFO L138 Inliner]: procedures = 180, calls = 69, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 146 [2022-12-13 15:41:36,048 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 15:41:36,048 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 15:41:36,049 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 15:41:36,049 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 15:41:36,057 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:41:35" (1/1) ... [2022-12-13 15:41:36,058 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:41:35" (1/1) ... [2022-12-13 15:41:36,061 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:41:35" (1/1) ... [2022-12-13 15:41:36,062 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:41:35" (1/1) ... [2022-12-13 15:41:36,070 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:41:35" (1/1) ... [2022-12-13 15:41:36,072 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:41:35" (1/1) ... [2022-12-13 15:41:36,074 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:41:35" (1/1) ... [2022-12-13 15:41:36,076 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:41:35" (1/1) ... [2022-12-13 15:41:36,079 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 15:41:36,080 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 15:41:36,080 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 15:41:36,080 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 15:41:36,081 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:41:35" (1/1) ... [2022-12-13 15:41:36,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 15:41:36,098 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b6b6f65-d949-46c2-8021-d6bdb93b0c59/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 15:41:36,108 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b6b6f65-d949-46c2-8021-d6bdb93b0c59/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 15:41:36,111 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b6b6f65-d949-46c2-8021-d6bdb93b0c59/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 15:41:36,144 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 15:41:36,144 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 15:41:36,144 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 15:41:36,144 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 15:41:36,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-12-13 15:41:36,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-12-13 15:41:36,144 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 15:41:36,144 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 15:41:36,145 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 15:41:36,145 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 15:41:36,145 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-13 15:41:36,145 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-13 15:41:36,145 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-12-13 15:41:36,145 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-12-13 15:41:36,145 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 15:41:36,145 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 15:41:36,145 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 15:41:36,147 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 15:41:36,277 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 15:41:36,280 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 15:41:36,633 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 15:41:36,728 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 15:41:36,729 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 15:41:36,730 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 03:41:36 BoogieIcfgContainer [2022-12-13 15:41:36,730 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 15:41:36,732 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 15:41:36,732 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 15:41:36,734 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 15:41:36,734 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 03:41:35" (1/3) ... [2022-12-13 15:41:36,735 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d3ab922 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 03:41:36, skipping insertion in model container [2022-12-13 15:41:36,735 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:41:35" (2/3) ... [2022-12-13 15:41:36,735 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d3ab922 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 03:41:36, skipping insertion in model container [2022-12-13 15:41:36,735 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 03:41:36" (3/3) ... [2022-12-13 15:41:36,736 INFO L112 eAbstractionObserver]: Analyzing ICFG mix018_power.oepc_pso.oepc_rmo.oepc.i [2022-12-13 15:41:36,750 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 15:41:36,750 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2022-12-13 15:41:36,750 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 15:41:36,798 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 15:41:36,828 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 162 places, 151 transitions, 322 flow [2022-12-13 15:41:36,869 INFO L130 PetriNetUnfolder]: 2/147 cut-off events. [2022-12-13 15:41:36,870 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 15:41:36,874 INFO L83 FinitePrefix]: Finished finitePrefix Result has 160 conditions, 147 events. 2/147 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 102 event pairs, 0 based on Foata normal form. 0/134 useless extension candidates. Maximal degree in co-relation 101. Up to 2 conditions per place. [2022-12-13 15:41:36,874 INFO L82 GeneralOperation]: Start removeDead. Operand has 162 places, 151 transitions, 322 flow [2022-12-13 15:41:36,877 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 158 places, 147 transitions, 306 flow [2022-12-13 15:41:36,880 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-12-13 15:41:36,888 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 158 places, 147 transitions, 306 flow [2022-12-13 15:41:36,890 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 158 places, 147 transitions, 306 flow [2022-12-13 15:41:36,890 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 158 places, 147 transitions, 306 flow [2022-12-13 15:41:36,912 INFO L130 PetriNetUnfolder]: 2/147 cut-off events. [2022-12-13 15:41:36,913 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 15:41:36,913 INFO L83 FinitePrefix]: Finished finitePrefix Result has 160 conditions, 147 events. 2/147 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 102 event pairs, 0 based on Foata normal form. 0/134 useless extension candidates. Maximal degree in co-relation 101. Up to 2 conditions per place. [2022-12-13 15:41:36,915 INFO L119 LiptonReduction]: Number of co-enabled transitions 3764 [2022-12-13 15:41:43,588 INFO L134 LiptonReduction]: Checked pairs total: 10874 [2022-12-13 15:41:43,588 INFO L136 LiptonReduction]: Total number of compositions: 139 [2022-12-13 15:41:43,599 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 15:41:43,603 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;@3c1db486, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 15:41:43,603 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2022-12-13 15:41:43,605 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2022-12-13 15:41:43,605 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 15:41:43,605 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 15:41:43,606 INFO L209 CegarLoopForPetriNet]: trace histogram [1] [2022-12-13 15:41:43,606 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-12-13 15:41:43,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:41:43,610 INFO L85 PathProgramCache]: Analyzing trace with hash 628, now seen corresponding path program 1 times [2022-12-13 15:41:43,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 15:41:43,619 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1988595852] [2022-12-13 15:41:43,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:41:43,619 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 15:41:43,619 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b6b6f65-d949-46c2-8021-d6bdb93b0c59/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 15:41:43,620 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b6b6f65-d949-46c2-8021-d6bdb93b0c59/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 15:41:43,668 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b6b6f65-d949-46c2-8021-d6bdb93b0c59/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 15:41:43,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:41:43,720 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2022-12-13 15:41:43,723 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 15:41:43,726 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 15:41:43,726 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 15:41:43,727 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 15:41:43,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1988595852] [2022-12-13 15:41:43,727 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1988595852] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:41:43,727 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:41:43,728 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-12-13 15:41:43,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521766117] [2022-12-13 15:41:43,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:41:43,734 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-13 15:41:43,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 15:41:43,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-13 15:41:43,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-13 15:41:43,762 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 290 [2022-12-13 15:41:43,764 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 41 transitions, 94 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 15:41:43,764 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 15:41:43,765 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 290 [2022-12-13 15:41:43,765 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 15:41:45,309 INFO L130 PetriNetUnfolder]: 8719/11811 cut-off events. [2022-12-13 15:41:45,309 INFO L131 PetriNetUnfolder]: For 47/47 co-relation queries the response was YES. [2022-12-13 15:41:45,331 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23759 conditions, 11811 events. 8719/11811 cut-off events. For 47/47 co-relation queries the response was YES. Maximal size of possible extension queue 543. Compared 61179 event pairs, 8719 based on Foata normal form. 0/10304 useless extension candidates. Maximal degree in co-relation 23747. Up to 11731 conditions per place. [2022-12-13 15:41:45,371 INFO L137 encePairwiseOnDemand]: 281/290 looper letters, 28 selfloop transitions, 0 changer transitions 0/32 dead transitions. [2022-12-13 15:41:45,371 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 32 transitions, 132 flow [2022-12-13 15:41:45,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 15:41:45,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-12-13 15:41:45,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 309 transitions. [2022-12-13 15:41:45,382 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5327586206896552 [2022-12-13 15:41:45,383 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 309 transitions. [2022-12-13 15:41:45,383 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 309 transitions. [2022-12-13 15:41:45,384 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 15:41:45,386 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 309 transitions. [2022-12-13 15:41:45,388 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 154.5) internal successors, (309), 2 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:41:45,392 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 290.0) internal successors, (870), 3 states have internal predecessors, (870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:41:45,393 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 290.0) internal successors, (870), 3 states have internal predecessors, (870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:41:45,394 INFO L175 Difference]: Start difference. First operand has 53 places, 41 transitions, 94 flow. Second operand 2 states and 309 transitions. [2022-12-13 15:41:45,395 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 32 transitions, 132 flow [2022-12-13 15:41:45,400 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 32 transitions, 128 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-13 15:41:45,401 INFO L231 Difference]: Finished difference. Result has 42 places, 32 transitions, 72 flow [2022-12-13 15:41:45,403 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=290, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=72, PETRI_PLACES=42, PETRI_TRANSITIONS=32} [2022-12-13 15:41:45,406 INFO L288 CegarLoopForPetriNet]: 53 programPoint places, -11 predicate places. [2022-12-13 15:41:45,406 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 32 transitions, 72 flow [2022-12-13 15:41:45,406 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 15:41:45,406 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 15:41:45,406 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-12-13 15:41:45,419 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b6b6f65-d949-46c2-8021-d6bdb93b0c59/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 15:41:45,607 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b6b6f65-d949-46c2-8021-d6bdb93b0c59/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 15:41:45,607 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-12-13 15:41:45,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:41:45,608 INFO L85 PathProgramCache]: Analyzing trace with hash 616226, now seen corresponding path program 1 times [2022-12-13 15:41:45,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 15:41:45,608 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1804857038] [2022-12-13 15:41:45,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:41:45,608 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 15:41:45,608 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b6b6f65-d949-46c2-8021-d6bdb93b0c59/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 15:41:45,609 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b6b6f65-d949-46c2-8021-d6bdb93b0c59/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 15:41:45,610 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b6b6f65-d949-46c2-8021-d6bdb93b0c59/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 15:41:45,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:41:45,666 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-13 15:41:45,667 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 15:41:45,684 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 15:41:45,684 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 15:41:45,684 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 15:41:45,684 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1804857038] [2022-12-13 15:41:45,684 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1804857038] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:41:45,684 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:41:45,684 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 15:41:45,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836835832] [2022-12-13 15:41:45,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:41:45,686 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 15:41:45,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 15:41:45,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 15:41:45,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 15:41:45,690 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 290 [2022-12-13 15:41:45,690 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 32 transitions, 72 flow. Second operand has 3 states, 3 states have (on average 136.0) internal successors, (408), 3 states have internal predecessors, (408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:41:45,690 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 15:41:45,690 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 290 [2022-12-13 15:41:45,690 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 15:41:46,731 INFO L130 PetriNetUnfolder]: 6855/9350 cut-off events. [2022-12-13 15:41:46,731 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 15:41:46,741 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18787 conditions, 9350 events. 6855/9350 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 435. Compared 46676 event pairs, 3527 based on Foata normal form. 0/8689 useless extension candidates. Maximal degree in co-relation 18784. Up to 7399 conditions per place. [2022-12-13 15:41:46,763 INFO L137 encePairwiseOnDemand]: 287/290 looper letters, 45 selfloop transitions, 2 changer transitions 2/53 dead transitions. [2022-12-13 15:41:46,763 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 53 transitions, 218 flow [2022-12-13 15:41:46,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 15:41:46,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 15:41:46,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 455 transitions. [2022-12-13 15:41:46,765 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5229885057471264 [2022-12-13 15:41:46,765 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 455 transitions. [2022-12-13 15:41:46,766 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 455 transitions. [2022-12-13 15:41:46,766 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 15:41:46,766 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 455 transitions. [2022-12-13 15:41:46,767 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 151.66666666666666) internal successors, (455), 3 states have internal predecessors, (455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:41:46,768 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 290.0) internal successors, (1160), 4 states have internal predecessors, (1160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:41:46,769 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 290.0) internal successors, (1160), 4 states have internal predecessors, (1160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:41:46,769 INFO L175 Difference]: Start difference. First operand has 42 places, 32 transitions, 72 flow. Second operand 3 states and 455 transitions. [2022-12-13 15:41:46,769 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 53 transitions, 218 flow [2022-12-13 15:41:46,769 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 53 transitions, 218 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-13 15:41:46,770 INFO L231 Difference]: Finished difference. Result has 43 places, 30 transitions, 72 flow [2022-12-13 15:41:46,770 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=290, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=72, PETRI_PLACES=43, PETRI_TRANSITIONS=30} [2022-12-13 15:41:46,770 INFO L288 CegarLoopForPetriNet]: 53 programPoint places, -10 predicate places. [2022-12-13 15:41:46,770 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 30 transitions, 72 flow [2022-12-13 15:41:46,771 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 136.0) internal successors, (408), 3 states have internal predecessors, (408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:41:46,771 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 15:41:46,771 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:41:46,778 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b6b6f65-d949-46c2-8021-d6bdb93b0c59/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)] Forceful destruction successful, exit code 0 [2022-12-13 15:41:46,971 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b6b6f65-d949-46c2-8021-d6bdb93b0c59/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 15:41:46,973 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-12-13 15:41:46,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:41:46,974 INFO L85 PathProgramCache]: Analyzing trace with hash -1172283620, now seen corresponding path program 1 times [2022-12-13 15:41:46,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 15:41:46,976 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1161247538] [2022-12-13 15:41:46,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:41:46,977 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 15:41:46,977 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b6b6f65-d949-46c2-8021-d6bdb93b0c59/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 15:41:46,978 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b6b6f65-d949-46c2-8021-d6bdb93b0c59/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 15:41:46,979 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b6b6f65-d949-46c2-8021-d6bdb93b0c59/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 15:41:47,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:41:47,066 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-13 15:41:47,067 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 15:41:47,103 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 15:41:47,104 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 15:41:47,104 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 15:41:47,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1161247538] [2022-12-13 15:41:47,104 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1161247538] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:41:47,104 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:41:47,104 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 15:41:47,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603847661] [2022-12-13 15:41:47,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:41:47,105 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 15:41:47,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 15:41:47,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 15:41:47,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 15:41:47,118 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 290 [2022-12-13 15:41:47,119 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 30 transitions, 72 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 15:41:47,119 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 15:41:47,119 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 290 [2022-12-13 15:41:47,119 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 15:41:47,766 INFO L130 PetriNetUnfolder]: 4483/6393 cut-off events. [2022-12-13 15:41:47,766 INFO L131 PetriNetUnfolder]: For 421/421 co-relation queries the response was YES. [2022-12-13 15:41:47,771 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13342 conditions, 6393 events. 4483/6393 cut-off events. For 421/421 co-relation queries the response was YES. Maximal size of possible extension queue 330. Compared 34221 event pairs, 818 based on Foata normal form. 320/6479 useless extension candidates. Maximal degree in co-relation 13338. Up to 4756 conditions per place. [2022-12-13 15:41:47,784 INFO L137 encePairwiseOnDemand]: 283/290 looper letters, 40 selfloop transitions, 5 changer transitions 27/76 dead transitions. [2022-12-13 15:41:47,784 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 76 transitions, 320 flow [2022-12-13 15:41:47,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 15:41:47,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 15:41:47,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 724 transitions. [2022-12-13 15:41:47,786 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4993103448275862 [2022-12-13 15:41:47,786 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 724 transitions. [2022-12-13 15:41:47,786 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 724 transitions. [2022-12-13 15:41:47,786 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 15:41:47,786 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 724 transitions. [2022-12-13 15:41:47,788 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 144.8) internal successors, (724), 5 states have internal predecessors, (724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:41:47,790 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 290.0) internal successors, (1740), 6 states have internal predecessors, (1740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:41:47,790 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 290.0) internal successors, (1740), 6 states have internal predecessors, (1740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:41:47,791 INFO L175 Difference]: Start difference. First operand has 43 places, 30 transitions, 72 flow. Second operand 5 states and 724 transitions. [2022-12-13 15:41:47,791 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 76 transitions, 320 flow [2022-12-13 15:41:47,791 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 76 transitions, 310 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 15:41:47,792 INFO L231 Difference]: Finished difference. Result has 47 places, 34 transitions, 113 flow [2022-12-13 15:41:47,792 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=290, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=113, PETRI_PLACES=47, PETRI_TRANSITIONS=34} [2022-12-13 15:41:47,792 INFO L288 CegarLoopForPetriNet]: 53 programPoint places, -6 predicate places. [2022-12-13 15:41:47,793 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 34 transitions, 113 flow [2022-12-13 15:41:47,793 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 15:41:47,793 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 15:41:47,793 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:41:47,802 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b6b6f65-d949-46c2-8021-d6bdb93b0c59/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 15:41:47,993 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b6b6f65-d949-46c2-8021-d6bdb93b0c59/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 15:41:47,994 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-12-13 15:41:47,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:41:47,994 INFO L85 PathProgramCache]: Analyzing trace with hash 1621644695, now seen corresponding path program 1 times [2022-12-13 15:41:47,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 15:41:47,995 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1389074270] [2022-12-13 15:41:47,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:41:47,995 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 15:41:47,995 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b6b6f65-d949-46c2-8021-d6bdb93b0c59/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 15:41:47,996 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b6b6f65-d949-46c2-8021-d6bdb93b0c59/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 15:41:47,997 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b6b6f65-d949-46c2-8021-d6bdb93b0c59/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 15:41:48,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:41:48,091 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 15:41:48,091 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 15:41:48,124 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 15:41:48,124 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 15:41:48,124 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 15:41:48,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1389074270] [2022-12-13 15:41:48,124 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1389074270] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:41:48,125 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:41:48,125 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 15:41:48,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244957382] [2022-12-13 15:41:48,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:41:48,125 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 15:41:48,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 15:41:48,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 15:41:48,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 15:41:48,145 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 290 [2022-12-13 15:41:48,146 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 34 transitions, 113 flow. Second operand has 5 states, 5 states have (on average 132.8) internal successors, (664), 5 states have internal predecessors, (664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:41:48,146 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 15:41:48,147 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 290 [2022-12-13 15:41:48,147 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 15:41:48,656 INFO L130 PetriNetUnfolder]: 2161/3288 cut-off events. [2022-12-13 15:41:48,656 INFO L131 PetriNetUnfolder]: For 1182/1182 co-relation queries the response was YES. [2022-12-13 15:41:48,660 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8683 conditions, 3288 events. 2161/3288 cut-off events. For 1182/1182 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 17192 event pairs, 403 based on Foata normal form. 212/3401 useless extension candidates. Maximal degree in co-relation 8676. Up to 1426 conditions per place. [2022-12-13 15:41:48,665 INFO L137 encePairwiseOnDemand]: 283/290 looper letters, 53 selfloop transitions, 9 changer transitions 27/93 dead transitions. [2022-12-13 15:41:48,665 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 93 transitions, 469 flow [2022-12-13 15:41:48,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 15:41:48,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 15:41:48,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 871 transitions. [2022-12-13 15:41:48,668 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5005747126436781 [2022-12-13 15:41:48,668 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 871 transitions. [2022-12-13 15:41:48,668 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 871 transitions. [2022-12-13 15:41:48,668 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 15:41:48,668 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 871 transitions. [2022-12-13 15:41:48,669 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 145.16666666666666) internal successors, (871), 6 states have internal predecessors, (871), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:41:48,671 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 290.0) internal successors, (2030), 7 states have internal predecessors, (2030), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:41:48,672 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 290.0) internal successors, (2030), 7 states have internal predecessors, (2030), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:41:48,672 INFO L175 Difference]: Start difference. First operand has 47 places, 34 transitions, 113 flow. Second operand 6 states and 871 transitions. [2022-12-13 15:41:48,672 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 93 transitions, 469 flow [2022-12-13 15:41:48,677 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 93 transitions, 462 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-12-13 15:41:48,678 INFO L231 Difference]: Finished difference. Result has 51 places, 38 transitions, 178 flow [2022-12-13 15:41:48,678 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=290, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=178, PETRI_PLACES=51, PETRI_TRANSITIONS=38} [2022-12-13 15:41:48,679 INFO L288 CegarLoopForPetriNet]: 53 programPoint places, -2 predicate places. [2022-12-13 15:41:48,679 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 38 transitions, 178 flow [2022-12-13 15:41:48,679 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 132.8) internal successors, (664), 5 states have internal predecessors, (664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:41:48,679 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 15:41:48,679 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 15:41:48,691 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b6b6f65-d949-46c2-8021-d6bdb93b0c59/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 15:41:48,880 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b6b6f65-d949-46c2-8021-d6bdb93b0c59/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 15:41:48,881 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-12-13 15:41:48,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:41:48,882 INFO L85 PathProgramCache]: Analyzing trace with hash -1158292673, now seen corresponding path program 1 times [2022-12-13 15:41:48,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 15:41:48,882 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [910492584] [2022-12-13 15:41:48,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:41:48,883 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 15:41:48,883 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b6b6f65-d949-46c2-8021-d6bdb93b0c59/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 15:41:48,884 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b6b6f65-d949-46c2-8021-d6bdb93b0c59/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 15:41:48,886 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b6b6f65-d949-46c2-8021-d6bdb93b0c59/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 15:41:48,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:41:48,983 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-13 15:41:48,984 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 15:41:49,023 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 15:41:49,023 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 15:41:49,023 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 15:41:49,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [910492584] [2022-12-13 15:41:49,024 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [910492584] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:41:49,024 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:41:49,024 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 15:41:49,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051398287] [2022-12-13 15:41:49,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:41:49,024 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 15:41:49,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 15:41:49,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 15:41:49,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 15:41:49,047 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 290 [2022-12-13 15:41:49,049 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 38 transitions, 178 flow. Second operand has 6 states, 6 states have (on average 132.83333333333334) internal successors, (797), 6 states have internal predecessors, (797), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:41:49,049 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 15:41:49,049 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 290 [2022-12-13 15:41:49,049 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 15:41:49,462 INFO L130 PetriNetUnfolder]: 1189/1866 cut-off events. [2022-12-13 15:41:49,462 INFO L131 PetriNetUnfolder]: For 1810/1810 co-relation queries the response was YES. [2022-12-13 15:41:49,465 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5586 conditions, 1866 events. 1189/1866 cut-off events. For 1810/1810 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 9100 event pairs, 331 based on Foata normal form. 77/1907 useless extension candidates. Maximal degree in co-relation 5577. Up to 630 conditions per place. [2022-12-13 15:41:49,468 INFO L137 encePairwiseOnDemand]: 283/290 looper letters, 64 selfloop transitions, 13 changer transitions 27/108 dead transitions. [2022-12-13 15:41:49,468 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 108 transitions, 638 flow [2022-12-13 15:41:49,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 15:41:49,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 15:41:49,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1016 transitions. [2022-12-13 15:41:49,473 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5004926108374385 [2022-12-13 15:41:49,473 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1016 transitions. [2022-12-13 15:41:49,473 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1016 transitions. [2022-12-13 15:41:49,474 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 15:41:49,474 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1016 transitions. [2022-12-13 15:41:49,478 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 145.14285714285714) internal successors, (1016), 7 states have internal predecessors, (1016), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:41:49,484 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 290.0) internal successors, (2320), 8 states have internal predecessors, (2320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:41:49,484 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 290.0) internal successors, (2320), 8 states have internal predecessors, (2320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:41:49,484 INFO L175 Difference]: Start difference. First operand has 51 places, 38 transitions, 178 flow. Second operand 7 states and 1016 transitions. [2022-12-13 15:41:49,484 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 108 transitions, 638 flow [2022-12-13 15:41:49,495 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 108 transitions, 576 flow, removed 26 selfloop flow, removed 4 redundant places. [2022-12-13 15:41:49,496 INFO L231 Difference]: Finished difference. Result has 54 places, 42 transitions, 228 flow [2022-12-13 15:41:49,496 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=290, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=228, PETRI_PLACES=54, PETRI_TRANSITIONS=42} [2022-12-13 15:41:49,496 INFO L288 CegarLoopForPetriNet]: 53 programPoint places, 1 predicate places. [2022-12-13 15:41:49,496 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 42 transitions, 228 flow [2022-12-13 15:41:49,497 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 132.83333333333334) internal successors, (797), 6 states have internal predecessors, (797), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:41:49,497 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 15:41:49,497 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 15:41:49,506 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b6b6f65-d949-46c2-8021-d6bdb93b0c59/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 15:41:49,697 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b6b6f65-d949-46c2-8021-d6bdb93b0c59/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 15:41:49,697 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-12-13 15:41:49,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:41:49,698 INFO L85 PathProgramCache]: Analyzing trace with hash 2044015201, now seen corresponding path program 1 times [2022-12-13 15:41:49,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 15:41:49,698 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1393027615] [2022-12-13 15:41:49,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:41:49,699 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 15:41:49,699 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b6b6f65-d949-46c2-8021-d6bdb93b0c59/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 15:41:49,699 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b6b6f65-d949-46c2-8021-d6bdb93b0c59/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 15:41:49,700 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b6b6f65-d949-46c2-8021-d6bdb93b0c59/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 15:41:49,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:41:49,782 INFO L263 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-13 15:41:49,784 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 15:41:49,830 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 15:41:49,831 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 15:41:49,831 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 15:41:49,831 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1393027615] [2022-12-13 15:41:49,831 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1393027615] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:41:49,831 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:41:49,831 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 15:41:49,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351170286] [2022-12-13 15:41:49,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:41:49,832 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 15:41:49,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 15:41:49,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 15:41:49,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 15:41:49,872 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 290 [2022-12-13 15:41:49,872 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 42 transitions, 228 flow. Second operand has 7 states, 7 states have (on average 132.85714285714286) internal successors, (930), 7 states have internal predecessors, (930), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:41:49,872 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 15:41:49,872 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 290 [2022-12-13 15:41:49,873 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 15:41:50,324 INFO L130 PetriNetUnfolder]: 1011/1560 cut-off events. [2022-12-13 15:41:50,324 INFO L131 PetriNetUnfolder]: For 1455/1455 co-relation queries the response was YES. [2022-12-13 15:41:50,326 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4512 conditions, 1560 events. 1011/1560 cut-off events. For 1455/1455 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 7408 event pairs, 326 based on Foata normal form. 14/1551 useless extension candidates. Maximal degree in co-relation 4502. Up to 630 conditions per place. [2022-12-13 15:41:50,329 INFO L137 encePairwiseOnDemand]: 283/290 looper letters, 60 selfloop transitions, 17 changer transitions 14/95 dead transitions. [2022-12-13 15:41:50,329 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 95 transitions, 574 flow [2022-12-13 15:41:50,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 15:41:50,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 15:41:50,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1133 transitions. [2022-12-13 15:41:50,332 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.48836206896551726 [2022-12-13 15:41:50,332 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1133 transitions. [2022-12-13 15:41:50,332 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1133 transitions. [2022-12-13 15:41:50,332 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 15:41:50,332 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1133 transitions. [2022-12-13 15:41:50,334 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 141.625) internal successors, (1133), 8 states have internal predecessors, (1133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:41:50,335 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 290.0) internal successors, (2610), 9 states have internal predecessors, (2610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:41:50,336 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 290.0) internal successors, (2610), 9 states have internal predecessors, (2610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:41:50,336 INFO L175 Difference]: Start difference. First operand has 54 places, 42 transitions, 228 flow. Second operand 8 states and 1133 transitions. [2022-12-13 15:41:50,336 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 95 transitions, 574 flow [2022-12-13 15:41:50,347 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 95 transitions, 512 flow, removed 22 selfloop flow, removed 5 redundant places. [2022-12-13 15:41:50,348 INFO L231 Difference]: Finished difference. Result has 57 places, 42 transitions, 222 flow [2022-12-13 15:41:50,348 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=290, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=222, PETRI_PLACES=57, PETRI_TRANSITIONS=42} [2022-12-13 15:41:50,349 INFO L288 CegarLoopForPetriNet]: 53 programPoint places, 4 predicate places. [2022-12-13 15:41:50,349 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 42 transitions, 222 flow [2022-12-13 15:41:50,349 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 132.85714285714286) internal successors, (930), 7 states have internal predecessors, (930), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:41:50,349 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 15:41:50,350 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:41:50,358 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b6b6f65-d949-46c2-8021-d6bdb93b0c59/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 15:41:50,550 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b6b6f65-d949-46c2-8021-d6bdb93b0c59/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 15:41:50,551 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-12-13 15:41:50,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:41:50,553 INFO L85 PathProgramCache]: Analyzing trace with hash -317843764, now seen corresponding path program 1 times [2022-12-13 15:41:50,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 15:41:50,554 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [963095769] [2022-12-13 15:41:50,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:41:50,555 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 15:41:50,555 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b6b6f65-d949-46c2-8021-d6bdb93b0c59/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 15:41:50,558 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b6b6f65-d949-46c2-8021-d6bdb93b0c59/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 15:41:50,561 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b6b6f65-d949-46c2-8021-d6bdb93b0c59/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 15:41:50,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:41:50,725 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 17 conjunts are in the unsatisfiable core [2022-12-13 15:41:50,727 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 15:41:50,958 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 15:41:50,958 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 15:41:50,958 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 15:41:50,958 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [963095769] [2022-12-13 15:41:50,958 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [963095769] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:41:50,959 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:41:50,959 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 15:41:50,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917007768] [2022-12-13 15:41:50,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:41:50,959 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 15:41:50,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 15:41:50,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 15:41:50,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-12-13 15:41:51,023 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 290 [2022-12-13 15:41:51,024 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 42 transitions, 222 flow. Second operand has 8 states, 8 states have (on average 133.0) internal successors, (1064), 8 states have internal predecessors, (1064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:41:51,025 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 15:41:51,025 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 290 [2022-12-13 15:41:51,025 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 15:41:51,497 INFO L130 PetriNetUnfolder]: 1159/1791 cut-off events. [2022-12-13 15:41:51,497 INFO L131 PetriNetUnfolder]: For 1966/1966 co-relation queries the response was YES. [2022-12-13 15:41:51,499 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5331 conditions, 1791 events. 1159/1791 cut-off events. For 1966/1966 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 8439 event pairs, 195 based on Foata normal form. 0/1782 useless extension candidates. Maximal degree in co-relation 5320. Up to 773 conditions per place. [2022-12-13 15:41:51,503 INFO L137 encePairwiseOnDemand]: 284/290 looper letters, 101 selfloop transitions, 6 changer transitions 0/111 dead transitions. [2022-12-13 15:41:51,503 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 111 transitions, 814 flow [2022-12-13 15:41:51,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 15:41:51,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 15:41:51,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 982 transitions. [2022-12-13 15:41:51,505 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.483743842364532 [2022-12-13 15:41:51,505 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 982 transitions. [2022-12-13 15:41:51,505 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 982 transitions. [2022-12-13 15:41:51,505 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 15:41:51,505 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 982 transitions. [2022-12-13 15:41:51,507 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 140.28571428571428) internal successors, (982), 7 states have internal predecessors, (982), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:41:51,508 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 290.0) internal successors, (2320), 8 states have internal predecessors, (2320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:41:51,508 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 290.0) internal successors, (2320), 8 states have internal predecessors, (2320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:41:51,509 INFO L175 Difference]: Start difference. First operand has 57 places, 42 transitions, 222 flow. Second operand 7 states and 982 transitions. [2022-12-13 15:41:51,509 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 111 transitions, 814 flow [2022-12-13 15:41:51,519 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 111 transitions, 658 flow, removed 38 selfloop flow, removed 7 redundant places. [2022-12-13 15:41:51,519 INFO L231 Difference]: Finished difference. Result has 56 places, 44 transitions, 182 flow [2022-12-13 15:41:51,520 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=290, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=182, PETRI_PLACES=56, PETRI_TRANSITIONS=44} [2022-12-13 15:41:51,520 INFO L288 CegarLoopForPetriNet]: 53 programPoint places, 3 predicate places. [2022-12-13 15:41:51,520 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 44 transitions, 182 flow [2022-12-13 15:41:51,520 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 133.0) internal successors, (1064), 8 states have internal predecessors, (1064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:41:51,520 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 15:41:51,521 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:41:51,529 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b6b6f65-d949-46c2-8021-d6bdb93b0c59/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 15:41:51,721 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b6b6f65-d949-46c2-8021-d6bdb93b0c59/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 15:41:51,722 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-12-13 15:41:51,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:41:51,723 INFO L85 PathProgramCache]: Analyzing trace with hash 288028920, now seen corresponding path program 2 times [2022-12-13 15:41:51,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 15:41:51,725 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [468791915] [2022-12-13 15:41:51,725 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 15:41:51,726 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 15:41:51,726 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b6b6f65-d949-46c2-8021-d6bdb93b0c59/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 15:41:51,728 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b6b6f65-d949-46c2-8021-d6bdb93b0c59/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 15:41:51,730 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b6b6f65-d949-46c2-8021-d6bdb93b0c59/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 15:41:51,825 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-12-13 15:41:51,825 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 15:41:51,830 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-13 15:41:51,831 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 15:41:51,852 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 15:41:51,853 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 15:41:51,853 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 15:41:51,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [468791915] [2022-12-13 15:41:51,853 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [468791915] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:41:51,853 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:41:51,853 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 15:41:51,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707480028] [2022-12-13 15:41:51,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:41:51,854 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 15:41:51,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 15:41:51,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 15:41:51,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 15:41:51,860 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 290 [2022-12-13 15:41:51,861 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 44 transitions, 182 flow. Second operand has 3 states, 3 states have (on average 141.33333333333334) internal successors, (424), 3 states have internal predecessors, (424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:41:51,861 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 15:41:51,861 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 290 [2022-12-13 15:41:51,861 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 15:41:52,226 INFO L130 PetriNetUnfolder]: 2066/3220 cut-off events. [2022-12-13 15:41:52,226 INFO L131 PetriNetUnfolder]: For 2567/2567 co-relation queries the response was YES. [2022-12-13 15:41:52,231 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9181 conditions, 3220 events. 2066/3220 cut-off events. For 2567/2567 co-relation queries the response was YES. Maximal size of possible extension queue 168. Compared 17966 event pairs, 858 based on Foata normal form. 1/3190 useless extension candidates. Maximal degree in co-relation 9171. Up to 1777 conditions per place. [2022-12-13 15:41:52,237 INFO L137 encePairwiseOnDemand]: 287/290 looper letters, 75 selfloop transitions, 2 changer transitions 0/80 dead transitions. [2022-12-13 15:41:52,237 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 80 transitions, 492 flow [2022-12-13 15:41:52,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 15:41:52,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 15:41:52,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 449 transitions. [2022-12-13 15:41:52,239 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5160919540229885 [2022-12-13 15:41:52,239 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 449 transitions. [2022-12-13 15:41:52,239 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 449 transitions. [2022-12-13 15:41:52,239 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 15:41:52,239 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 449 transitions. [2022-12-13 15:41:52,240 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 149.66666666666666) internal successors, (449), 3 states have internal predecessors, (449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:41:52,240 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 290.0) internal successors, (1160), 4 states have internal predecessors, (1160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:41:52,241 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 290.0) internal successors, (1160), 4 states have internal predecessors, (1160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:41:52,241 INFO L175 Difference]: Start difference. First operand has 56 places, 44 transitions, 182 flow. Second operand 3 states and 449 transitions. [2022-12-13 15:41:52,241 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 80 transitions, 492 flow [2022-12-13 15:41:52,269 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 80 transitions, 484 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-13 15:41:52,270 INFO L231 Difference]: Finished difference. Result has 56 places, 45 transitions, 188 flow [2022-12-13 15:41:52,270 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=290, PETRI_DIFFERENCE_MINUEND_FLOW=176, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=188, PETRI_PLACES=56, PETRI_TRANSITIONS=45} [2022-12-13 15:41:52,270 INFO L288 CegarLoopForPetriNet]: 53 programPoint places, 3 predicate places. [2022-12-13 15:41:52,270 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 45 transitions, 188 flow [2022-12-13 15:41:52,270 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 141.33333333333334) internal successors, (424), 3 states have internal predecessors, (424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:41:52,271 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 15:41:52,271 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:41:52,278 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b6b6f65-d949-46c2-8021-d6bdb93b0c59/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)] Ended with exit code 0 [2022-12-13 15:41:52,471 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b6b6f65-d949-46c2-8021-d6bdb93b0c59/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 15:41:52,472 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-12-13 15:41:52,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:41:52,474 INFO L85 PathProgramCache]: Analyzing trace with hash 273466740, now seen corresponding path program 3 times [2022-12-13 15:41:52,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 15:41:52,475 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [633844349] [2022-12-13 15:41:52,476 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 15:41:52,476 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 15:41:52,477 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b6b6f65-d949-46c2-8021-d6bdb93b0c59/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 15:41:52,479 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b6b6f65-d949-46c2-8021-d6bdb93b0c59/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 15:41:52,482 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b6b6f65-d949-46c2-8021-d6bdb93b0c59/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 15:41:52,584 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-12-13 15:41:52,585 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 15:41:52,589 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 15:41:52,590 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 15:41:52,611 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 15:41:52,611 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 15:41:52,611 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 15:41:52,611 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [633844349] [2022-12-13 15:41:52,611 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [633844349] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:41:52,611 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:41:52,611 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 15:41:52,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852671964] [2022-12-13 15:41:52,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:41:52,612 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 15:41:52,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 15:41:52,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 15:41:52,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 15:41:52,620 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 290 [2022-12-13 15:41:52,621 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 45 transitions, 188 flow. Second operand has 4 states, 4 states have (on average 138.25) internal successors, (553), 4 states have internal predecessors, (553), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:41:52,621 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 15:41:52,621 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 290 [2022-12-13 15:41:52,621 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 15:41:53,165 INFO L130 PetriNetUnfolder]: 3389/5467 cut-off events. [2022-12-13 15:41:53,165 INFO L131 PetriNetUnfolder]: For 4183/4184 co-relation queries the response was YES. [2022-12-13 15:41:53,172 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15611 conditions, 5467 events. 3389/5467 cut-off events. For 4183/4184 co-relation queries the response was YES. Maximal size of possible extension queue 263. Compared 34037 event pairs, 418 based on Foata normal form. 1/5467 useless extension candidates. Maximal degree in co-relation 15600. Up to 2588 conditions per place. [2022-12-13 15:41:53,184 INFO L137 encePairwiseOnDemand]: 287/290 looper letters, 92 selfloop transitions, 2 changer transitions 0/97 dead transitions. [2022-12-13 15:41:53,184 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 97 transitions, 608 flow [2022-12-13 15:41:53,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 15:41:53,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 15:41:53,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 586 transitions. [2022-12-13 15:41:53,186 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5051724137931034 [2022-12-13 15:41:53,186 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 586 transitions. [2022-12-13 15:41:53,186 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 586 transitions. [2022-12-13 15:41:53,186 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 15:41:53,186 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 586 transitions. [2022-12-13 15:41:53,187 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 146.5) internal successors, (586), 4 states have internal predecessors, (586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:41:53,188 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 290.0) internal successors, (1450), 5 states have internal predecessors, (1450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:41:53,189 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 290.0) internal successors, (1450), 5 states have internal predecessors, (1450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:41:53,189 INFO L175 Difference]: Start difference. First operand has 56 places, 45 transitions, 188 flow. Second operand 4 states and 586 transitions. [2022-12-13 15:41:53,189 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 97 transitions, 608 flow [2022-12-13 15:41:53,247 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 97 transitions, 605 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 15:41:53,247 INFO L231 Difference]: Finished difference. Result has 60 places, 46 transitions, 199 flow [2022-12-13 15:41:53,248 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=290, PETRI_DIFFERENCE_MINUEND_FLOW=186, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=199, PETRI_PLACES=60, PETRI_TRANSITIONS=46} [2022-12-13 15:41:53,248 INFO L288 CegarLoopForPetriNet]: 53 programPoint places, 7 predicate places. [2022-12-13 15:41:53,248 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 46 transitions, 199 flow [2022-12-13 15:41:53,248 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 138.25) internal successors, (553), 4 states have internal predecessors, (553), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:41:53,248 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 15:41:53,248 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:41:53,256 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b6b6f65-d949-46c2-8021-d6bdb93b0c59/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 15:41:53,449 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b6b6f65-d949-46c2-8021-d6bdb93b0c59/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 15:41:53,450 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-12-13 15:41:53,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:41:53,451 INFO L85 PathProgramCache]: Analyzing trace with hash 736021638, now seen corresponding path program 4 times [2022-12-13 15:41:53,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 15:41:53,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2133011027] [2022-12-13 15:41:53,452 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-13 15:41:53,453 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 15:41:53,453 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b6b6f65-d949-46c2-8021-d6bdb93b0c59/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 15:41:53,456 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b6b6f65-d949-46c2-8021-d6bdb93b0c59/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 15:41:53,458 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b6b6f65-d949-46c2-8021-d6bdb93b0c59/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 15:41:53,625 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-13 15:41:53,625 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 15:41:53,630 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 15:41:53,631 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 15:41:53,650 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 15:41:53,650 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 15:41:53,650 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 15:41:53,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2133011027] [2022-12-13 15:41:53,650 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2133011027] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:41:53,650 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:41:53,651 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 15:41:53,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906517860] [2022-12-13 15:41:53,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:41:53,651 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 15:41:53,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 15:41:53,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 15:41:53,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 15:41:53,659 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 290 [2022-12-13 15:41:53,659 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 46 transitions, 199 flow. Second operand has 4 states, 4 states have (on average 138.25) internal successors, (553), 4 states have internal predecessors, (553), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:41:53,659 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 15:41:53,660 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 290 [2022-12-13 15:41:53,660 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 15:41:54,397 INFO L130 PetriNetUnfolder]: 5141/8093 cut-off events. [2022-12-13 15:41:54,397 INFO L131 PetriNetUnfolder]: For 7617/7618 co-relation queries the response was YES. [2022-12-13 15:41:54,405 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23968 conditions, 8093 events. 5141/8093 cut-off events. For 7617/7618 co-relation queries the response was YES. Maximal size of possible extension queue 431. Compared 51749 event pairs, 1335 based on Foata normal form. 1/8016 useless extension candidates. Maximal degree in co-relation 23955. Up to 3438 conditions per place. [2022-12-13 15:41:54,420 INFO L137 encePairwiseOnDemand]: 287/290 looper letters, 87 selfloop transitions, 2 changer transitions 0/93 dead transitions. [2022-12-13 15:41:54,420 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 93 transitions, 596 flow [2022-12-13 15:41:54,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 15:41:54,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 15:41:54,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 581 transitions. [2022-12-13 15:41:54,422 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5008620689655172 [2022-12-13 15:41:54,423 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 581 transitions. [2022-12-13 15:41:54,423 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 581 transitions. [2022-12-13 15:41:54,423 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 15:41:54,423 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 581 transitions. [2022-12-13 15:41:54,424 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 145.25) internal successors, (581), 4 states have internal predecessors, (581), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:41:54,426 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 290.0) internal successors, (1450), 5 states have internal predecessors, (1450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:41:54,427 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 290.0) internal successors, (1450), 5 states have internal predecessors, (1450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:41:54,427 INFO L175 Difference]: Start difference. First operand has 60 places, 46 transitions, 199 flow. Second operand 4 states and 581 transitions. [2022-12-13 15:41:54,427 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 93 transitions, 596 flow [2022-12-13 15:41:54,566 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 93 transitions, 594 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 15:41:54,567 INFO L231 Difference]: Finished difference. Result has 64 places, 47 transitions, 211 flow [2022-12-13 15:41:54,567 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=290, PETRI_DIFFERENCE_MINUEND_FLOW=198, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=211, PETRI_PLACES=64, PETRI_TRANSITIONS=47} [2022-12-13 15:41:54,568 INFO L288 CegarLoopForPetriNet]: 53 programPoint places, 11 predicate places. [2022-12-13 15:41:54,568 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 47 transitions, 211 flow [2022-12-13 15:41:54,568 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 138.25) internal successors, (553), 4 states have internal predecessors, (553), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:41:54,568 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 15:41:54,568 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:41:54,577 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b6b6f65-d949-46c2-8021-d6bdb93b0c59/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)] Forceful destruction successful, exit code 0 [2022-12-13 15:41:54,769 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b6b6f65-d949-46c2-8021-d6bdb93b0c59/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 15:41:54,770 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-12-13 15:41:54,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:41:54,772 INFO L85 PathProgramCache]: Analyzing trace with hash -488968422, now seen corresponding path program 5 times [2022-12-13 15:41:54,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 15:41:54,773 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1553084117] [2022-12-13 15:41:54,773 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-13 15:41:54,774 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 15:41:54,774 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b6b6f65-d949-46c2-8021-d6bdb93b0c59/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 15:41:54,777 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b6b6f65-d949-46c2-8021-d6bdb93b0c59/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 15:41:54,780 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b6b6f65-d949-46c2-8021-d6bdb93b0c59/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 15:41:54,933 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-12-13 15:41:54,933 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-12-13 15:41:54,933 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 15:41:55,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 15:41:55,049 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-12-13 15:41:55,049 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 15:41:55,050 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (15 of 16 remaining) [2022-12-13 15:41:55,051 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (14 of 16 remaining) [2022-12-13 15:41:55,051 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2022-12-13 15:41:55,051 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining) [2022-12-13 15:41:55,052 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2022-12-13 15:41:55,052 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2022-12-13 15:41:55,052 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2022-12-13 15:41:55,052 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2022-12-13 15:41:55,052 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2022-12-13 15:41:55,052 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2022-12-13 15:41:55,052 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (5 of 16 remaining) [2022-12-13 15:41:55,052 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 16 remaining) [2022-12-13 15:41:55,052 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 16 remaining) [2022-12-13 15:41:55,053 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 16 remaining) [2022-12-13 15:41:55,053 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 16 remaining) [2022-12-13 15:41:55,053 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2022-12-13 15:41:55,066 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b6b6f65-d949-46c2-8021-d6bdb93b0c59/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)] Forceful destruction successful, exit code 0 [2022-12-13 15:41:55,253 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b6b6f65-d949-46c2-8021-d6bdb93b0c59/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 15:41:55,254 INFO L445 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1, 1, 1] [2022-12-13 15:41:55,270 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 15:41:55,270 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 15:41:55,340 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 03:41:55 BasicIcfg [2022-12-13 15:41:55,340 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 15:41:55,341 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-13 15:41:55,341 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-13 15:41:55,341 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-13 15:41:55,341 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 03:41:36" (3/4) ... [2022-12-13 15:41:55,343 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-12-13 15:41:55,343 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-13 15:41:55,344 INFO L158 Benchmark]: Toolchain (without parser) took 19810.86ms. Allocated memory was 67.1MB in the beginning and 685.8MB in the end (delta: 618.7MB). Free memory was 41.8MB in the beginning and 413.8MB in the end (delta: -372.0MB). Peak memory consumption was 247.3MB. Max. memory is 16.1GB. [2022-12-13 15:41:55,344 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 67.1MB. Free memory is still 46.7MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 15:41:55,344 INFO L158 Benchmark]: CACSL2BoogieTranslator took 463.26ms. Allocated memory is still 67.1MB. Free memory was 41.8MB in the beginning and 34.0MB in the end (delta: 7.8MB). Peak memory consumption was 18.7MB. Max. memory is 16.1GB. [2022-12-13 15:41:55,345 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.69ms. Allocated memory is still 67.1MB. Free memory was 34.0MB in the beginning and 31.3MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 15:41:55,345 INFO L158 Benchmark]: Boogie Preprocessor took 30.76ms. Allocated memory is still 67.1MB. Free memory was 31.3MB in the beginning and 29.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 15:41:55,345 INFO L158 Benchmark]: RCFGBuilder took 650.58ms. Allocated memory was 67.1MB in the beginning and 81.8MB in the end (delta: 14.7MB). Free memory was 28.9MB in the beginning and 47.6MB in the end (delta: -18.7MB). Peak memory consumption was 17.4MB. Max. memory is 16.1GB. [2022-12-13 15:41:55,345 INFO L158 Benchmark]: TraceAbstraction took 18608.65ms. Allocated memory was 81.8MB in the beginning and 685.8MB in the end (delta: 604.0MB). Free memory was 46.7MB in the beginning and 413.8MB in the end (delta: -367.1MB). Peak memory consumption was 236.3MB. Max. memory is 16.1GB. [2022-12-13 15:41:55,346 INFO L158 Benchmark]: Witness Printer took 2.67ms. Allocated memory is still 685.8MB. Free memory is still 413.8MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 15:41:55,347 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.11ms. Allocated memory is still 67.1MB. Free memory is still 46.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 463.26ms. Allocated memory is still 67.1MB. Free memory was 41.8MB in the beginning and 34.0MB in the end (delta: 7.8MB). Peak memory consumption was 18.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.69ms. Allocated memory is still 67.1MB. Free memory was 34.0MB in the beginning and 31.3MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 30.76ms. Allocated memory is still 67.1MB. Free memory was 31.3MB in the beginning and 29.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 650.58ms. Allocated memory was 67.1MB in the beginning and 81.8MB in the end (delta: 14.7MB). Free memory was 28.9MB in the beginning and 47.6MB in the end (delta: -18.7MB). Peak memory consumption was 17.4MB. Max. memory is 16.1GB. * TraceAbstraction took 18608.65ms. Allocated memory was 81.8MB in the beginning and 685.8MB in the end (delta: 604.0MB). Free memory was 46.7MB in the beginning and 413.8MB in the end (delta: -367.1MB). Peak memory consumption was 236.3MB. Max. memory is 16.1GB. * Witness Printer took 2.67ms. Allocated memory is still 685.8MB. Free memory is still 413.8MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.7s, 158 PlacesBefore, 53 PlacesAfterwards, 147 TransitionsBefore, 41 TransitionsAfterwards, 3764 CoEnabledTransitionPairs, 7 FixpointIterations, 54 TrivialSequentialCompositions, 77 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 1 ChoiceCompositions, 139 TotalNumberOfCompositions, 10874 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4896, independent: 4648, independent conditional: 0, independent unconditional: 4648, dependent: 248, dependent conditional: 0, dependent unconditional: 248, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 2035, independent: 1971, independent conditional: 0, independent unconditional: 1971, dependent: 64, dependent conditional: 0, dependent unconditional: 64, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 4896, independent: 2677, independent conditional: 0, independent unconditional: 2677, dependent: 184, dependent conditional: 0, dependent unconditional: 184, unknown: 2035, unknown conditional: 0, unknown unconditional: 2035] , Statistics on independence cache: Total cache size (in pairs): 216, Positive cache size: 195, Positive conditional cache size: 0, Positive unconditional cache size: 195, Negative cache size: 21, Negative conditional cache size: 0, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int __unbuffered_p3_EBX = 0; [L720] 0 int a = 0; [L721] 0 _Bool a$flush_delayed; [L722] 0 int a$mem_tmp; [L723] 0 _Bool a$r_buff0_thd0; [L724] 0 _Bool a$r_buff0_thd1; [L725] 0 _Bool a$r_buff0_thd2; [L726] 0 _Bool a$r_buff0_thd3; [L727] 0 _Bool a$r_buff0_thd4; [L728] 0 _Bool a$r_buff1_thd0; [L729] 0 _Bool a$r_buff1_thd1; [L730] 0 _Bool a$r_buff1_thd2; [L731] 0 _Bool a$r_buff1_thd3; [L732] 0 _Bool a$r_buff1_thd4; [L733] 0 _Bool a$read_delayed; [L734] 0 int *a$read_delayed_var; [L735] 0 int a$w_buff0; [L736] 0 _Bool a$w_buff0_used; [L737] 0 int a$w_buff1; [L738] 0 _Bool a$w_buff1_used; [L739] 0 _Bool main$tmp_guard0; [L740] 0 _Bool main$tmp_guard1; [L742] 0 int x = 0; [L744] 0 int y = 0; [L746] 0 int z = 0; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice2; [L866] 0 pthread_t t465; [L867] FCALL, FORK 0 pthread_create(&t465, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t465, ((void *)0), P0, ((void *)0))=-1, t465={11:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L868] 0 pthread_t t466; [L752] 1 a$w_buff1 = a$w_buff0 [L753] 1 a$w_buff0 = 1 [L754] 1 a$w_buff1_used = a$w_buff0_used [L755] 1 a$w_buff0_used = (_Bool)1 [L756] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L756] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L757] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L758] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L759] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L760] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L761] 1 a$r_buff1_thd4 = a$r_buff0_thd4 [L762] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L869] FCALL, FORK 0 pthread_create(&t466, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t466, ((void *)0), P1, ((void *)0))=0, t465={11:0}, t466={15:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L870] 0 pthread_t t467; [L765] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L782] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L785] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L788] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L789] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L790] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L791] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L792] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L871] FCALL, FORK 0 pthread_create(&t467, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t467, ((void *)0), P2, ((void *)0))=1, t465={11:0}, t466={15:0}, t467={7:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L802] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L872] 0 pthread_t t468; [L795] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L797] 2 return 0; [L805] 3 __unbuffered_p2_EAX = z VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L873] FCALL, FORK 0 pthread_create(&t468, ((void *)0), P3, ((void *)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t468, ((void *)0), P3, ((void *)0))=2, t465={11:0}, t466={15:0}, t467={7:0}, t468={-2147483637:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L808] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L809] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L810] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L811] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L812] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L815] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L817] 3 return 0; [L822] 4 z = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L825] 4 __unbuffered_p3_EAX = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L828] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L829] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L830] 4 a$flush_delayed = weak$$choice2 [L831] 4 a$mem_tmp = a [L832] 4 a = !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L833] 4 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L834] 4 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L835] 4 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L836] 4 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L837] 4 a$r_buff0_thd4 = weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L838] 4 a$r_buff1_thd4 = weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L839] 4 __unbuffered_p3_EBX = a [L840] 4 a = a$flush_delayed ? a$mem_tmp : a [L841] 4 a$flush_delayed = (_Bool)0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=0, x=2, y=1, z=1] [L768] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L769] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L770] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L771] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L772] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=0, x=2, y=1, z=1] [L844] 4 a = a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L845] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L846] 4 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L847] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L848] 4 a$r_buff1_thd4 = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=0, x=2, y=1, z=1] [L851] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L853] 4 return 0; [L775] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L777] 1 return 0; [L875] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L877] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L877] RET 0 assume_abort_if_not(main$tmp_guard0) [L879] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L880] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L881] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L882] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L883] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t465={11:0}, t466={15:0}, t467={7:0}, t468={-2147483637:0}, weak$$choice0=2, weak$$choice2=0, x=2, y=1, z=1] [L886] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L888] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=0, x=2, y=1, z=1] - 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: 864]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 873]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 869]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 871]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 867]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 188 locations, 16 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 18.4s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 7.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 478 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 404 mSDsluCounter, 152 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 107 mSDsCounter, 68 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1898 IncrementalHoareTripleChecker+Invalid, 1966 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 68 mSolverCounterUnsat, 45 mSDtfsCounter, 1898 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 184 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=228occurred 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.4s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 212 NumberOfCodeBlocks, 212 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 174 ConstructedInterpolants, 0 QuantifiedInterpolants, 739 SizeOfPredicates, 18 NumberOfNonLiveVariables, 1502 ConjunctsInSsa, 66 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 15:41:55,366 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b6b6f65-d949-46c2-8021-d6bdb93b0c59/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample