./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/safe020_rmo.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_1ff8853c-4614-4805-9a13-aaae87bb1caa/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ff8853c-4614-4805-9a13-aaae87bb1caa/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_1ff8853c-4614-4805-9a13-aaae87bb1caa/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ff8853c-4614-4805-9a13-aaae87bb1caa/bin/uautomizer-uyxdKDjOR8/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe020_rmo.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ff8853c-4614-4805-9a13-aaae87bb1caa/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_1ff8853c-4614-4805-9a13-aaae87bb1caa/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 d52a8576f41904f21a1a217cd81ed2d36ac8928d5a02d745a0c93a101e2535cf --- 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 13:47:24,098 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 13:47:24,100 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 13:47:24,113 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 13:47:24,113 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 13:47:24,114 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 13:47:24,114 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 13:47:24,115 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 13:47:24,116 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 13:47:24,117 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 13:47:24,118 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 13:47:24,118 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 13:47:24,118 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 13:47:24,119 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 13:47:24,120 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 13:47:24,121 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 13:47:24,121 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 13:47:24,122 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 13:47:24,123 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 13:47:24,124 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 13:47:24,125 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 13:47:24,126 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 13:47:24,126 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 13:47:24,127 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 13:47:24,129 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 13:47:24,129 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 13:47:24,129 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 13:47:24,130 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 13:47:24,130 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 13:47:24,131 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 13:47:24,131 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 13:47:24,132 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 13:47:24,132 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 13:47:24,133 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 13:47:24,133 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 13:47:24,133 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 13:47:24,134 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 13:47:24,134 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 13:47:24,134 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 13:47:24,135 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 13:47:24,135 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 13:47:24,136 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ff8853c-4614-4805-9a13-aaae87bb1caa/bin/uautomizer-uyxdKDjOR8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-12-13 13:47:24,151 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 13:47:24,151 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 13:47:24,151 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 13:47:24,151 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 13:47:24,152 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 13:47:24,152 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 13:47:24,152 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 13:47:24,153 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 13:47:24,153 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 13:47:24,153 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 13:47:24,153 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 13:47:24,153 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-13 13:47:24,153 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 13:47:24,153 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 13:47:24,154 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 13:47:24,154 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-12-13 13:47:24,154 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-12-13 13:47:24,154 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-12-13 13:47:24,154 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 13:47:24,154 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-12-13 13:47:24,154 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 13:47:24,154 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 13:47:24,154 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 13:47:24,154 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 13:47:24,155 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 13:47:24,155 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 13:47:24,155 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 13:47:24,155 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 13:47:24,155 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 13:47:24,155 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 13:47:24,155 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 13:47:24,155 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 13:47:24,156 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 13:47:24,156 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 13:47:24,156 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_1ff8853c-4614-4805-9a13-aaae87bb1caa/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_1ff8853c-4614-4805-9a13-aaae87bb1caa/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 -> d52a8576f41904f21a1a217cd81ed2d36ac8928d5a02d745a0c93a101e2535cf [2022-12-13 13:47:24,328 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 13:47:24,345 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 13:47:24,347 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 13:47:24,348 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 13:47:24,349 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 13:47:24,349 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ff8853c-4614-4805-9a13-aaae87bb1caa/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/pthread-wmm/safe020_rmo.i [2022-12-13 13:47:26,954 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 13:47:27,175 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 13:47:27,176 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ff8853c-4614-4805-9a13-aaae87bb1caa/sv-benchmarks/c/pthread-wmm/safe020_rmo.i [2022-12-13 13:47:27,187 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ff8853c-4614-4805-9a13-aaae87bb1caa/bin/uautomizer-uyxdKDjOR8/data/e072c8155/811f4f07405244b8b30f8164ab0de48f/FLAG446fb7989 [2022-12-13 13:47:27,197 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ff8853c-4614-4805-9a13-aaae87bb1caa/bin/uautomizer-uyxdKDjOR8/data/e072c8155/811f4f07405244b8b30f8164ab0de48f [2022-12-13 13:47:27,199 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 13:47:27,200 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 13:47:27,201 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 13:47:27,201 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 13:47:27,204 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 13:47:27,204 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 01:47:27" (1/1) ... [2022-12-13 13:47:27,205 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ab3b3a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:47:27, skipping insertion in model container [2022-12-13 13:47:27,205 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 01:47:27" (1/1) ... [2022-12-13 13:47:27,210 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 13:47:27,235 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 13:47:27,348 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_1ff8853c-4614-4805-9a13-aaae87bb1caa/sv-benchmarks/c/pthread-wmm/safe020_rmo.i[988,1001] [2022-12-13 13:47:27,436 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:47:27,436 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:47:27,436 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:47:27,436 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:47:27,437 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:47:27,443 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:47:27,444 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:47:27,444 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:47:27,444 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:47:27,444 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:47:27,445 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:47:27,445 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:47:27,445 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:47:27,447 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:47:27,448 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:47:27,448 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:47:27,448 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:47:27,455 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:47:27,455 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:47:27,455 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:47:27,456 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:47:27,457 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:47:27,458 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:47:27,458 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:47:27,462 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:47:27,462 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:47:27,462 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:47:27,464 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:47:27,465 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:47:27,466 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:47:27,466 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 13:47:27,474 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 13:47:27,483 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_1ff8853c-4614-4805-9a13-aaae87bb1caa/sv-benchmarks/c/pthread-wmm/safe020_rmo.i[988,1001] [2022-12-13 13:47:27,499 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:47:27,499 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:47:27,499 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:47:27,499 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:47:27,499 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:47:27,504 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:47:27,504 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:47:27,505 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:47:27,505 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:47:27,505 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:47:27,505 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:47:27,506 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:47:27,506 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:47:27,507 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:47:27,507 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:47:27,508 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:47:27,508 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:47:27,513 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:47:27,513 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:47:27,513 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:47:27,513 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:47:27,515 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:47:27,515 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:47:27,515 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:47:27,517 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:47:27,518 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:47:27,518 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:47:27,519 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:47:27,520 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:47:27,520 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:47:27,521 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 13:47:27,542 INFO L208 MainTranslator]: Completed translation [2022-12-13 13:47:27,542 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:47:27 WrapperNode [2022-12-13 13:47:27,542 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 13:47:27,543 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 13:47:27,543 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 13:47:27,544 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 13:47:27,549 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:47:27" (1/1) ... [2022-12-13 13:47:27,561 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:47:27" (1/1) ... [2022-12-13 13:47:27,577 INFO L138 Inliner]: procedures = 176, calls = 75, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 135 [2022-12-13 13:47:27,577 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 13:47:27,578 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 13:47:27,578 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 13:47:27,578 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 13:47:27,585 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:47:27" (1/1) ... [2022-12-13 13:47:27,585 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:47:27" (1/1) ... [2022-12-13 13:47:27,588 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:47:27" (1/1) ... [2022-12-13 13:47:27,588 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:47:27" (1/1) ... [2022-12-13 13:47:27,596 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:47:27" (1/1) ... [2022-12-13 13:47:27,598 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:47:27" (1/1) ... [2022-12-13 13:47:27,600 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:47:27" (1/1) ... [2022-12-13 13:47:27,601 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:47:27" (1/1) ... [2022-12-13 13:47:27,604 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 13:47:27,604 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 13:47:27,605 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 13:47:27,605 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 13:47:27,605 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:47:27" (1/1) ... [2022-12-13 13:47:27,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 13:47:27,619 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ff8853c-4614-4805-9a13-aaae87bb1caa/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:47:27,629 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ff8853c-4614-4805-9a13-aaae87bb1caa/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 13:47:27,631 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ff8853c-4614-4805-9a13-aaae87bb1caa/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 13:47:27,664 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 13:47:27,664 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 13:47:27,665 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 13:47:27,665 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 13:47:27,665 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 13:47:27,665 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 13:47:27,665 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 13:47:27,665 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 13:47:27,665 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 13:47:27,665 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 13:47:27,665 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-13 13:47:27,665 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-13 13:47:27,665 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 13:47:27,665 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 13:47:27,666 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 13:47:27,666 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 13:47:27,667 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 13:47:27,780 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 13:47:27,781 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 13:47:28,185 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 13:47:28,412 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 13:47:28,412 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 13:47:28,414 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 01:47:28 BoogieIcfgContainer [2022-12-13 13:47:28,414 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 13:47:28,415 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 13:47:28,415 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 13:47:28,418 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 13:47:28,418 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 01:47:27" (1/3) ... [2022-12-13 13:47:28,418 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@683cfb16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 01:47:28, skipping insertion in model container [2022-12-13 13:47:28,418 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:47:27" (2/3) ... [2022-12-13 13:47:28,419 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@683cfb16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 01:47:28, skipping insertion in model container [2022-12-13 13:47:28,419 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 01:47:28" (3/3) ... [2022-12-13 13:47:28,420 INFO L112 eAbstractionObserver]: Analyzing ICFG safe020_rmo.i [2022-12-13 13:47:28,434 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 13:47:28,435 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 48 error locations. [2022-12-13 13:47:28,435 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 13:47:28,509 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 13:47:28,535 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 188 places, 180 transitions, 375 flow [2022-12-13 13:47:28,583 INFO L130 PetriNetUnfolder]: 2/177 cut-off events. [2022-12-13 13:47:28,584 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 13:47:28,588 INFO L83 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 177 events. 2/177 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 256 event pairs, 0 based on Foata normal form. 0/127 useless extension candidates. Maximal degree in co-relation 117. Up to 2 conditions per place. [2022-12-13 13:47:28,589 INFO L82 GeneralOperation]: Start removeDead. Operand has 188 places, 180 transitions, 375 flow [2022-12-13 13:47:28,593 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 185 places, 177 transitions, 363 flow [2022-12-13 13:47:28,595 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-12-13 13:47:28,603 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 185 places, 177 transitions, 363 flow [2022-12-13 13:47:28,605 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 185 places, 177 transitions, 363 flow [2022-12-13 13:47:28,605 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 185 places, 177 transitions, 363 flow [2022-12-13 13:47:28,631 INFO L130 PetriNetUnfolder]: 2/177 cut-off events. [2022-12-13 13:47:28,631 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 13:47:28,632 INFO L83 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 177 events. 2/177 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 264 event pairs, 0 based on Foata normal form. 0/127 useless extension candidates. Maximal degree in co-relation 117. Up to 2 conditions per place. [2022-12-13 13:47:28,634 INFO L119 LiptonReduction]: Number of co-enabled transitions 7128 [2022-12-13 13:47:33,718 INFO L134 LiptonReduction]: Checked pairs total: 38356 [2022-12-13 13:47:33,719 INFO L136 LiptonReduction]: Total number of compositions: 153 [2022-12-13 13:47:33,729 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 13:47:33,733 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;@261314f, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 13:47:33,733 INFO L358 AbstractCegarLoop]: Starting to check reachability of 85 error locations. [2022-12-13 13:47:33,735 INFO L130 PetriNetUnfolder]: 0/1 cut-off events. [2022-12-13 13:47:33,735 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 13:47:33,735 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:47:33,735 INFO L209 CegarLoopForPetriNet]: trace histogram [1] [2022-12-13 13:47:33,736 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2022-12-13 13:47:33,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:47:33,739 INFO L85 PathProgramCache]: Analyzing trace with hash 1013, now seen corresponding path program 1 times [2022-12-13 13:47:33,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:47:33,746 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119273244] [2022-12-13 13:47:33,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:47:33,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:47:33,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:47:33,824 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 13:47:33,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:47:33,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119273244] [2022-12-13 13:47:33,825 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1119273244] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:47:33,825 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:47:33,825 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-12-13 13:47:33,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049780489] [2022-12-13 13:47:33,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:47:33,833 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-13 13:47:33,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:47:33,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-13 13:47:33,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-13 13:47:33,850 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 333 [2022-12-13 13:47:33,851 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 74 transitions, 157 flow. Second operand has 2 states, 2 states have (on average 130.5) internal successors, (261), 2 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:47:33,851 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:47:33,851 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 333 [2022-12-13 13:47:33,852 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:47:37,516 INFO L130 PetriNetUnfolder]: 25008/34927 cut-off events. [2022-12-13 13:47:37,516 INFO L131 PetriNetUnfolder]: For 37/37 co-relation queries the response was YES. [2022-12-13 13:47:37,553 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69873 conditions, 34927 events. 25008/34927 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 2728. Compared 233039 event pairs, 25008 based on Foata normal form. 600/14933 useless extension candidates. Maximal degree in co-relation 69862. Up to 34808 conditions per place. [2022-12-13 13:47:37,674 INFO L137 encePairwiseOnDemand]: 306/333 looper letters, 46 selfloop transitions, 0 changer transitions 0/47 dead transitions. [2022-12-13 13:47:37,674 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 47 transitions, 195 flow [2022-12-13 13:47:37,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 13:47:37,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-12-13 13:47:37,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 333 transitions. [2022-12-13 13:47:37,685 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5 [2022-12-13 13:47:37,686 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 333 transitions. [2022-12-13 13:47:37,686 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 333 transitions. [2022-12-13 13:47:37,687 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:47:37,689 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 333 transitions. [2022-12-13 13:47:37,692 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 166.5) internal successors, (333), 2 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:47:37,697 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 333.0) internal successors, (999), 3 states have internal predecessors, (999), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:47:37,698 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 333.0) internal successors, (999), 3 states have internal predecessors, (999), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:47:37,699 INFO L175 Difference]: Start difference. First operand has 83 places, 74 transitions, 157 flow. Second operand 2 states and 333 transitions. [2022-12-13 13:47:37,700 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 47 transitions, 195 flow [2022-12-13 13:47:37,704 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 47 transitions, 192 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-13 13:47:37,706 INFO L231 Difference]: Finished difference. Result has 55 places, 47 transitions, 100 flow [2022-12-13 13:47:37,707 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=333, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=100, PETRI_PLACES=55, PETRI_TRANSITIONS=47} [2022-12-13 13:47:37,710 INFO L288 CegarLoopForPetriNet]: 83 programPoint places, -28 predicate places. [2022-12-13 13:47:37,711 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 47 transitions, 100 flow [2022-12-13 13:47:37,711 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 130.5) internal successors, (261), 2 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:47:37,711 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:47:37,711 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2022-12-13 13:47:37,712 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 13:47:37,712 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2022-12-13 13:47:37,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:47:37,713 INFO L85 PathProgramCache]: Analyzing trace with hash 31032643, now seen corresponding path program 1 times [2022-12-13 13:47:37,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:47:37,713 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132601597] [2022-12-13 13:47:37,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:47:37,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:47:37,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:47:37,898 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 13:47:37,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:47:37,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132601597] [2022-12-13 13:47:37,899 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [132601597] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:47:37,899 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:47:37,899 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 13:47:37,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395316644] [2022-12-13 13:47:37,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:47:37,901 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 13:47:37,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:47:37,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 13:47:37,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 13:47:37,934 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 333 [2022-12-13 13:47:37,935 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 47 transitions, 100 flow. Second operand has 3 states, 3 states have (on average 125.33333333333333) internal successors, (376), 3 states have internal predecessors, (376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:47:37,935 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:47:37,935 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 333 [2022-12-13 13:47:37,935 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:47:40,274 INFO L130 PetriNetUnfolder]: 15427/22708 cut-off events. [2022-12-13 13:47:40,274 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 13:47:40,299 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45191 conditions, 22708 events. 15427/22708 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 1515. Compared 154188 event pairs, 9707 based on Foata normal form. 0/12114 useless extension candidates. Maximal degree in co-relation 45188. Up to 13893 conditions per place. [2022-12-13 13:47:40,356 INFO L137 encePairwiseOnDemand]: 314/333 looper letters, 53 selfloop transitions, 10 changer transitions 0/64 dead transitions. [2022-12-13 13:47:40,356 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 64 transitions, 260 flow [2022-12-13 13:47:40,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 13:47:40,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 13:47:40,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 444 transitions. [2022-12-13 13:47:40,359 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4444444444444444 [2022-12-13 13:47:40,360 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 444 transitions. [2022-12-13 13:47:40,360 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 444 transitions. [2022-12-13 13:47:40,360 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:47:40,360 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 444 transitions. [2022-12-13 13:47:40,362 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 148.0) internal successors, (444), 3 states have internal predecessors, (444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:47:40,365 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 333.0) internal successors, (1332), 4 states have internal predecessors, (1332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:47:40,365 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 333.0) internal successors, (1332), 4 states have internal predecessors, (1332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:47:40,365 INFO L175 Difference]: Start difference. First operand has 55 places, 47 transitions, 100 flow. Second operand 3 states and 444 transitions. [2022-12-13 13:47:40,366 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 64 transitions, 260 flow [2022-12-13 13:47:40,366 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 64 transitions, 260 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-13 13:47:40,367 INFO L231 Difference]: Finished difference. Result has 57 places, 53 transitions, 182 flow [2022-12-13 13:47:40,367 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=333, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=182, PETRI_PLACES=57, PETRI_TRANSITIONS=53} [2022-12-13 13:47:40,368 INFO L288 CegarLoopForPetriNet]: 83 programPoint places, -26 predicate places. [2022-12-13 13:47:40,368 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 53 transitions, 182 flow [2022-12-13 13:47:40,368 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 125.33333333333333) internal successors, (376), 3 states have internal predecessors, (376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:47:40,368 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:47:40,368 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2022-12-13 13:47:40,368 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 13:47:40,369 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2022-12-13 13:47:40,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:47:40,369 INFO L85 PathProgramCache]: Analyzing trace with hash 31032644, now seen corresponding path program 1 times [2022-12-13 13:47:40,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:47:40,370 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594336697] [2022-12-13 13:47:40,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:47:40,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:47:40,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:47:40,492 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 13:47:40,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:47:40,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594336697] [2022-12-13 13:47:40,492 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594336697] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:47:40,492 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:47:40,492 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 13:47:40,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68980075] [2022-12-13 13:47:40,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:47:40,493 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 13:47:40,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:47:40,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 13:47:40,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 13:47:40,520 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 333 [2022-12-13 13:47:40,521 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 53 transitions, 182 flow. Second operand has 3 states, 3 states have (on average 129.33333333333334) internal successors, (388), 3 states have internal predecessors, (388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:47:40,521 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:47:40,521 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 333 [2022-12-13 13:47:40,521 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:47:41,266 INFO L130 PetriNetUnfolder]: 4460/6957 cut-off events. [2022-12-13 13:47:41,266 INFO L131 PetriNetUnfolder]: For 2099/2099 co-relation queries the response was YES. [2022-12-13 13:47:41,273 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19675 conditions, 6957 events. 4460/6957 cut-off events. For 2099/2099 co-relation queries the response was YES. Maximal size of possible extension queue 536. Compared 42825 event pairs, 3273 based on Foata normal form. 2015/7978 useless extension candidates. Maximal degree in co-relation 19670. Up to 6801 conditions per place. [2022-12-13 13:47:41,287 INFO L137 encePairwiseOnDemand]: 323/333 looper letters, 41 selfloop transitions, 1 changer transitions 1/44 dead transitions. [2022-12-13 13:47:41,288 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 44 transitions, 250 flow [2022-12-13 13:47:41,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 13:47:41,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 13:47:41,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 428 transitions. [2022-12-13 13:47:41,289 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.42842842842842843 [2022-12-13 13:47:41,289 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 428 transitions. [2022-12-13 13:47:41,289 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 428 transitions. [2022-12-13 13:47:41,290 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:47:41,290 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 428 transitions. [2022-12-13 13:47:41,290 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 142.66666666666666) internal successors, (428), 3 states have internal predecessors, (428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:47:41,292 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 333.0) internal successors, (1332), 4 states have internal predecessors, (1332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:47:41,292 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 333.0) internal successors, (1332), 4 states have internal predecessors, (1332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:47:41,292 INFO L175 Difference]: Start difference. First operand has 57 places, 53 transitions, 182 flow. Second operand 3 states and 428 transitions. [2022-12-13 13:47:41,292 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 44 transitions, 250 flow [2022-12-13 13:47:41,305 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 44 transitions, 230 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 13:47:41,305 INFO L231 Difference]: Finished difference. Result has 48 places, 43 transitions, 144 flow [2022-12-13 13:47:41,305 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=333, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=144, PETRI_PLACES=48, PETRI_TRANSITIONS=43} [2022-12-13 13:47:41,306 INFO L288 CegarLoopForPetriNet]: 83 programPoint places, -35 predicate places. [2022-12-13 13:47:41,306 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 43 transitions, 144 flow [2022-12-13 13:47:41,306 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 129.33333333333334) internal successors, (388), 3 states have internal predecessors, (388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:47:41,306 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:47:41,306 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:47:41,306 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 13:47:41,306 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2022-12-13 13:47:41,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:47:41,307 INFO L85 PathProgramCache]: Analyzing trace with hash 210402903, now seen corresponding path program 1 times [2022-12-13 13:47:41,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:47:41,307 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698806597] [2022-12-13 13:47:41,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:47:41,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:47:41,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:47:41,452 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 13:47:41,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:47:41,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698806597] [2022-12-13 13:47:41,452 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698806597] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:47:41,453 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:47:41,453 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 13:47:41,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111670030] [2022-12-13 13:47:41,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:47:41,453 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 13:47:41,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:47:41,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 13:47:41,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 13:47:41,456 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 333 [2022-12-13 13:47:41,457 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 43 transitions, 144 flow. Second operand has 3 states, 3 states have (on average 132.66666666666666) internal successors, (398), 3 states have internal predecessors, (398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:47:41,457 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:47:41,457 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 333 [2022-12-13 13:47:41,457 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:47:42,355 INFO L130 PetriNetUnfolder]: 4236/6701 cut-off events. [2022-12-13 13:47:42,355 INFO L131 PetriNetUnfolder]: For 827/827 co-relation queries the response was YES. [2022-12-13 13:47:42,363 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17552 conditions, 6701 events. 4236/6701 cut-off events. For 827/827 co-relation queries the response was YES. Maximal size of possible extension queue 531. Compared 42140 event pairs, 1469 based on Foata normal form. 0/5063 useless extension candidates. Maximal degree in co-relation 17547. Up to 4987 conditions per place. [2022-12-13 13:47:42,382 INFO L137 encePairwiseOnDemand]: 329/333 looper letters, 63 selfloop transitions, 3 changer transitions 0/67 dead transitions. [2022-12-13 13:47:42,382 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 67 transitions, 358 flow [2022-12-13 13:47:42,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 13:47:42,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 13:47:42,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 441 transitions. [2022-12-13 13:47:42,384 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.44144144144144143 [2022-12-13 13:47:42,384 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 441 transitions. [2022-12-13 13:47:42,384 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 441 transitions. [2022-12-13 13:47:42,385 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:47:42,385 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 441 transitions. [2022-12-13 13:47:42,386 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 147.0) internal successors, (441), 3 states have internal predecessors, (441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:47:42,387 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 333.0) internal successors, (1332), 4 states have internal predecessors, (1332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:47:42,388 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 333.0) internal successors, (1332), 4 states have internal predecessors, (1332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:47:42,388 INFO L175 Difference]: Start difference. First operand has 48 places, 43 transitions, 144 flow. Second operand 3 states and 441 transitions. [2022-12-13 13:47:42,388 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 67 transitions, 358 flow [2022-12-13 13:47:42,389 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 67 transitions, 357 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 13:47:42,390 INFO L231 Difference]: Finished difference. Result has 49 places, 43 transitions, 156 flow [2022-12-13 13:47:42,390 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=333, PETRI_DIFFERENCE_MINUEND_FLOW=143, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=156, PETRI_PLACES=49, PETRI_TRANSITIONS=43} [2022-12-13 13:47:42,391 INFO L288 CegarLoopForPetriNet]: 83 programPoint places, -34 predicate places. [2022-12-13 13:47:42,391 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 43 transitions, 156 flow [2022-12-13 13:47:42,391 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 132.66666666666666) internal successors, (398), 3 states have internal predecessors, (398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:47:42,391 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:47:42,391 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:47:42,391 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 13:47:42,392 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2022-12-13 13:47:42,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:47:42,392 INFO L85 PathProgramCache]: Analyzing trace with hash 210403137, now seen corresponding path program 1 times [2022-12-13 13:47:42,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:47:42,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620309268] [2022-12-13 13:47:42,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:47:42,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:47:42,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:47:42,526 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 13:47:42,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:47:42,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620309268] [2022-12-13 13:47:42,526 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1620309268] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:47:42,527 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:47:42,527 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 13:47:42,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672770390] [2022-12-13 13:47:42,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:47:42,527 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 13:47:42,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:47:42,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 13:47:42,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 13:47:42,532 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 333 [2022-12-13 13:47:42,533 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 43 transitions, 156 flow. Second operand has 3 states, 3 states have (on average 130.66666666666666) internal successors, (392), 3 states have internal predecessors, (392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:47:42,533 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:47:42,533 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 333 [2022-12-13 13:47:42,533 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:47:43,622 INFO L130 PetriNetUnfolder]: 5080/7709 cut-off events. [2022-12-13 13:47:43,622 INFO L131 PetriNetUnfolder]: For 1617/1617 co-relation queries the response was YES. [2022-12-13 13:47:43,631 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21060 conditions, 7709 events. 5080/7709 cut-off events. For 1617/1617 co-relation queries the response was YES. Maximal size of possible extension queue 455. Compared 45724 event pairs, 1373 based on Foata normal form. 0/6077 useless extension candidates. Maximal degree in co-relation 21054. Up to 7328 conditions per place. [2022-12-13 13:47:43,647 INFO L137 encePairwiseOnDemand]: 329/333 looper letters, 71 selfloop transitions, 3 changer transitions 0/74 dead transitions. [2022-12-13 13:47:43,647 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 74 transitions, 414 flow [2022-12-13 13:47:43,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 13:47:43,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 13:47:43,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 442 transitions. [2022-12-13 13:47:43,649 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.44244244244244246 [2022-12-13 13:47:43,649 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 442 transitions. [2022-12-13 13:47:43,649 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 442 transitions. [2022-12-13 13:47:43,649 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:47:43,649 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 442 transitions. [2022-12-13 13:47:43,650 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 147.33333333333334) internal successors, (442), 3 states have internal predecessors, (442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:47:43,652 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 333.0) internal successors, (1332), 4 states have internal predecessors, (1332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:47:43,652 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 333.0) internal successors, (1332), 4 states have internal predecessors, (1332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:47:43,652 INFO L175 Difference]: Start difference. First operand has 49 places, 43 transitions, 156 flow. Second operand 3 states and 442 transitions. [2022-12-13 13:47:43,652 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 74 transitions, 414 flow [2022-12-13 13:47:43,655 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 74 transitions, 404 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 13:47:43,656 INFO L231 Difference]: Finished difference. Result has 50 places, 45 transitions, 169 flow [2022-12-13 13:47:43,656 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=333, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=169, PETRI_PLACES=50, PETRI_TRANSITIONS=45} [2022-12-13 13:47:43,657 INFO L288 CegarLoopForPetriNet]: 83 programPoint places, -33 predicate places. [2022-12-13 13:47:43,657 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 45 transitions, 169 flow [2022-12-13 13:47:43,657 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 130.66666666666666) internal successors, (392), 3 states have internal predecessors, (392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:47:43,657 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:47:43,657 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:47:43,658 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 13:47:43,658 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2022-12-13 13:47:43,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:47:43,658 INFO L85 PathProgramCache]: Analyzing trace with hash -2067439380, now seen corresponding path program 1 times [2022-12-13 13:47:43,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:47:43,659 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300175411] [2022-12-13 13:47:43,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:47:43,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:47:43,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:47:43,866 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 13:47:43,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:47:43,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300175411] [2022-12-13 13:47:43,866 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300175411] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:47:43,867 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:47:43,867 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 13:47:43,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333165275] [2022-12-13 13:47:43,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:47:43,867 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 13:47:43,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:47:43,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 13:47:43,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 13:47:43,872 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 333 [2022-12-13 13:47:43,873 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 45 transitions, 169 flow. Second operand has 3 states, 3 states have (on average 134.0) internal successors, (402), 3 states have internal predecessors, (402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:47:43,873 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:47:43,873 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 333 [2022-12-13 13:47:43,873 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:47:44,661 INFO L130 PetriNetUnfolder]: 4597/7122 cut-off events. [2022-12-13 13:47:44,661 INFO L131 PetriNetUnfolder]: For 1469/1469 co-relation queries the response was YES. [2022-12-13 13:47:44,670 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20159 conditions, 7122 events. 4597/7122 cut-off events. For 1469/1469 co-relation queries the response was YES. Maximal size of possible extension queue 557. Compared 43717 event pairs, 1555 based on Foata normal form. 12/5430 useless extension candidates. Maximal degree in co-relation 20152. Up to 5452 conditions per place. [2022-12-13 13:47:44,685 INFO L137 encePairwiseOnDemand]: 330/333 looper letters, 63 selfloop transitions, 3 changer transitions 0/68 dead transitions. [2022-12-13 13:47:44,685 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 68 transitions, 384 flow [2022-12-13 13:47:44,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 13:47:44,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 13:47:44,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 442 transitions. [2022-12-13 13:47:44,687 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.44244244244244246 [2022-12-13 13:47:44,687 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 442 transitions. [2022-12-13 13:47:44,687 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 442 transitions. [2022-12-13 13:47:44,687 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:47:44,687 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 442 transitions. [2022-12-13 13:47:44,688 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 147.33333333333334) internal successors, (442), 3 states have internal predecessors, (442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:47:44,689 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 333.0) internal successors, (1332), 4 states have internal predecessors, (1332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:47:44,689 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 333.0) internal successors, (1332), 4 states have internal predecessors, (1332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:47:44,689 INFO L175 Difference]: Start difference. First operand has 50 places, 45 transitions, 169 flow. Second operand 3 states and 442 transitions. [2022-12-13 13:47:44,689 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 68 transitions, 384 flow [2022-12-13 13:47:44,690 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 68 transitions, 380 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 13:47:44,690 INFO L231 Difference]: Finished difference. Result has 52 places, 45 transitions, 177 flow [2022-12-13 13:47:44,690 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=333, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=177, PETRI_PLACES=52, PETRI_TRANSITIONS=45} [2022-12-13 13:47:44,691 INFO L288 CegarLoopForPetriNet]: 83 programPoint places, -31 predicate places. [2022-12-13 13:47:44,691 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 45 transitions, 177 flow [2022-12-13 13:47:44,691 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 134.0) internal successors, (402), 3 states have internal predecessors, (402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:47:44,691 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:47:44,691 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:47:44,691 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 13:47:44,691 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2022-12-13 13:47:44,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:47:44,692 INFO L85 PathProgramCache]: Analyzing trace with hash -2067438777, now seen corresponding path program 1 times [2022-12-13 13:47:44,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:47:44,692 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116527883] [2022-12-13 13:47:44,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:47:44,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:47:44,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:47:44,735 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 13:47:44,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:47:44,735 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116527883] [2022-12-13 13:47:44,735 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116527883] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:47:44,736 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:47:44,736 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 13:47:44,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467702614] [2022-12-13 13:47:44,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:47:44,736 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 13:47:44,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:47:44,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 13:47:44,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 13:47:44,763 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 333 [2022-12-13 13:47:44,764 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 45 transitions, 177 flow. Second operand has 3 states, 3 states have (on average 130.0) internal successors, (390), 3 states have internal predecessors, (390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:47:44,764 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:47:44,764 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 333 [2022-12-13 13:47:44,764 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:47:45,663 INFO L130 PetriNetUnfolder]: 5320/8279 cut-off events. [2022-12-13 13:47:45,663 INFO L131 PetriNetUnfolder]: For 2247/2247 co-relation queries the response was YES. [2022-12-13 13:47:45,672 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23741 conditions, 8279 events. 5320/8279 cut-off events. For 2247/2247 co-relation queries the response was YES. Maximal size of possible extension queue 645. Compared 52192 event pairs, 2028 based on Foata normal form. 0/6534 useless extension candidates. Maximal degree in co-relation 23733. Up to 6086 conditions per place. [2022-12-13 13:47:45,687 INFO L137 encePairwiseOnDemand]: 327/333 looper letters, 52 selfloop transitions, 6 changer transitions 0/60 dead transitions. [2022-12-13 13:47:45,687 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 60 transitions, 341 flow [2022-12-13 13:47:45,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 13:47:45,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 13:47:45,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 427 transitions. [2022-12-13 13:47:45,689 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.42742742742742745 [2022-12-13 13:47:45,689 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 427 transitions. [2022-12-13 13:47:45,689 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 427 transitions. [2022-12-13 13:47:45,689 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:47:45,689 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 427 transitions. [2022-12-13 13:47:45,690 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 142.33333333333334) internal successors, (427), 3 states have internal predecessors, (427), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:47:45,691 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 333.0) internal successors, (1332), 4 states have internal predecessors, (1332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:47:45,691 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 333.0) internal successors, (1332), 4 states have internal predecessors, (1332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:47:45,691 INFO L175 Difference]: Start difference. First operand has 52 places, 45 transitions, 177 flow. Second operand 3 states and 427 transitions. [2022-12-13 13:47:45,691 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 60 transitions, 341 flow [2022-12-13 13:47:45,693 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 60 transitions, 335 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 13:47:45,694 INFO L231 Difference]: Finished difference. Result has 52 places, 48 transitions, 209 flow [2022-12-13 13:47:45,694 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=333, PETRI_DIFFERENCE_MINUEND_FLOW=167, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=209, PETRI_PLACES=52, PETRI_TRANSITIONS=48} [2022-12-13 13:47:45,694 INFO L288 CegarLoopForPetriNet]: 83 programPoint places, -31 predicate places. [2022-12-13 13:47:45,694 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 48 transitions, 209 flow [2022-12-13 13:47:45,695 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 130.0) internal successors, (390), 3 states have internal predecessors, (390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:47:45,695 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:47:45,695 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:47:45,695 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 13:47:45,695 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2022-12-13 13:47:45,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:47:45,695 INFO L85 PathProgramCache]: Analyzing trace with hash -2067438776, now seen corresponding path program 1 times [2022-12-13 13:47:45,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:47:45,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117774540] [2022-12-13 13:47:45,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:47:45,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:47:45,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:47:45,793 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 13:47:45,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:47:45,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117774540] [2022-12-13 13:47:45,794 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117774540] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:47:45,794 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:47:45,794 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 13:47:45,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769748312] [2022-12-13 13:47:45,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:47:45,795 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 13:47:45,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:47:45,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 13:47:45,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 13:47:45,832 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 333 [2022-12-13 13:47:45,833 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 48 transitions, 209 flow. Second operand has 4 states, 4 states have (on average 131.0) internal successors, (524), 4 states have internal predecessors, (524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:47:45,833 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:47:45,833 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 333 [2022-12-13 13:47:45,833 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:47:46,706 INFO L130 PetriNetUnfolder]: 5195/8094 cut-off events. [2022-12-13 13:47:46,706 INFO L131 PetriNetUnfolder]: For 3645/3645 co-relation queries the response was YES. [2022-12-13 13:47:46,718 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24590 conditions, 8094 events. 5195/8094 cut-off events. For 3645/3645 co-relation queries the response was YES. Maximal size of possible extension queue 641. Compared 51146 event pairs, 1542 based on Foata normal form. 48/6397 useless extension candidates. Maximal degree in co-relation 24581. Up to 6423 conditions per place. [2022-12-13 13:47:46,739 INFO L137 encePairwiseOnDemand]: 330/333 looper letters, 64 selfloop transitions, 3 changer transitions 0/69 dead transitions. [2022-12-13 13:47:46,739 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 69 transitions, 423 flow [2022-12-13 13:47:46,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 13:47:46,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 13:47:46,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 562 transitions. [2022-12-13 13:47:46,741 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4219219219219219 [2022-12-13 13:47:46,741 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 562 transitions. [2022-12-13 13:47:46,741 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 562 transitions. [2022-12-13 13:47:46,741 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:47:46,741 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 562 transitions. [2022-12-13 13:47:46,742 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 140.5) internal successors, (562), 4 states have internal predecessors, (562), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:47:46,743 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 333.0) internal successors, (1665), 5 states have internal predecessors, (1665), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:47:46,744 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 333.0) internal successors, (1665), 5 states have internal predecessors, (1665), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:47:46,744 INFO L175 Difference]: Start difference. First operand has 52 places, 48 transitions, 209 flow. Second operand 4 states and 562 transitions. [2022-12-13 13:47:46,744 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 69 transitions, 423 flow [2022-12-13 13:47:46,770 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 69 transitions, 414 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 13:47:46,770 INFO L231 Difference]: Finished difference. Result has 52 places, 47 transitions, 202 flow [2022-12-13 13:47:46,771 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=333, PETRI_DIFFERENCE_MINUEND_FLOW=196, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=202, PETRI_PLACES=52, PETRI_TRANSITIONS=47} [2022-12-13 13:47:46,771 INFO L288 CegarLoopForPetriNet]: 83 programPoint places, -31 predicate places. [2022-12-13 13:47:46,771 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 47 transitions, 202 flow [2022-12-13 13:47:46,771 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 131.0) internal successors, (524), 4 states have internal predecessors, (524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:47:46,771 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:47:46,771 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:47:46,772 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 13:47:46,772 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2022-12-13 13:47:46,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:47:46,772 INFO L85 PathProgramCache]: Analyzing trace with hash 1903739950, now seen corresponding path program 1 times [2022-12-13 13:47:46,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:47:46,772 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216170693] [2022-12-13 13:47:46,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:47:46,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:47:46,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:47:47,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 13:47:47,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:47:47,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216170693] [2022-12-13 13:47:47,650 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1216170693] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:47:47,650 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:47:47,650 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 13:47:47,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270104090] [2022-12-13 13:47:47,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:47:47,651 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 13:47:47,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:47:47,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 13:47:47,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-12-13 13:47:47,867 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 333 [2022-12-13 13:47:47,868 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 47 transitions, 202 flow. Second operand has 8 states, 8 states have (on average 114.625) internal successors, (917), 8 states have internal predecessors, (917), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:47:47,868 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:47:47,868 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 333 [2022-12-13 13:47:47,868 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:47:49,036 INFO L130 PetriNetUnfolder]: 5055/7879 cut-off events. [2022-12-13 13:47:49,036 INFO L131 PetriNetUnfolder]: For 3513/3513 co-relation queries the response was YES. [2022-12-13 13:47:49,047 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23587 conditions, 7879 events. 5055/7879 cut-off events. For 3513/3513 co-relation queries the response was YES. Maximal size of possible extension queue 618. Compared 49551 event pairs, 2136 based on Foata normal form. 7/6206 useless extension candidates. Maximal degree in co-relation 23579. Up to 6911 conditions per place. [2022-12-13 13:47:49,064 INFO L137 encePairwiseOnDemand]: 322/333 looper letters, 89 selfloop transitions, 35 changer transitions 0/126 dead transitions. [2022-12-13 13:47:49,064 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 126 transitions, 771 flow [2022-12-13 13:47:49,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 13:47:49,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-13 13:47:49,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1229 transitions. [2022-12-13 13:47:49,067 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.36906906906906906 [2022-12-13 13:47:49,067 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1229 transitions. [2022-12-13 13:47:49,067 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1229 transitions. [2022-12-13 13:47:49,068 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:47:49,068 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1229 transitions. [2022-12-13 13:47:49,069 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 122.9) internal successors, (1229), 10 states have internal predecessors, (1229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:47:49,072 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 333.0) internal successors, (3663), 11 states have internal predecessors, (3663), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:47:49,072 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 333.0) internal successors, (3663), 11 states have internal predecessors, (3663), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:47:49,072 INFO L175 Difference]: Start difference. First operand has 52 places, 47 transitions, 202 flow. Second operand 10 states and 1229 transitions. [2022-12-13 13:47:49,073 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 126 transitions, 771 flow [2022-12-13 13:47:49,082 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 126 transitions, 764 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 13:47:49,083 INFO L231 Difference]: Finished difference. Result has 65 places, 81 transitions, 501 flow [2022-12-13 13:47:49,083 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=333, PETRI_DIFFERENCE_MINUEND_FLOW=198, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=501, PETRI_PLACES=65, PETRI_TRANSITIONS=81} [2022-12-13 13:47:49,084 INFO L288 CegarLoopForPetriNet]: 83 programPoint places, -18 predicate places. [2022-12-13 13:47:49,084 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 81 transitions, 501 flow [2022-12-13 13:47:49,084 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 114.625) internal successors, (917), 8 states have internal predecessors, (917), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:47:49,084 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:47:49,084 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:47:49,084 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 13:47:49,084 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2022-12-13 13:47:49,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:47:49,085 INFO L85 PathProgramCache]: Analyzing trace with hash 333926618, now seen corresponding path program 1 times [2022-12-13 13:47:49,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:47:49,085 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156820664] [2022-12-13 13:47:49,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:47:49,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:47:49,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:47:49,166 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 13:47:49,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:47:49,166 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156820664] [2022-12-13 13:47:49,166 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [156820664] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:47:49,166 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:47:49,166 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 13:47:49,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458225290] [2022-12-13 13:47:49,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:47:49,167 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 13:47:49,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:47:49,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 13:47:49,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 13:47:49,249 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 333 [2022-12-13 13:47:49,249 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 81 transitions, 501 flow. Second operand has 5 states, 5 states have (on average 122.6) internal successors, (613), 5 states have internal predecessors, (613), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:47:49,250 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:47:49,250 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 333 [2022-12-13 13:47:49,250 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:47:50,184 INFO L130 PetriNetUnfolder]: 4399/6851 cut-off events. [2022-12-13 13:47:50,184 INFO L131 PetriNetUnfolder]: For 5806/5820 co-relation queries the response was YES. [2022-12-13 13:47:50,196 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23513 conditions, 6851 events. 4399/6851 cut-off events. For 5806/5820 co-relation queries the response was YES. Maximal size of possible extension queue 537. Compared 41690 event pairs, 1330 based on Foata normal form. 80/5918 useless extension candidates. Maximal degree in co-relation 23499. Up to 2845 conditions per place. [2022-12-13 13:47:50,210 INFO L137 encePairwiseOnDemand]: 317/333 looper letters, 79 selfloop transitions, 27 changer transitions 0/108 dead transitions. [2022-12-13 13:47:50,210 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 108 transitions, 852 flow [2022-12-13 13:47:50,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 13:47:50,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 13:47:50,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 539 transitions. [2022-12-13 13:47:50,211 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.40465465465465467 [2022-12-13 13:47:50,211 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 539 transitions. [2022-12-13 13:47:50,211 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 539 transitions. [2022-12-13 13:47:50,212 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:47:50,212 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 539 transitions. [2022-12-13 13:47:50,212 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 134.75) internal successors, (539), 4 states have internal predecessors, (539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:47:50,213 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 333.0) internal successors, (1665), 5 states have internal predecessors, (1665), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:47:50,214 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 333.0) internal successors, (1665), 5 states have internal predecessors, (1665), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:47:50,214 INFO L175 Difference]: Start difference. First operand has 65 places, 81 transitions, 501 flow. Second operand 4 states and 539 transitions. [2022-12-13 13:47:50,214 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 108 transitions, 852 flow [2022-12-13 13:47:50,232 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 108 transitions, 838 flow, removed 7 selfloop flow, removed 0 redundant places. [2022-12-13 13:47:50,233 INFO L231 Difference]: Finished difference. Result has 70 places, 91 transitions, 673 flow [2022-12-13 13:47:50,233 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=333, PETRI_DIFFERENCE_MINUEND_FLOW=487, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=673, PETRI_PLACES=70, PETRI_TRANSITIONS=91} [2022-12-13 13:47:50,234 INFO L288 CegarLoopForPetriNet]: 83 programPoint places, -13 predicate places. [2022-12-13 13:47:50,234 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 91 transitions, 673 flow [2022-12-13 13:47:50,234 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 122.6) internal successors, (613), 5 states have internal predecessors, (613), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:47:50,235 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:47:50,235 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:47:50,235 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 13:47:50,235 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2022-12-13 13:47:50,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:47:50,235 INFO L85 PathProgramCache]: Analyzing trace with hash -357179879, now seen corresponding path program 1 times [2022-12-13 13:47:50,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:47:50,235 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706941040] [2022-12-13 13:47:50,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:47:50,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:47:50,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:47:51,106 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 13:47:51,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:47:51,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706941040] [2022-12-13 13:47:51,106 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706941040] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:47:51,106 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:47:51,106 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 13:47:51,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737778395] [2022-12-13 13:47:51,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:47:51,107 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 13:47:51,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:47:51,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 13:47:51,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2022-12-13 13:47:51,252 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 333 [2022-12-13 13:47:51,253 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 91 transitions, 673 flow. Second operand has 10 states, 10 states have (on average 110.4) internal successors, (1104), 10 states have internal predecessors, (1104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:47:51,253 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:47:51,253 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 333 [2022-12-13 13:47:51,253 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:47:52,587 INFO L130 PetriNetUnfolder]: 4391/6936 cut-off events. [2022-12-13 13:47:52,587 INFO L131 PetriNetUnfolder]: For 9196/9196 co-relation queries the response was YES. [2022-12-13 13:47:52,600 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27375 conditions, 6936 events. 4391/6936 cut-off events. For 9196/9196 co-relation queries the response was YES. Maximal size of possible extension queue 549. Compared 43337 event pairs, 1102 based on Foata normal form. 162/6398 useless extension candidates. Maximal degree in co-relation 27359. Up to 5264 conditions per place. [2022-12-13 13:47:52,615 INFO L137 encePairwiseOnDemand]: 317/333 looper letters, 116 selfloop transitions, 81 changer transitions 3/202 dead transitions. [2022-12-13 13:47:52,615 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 202 transitions, 1754 flow [2022-12-13 13:47:52,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 13:47:52,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-13 13:47:52,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1664 transitions. [2022-12-13 13:47:52,619 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.35692835692835695 [2022-12-13 13:47:52,619 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1664 transitions. [2022-12-13 13:47:52,619 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1664 transitions. [2022-12-13 13:47:52,619 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:47:52,619 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1664 transitions. [2022-12-13 13:47:52,621 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 118.85714285714286) internal successors, (1664), 14 states have internal predecessors, (1664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:47:52,624 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 333.0) internal successors, (4995), 15 states have internal predecessors, (4995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:47:52,625 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 333.0) internal successors, (4995), 15 states have internal predecessors, (4995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:47:52,625 INFO L175 Difference]: Start difference. First operand has 70 places, 91 transitions, 673 flow. Second operand 14 states and 1664 transitions. [2022-12-13 13:47:52,625 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 202 transitions, 1754 flow [2022-12-13 13:47:52,666 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 202 transitions, 1745 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 13:47:52,668 INFO L231 Difference]: Finished difference. Result has 92 places, 136 transitions, 1401 flow [2022-12-13 13:47:52,668 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=333, PETRI_DIFFERENCE_MINUEND_FLOW=669, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=1401, PETRI_PLACES=92, PETRI_TRANSITIONS=136} [2022-12-13 13:47:52,668 INFO L288 CegarLoopForPetriNet]: 83 programPoint places, 9 predicate places. [2022-12-13 13:47:52,668 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 136 transitions, 1401 flow [2022-12-13 13:47:52,669 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 110.4) internal successors, (1104), 10 states have internal predecessors, (1104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:47:52,669 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:47:52,669 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:47:52,669 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 13:47:52,669 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2022-12-13 13:47:52,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:47:52,669 INFO L85 PathProgramCache]: Analyzing trace with hash -1113625073, now seen corresponding path program 1 times [2022-12-13 13:47:52,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:47:52,669 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048261308] [2022-12-13 13:47:52,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:47:52,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:47:52,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:47:52,753 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 13:47:52,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:47:52,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048261308] [2022-12-13 13:47:52,754 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048261308] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:47:52,754 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:47:52,754 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 13:47:52,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5103540] [2022-12-13 13:47:52,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:47:52,754 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 13:47:52,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:47:52,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 13:47:52,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 13:47:52,760 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 333 [2022-12-13 13:47:52,761 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 136 transitions, 1401 flow. Second operand has 3 states, 3 states have (on average 130.66666666666666) internal successors, (392), 3 states have internal predecessors, (392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:47:52,761 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:47:52,761 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 333 [2022-12-13 13:47:52,761 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:47:53,153 INFO L130 PetriNetUnfolder]: 1358/2378 cut-off events. [2022-12-13 13:47:53,153 INFO L131 PetriNetUnfolder]: For 5484/5484 co-relation queries the response was YES. [2022-12-13 13:47:53,158 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10620 conditions, 2378 events. 1358/2378 cut-off events. For 5484/5484 co-relation queries the response was YES. Maximal size of possible extension queue 216. Compared 13925 event pairs, 364 based on Foata normal form. 27/2172 useless extension candidates. Maximal degree in co-relation 10593. Up to 2188 conditions per place. [2022-12-13 13:47:53,164 INFO L137 encePairwiseOnDemand]: 328/333 looper letters, 116 selfloop transitions, 4 changer transitions 0/122 dead transitions. [2022-12-13 13:47:53,164 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 122 transitions, 1312 flow [2022-12-13 13:47:53,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 13:47:53,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 13:47:53,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 426 transitions. [2022-12-13 13:47:53,165 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4264264264264264 [2022-12-13 13:47:53,165 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 426 transitions. [2022-12-13 13:47:53,165 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 426 transitions. [2022-12-13 13:47:53,165 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:47:53,165 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 426 transitions. [2022-12-13 13:47:53,166 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 142.0) internal successors, (426), 3 states have internal predecessors, (426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:47:53,166 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 333.0) internal successors, (1332), 4 states have internal predecessors, (1332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:47:53,167 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 333.0) internal successors, (1332), 4 states have internal predecessors, (1332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:47:53,167 INFO L175 Difference]: Start difference. First operand has 92 places, 136 transitions, 1401 flow. Second operand 3 states and 426 transitions. [2022-12-13 13:47:53,167 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 122 transitions, 1312 flow [2022-12-13 13:47:53,194 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 122 transitions, 1230 flow, removed 37 selfloop flow, removed 4 redundant places. [2022-12-13 13:47:53,196 INFO L231 Difference]: Finished difference. Result has 87 places, 103 transitions, 894 flow [2022-12-13 13:47:53,196 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=333, PETRI_DIFFERENCE_MINUEND_FLOW=868, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=894, PETRI_PLACES=87, PETRI_TRANSITIONS=103} [2022-12-13 13:47:53,196 INFO L288 CegarLoopForPetriNet]: 83 programPoint places, 4 predicate places. [2022-12-13 13:47:53,196 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 103 transitions, 894 flow [2022-12-13 13:47:53,196 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 130.66666666666666) internal successors, (392), 3 states have internal predecessors, (392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:47:53,196 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:47:53,196 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:47:53,197 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 13:47:53,197 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2022-12-13 13:47:53,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:47:53,197 INFO L85 PathProgramCache]: Analyzing trace with hash -1590035893, now seen corresponding path program 1 times [2022-12-13 13:47:53,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:47:53,197 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763445494] [2022-12-13 13:47:53,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:47:53,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:47:53,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:47:53,315 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 13:47:53,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:47:53,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763445494] [2022-12-13 13:47:53,316 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1763445494] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:47:53,316 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:47:53,316 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 13:47:53,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182908089] [2022-12-13 13:47:53,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:47:53,316 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 13:47:53,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:47:53,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 13:47:53,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 13:47:53,322 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 333 [2022-12-13 13:47:53,323 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 103 transitions, 894 flow. Second operand has 4 states, 4 states have (on average 130.0) internal successors, (520), 4 states have internal predecessors, (520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:47:53,323 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:47:53,323 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 333 [2022-12-13 13:47:53,323 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:47:53,518 INFO L130 PetriNetUnfolder]: 283/563 cut-off events. [2022-12-13 13:47:53,518 INFO L131 PetriNetUnfolder]: For 901/901 co-relation queries the response was YES. [2022-12-13 13:47:53,519 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2352 conditions, 563 events. 283/563 cut-off events. For 901/901 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 2304 event pairs, 57 based on Foata normal form. 29/561 useless extension candidates. Maximal degree in co-relation 2326. Up to 292 conditions per place. [2022-12-13 13:47:53,520 INFO L137 encePairwiseOnDemand]: 328/333 looper letters, 95 selfloop transitions, 7 changer transitions 0/104 dead transitions. [2022-12-13 13:47:53,521 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 104 transitions, 941 flow [2022-12-13 13:47:53,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 13:47:53,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 13:47:53,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 564 transitions. [2022-12-13 13:47:53,523 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.42342342342342343 [2022-12-13 13:47:53,523 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 564 transitions. [2022-12-13 13:47:53,523 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 564 transitions. [2022-12-13 13:47:53,524 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:47:53,524 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 564 transitions. [2022-12-13 13:47:53,525 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 141.0) internal successors, (564), 4 states have internal predecessors, (564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:47:53,526 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 333.0) internal successors, (1665), 5 states have internal predecessors, (1665), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:47:53,526 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 333.0) internal successors, (1665), 5 states have internal predecessors, (1665), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:47:53,526 INFO L175 Difference]: Start difference. First operand has 87 places, 103 transitions, 894 flow. Second operand 4 states and 564 transitions. [2022-12-13 13:47:53,526 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 104 transitions, 941 flow [2022-12-13 13:47:53,529 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 104 transitions, 855 flow, removed 30 selfloop flow, removed 9 redundant places. [2022-12-13 13:47:53,530 INFO L231 Difference]: Finished difference. Result has 76 places, 76 transitions, 519 flow [2022-12-13 13:47:53,531 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=333, PETRI_DIFFERENCE_MINUEND_FLOW=479, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=519, PETRI_PLACES=76, PETRI_TRANSITIONS=76} [2022-12-13 13:47:53,531 INFO L288 CegarLoopForPetriNet]: 83 programPoint places, -7 predicate places. [2022-12-13 13:47:53,531 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 76 transitions, 519 flow [2022-12-13 13:47:53,531 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 130.0) internal successors, (520), 4 states have internal predecessors, (520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:47:53,531 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:47:53,531 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 13:47:53,532 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-13 13:47:53,532 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2022-12-13 13:47:53,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:47:53,532 INFO L85 PathProgramCache]: Analyzing trace with hash 1576302034, now seen corresponding path program 1 times [2022-12-13 13:47:53,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:47:53,532 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017383337] [2022-12-13 13:47:53,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:47:53,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:47:53,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:47:53,676 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 13:47:53,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:47:53,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017383337] [2022-12-13 13:47:53,676 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017383337] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:47:53,676 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:47:53,676 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 13:47:53,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727725224] [2022-12-13 13:47:53,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:47:53,677 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 13:47:53,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:47:53,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 13:47:53,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-13 13:47:53,684 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 333 [2022-12-13 13:47:53,685 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 76 transitions, 519 flow. Second operand has 5 states, 5 states have (on average 129.6) internal successors, (648), 5 states have internal predecessors, (648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:47:53,685 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:47:53,685 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 333 [2022-12-13 13:47:53,685 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:47:53,824 INFO L130 PetriNetUnfolder]: 168/313 cut-off events. [2022-12-13 13:47:53,824 INFO L131 PetriNetUnfolder]: For 602/602 co-relation queries the response was YES. [2022-12-13 13:47:53,825 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1254 conditions, 313 events. 168/313 cut-off events. For 602/602 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1047 event pairs, 36 based on Foata normal form. 10/321 useless extension candidates. Maximal degree in co-relation 1235. Up to 137 conditions per place. [2022-12-13 13:47:53,826 INFO L137 encePairwiseOnDemand]: 328/333 looper letters, 63 selfloop transitions, 10 changer transitions 1/76 dead transitions. [2022-12-13 13:47:53,826 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 76 transitions, 614 flow [2022-12-13 13:47:53,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 13:47:53,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 13:47:53,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 683 transitions. [2022-12-13 13:47:53,827 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4102102102102102 [2022-12-13 13:47:53,827 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 683 transitions. [2022-12-13 13:47:53,827 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 683 transitions. [2022-12-13 13:47:53,827 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:47:53,827 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 683 transitions. [2022-12-13 13:47:53,828 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 136.6) internal successors, (683), 5 states have internal predecessors, (683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:47:53,830 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 333.0) internal successors, (1998), 6 states have internal predecessors, (1998), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:47:53,830 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 333.0) internal successors, (1998), 6 states have internal predecessors, (1998), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:47:53,830 INFO L175 Difference]: Start difference. First operand has 76 places, 76 transitions, 519 flow. Second operand 5 states and 683 transitions. [2022-12-13 13:47:53,830 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 76 transitions, 614 flow [2022-12-13 13:47:53,832 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 76 transitions, 539 flow, removed 15 selfloop flow, removed 10 redundant places. [2022-12-13 13:47:53,834 INFO L231 Difference]: Finished difference. Result has 61 places, 47 transitions, 274 flow [2022-12-13 13:47:53,834 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=333, PETRI_DIFFERENCE_MINUEND_FLOW=248, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=274, PETRI_PLACES=61, PETRI_TRANSITIONS=47} [2022-12-13 13:47:53,834 INFO L288 CegarLoopForPetriNet]: 83 programPoint places, -22 predicate places. [2022-12-13 13:47:53,834 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 47 transitions, 274 flow [2022-12-13 13:47:53,835 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 129.6) internal successors, (648), 5 states have internal predecessors, (648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:47:53,835 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:47:53,835 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 13:47:53,835 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-13 13:47:53,835 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2022-12-13 13:47:53,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:47:53,836 INFO L85 PathProgramCache]: Analyzing trace with hash -387580105, now seen corresponding path program 1 times [2022-12-13 13:47:53,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:47:53,836 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951678029] [2022-12-13 13:47:53,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:47:53,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:47:53,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:47:53,990 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 13:47:53,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:47:53,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951678029] [2022-12-13 13:47:53,990 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951678029] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:47:53,990 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:47:53,990 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 13:47:53,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645605945] [2022-12-13 13:47:53,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:47:53,991 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 13:47:53,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:47:53,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 13:47:53,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 13:47:53,994 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 333 [2022-12-13 13:47:53,995 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 47 transitions, 274 flow. Second operand has 3 states, 3 states have (on average 134.0) internal successors, (402), 3 states have internal predecessors, (402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:47:53,995 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:47:53,995 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 333 [2022-12-13 13:47:53,995 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:47:54,113 INFO L130 PetriNetUnfolder]: 225/415 cut-off events. [2022-12-13 13:47:54,114 INFO L131 PetriNetUnfolder]: For 811/811 co-relation queries the response was YES. [2022-12-13 13:47:54,114 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1631 conditions, 415 events. 225/415 cut-off events. For 811/811 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1443 event pairs, 85 based on Foata normal form. 0/414 useless extension candidates. Maximal degree in co-relation 1617. Up to 302 conditions per place. [2022-12-13 13:47:54,115 INFO L137 encePairwiseOnDemand]: 330/333 looper letters, 65 selfloop transitions, 3 changer transitions 0/68 dead transitions. [2022-12-13 13:47:54,115 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 68 transitions, 537 flow [2022-12-13 13:47:54,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 13:47:54,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 13:47:54,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 421 transitions. [2022-12-13 13:47:54,116 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4214214214214214 [2022-12-13 13:47:54,116 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 421 transitions. [2022-12-13 13:47:54,116 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 421 transitions. [2022-12-13 13:47:54,117 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:47:54,117 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 421 transitions. [2022-12-13 13:47:54,117 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 140.33333333333334) internal successors, (421), 3 states have internal predecessors, (421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:47:54,118 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 333.0) internal successors, (1332), 4 states have internal predecessors, (1332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:47:54,118 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 333.0) internal successors, (1332), 4 states have internal predecessors, (1332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:47:54,118 INFO L175 Difference]: Start difference. First operand has 61 places, 47 transitions, 274 flow. Second operand 3 states and 421 transitions. [2022-12-13 13:47:54,118 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 68 transitions, 537 flow [2022-12-13 13:47:54,120 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 68 transitions, 487 flow, removed 12 selfloop flow, removed 3 redundant places. [2022-12-13 13:47:54,120 INFO L231 Difference]: Finished difference. Result has 60 places, 47 transitions, 259 flow [2022-12-13 13:47:54,121 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=333, PETRI_DIFFERENCE_MINUEND_FLOW=248, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=259, PETRI_PLACES=60, PETRI_TRANSITIONS=47} [2022-12-13 13:47:54,121 INFO L288 CegarLoopForPetriNet]: 83 programPoint places, -23 predicate places. [2022-12-13 13:47:54,121 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 47 transitions, 259 flow [2022-12-13 13:47:54,121 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 134.0) internal successors, (402), 3 states have internal predecessors, (402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:47:54,121 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:47:54,121 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 13:47:54,121 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-13 13:47:54,121 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2022-12-13 13:47:54,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:47:54,122 INFO L85 PathProgramCache]: Analyzing trace with hash -1555079485, now seen corresponding path program 2 times [2022-12-13 13:47:54,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:47:54,122 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431052426] [2022-12-13 13:47:54,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:47:54,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:47:54,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:47:55,252 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 13:47:55,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:47:55,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431052426] [2022-12-13 13:47:55,252 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431052426] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:47:55,253 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:47:55,253 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 13:47:55,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554522007] [2022-12-13 13:47:55,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:47:55,253 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 13:47:55,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:47:55,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 13:47:55,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-13 13:47:55,377 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 333 [2022-12-13 13:47:55,378 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 47 transitions, 259 flow. Second operand has 7 states, 7 states have (on average 122.85714285714286) internal successors, (860), 7 states have internal predecessors, (860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:47:55,378 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:47:55,378 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 333 [2022-12-13 13:47:55,378 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:47:55,688 INFO L130 PetriNetUnfolder]: 296/591 cut-off events. [2022-12-13 13:47:55,688 INFO L131 PetriNetUnfolder]: For 821/823 co-relation queries the response was YES. [2022-12-13 13:47:55,689 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2192 conditions, 591 events. 296/591 cut-off events. For 821/823 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 2697 event pairs, 75 based on Foata normal form. 1/592 useless extension candidates. Maximal degree in co-relation 2177. Up to 366 conditions per place. [2022-12-13 13:47:55,690 INFO L137 encePairwiseOnDemand]: 327/333 looper letters, 72 selfloop transitions, 11 changer transitions 0/85 dead transitions. [2022-12-13 13:47:55,690 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 85 transitions, 600 flow [2022-12-13 13:47:55,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 13:47:55,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 13:47:55,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 651 transitions. [2022-12-13 13:47:55,692 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.390990990990991 [2022-12-13 13:47:55,692 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 651 transitions. [2022-12-13 13:47:55,692 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 651 transitions. [2022-12-13 13:47:55,692 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:47:55,692 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 651 transitions. [2022-12-13 13:47:55,693 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 130.2) internal successors, (651), 5 states have internal predecessors, (651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:47:55,694 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 333.0) internal successors, (1998), 6 states have internal predecessors, (1998), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:47:55,695 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 333.0) internal successors, (1998), 6 states have internal predecessors, (1998), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:47:55,695 INFO L175 Difference]: Start difference. First operand has 60 places, 47 transitions, 259 flow. Second operand 5 states and 651 transitions. [2022-12-13 13:47:55,695 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 85 transitions, 600 flow [2022-12-13 13:47:55,698 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 85 transitions, 592 flow, removed 2 selfloop flow, removed 1 redundant places. [2022-12-13 13:47:55,699 INFO L231 Difference]: Finished difference. Result has 65 places, 51 transitions, 316 flow [2022-12-13 13:47:55,699 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=333, PETRI_DIFFERENCE_MINUEND_FLOW=254, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=316, PETRI_PLACES=65, PETRI_TRANSITIONS=51} [2022-12-13 13:47:55,700 INFO L288 CegarLoopForPetriNet]: 83 programPoint places, -18 predicate places. [2022-12-13 13:47:55,700 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 51 transitions, 316 flow [2022-12-13 13:47:55,700 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 122.85714285714286) internal successors, (860), 7 states have internal predecessors, (860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:47:55,700 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:47:55,701 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 13:47:55,701 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-13 13:47:55,701 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2022-12-13 13:47:55,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:47:55,701 INFO L85 PathProgramCache]: Analyzing trace with hash -960065341, now seen corresponding path program 3 times [2022-12-13 13:47:55,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:47:55,701 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229286320] [2022-12-13 13:47:55,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:47:55,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:47:55,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:47:57,150 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 13:47:57,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:47:57,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229286320] [2022-12-13 13:47:57,151 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229286320] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:47:57,151 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:47:57,151 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 13:47:57,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578948332] [2022-12-13 13:47:57,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:47:57,151 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 13:47:57,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:47:57,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 13:47:57,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-12-13 13:47:57,285 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 333 [2022-12-13 13:47:57,286 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 51 transitions, 316 flow. Second operand has 9 states, 9 states have (on average 122.22222222222223) internal successors, (1100), 9 states have internal predecessors, (1100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:47:57,286 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:47:57,286 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 333 [2022-12-13 13:47:57,286 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:47:57,630 INFO L130 PetriNetUnfolder]: 326/669 cut-off events. [2022-12-13 13:47:57,630 INFO L131 PetriNetUnfolder]: For 1290/1298 co-relation queries the response was YES. [2022-12-13 13:47:57,632 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2669 conditions, 669 events. 326/669 cut-off events. For 1290/1298 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 3210 event pairs, 110 based on Foata normal form. 1/667 useless extension candidates. Maximal degree in co-relation 2652. Up to 258 conditions per place. [2022-12-13 13:47:57,633 INFO L137 encePairwiseOnDemand]: 327/333 looper letters, 63 selfloop transitions, 10 changer transitions 0/75 dead transitions. [2022-12-13 13:47:57,633 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 75 transitions, 581 flow [2022-12-13 13:47:57,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 13:47:57,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 13:47:57,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 763 transitions. [2022-12-13 13:47:57,635 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.3818818818818819 [2022-12-13 13:47:57,635 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 763 transitions. [2022-12-13 13:47:57,635 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 763 transitions. [2022-12-13 13:47:57,635 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:47:57,635 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 763 transitions. [2022-12-13 13:47:57,636 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 127.16666666666667) internal successors, (763), 6 states have internal predecessors, (763), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:47:57,637 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 333.0) internal successors, (2331), 7 states have internal predecessors, (2331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:47:57,637 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 333.0) internal successors, (2331), 7 states have internal predecessors, (2331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:47:57,637 INFO L175 Difference]: Start difference. First operand has 65 places, 51 transitions, 316 flow. Second operand 6 states and 763 transitions. [2022-12-13 13:47:57,637 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 75 transitions, 581 flow [2022-12-13 13:47:57,640 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 75 transitions, 578 flow, removed 1 selfloop flow, removed 1 redundant places. [2022-12-13 13:47:57,641 INFO L231 Difference]: Finished difference. Result has 71 places, 53 transitions, 356 flow [2022-12-13 13:47:57,641 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=333, PETRI_DIFFERENCE_MINUEND_FLOW=313, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=356, PETRI_PLACES=71, PETRI_TRANSITIONS=53} [2022-12-13 13:47:57,641 INFO L288 CegarLoopForPetriNet]: 83 programPoint places, -12 predicate places. [2022-12-13 13:47:57,641 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 53 transitions, 356 flow [2022-12-13 13:47:57,642 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 122.22222222222223) internal successors, (1100), 9 states have internal predecessors, (1100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:47:57,642 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:47:57,642 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 13:47:57,642 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-13 13:47:57,642 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2022-12-13 13:47:57,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:47:57,642 INFO L85 PathProgramCache]: Analyzing trace with hash -825204559, now seen corresponding path program 4 times [2022-12-13 13:47:57,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:47:57,642 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561299472] [2022-12-13 13:47:57,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:47:57,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:47:57,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 13:47:57,687 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 13:47:57,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 13:47:57,755 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 13:47:57,755 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 13:47:57,756 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK (84 of 85 remaining) [2022-12-13 13:47:57,757 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (83 of 85 remaining) [2022-12-13 13:47:57,757 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (82 of 85 remaining) [2022-12-13 13:47:57,758 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (81 of 85 remaining) [2022-12-13 13:47:57,758 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (80 of 85 remaining) [2022-12-13 13:47:57,758 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (79 of 85 remaining) [2022-12-13 13:47:57,758 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (78 of 85 remaining) [2022-12-13 13:47:57,758 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (77 of 85 remaining) [2022-12-13 13:47:57,758 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (76 of 85 remaining) [2022-12-13 13:47:57,758 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 85 remaining) [2022-12-13 13:47:57,758 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 85 remaining) [2022-12-13 13:47:57,758 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 85 remaining) [2022-12-13 13:47:57,758 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 85 remaining) [2022-12-13 13:47:57,758 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 85 remaining) [2022-12-13 13:47:57,758 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 85 remaining) [2022-12-13 13:47:57,758 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 85 remaining) [2022-12-13 13:47:57,758 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 85 remaining) [2022-12-13 13:47:57,758 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 85 remaining) [2022-12-13 13:47:57,759 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 85 remaining) [2022-12-13 13:47:57,759 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 85 remaining) [2022-12-13 13:47:57,759 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 85 remaining) [2022-12-13 13:47:57,759 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 85 remaining) [2022-12-13 13:47:57,759 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 85 remaining) [2022-12-13 13:47:57,759 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 85 remaining) [2022-12-13 13:47:57,759 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 85 remaining) [2022-12-13 13:47:57,759 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 85 remaining) [2022-12-13 13:47:57,759 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 85 remaining) [2022-12-13 13:47:57,759 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 85 remaining) [2022-12-13 13:47:57,759 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 85 remaining) [2022-12-13 13:47:57,759 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 85 remaining) [2022-12-13 13:47:57,759 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 85 remaining) [2022-12-13 13:47:57,759 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 85 remaining) [2022-12-13 13:47:57,759 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 85 remaining) [2022-12-13 13:47:57,759 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 85 remaining) [2022-12-13 13:47:57,760 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 85 remaining) [2022-12-13 13:47:57,760 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 85 remaining) [2022-12-13 13:47:57,760 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 85 remaining) [2022-12-13 13:47:57,760 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 85 remaining) [2022-12-13 13:47:57,760 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 85 remaining) [2022-12-13 13:47:57,760 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 85 remaining) [2022-12-13 13:47:57,760 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 85 remaining) [2022-12-13 13:47:57,760 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 85 remaining) [2022-12-13 13:47:57,760 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 85 remaining) [2022-12-13 13:47:57,760 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 85 remaining) [2022-12-13 13:47:57,760 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 85 remaining) [2022-12-13 13:47:57,760 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 85 remaining) [2022-12-13 13:47:57,760 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 85 remaining) [2022-12-13 13:47:57,760 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK (37 of 85 remaining) [2022-12-13 13:47:57,760 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (36 of 85 remaining) [2022-12-13 13:47:57,761 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (35 of 85 remaining) [2022-12-13 13:47:57,761 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (34 of 85 remaining) [2022-12-13 13:47:57,761 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 85 remaining) [2022-12-13 13:47:57,761 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 85 remaining) [2022-12-13 13:47:57,761 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 85 remaining) [2022-12-13 13:47:57,761 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 85 remaining) [2022-12-13 13:47:57,761 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 85 remaining) [2022-12-13 13:47:57,761 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 85 remaining) [2022-12-13 13:47:57,761 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 85 remaining) [2022-12-13 13:47:57,761 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 85 remaining) [2022-12-13 13:47:57,761 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 85 remaining) [2022-12-13 13:47:57,761 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 85 remaining) [2022-12-13 13:47:57,761 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 85 remaining) [2022-12-13 13:47:57,761 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 85 remaining) [2022-12-13 13:47:57,761 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 85 remaining) [2022-12-13 13:47:57,761 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 85 remaining) [2022-12-13 13:47:57,762 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 85 remaining) [2022-12-13 13:47:57,762 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 85 remaining) [2022-12-13 13:47:57,762 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 85 remaining) [2022-12-13 13:47:57,762 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 85 remaining) [2022-12-13 13:47:57,762 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 85 remaining) [2022-12-13 13:47:57,762 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 85 remaining) [2022-12-13 13:47:57,762 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 85 remaining) [2022-12-13 13:47:57,762 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 85 remaining) [2022-12-13 13:47:57,762 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 85 remaining) [2022-12-13 13:47:57,762 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 85 remaining) [2022-12-13 13:47:57,762 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 85 remaining) [2022-12-13 13:47:57,762 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 85 remaining) [2022-12-13 13:47:57,762 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 85 remaining) [2022-12-13 13:47:57,762 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 85 remaining) [2022-12-13 13:47:57,762 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 85 remaining) [2022-12-13 13:47:57,762 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 85 remaining) [2022-12-13 13:47:57,762 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 85 remaining) [2022-12-13 13:47:57,763 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 85 remaining) [2022-12-13 13:47:57,763 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 85 remaining) [2022-12-13 13:47:57,763 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 85 remaining) [2022-12-13 13:47:57,763 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-13 13:47:57,763 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:47:57,768 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 13:47:57,768 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 13:47:57,813 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 01:47:57 BasicIcfg [2022-12-13 13:47:57,813 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 13:47:57,813 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-13 13:47:57,813 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-13 13:47:57,813 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-13 13:47:57,814 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 01:47:28" (3/4) ... [2022-12-13 13:47:57,816 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-12-13 13:47:57,816 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-13 13:47:57,816 INFO L158 Benchmark]: Toolchain (without parser) took 30616.29ms. Allocated memory was 167.8MB in the beginning and 2.1GB in the end (delta: 2.0GB). Free memory was 131.8MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 872.5MB. Max. memory is 16.1GB. [2022-12-13 13:47:57,816 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 96.5MB. Free memory is still 46.4MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 13:47:57,816 INFO L158 Benchmark]: CACSL2BoogieTranslator took 341.91ms. Allocated memory is still 167.8MB. Free memory was 131.8MB in the beginning and 104.7MB in the end (delta: 27.1MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2022-12-13 13:47:57,817 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.98ms. Allocated memory is still 167.8MB. Free memory was 104.2MB in the beginning and 102.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 13:47:57,817 INFO L158 Benchmark]: Boogie Preprocessor took 26.16ms. Allocated memory is still 167.8MB. Free memory was 102.0MB in the beginning and 99.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 13:47:57,817 INFO L158 Benchmark]: RCFGBuilder took 809.54ms. Allocated memory was 167.8MB in the beginning and 201.3MB in the end (delta: 33.6MB). Free memory was 99.9MB in the beginning and 80.5MB in the end (delta: 19.5MB). Peak memory consumption was 62.4MB. Max. memory is 16.1GB. [2022-12-13 13:47:57,817 INFO L158 Benchmark]: TraceAbstraction took 29397.61ms. Allocated memory was 201.3MB in the beginning and 2.1GB in the end (delta: 1.9GB). Free memory was 79.4MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 785.0MB. Max. memory is 16.1GB. [2022-12-13 13:47:57,817 INFO L158 Benchmark]: Witness Printer took 2.52ms. Allocated memory is still 2.1GB. Free memory was 1.2GB in the beginning and 1.2GB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 13:47:57,818 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 96.5MB. Free memory is still 46.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 341.91ms. Allocated memory is still 167.8MB. Free memory was 131.8MB in the beginning and 104.7MB in the end (delta: 27.1MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.98ms. Allocated memory is still 167.8MB. Free memory was 104.2MB in the beginning and 102.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 26.16ms. Allocated memory is still 167.8MB. Free memory was 102.0MB in the beginning and 99.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 809.54ms. Allocated memory was 167.8MB in the beginning and 201.3MB in the end (delta: 33.6MB). Free memory was 99.9MB in the beginning and 80.5MB in the end (delta: 19.5MB). Peak memory consumption was 62.4MB. Max. memory is 16.1GB. * TraceAbstraction took 29397.61ms. Allocated memory was 201.3MB in the beginning and 2.1GB in the end (delta: 1.9GB). Free memory was 79.4MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 785.0MB. Max. memory is 16.1GB. * Witness Printer took 2.52ms. Allocated memory is still 2.1GB. Free memory was 1.2GB in the beginning and 1.2GB in the end (delta: 1.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: 5.1s, 185 PlacesBefore, 83 PlacesAfterwards, 177 TransitionsBefore, 74 TransitionsAfterwards, 7128 CoEnabledTransitionPairs, 7 FixpointIterations, 72 TrivialSequentialCompositions, 77 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 1 ChoiceCompositions, 153 TotalNumberOfCompositions, 38356 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 9419, independent: 8777, independent conditional: 0, independent unconditional: 8777, dependent: 642, dependent conditional: 0, dependent unconditional: 642, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 2909, independent: 2819, independent conditional: 0, independent unconditional: 2819, dependent: 90, dependent conditional: 0, dependent unconditional: 90, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 9419, independent: 5958, independent conditional: 0, independent unconditional: 5958, dependent: 552, dependent conditional: 0, dependent unconditional: 552, unknown: 2909, unknown conditional: 0, unknown unconditional: 2909] , Statistics on independence cache: Total cache size (in pairs): 408, Positive cache size: 362, Positive conditional cache size: 0, Positive unconditional cache size: 362, Negative cache size: 46, Negative conditional cache size: 0, Negative unconditional cache size: 46, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 19]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 19. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L715] 0 _Bool __unbuffered_p2_EAX$flush_delayed; [L716] 0 int __unbuffered_p2_EAX$mem_tmp; [L717] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd0; [L718] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd1; [L719] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd2; [L720] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd3; [L721] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd0; [L722] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd1; [L723] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd2; [L724] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd3; [L725] 0 _Bool __unbuffered_p2_EAX$read_delayed; [L726] 0 int *__unbuffered_p2_EAX$read_delayed_var; [L727] 0 int __unbuffered_p2_EAX$w_buff0; [L728] 0 _Bool __unbuffered_p2_EAX$w_buff0_used; [L729] 0 int __unbuffered_p2_EAX$w_buff1; [L730] 0 _Bool __unbuffered_p2_EAX$w_buff1_used; [L731] 0 _Bool main$tmp_guard0; [L732] 0 _Bool main$tmp_guard1; [L734] 0 int x = 0; [L735] 0 _Bool x$flush_delayed; [L736] 0 int x$mem_tmp; [L737] 0 _Bool x$r_buff0_thd0; [L738] 0 _Bool x$r_buff0_thd1; [L739] 0 _Bool x$r_buff0_thd2; [L740] 0 _Bool x$r_buff0_thd3; [L741] 0 _Bool x$r_buff1_thd0; [L742] 0 _Bool x$r_buff1_thd1; [L743] 0 _Bool x$r_buff1_thd2; [L744] 0 _Bool x$r_buff1_thd3; [L745] 0 _Bool x$read_delayed; [L746] 0 int *x$read_delayed_var; [L747] 0 int x$w_buff0; [L748] 0 _Bool x$w_buff0_used; [L749] 0 int x$w_buff1; [L750] 0 _Bool x$w_buff1_used; [L752] 0 int y = 0; [L753] 0 _Bool weak$$choice0; [L754] 0 _Bool weak$$choice1; [L755] 0 _Bool weak$$choice2; [L849] 0 pthread_t t2269; [L850] FCALL, FORK 0 pthread_create(&t2269, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2269, ((void *)0), P0, ((void *)0))=-2, t2269={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L851] 0 pthread_t t2270; [L852] FCALL, FORK 0 pthread_create(&t2270, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2270, ((void *)0), P1, ((void *)0))=-1, t2269={7:0}, t2270={5:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L853] 0 pthread_t t2271; [L854] FCALL, FORK 0 pthread_create(&t2271, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2271, ((void *)0), P2, ((void *)0))=0, t2269={7:0}, t2270={5:0}, t2271={6:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L806] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L807] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L808] 3 x$flush_delayed = weak$$choice2 [L809] EXPR 3 \read(x) [L809] 3 x$mem_tmp = x [L810] EXPR 3 !x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff1) [L810] EXPR 3 \read(x) [L810] EXPR 3 !x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff1) [L810] 3 x = !x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff1) [L811] 3 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff0)) [L812] 3 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff1 : x$w_buff1)) [L813] 3 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used)) [L814] 3 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L815] 3 x$r_buff0_thd3 = weak$$choice2 ? x$r_buff0_thd3 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$r_buff0_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3)) [L816] 3 x$r_buff1_thd3 = weak$$choice2 ? x$r_buff1_thd3 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$r_buff1_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L817] 3 __unbuffered_p2_EAX$read_delayed = (_Bool)1 [L818] 3 __unbuffered_p2_EAX$read_delayed_var = &x [L819] EXPR 3 \read(x) [L819] 3 __unbuffered_p2_EAX = x [L820] EXPR 3 x$flush_delayed ? x$mem_tmp : x [L820] 3 x = x$flush_delayed ? x$mem_tmp : x [L821] 3 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$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=2, weak$$choice1=0, weak$$choice2=1, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L824] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$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=2, weak$$choice1=0, weak$$choice2=1, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L827] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L827] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L827] EXPR 3 \read(x) [L827] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L827] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L827] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L828] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L829] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L830] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L831] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$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=2, weak$$choice1=0, weak$$choice2=1, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L759] 1 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$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=2, weak$$choice1=0, weak$$choice2=1, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L764] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L765] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L766] 1 x$flush_delayed = weak$$choice2 [L767] EXPR 1 \read(x) [L767] 1 x$mem_tmp = x [L768] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L768] EXPR 1 \read(x) [L768] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L768] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L769] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L770] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L771] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L772] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L773] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L774] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L775] EXPR 1 \read(x) [L775] 1 __unbuffered_p0_EAX = x [L776] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L776] 1 x = x$flush_delayed ? x$mem_tmp : x [L777] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$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=3, weak$$choice1=0, weak$$choice2=255, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L789] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$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=3, weak$$choice1=0, weak$$choice2=255, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L792] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L792] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L792] EXPR 2 \read(x) [L792] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L792] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L792] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L793] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L794] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L795] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L796] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$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=3, weak$$choice1=0, weak$$choice2=255, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L782] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L784] 1 return 0; [L799] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L801] 2 return 0; [L834] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L836] 3 return 0; [L856] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L858] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L858] RET 0 assume_abort_if_not(main$tmp_guard0) [L860] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L860] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L860] EXPR 0 \read(x) [L860] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L860] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L860] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L861] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L862] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L863] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L864] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$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, t2269={7:0}, t2270={5:0}, t2271={6:0}, weak$$choice0=3, weak$$choice1=0, weak$$choice2=255, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L867] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L868] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L868] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L868] EXPR 0 \read(*__unbuffered_p2_EAX$read_delayed_var) [L868] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L868] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L868] 0 __unbuffered_p2_EAX = __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L869] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 1) [L871] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=3, weak$$choice1=1, weak$$choice2=255, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - 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: -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: -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: -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: -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: -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: 847]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 850]: 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: 854]: 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: 852]: 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 7 procedures, 238 locations, 85 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: 29.2s, OverallIterations: 18, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 17.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1415 SdHoareTripleChecker+Valid, 2.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1032 mSDsluCounter, 629 SdHoareTripleChecker+Invalid, 2.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 560 mSDsCounter, 350 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2872 IncrementalHoareTripleChecker+Invalid, 3222 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 350 mSolverCounterUnsat, 69 mSDtfsCounter, 2872 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 70 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1401occurred in iteration=11, InterpolantAutomatonStates: 78, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 5.4s InterpolantComputationTime, 239 NumberOfCodeBlocks, 239 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 201 ConstructedInterpolants, 0 QuantifiedInterpolants, 2867 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 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 13:47:57,833 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ff8853c-4614-4805-9a13-aaae87bb1caa/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_1ff8853c-4614-4805-9a13-aaae87bb1caa/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ff8853c-4614-4805-9a13-aaae87bb1caa/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_1ff8853c-4614-4805-9a13-aaae87bb1caa/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ff8853c-4614-4805-9a13-aaae87bb1caa/bin/uautomizer-uyxdKDjOR8/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe020_rmo.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ff8853c-4614-4805-9a13-aaae87bb1caa/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_1ff8853c-4614-4805-9a13-aaae87bb1caa/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 d52a8576f41904f21a1a217cd81ed2d36ac8928d5a02d745a0c93a101e2535cf --- 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 13:47:59,482 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 13:47:59,483 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 13:47:59,496 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 13:47:59,496 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 13:47:59,497 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 13:47:59,498 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 13:47:59,499 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 13:47:59,500 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 13:47:59,500 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 13:47:59,501 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 13:47:59,502 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 13:47:59,502 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 13:47:59,503 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 13:47:59,503 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 13:47:59,504 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 13:47:59,505 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 13:47:59,505 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 13:47:59,506 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 13:47:59,508 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 13:47:59,509 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 13:47:59,509 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 13:47:59,510 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 13:47:59,511 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 13:47:59,513 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 13:47:59,513 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 13:47:59,513 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 13:47:59,514 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 13:47:59,514 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 13:47:59,515 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 13:47:59,515 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 13:47:59,516 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 13:47:59,516 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 13:47:59,517 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 13:47:59,522 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 13:47:59,523 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 13:47:59,524 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 13:47:59,524 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 13:47:59,524 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 13:47:59,525 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 13:47:59,526 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 13:47:59,526 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ff8853c-4614-4805-9a13-aaae87bb1caa/bin/uautomizer-uyxdKDjOR8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-12-13 13:47:59,543 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 13:47:59,543 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 13:47:59,543 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 13:47:59,544 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 13:47:59,544 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 13:47:59,544 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 13:47:59,545 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 13:47:59,545 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 13:47:59,545 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 13:47:59,545 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 13:47:59,545 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 13:47:59,545 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-13 13:47:59,545 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 13:47:59,545 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 13:47:59,546 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 13:47:59,546 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-12-13 13:47:59,546 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-12-13 13:47:59,546 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-12-13 13:47:59,546 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 13:47:59,546 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-12-13 13:47:59,546 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-12-13 13:47:59,546 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-12-13 13:47:59,546 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 13:47:59,547 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 13:47:59,547 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 13:47:59,547 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 13:47:59,547 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 13:47:59,547 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 13:47:59,547 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 13:47:59,547 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 13:47:59,548 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-12-13 13:47:59,548 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-12-13 13:47:59,548 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 13:47:59,548 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 13:47:59,548 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 13:47:59,548 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2022-12-13 13:47:59,548 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 13:47:59,548 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_1ff8853c-4614-4805-9a13-aaae87bb1caa/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_1ff8853c-4614-4805-9a13-aaae87bb1caa/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 -> d52a8576f41904f21a1a217cd81ed2d36ac8928d5a02d745a0c93a101e2535cf [2022-12-13 13:47:59,751 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 13:47:59,767 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 13:47:59,769 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 13:47:59,770 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 13:47:59,770 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 13:47:59,771 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ff8853c-4614-4805-9a13-aaae87bb1caa/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/pthread-wmm/safe020_rmo.i [2022-12-13 13:48:02,428 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 13:48:02,659 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 13:48:02,660 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ff8853c-4614-4805-9a13-aaae87bb1caa/sv-benchmarks/c/pthread-wmm/safe020_rmo.i [2022-12-13 13:48:02,673 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ff8853c-4614-4805-9a13-aaae87bb1caa/bin/uautomizer-uyxdKDjOR8/data/e8ccf351c/f15aedde094347df844f0bdf0905c591/FLAG2aa25a429 [2022-12-13 13:48:02,685 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ff8853c-4614-4805-9a13-aaae87bb1caa/bin/uautomizer-uyxdKDjOR8/data/e8ccf351c/f15aedde094347df844f0bdf0905c591 [2022-12-13 13:48:02,686 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 13:48:02,687 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 13:48:02,688 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 13:48:02,688 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 13:48:02,691 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 13:48:02,691 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 01:48:02" (1/1) ... [2022-12-13 13:48:02,692 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56611a54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:48:02, skipping insertion in model container [2022-12-13 13:48:02,692 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 01:48:02" (1/1) ... [2022-12-13 13:48:02,697 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 13:48:02,736 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 13:48:02,875 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_1ff8853c-4614-4805-9a13-aaae87bb1caa/sv-benchmarks/c/pthread-wmm/safe020_rmo.i[988,1001] [2022-12-13 13:48:02,982 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:48:02,982 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:48:02,982 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:48:02,983 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:48:02,983 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:48:02,988 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:48:02,988 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:48:02,988 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:48:02,989 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:48:02,989 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:48:02,990 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:48:02,990 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:48:02,990 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:48:02,992 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:48:02,992 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:48:02,992 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:48:02,993 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:48:02,998 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:48:02,998 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:48:02,998 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:48:02,999 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:48:03,000 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:48:03,000 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:48:03,001 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:48:03,005 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:48:03,005 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:48:03,005 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:48:03,007 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:48:03,007 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:48:03,009 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:48:03,009 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 13:48:03,022 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 13:48:03,032 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_1ff8853c-4614-4805-9a13-aaae87bb1caa/sv-benchmarks/c/pthread-wmm/safe020_rmo.i[988,1001] [2022-12-13 13:48:03,049 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:48:03,050 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:48:03,050 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:48:03,050 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:48:03,050 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:48:03,054 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:48:03,054 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:48:03,054 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:48:03,054 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:48:03,055 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:48:03,055 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:48:03,055 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:48:03,055 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:48:03,057 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:48:03,057 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:48:03,057 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:48:03,058 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:48:03,061 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:48:03,061 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:48:03,062 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:48:03,062 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:48:03,063 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:48:03,063 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:48:03,063 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:48:03,066 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:48:03,066 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:48:03,066 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:48:03,067 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:48:03,068 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:48:03,068 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:48:03,069 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 13:48:03,092 INFO L208 MainTranslator]: Completed translation [2022-12-13 13:48:03,092 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:48:03 WrapperNode [2022-12-13 13:48:03,092 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 13:48:03,093 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 13:48:03,097 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 13:48:03,097 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 13:48:03,103 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:48:03" (1/1) ... [2022-12-13 13:48:03,115 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:48:03" (1/1) ... [2022-12-13 13:48:03,131 INFO L138 Inliner]: procedures = 180, calls = 75, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 136 [2022-12-13 13:48:03,131 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 13:48:03,131 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 13:48:03,131 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 13:48:03,131 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 13:48:03,138 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:48:03" (1/1) ... [2022-12-13 13:48:03,138 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:48:03" (1/1) ... [2022-12-13 13:48:03,141 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:48:03" (1/1) ... [2022-12-13 13:48:03,142 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:48:03" (1/1) ... [2022-12-13 13:48:03,148 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:48:03" (1/1) ... [2022-12-13 13:48:03,150 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:48:03" (1/1) ... [2022-12-13 13:48:03,152 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:48:03" (1/1) ... [2022-12-13 13:48:03,153 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:48:03" (1/1) ... [2022-12-13 13:48:03,156 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 13:48:03,157 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 13:48:03,157 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 13:48:03,157 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 13:48:03,157 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:48:03" (1/1) ... [2022-12-13 13:48:03,162 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 13:48:03,171 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ff8853c-4614-4805-9a13-aaae87bb1caa/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:48:03,181 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ff8853c-4614-4805-9a13-aaae87bb1caa/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 13:48:03,183 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ff8853c-4614-4805-9a13-aaae87bb1caa/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 13:48:03,214 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-12-13 13:48:03,214 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 13:48:03,214 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 13:48:03,214 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 13:48:03,215 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 13:48:03,215 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-12-13 13:48:03,215 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-12-13 13:48:03,215 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2022-12-13 13:48:03,215 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 13:48:03,215 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 13:48:03,215 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 13:48:03,215 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 13:48:03,215 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-13 13:48:03,216 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-13 13:48:03,216 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 13:48:03,216 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 13:48:03,216 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 13:48:03,217 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 13:48:03,349 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 13:48:03,351 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 13:48:03,918 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 13:48:04,202 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 13:48:04,202 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 13:48:04,204 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 01:48:04 BoogieIcfgContainer [2022-12-13 13:48:04,204 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 13:48:04,205 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 13:48:04,205 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 13:48:04,208 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 13:48:04,208 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 01:48:02" (1/3) ... [2022-12-13 13:48:04,208 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c492393 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 01:48:04, skipping insertion in model container [2022-12-13 13:48:04,208 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:48:03" (2/3) ... [2022-12-13 13:48:04,209 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c492393 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 01:48:04, skipping insertion in model container [2022-12-13 13:48:04,209 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 01:48:04" (3/3) ... [2022-12-13 13:48:04,210 INFO L112 eAbstractionObserver]: Analyzing ICFG safe020_rmo.i [2022-12-13 13:48:04,228 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 13:48:04,228 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 48 error locations. [2022-12-13 13:48:04,229 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 13:48:04,342 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 13:48:04,379 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 189 places, 181 transitions, 377 flow [2022-12-13 13:48:04,464 INFO L130 PetriNetUnfolder]: 2/178 cut-off events. [2022-12-13 13:48:04,464 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 13:48:04,469 INFO L83 FinitePrefix]: Finished finitePrefix Result has 188 conditions, 178 events. 2/178 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 256 event pairs, 0 based on Foata normal form. 0/128 useless extension candidates. Maximal degree in co-relation 117. Up to 2 conditions per place. [2022-12-13 13:48:04,469 INFO L82 GeneralOperation]: Start removeDead. Operand has 189 places, 181 transitions, 377 flow [2022-12-13 13:48:04,474 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 186 places, 178 transitions, 365 flow [2022-12-13 13:48:04,477 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-12-13 13:48:04,485 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 186 places, 178 transitions, 365 flow [2022-12-13 13:48:04,487 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 186 places, 178 transitions, 365 flow [2022-12-13 13:48:04,488 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 186 places, 178 transitions, 365 flow [2022-12-13 13:48:04,522 INFO L130 PetriNetUnfolder]: 2/178 cut-off events. [2022-12-13 13:48:04,522 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 13:48:04,523 INFO L83 FinitePrefix]: Finished finitePrefix Result has 188 conditions, 178 events. 2/178 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 262 event pairs, 0 based on Foata normal form. 0/128 useless extension candidates. Maximal degree in co-relation 117. Up to 2 conditions per place. [2022-12-13 13:48:04,525 INFO L119 LiptonReduction]: Number of co-enabled transitions 7128 [2022-12-13 13:48:15,331 INFO L134 LiptonReduction]: Checked pairs total: 41835 [2022-12-13 13:48:15,332 INFO L136 LiptonReduction]: Total number of compositions: 142 [2022-12-13 13:48:15,342 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 13:48:15,346 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;@54021b93, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 13:48:15,346 INFO L358 AbstractCegarLoop]: Starting to check reachability of 85 error locations. [2022-12-13 13:48:15,347 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2022-12-13 13:48:15,347 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 13:48:15,347 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:48:15,348 INFO L209 CegarLoopForPetriNet]: trace histogram [1] [2022-12-13 13:48:15,348 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2022-12-13 13:48:15,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:48:15,352 INFO L85 PathProgramCache]: Analyzing trace with hash 1006, now seen corresponding path program 1 times [2022-12-13 13:48:15,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 13:48:15,361 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1079116287] [2022-12-13 13:48:15,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:48:15,361 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 13:48:15,361 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ff8853c-4614-4805-9a13-aaae87bb1caa/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 13:48:15,362 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ff8853c-4614-4805-9a13-aaae87bb1caa/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 13:48:15,363 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ff8853c-4614-4805-9a13-aaae87bb1caa/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 13:48:15,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:48:15,426 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2022-12-13 13:48:15,429 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:48:15,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:48:15,432 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 13:48:15,432 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 13:48:15,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1079116287] [2022-12-13 13:48:15,433 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1079116287] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:48:15,433 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:48:15,433 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-12-13 13:48:15,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611521571] [2022-12-13 13:48:15,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:48:15,440 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-13 13:48:15,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 13:48:15,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-13 13:48:15,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-13 13:48:15,459 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 323 [2022-12-13 13:48:15,461 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 74 transitions, 157 flow. Second operand has 2 states, 2 states have (on average 131.5) internal successors, (263), 2 states have internal predecessors, (263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:48:15,461 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:48:15,461 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 323 [2022-12-13 13:48:15,462 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:48:19,482 INFO L130 PetriNetUnfolder]: 25008/34927 cut-off events. [2022-12-13 13:48:19,482 INFO L131 PetriNetUnfolder]: For 37/37 co-relation queries the response was YES. [2022-12-13 13:48:19,516 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69873 conditions, 34927 events. 25008/34927 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 2713. Compared 233002 event pairs, 25008 based on Foata normal form. 600/14933 useless extension candidates. Maximal degree in co-relation 69862. Up to 34808 conditions per place. [2022-12-13 13:48:19,688 INFO L137 encePairwiseOnDemand]: 296/323 looper letters, 46 selfloop transitions, 0 changer transitions 0/47 dead transitions. [2022-12-13 13:48:19,688 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 47 transitions, 195 flow [2022-12-13 13:48:19,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 13:48:19,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-12-13 13:48:19,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 335 transitions. [2022-12-13 13:48:19,702 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5185758513931888 [2022-12-13 13:48:19,702 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 335 transitions. [2022-12-13 13:48:19,703 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 335 transitions. [2022-12-13 13:48:19,704 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:48:19,706 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 335 transitions. [2022-12-13 13:48:19,709 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 167.5) internal successors, (335), 2 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:48:19,714 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 323.0) internal successors, (969), 3 states have internal predecessors, (969), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:48:19,715 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 323.0) internal successors, (969), 3 states have internal predecessors, (969), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:48:19,716 INFO L175 Difference]: Start difference. First operand has 83 places, 74 transitions, 157 flow. Second operand 2 states and 335 transitions. [2022-12-13 13:48:19,717 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 47 transitions, 195 flow [2022-12-13 13:48:19,722 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 47 transitions, 192 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-13 13:48:19,724 INFO L231 Difference]: Finished difference. Result has 55 places, 47 transitions, 100 flow [2022-12-13 13:48:19,726 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=323, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=100, PETRI_PLACES=55, PETRI_TRANSITIONS=47} [2022-12-13 13:48:19,729 INFO L288 CegarLoopForPetriNet]: 83 programPoint places, -28 predicate places. [2022-12-13 13:48:19,729 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 47 transitions, 100 flow [2022-12-13 13:48:19,730 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 131.5) internal successors, (263), 2 states have internal predecessors, (263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:48:19,730 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:48:19,730 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2022-12-13 13:48:19,738 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ff8853c-4614-4805-9a13-aaae87bb1caa/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 13:48:19,930 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ff8853c-4614-4805-9a13-aaae87bb1caa/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 13:48:19,931 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2022-12-13 13:48:19,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:48:19,932 INFO L85 PathProgramCache]: Analyzing trace with hash 30736719, now seen corresponding path program 1 times [2022-12-13 13:48:19,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 13:48:19,932 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [723175224] [2022-12-13 13:48:19,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:48:19,933 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 13:48:19,933 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ff8853c-4614-4805-9a13-aaae87bb1caa/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 13:48:19,934 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ff8853c-4614-4805-9a13-aaae87bb1caa/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 13:48:19,935 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ff8853c-4614-4805-9a13-aaae87bb1caa/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 13:48:20,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:48:20,046 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-13 13:48:20,048 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:48:20,115 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-12-13 13:48:20,116 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2022-12-13 13:48:20,139 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 13:48:20,139 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 13:48:20,139 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 13:48:20,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [723175224] [2022-12-13 13:48:20,140 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [723175224] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:48:20,140 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:48:20,140 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 13:48:20,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136014035] [2022-12-13 13:48:20,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:48:20,141 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 13:48:20,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 13:48:20,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 13:48:20,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 13:48:20,201 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 323 [2022-12-13 13:48:20,202 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 47 transitions, 100 flow. Second operand has 3 states, 3 states have (on average 128.33333333333334) internal successors, (385), 3 states have internal predecessors, (385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:48:20,202 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:48:20,202 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 323 [2022-12-13 13:48:20,203 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:48:22,368 INFO L130 PetriNetUnfolder]: 12067/17108 cut-off events. [2022-12-13 13:48:22,369 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 13:48:22,380 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34231 conditions, 17108 events. 12067/17108 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 1108. Compared 105110 event pairs, 7587 based on Foata normal form. 0/8594 useless extension candidates. Maximal degree in co-relation 34228. Up to 8673 conditions per place. [2022-12-13 13:48:22,426 INFO L137 encePairwiseOnDemand]: 312/323 looper letters, 58 selfloop transitions, 2 changer transitions 0/61 dead transitions. [2022-12-13 13:48:22,426 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 61 transitions, 248 flow [2022-12-13 13:48:22,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 13:48:22,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 13:48:22,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 450 transitions. [2022-12-13 13:48:22,429 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.46439628482972134 [2022-12-13 13:48:22,429 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 450 transitions. [2022-12-13 13:48:22,429 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 450 transitions. [2022-12-13 13:48:22,429 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:48:22,429 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 450 transitions. [2022-12-13 13:48:22,430 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 150.0) internal successors, (450), 3 states have internal predecessors, (450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:48:22,432 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 323.0) internal successors, (1292), 4 states have internal predecessors, (1292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:48:22,432 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 323.0) internal successors, (1292), 4 states have internal predecessors, (1292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:48:22,432 INFO L175 Difference]: Start difference. First operand has 55 places, 47 transitions, 100 flow. Second operand 3 states and 450 transitions. [2022-12-13 13:48:22,432 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 61 transitions, 248 flow [2022-12-13 13:48:22,432 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 61 transitions, 248 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-13 13:48:22,433 INFO L231 Difference]: Finished difference. Result has 56 places, 45 transitions, 116 flow [2022-12-13 13:48:22,433 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=323, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=116, PETRI_PLACES=56, PETRI_TRANSITIONS=45} [2022-12-13 13:48:22,434 INFO L288 CegarLoopForPetriNet]: 83 programPoint places, -27 predicate places. [2022-12-13 13:48:22,434 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 45 transitions, 116 flow [2022-12-13 13:48:22,434 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 128.33333333333334) internal successors, (385), 3 states have internal predecessors, (385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:48:22,434 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:48:22,434 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2022-12-13 13:48:22,444 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ff8853c-4614-4805-9a13-aaae87bb1caa/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2022-12-13 13:48:22,635 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ff8853c-4614-4805-9a13-aaae87bb1caa/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 13:48:22,636 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2022-12-13 13:48:22,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:48:22,638 INFO L85 PathProgramCache]: Analyzing trace with hash 30736720, now seen corresponding path program 1 times [2022-12-13 13:48:22,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 13:48:22,639 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1454155911] [2022-12-13 13:48:22,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:48:22,640 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 13:48:22,641 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ff8853c-4614-4805-9a13-aaae87bb1caa/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 13:48:22,643 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ff8853c-4614-4805-9a13-aaae87bb1caa/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 13:48:22,646 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ff8853c-4614-4805-9a13-aaae87bb1caa/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 13:48:22,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:48:22,736 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-13 13:48:22,737 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:48:22,753 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:48:22,754 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-12-13 13:48:22,781 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 13:48:22,781 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 13:48:22,781 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 13:48:22,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1454155911] [2022-12-13 13:48:22,781 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1454155911] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:48:22,781 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:48:22,781 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 13:48:22,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776197313] [2022-12-13 13:48:22,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:48:22,782 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 13:48:22,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 13:48:22,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 13:48:22,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 13:48:22,837 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 323 [2022-12-13 13:48:22,837 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 45 transitions, 116 flow. Second operand has 3 states, 3 states have (on average 131.33333333333334) internal successors, (394), 3 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:48:22,837 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:48:22,837 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 323 [2022-12-13 13:48:22,837 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:48:23,428 INFO L130 PetriNetUnfolder]: 3453/5038 cut-off events. [2022-12-13 13:48:23,428 INFO L131 PetriNetUnfolder]: For 486/486 co-relation queries the response was YES. [2022-12-13 13:48:23,432 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11256 conditions, 5038 events. 3453/5038 cut-off events. For 486/486 co-relation queries the response was YES. Maximal size of possible extension queue 354. Compared 26325 event pairs, 3453 based on Foata normal form. 0/4241 useless extension candidates. Maximal degree in co-relation 11251. Up to 5006 conditions per place. [2022-12-13 13:48:23,442 INFO L137 encePairwiseOnDemand]: 313/323 looper letters, 33 selfloop transitions, 1 changer transitions 1/36 dead transitions. [2022-12-13 13:48:23,442 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 36 transitions, 168 flow [2022-12-13 13:48:23,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 13:48:23,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 13:48:23,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 434 transitions. [2022-12-13 13:48:23,444 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.44788441692466463 [2022-12-13 13:48:23,444 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 434 transitions. [2022-12-13 13:48:23,444 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 434 transitions. [2022-12-13 13:48:23,444 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:48:23,444 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 434 transitions. [2022-12-13 13:48:23,445 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 144.66666666666666) internal successors, (434), 3 states have internal predecessors, (434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:48:23,446 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 323.0) internal successors, (1292), 4 states have internal predecessors, (1292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:48:23,447 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 323.0) internal successors, (1292), 4 states have internal predecessors, (1292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:48:23,447 INFO L175 Difference]: Start difference. First operand has 56 places, 45 transitions, 116 flow. Second operand 3 states and 434 transitions. [2022-12-13 13:48:23,447 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 36 transitions, 168 flow [2022-12-13 13:48:23,448 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 36 transitions, 164 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 13:48:23,449 INFO L231 Difference]: Finished difference. Result has 47 places, 35 transitions, 94 flow [2022-12-13 13:48:23,449 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=323, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=94, PETRI_PLACES=47, PETRI_TRANSITIONS=35} [2022-12-13 13:48:23,449 INFO L288 CegarLoopForPetriNet]: 83 programPoint places, -36 predicate places. [2022-12-13 13:48:23,449 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 35 transitions, 94 flow [2022-12-13 13:48:23,450 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 131.33333333333334) internal successors, (394), 3 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:48:23,450 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:48:23,450 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:48:23,461 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ff8853c-4614-4805-9a13-aaae87bb1caa/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 13:48:23,650 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ff8853c-4614-4805-9a13-aaae87bb1caa/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 13:48:23,651 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2022-12-13 13:48:23,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:48:23,653 INFO L85 PathProgramCache]: Analyzing trace with hash -315286976, now seen corresponding path program 1 times [2022-12-13 13:48:23,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 13:48:23,655 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [954468070] [2022-12-13 13:48:23,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:48:23,655 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 13:48:23,656 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ff8853c-4614-4805-9a13-aaae87bb1caa/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 13:48:23,658 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ff8853c-4614-4805-9a13-aaae87bb1caa/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 13:48:23,661 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ff8853c-4614-4805-9a13-aaae87bb1caa/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 13:48:23,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:48:23,798 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-13 13:48:23,799 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:48:23,814 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 13:48:23,814 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 13:48:23,814 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 13:48:23,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [954468070] [2022-12-13 13:48:23,814 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [954468070] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:48:23,814 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:48:23,814 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 13:48:23,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973929836] [2022-12-13 13:48:23,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:48:23,815 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 13:48:23,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 13:48:23,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 13:48:23,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 13:48:23,823 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 323 [2022-12-13 13:48:23,823 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 35 transitions, 94 flow. Second operand has 3 states, 3 states have (on average 130.66666666666666) internal successors, (392), 3 states have internal predecessors, (392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:48:23,823 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:48:23,823 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 323 [2022-12-13 13:48:23,823 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:48:24,144 INFO L130 PetriNetUnfolder]: 1212/1972 cut-off events. [2022-12-13 13:48:24,144 INFO L131 PetriNetUnfolder]: For 141/141 co-relation queries the response was YES. [2022-12-13 13:48:24,146 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4336 conditions, 1972 events. 1212/1972 cut-off events. For 141/141 co-relation queries the response was YES. Maximal size of possible extension queue 149. Compared 10034 event pairs, 461 based on Foata normal form. 27/1698 useless extension candidates. Maximal degree in co-relation 4331. Up to 1830 conditions per place. [2022-12-13 13:48:24,149 INFO L137 encePairwiseOnDemand]: 318/323 looper letters, 45 selfloop transitions, 4 changer transitions 0/50 dead transitions. [2022-12-13 13:48:24,149 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 50 transitions, 226 flow [2022-12-13 13:48:24,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 13:48:24,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 13:48:24,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 431 transitions. [2022-12-13 13:48:24,152 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.44478844169246645 [2022-12-13 13:48:24,152 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 431 transitions. [2022-12-13 13:48:24,152 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 431 transitions. [2022-12-13 13:48:24,152 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:48:24,152 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 431 transitions. [2022-12-13 13:48:24,154 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 13:48:24,156 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 323.0) internal successors, (1292), 4 states have internal predecessors, (1292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:48:24,156 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 323.0) internal successors, (1292), 4 states have internal predecessors, (1292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:48:24,156 INFO L175 Difference]: Start difference. First operand has 47 places, 35 transitions, 94 flow. Second operand 3 states and 431 transitions. [2022-12-13 13:48:24,156 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 50 transitions, 226 flow [2022-12-13 13:48:24,157 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 50 transitions, 225 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 13:48:24,157 INFO L231 Difference]: Finished difference. Result has 48 places, 38 transitions, 119 flow [2022-12-13 13:48:24,157 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=323, PETRI_DIFFERENCE_MINUEND_FLOW=93, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=119, PETRI_PLACES=48, PETRI_TRANSITIONS=38} [2022-12-13 13:48:24,158 INFO L288 CegarLoopForPetriNet]: 83 programPoint places, -35 predicate places. [2022-12-13 13:48:24,158 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 38 transitions, 119 flow [2022-12-13 13:48:24,158 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 130.66666666666666) internal successors, (392), 3 states have internal predecessors, (392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:48:24,158 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:48:24,158 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:48:24,169 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ff8853c-4614-4805-9a13-aaae87bb1caa/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 13:48:24,359 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ff8853c-4614-4805-9a13-aaae87bb1caa/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 13:48:24,360 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2022-12-13 13:48:24,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:48:24,361 INFO L85 PathProgramCache]: Analyzing trace with hash 462958106, now seen corresponding path program 1 times [2022-12-13 13:48:24,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 13:48:24,363 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1383662780] [2022-12-13 13:48:24,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:48:24,364 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 13:48:24,364 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ff8853c-4614-4805-9a13-aaae87bb1caa/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 13:48:24,367 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ff8853c-4614-4805-9a13-aaae87bb1caa/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 13:48:24,370 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ff8853c-4614-4805-9a13-aaae87bb1caa/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 13:48:24,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:48:24,500 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 13:48:24,501 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:48:24,527 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 13:48:24,527 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 13:48:24,527 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 13:48:24,527 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1383662780] [2022-12-13 13:48:24,527 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1383662780] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:48:24,528 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:48:24,528 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 13:48:24,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65228327] [2022-12-13 13:48:24,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:48:24,528 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 13:48:24,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 13:48:24,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 13:48:24,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 13:48:24,538 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 323 [2022-12-13 13:48:24,539 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 38 transitions, 119 flow. Second operand has 4 states, 4 states have (on average 130.5) internal successors, (522), 4 states have internal predecessors, (522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:48:24,539 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:48:24,539 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 323 [2022-12-13 13:48:24,539 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:48:24,821 INFO L130 PetriNetUnfolder]: 273/535 cut-off events. [2022-12-13 13:48:24,821 INFO L131 PetriNetUnfolder]: For 70/70 co-relation queries the response was YES. [2022-12-13 13:48:24,822 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1312 conditions, 535 events. 273/535 cut-off events. For 70/70 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 2139 event pairs, 101 based on Foata normal form. 27/506 useless extension candidates. Maximal degree in co-relation 1306. Up to 276 conditions per place. [2022-12-13 13:48:24,823 INFO L137 encePairwiseOnDemand]: 318/323 looper letters, 54 selfloop transitions, 7 changer transitions 0/62 dead transitions. [2022-12-13 13:48:24,823 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 62 transitions, 301 flow [2022-12-13 13:48:24,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 13:48:24,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 13:48:24,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 570 transitions. [2022-12-13 13:48:24,825 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4411764705882353 [2022-12-13 13:48:24,825 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 570 transitions. [2022-12-13 13:48:24,825 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 570 transitions. [2022-12-13 13:48:24,825 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:48:24,825 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 570 transitions. [2022-12-13 13:48:24,826 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 142.5) internal successors, (570), 4 states have internal predecessors, (570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:48:24,827 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 323.0) internal successors, (1615), 5 states have internal predecessors, (1615), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:48:24,828 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 323.0) internal successors, (1615), 5 states have internal predecessors, (1615), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:48:24,828 INFO L175 Difference]: Start difference. First operand has 48 places, 38 transitions, 119 flow. Second operand 4 states and 570 transitions. [2022-12-13 13:48:24,828 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 62 transitions, 301 flow [2022-12-13 13:48:24,828 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 62 transitions, 297 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 13:48:24,829 INFO L231 Difference]: Finished difference. Result has 51 places, 41 transitions, 155 flow [2022-12-13 13:48:24,829 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=323, PETRI_DIFFERENCE_MINUEND_FLOW=115, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=155, PETRI_PLACES=51, PETRI_TRANSITIONS=41} [2022-12-13 13:48:24,829 INFO L288 CegarLoopForPetriNet]: 83 programPoint places, -32 predicate places. [2022-12-13 13:48:24,830 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 41 transitions, 155 flow [2022-12-13 13:48:24,830 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 130.5) internal successors, (522), 4 states have internal predecessors, (522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:48:24,830 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:48:24,830 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:48:24,838 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ff8853c-4614-4805-9a13-aaae87bb1caa/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 13:48:25,031 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ff8853c-4614-4805-9a13-aaae87bb1caa/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 13:48:25,032 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2022-12-13 13:48:25,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:48:25,033 INFO L85 PathProgramCache]: Analyzing trace with hash -1716299081, now seen corresponding path program 1 times [2022-12-13 13:48:25,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 13:48:25,035 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [151212695] [2022-12-13 13:48:25,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:48:25,036 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 13:48:25,036 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ff8853c-4614-4805-9a13-aaae87bb1caa/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 13:48:25,039 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ff8853c-4614-4805-9a13-aaae87bb1caa/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 13:48:25,042 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ff8853c-4614-4805-9a13-aaae87bb1caa/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 13:48:25,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:48:25,179 INFO L263 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-13 13:48:25,180 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:48:25,205 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 13:48:25,205 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 13:48:25,205 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 13:48:25,205 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [151212695] [2022-12-13 13:48:25,206 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [151212695] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:48:25,206 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:48:25,206 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 13:48:25,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002687404] [2022-12-13 13:48:25,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:48:25,206 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 13:48:25,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 13:48:25,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 13:48:25,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 13:48:25,219 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 323 [2022-12-13 13:48:25,219 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 41 transitions, 155 flow. Second operand has 5 states, 5 states have (on average 130.4) internal successors, (652), 5 states have internal predecessors, (652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:48:25,219 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:48:25,220 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 323 [2022-12-13 13:48:25,220 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:48:25,494 INFO L130 PetriNetUnfolder]: 162/306 cut-off events. [2022-12-13 13:48:25,494 INFO L131 PetriNetUnfolder]: For 228/228 co-relation queries the response was YES. [2022-12-13 13:48:25,495 INFO L83 FinitePrefix]: Finished finitePrefix Result has 832 conditions, 306 events. 162/306 cut-off events. For 228/228 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1008 event pairs, 70 based on Foata normal form. 9/310 useless extension candidates. Maximal degree in co-relation 825. Up to 134 conditions per place. [2022-12-13 13:48:25,495 INFO L137 encePairwiseOnDemand]: 318/323 looper letters, 43 selfloop transitions, 10 changer transitions 1/55 dead transitions. [2022-12-13 13:48:25,496 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 55 transitions, 283 flow [2022-12-13 13:48:25,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 13:48:25,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 13:48:25,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 690 transitions. [2022-12-13 13:48:25,497 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.42724458204334365 [2022-12-13 13:48:25,497 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 690 transitions. [2022-12-13 13:48:25,497 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 690 transitions. [2022-12-13 13:48:25,498 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:48:25,498 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 690 transitions. [2022-12-13 13:48:25,499 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 138.0) internal successors, (690), 5 states have internal predecessors, (690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:48:25,500 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 323.0) internal successors, (1938), 6 states have internal predecessors, (1938), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:48:25,501 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 323.0) internal successors, (1938), 6 states have internal predecessors, (1938), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:48:25,501 INFO L175 Difference]: Start difference. First operand has 51 places, 41 transitions, 155 flow. Second operand 5 states and 690 transitions. [2022-12-13 13:48:25,501 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 55 transitions, 283 flow [2022-12-13 13:48:25,502 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 55 transitions, 267 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-13 13:48:25,503 INFO L231 Difference]: Finished difference. Result has 46 places, 33 transitions, 137 flow [2022-12-13 13:48:25,503 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=323, PETRI_DIFFERENCE_MINUEND_FLOW=111, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=137, PETRI_PLACES=46, PETRI_TRANSITIONS=33} [2022-12-13 13:48:25,503 INFO L288 CegarLoopForPetriNet]: 83 programPoint places, -37 predicate places. [2022-12-13 13:48:25,503 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 33 transitions, 137 flow [2022-12-13 13:48:25,504 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 130.4) internal successors, (652), 5 states have internal predecessors, (652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:48:25,504 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:48:25,504 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 13:48:25,512 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ff8853c-4614-4805-9a13-aaae87bb1caa/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 13:48:25,704 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ff8853c-4614-4805-9a13-aaae87bb1caa/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 13:48:25,706 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2022-12-13 13:48:25,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:48:25,707 INFO L85 PathProgramCache]: Analyzing trace with hash 1403219869, now seen corresponding path program 1 times [2022-12-13 13:48:25,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 13:48:25,709 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1034874849] [2022-12-13 13:48:25,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:48:25,710 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 13:48:25,710 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ff8853c-4614-4805-9a13-aaae87bb1caa/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 13:48:25,713 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ff8853c-4614-4805-9a13-aaae87bb1caa/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 13:48:25,716 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ff8853c-4614-4805-9a13-aaae87bb1caa/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 13:48:25,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:48:25,845 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-13 13:48:25,846 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:48:25,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:48:25,856 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 13:48:25,856 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 13:48:25,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1034874849] [2022-12-13 13:48:25,856 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1034874849] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:48:25,856 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:48:25,857 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 13:48:25,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461889446] [2022-12-13 13:48:25,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:48:25,857 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 13:48:25,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 13:48:25,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 13:48:25,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 13:48:25,861 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 323 [2022-12-13 13:48:25,861 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 33 transitions, 137 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 13:48:25,862 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:48:25,862 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 323 [2022-12-13 13:48:25,862 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:48:26,022 INFO L130 PetriNetUnfolder]: 225/419 cut-off events. [2022-12-13 13:48:26,022 INFO L131 PetriNetUnfolder]: For 475/475 co-relation queries the response was YES. [2022-12-13 13:48:26,022 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1210 conditions, 419 events. 225/419 cut-off events. For 475/475 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1483 event pairs, 131 based on Foata normal form. 0/414 useless extension candidates. Maximal degree in co-relation 1203. Up to 304 conditions per place. [2022-12-13 13:48:26,023 INFO L137 encePairwiseOnDemand]: 320/323 looper letters, 53 selfloop transitions, 2 changer transitions 0/55 dead transitions. [2022-12-13 13:48:26,024 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 55 transitions, 351 flow [2022-12-13 13:48:26,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 13:48:26,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 13:48:26,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 428 transitions. [2022-12-13 13:48:26,025 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.44169246646026833 [2022-12-13 13:48:26,025 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 428 transitions. [2022-12-13 13:48:26,025 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 428 transitions. [2022-12-13 13:48:26,025 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:48:26,025 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 428 transitions. [2022-12-13 13:48:26,026 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 142.66666666666666) internal successors, (428), 3 states have internal predecessors, (428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:48:26,026 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 323.0) internal successors, (1292), 4 states have internal predecessors, (1292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:48:26,027 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 323.0) internal successors, (1292), 4 states have internal predecessors, (1292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:48:26,027 INFO L175 Difference]: Start difference. First operand has 46 places, 33 transitions, 137 flow. Second operand 3 states and 428 transitions. [2022-12-13 13:48:26,027 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 55 transitions, 351 flow [2022-12-13 13:48:26,029 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 55 transitions, 301 flow, removed 12 selfloop flow, removed 3 redundant places. [2022-12-13 13:48:26,030 INFO L231 Difference]: Finished difference. Result has 45 places, 34 transitions, 123 flow [2022-12-13 13:48:26,030 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=323, PETRI_DIFFERENCE_MINUEND_FLOW=111, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=123, PETRI_PLACES=45, PETRI_TRANSITIONS=34} [2022-12-13 13:48:26,030 INFO L288 CegarLoopForPetriNet]: 83 programPoint places, -38 predicate places. [2022-12-13 13:48:26,030 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 34 transitions, 123 flow [2022-12-13 13:48:26,031 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 13:48:26,031 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:48:26,031 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 13:48:26,039 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ff8853c-4614-4805-9a13-aaae87bb1caa/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 13:48:26,231 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ff8853c-4614-4805-9a13-aaae87bb1caa/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 13:48:26,232 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2022-12-13 13:48:26,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:48:26,234 INFO L85 PathProgramCache]: Analyzing trace with hash -331944346, now seen corresponding path program 1 times [2022-12-13 13:48:26,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 13:48:26,236 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [535575732] [2022-12-13 13:48:26,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:48:26,237 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 13:48:26,238 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ff8853c-4614-4805-9a13-aaae87bb1caa/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 13:48:26,241 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ff8853c-4614-4805-9a13-aaae87bb1caa/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 13:48:26,244 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ff8853c-4614-4805-9a13-aaae87bb1caa/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 13:48:26,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:48:26,417 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-13 13:48:26,418 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:48:26,431 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 13:48:26,432 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 13:48:26,432 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 13:48:26,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [535575732] [2022-12-13 13:48:26,432 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [535575732] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:48:26,432 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:48:26,432 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 13:48:26,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103127795] [2022-12-13 13:48:26,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:48:26,433 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 13:48:26,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 13:48:26,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 13:48:26,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 13:48:26,472 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 323 [2022-12-13 13:48:26,473 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 34 transitions, 123 flow. Second operand has 3 states, 3 states have (on average 133.66666666666666) internal successors, (401), 3 states have internal predecessors, (401), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:48:26,473 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:48:26,473 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 323 [2022-12-13 13:48:26,473 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:48:26,620 INFO L130 PetriNetUnfolder]: 205/397 cut-off events. [2022-12-13 13:48:26,620 INFO L131 PetriNetUnfolder]: For 238/238 co-relation queries the response was YES. [2022-12-13 13:48:26,620 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1110 conditions, 397 events. 205/397 cut-off events. For 238/238 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1392 event pairs, 106 based on Foata normal form. 0/395 useless extension candidates. Maximal degree in co-relation 1102. Up to 208 conditions per place. [2022-12-13 13:48:26,621 INFO L137 encePairwiseOnDemand]: 320/323 looper letters, 38 selfloop transitions, 2 changer transitions 0/41 dead transitions. [2022-12-13 13:48:26,621 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 41 transitions, 235 flow [2022-12-13 13:48:26,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 13:48:26,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 13:48:26,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 413 transitions. [2022-12-13 13:48:26,622 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4262125902992776 [2022-12-13 13:48:26,622 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 413 transitions. [2022-12-13 13:48:26,622 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 413 transitions. [2022-12-13 13:48:26,623 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:48:26,623 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 413 transitions. [2022-12-13 13:48:26,623 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 137.66666666666666) internal successors, (413), 3 states have internal predecessors, (413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:48:26,624 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 323.0) internal successors, (1292), 4 states have internal predecessors, (1292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:48:26,624 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 323.0) internal successors, (1292), 4 states have internal predecessors, (1292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:48:26,624 INFO L175 Difference]: Start difference. First operand has 45 places, 34 transitions, 123 flow. Second operand 3 states and 413 transitions. [2022-12-13 13:48:26,624 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 41 transitions, 235 flow [2022-12-13 13:48:26,625 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 41 transitions, 233 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 13:48:26,626 INFO L231 Difference]: Finished difference. Result has 45 places, 33 transitions, 123 flow [2022-12-13 13:48:26,626 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=323, PETRI_DIFFERENCE_MINUEND_FLOW=119, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=123, PETRI_PLACES=45, PETRI_TRANSITIONS=33} [2022-12-13 13:48:26,627 INFO L288 CegarLoopForPetriNet]: 83 programPoint places, -38 predicate places. [2022-12-13 13:48:26,627 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 33 transitions, 123 flow [2022-12-13 13:48:26,627 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 133.66666666666666) internal successors, (401), 3 states have internal predecessors, (401), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:48:26,627 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:48:26,627 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 13:48:26,635 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ff8853c-4614-4805-9a13-aaae87bb1caa/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 13:48:26,828 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ff8853c-4614-4805-9a13-aaae87bb1caa/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 13:48:26,829 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2022-12-13 13:48:26,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:48:26,830 INFO L85 PathProgramCache]: Analyzing trace with hash 14943401, now seen corresponding path program 1 times [2022-12-13 13:48:26,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 13:48:26,831 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1037543511] [2022-12-13 13:48:26,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:48:26,832 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 13:48:26,832 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ff8853c-4614-4805-9a13-aaae87bb1caa/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 13:48:26,835 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ff8853c-4614-4805-9a13-aaae87bb1caa/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 13:48:26,838 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ff8853c-4614-4805-9a13-aaae87bb1caa/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 13:48:26,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:48:26,961 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-13 13:48:26,962 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:48:27,010 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 13:48:27,011 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 13:48:27,011 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 13:48:27,011 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1037543511] [2022-12-13 13:48:27,011 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1037543511] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:48:27,011 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:48:27,011 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 13:48:27,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954670958] [2022-12-13 13:48:27,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:48:27,011 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 13:48:27,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 13:48:27,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 13:48:27,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 13:48:27,108 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 323 [2022-12-13 13:48:27,109 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 33 transitions, 123 flow. Second operand has 4 states, 4 states have (on average 134.0) internal successors, (536), 4 states have internal predecessors, (536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:48:27,109 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:48:27,109 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 323 [2022-12-13 13:48:27,109 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:48:27,278 INFO L130 PetriNetUnfolder]: 205/395 cut-off events. [2022-12-13 13:48:27,278 INFO L131 PetriNetUnfolder]: For 226/226 co-relation queries the response was YES. [2022-12-13 13:48:27,278 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1112 conditions, 395 events. 205/395 cut-off events. For 226/226 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1382 event pairs, 106 based on Foata normal form. 0/395 useless extension candidates. Maximal degree in co-relation 1104. Up to 212 conditions per place. [2022-12-13 13:48:27,279 INFO L137 encePairwiseOnDemand]: 320/323 looper letters, 37 selfloop transitions, 2 changer transitions 0/40 dead transitions. [2022-12-13 13:48:27,279 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 40 transitions, 233 flow [2022-12-13 13:48:27,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 13:48:27,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 13:48:27,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 547 transitions. [2022-12-13 13:48:27,280 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.423374613003096 [2022-12-13 13:48:27,281 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 547 transitions. [2022-12-13 13:48:27,281 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 547 transitions. [2022-12-13 13:48:27,281 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:48:27,281 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 547 transitions. [2022-12-13 13:48:27,281 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 136.75) internal successors, (547), 4 states have internal predecessors, (547), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:48:27,282 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 323.0) internal successors, (1615), 5 states have internal predecessors, (1615), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:48:27,283 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 323.0) internal successors, (1615), 5 states have internal predecessors, (1615), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:48:27,283 INFO L175 Difference]: Start difference. First operand has 45 places, 33 transitions, 123 flow. Second operand 4 states and 547 transitions. [2022-12-13 13:48:27,283 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 40 transitions, 233 flow [2022-12-13 13:48:27,284 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 40 transitions, 229 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 13:48:27,284 INFO L231 Difference]: Finished difference. Result has 45 places, 32 transitions, 121 flow [2022-12-13 13:48:27,284 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=323, PETRI_DIFFERENCE_MINUEND_FLOW=117, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=121, PETRI_PLACES=45, PETRI_TRANSITIONS=32} [2022-12-13 13:48:27,285 INFO L288 CegarLoopForPetriNet]: 83 programPoint places, -38 predicate places. [2022-12-13 13:48:27,285 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 32 transitions, 121 flow [2022-12-13 13:48:27,285 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 134.0) internal successors, (536), 4 states have internal predecessors, (536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:48:27,285 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:48:27,286 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 13:48:27,294 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ff8853c-4614-4805-9a13-aaae87bb1caa/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)] Forceful destruction successful, exit code 0 [2022-12-13 13:48:27,486 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ff8853c-4614-4805-9a13-aaae87bb1caa/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 13:48:27,487 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2022-12-13 13:48:27,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:48:27,488 INFO L85 PathProgramCache]: Analyzing trace with hash 1095619305, now seen corresponding path program 2 times [2022-12-13 13:48:27,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 13:48:27,489 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [590806043] [2022-12-13 13:48:27,489 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 13:48:27,489 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 13:48:27,489 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ff8853c-4614-4805-9a13-aaae87bb1caa/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 13:48:27,491 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ff8853c-4614-4805-9a13-aaae87bb1caa/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 13:48:27,492 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ff8853c-4614-4805-9a13-aaae87bb1caa/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 13:48:27,629 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-12-13 13:48:27,629 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 13:48:27,636 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 40 conjunts are in the unsatisfiable core [2022-12-13 13:48:27,642 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:48:27,849 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 33 [2022-12-13 13:48:28,071 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 36 [2022-12-13 13:48:28,316 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 74 [2022-12-13 13:48:28,640 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2022-12-13 13:48:28,708 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 13:48:28,708 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 13:48:28,708 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 13:48:28,708 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [590806043] [2022-12-13 13:48:28,708 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [590806043] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:48:28,708 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:48:28,708 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 13:48:28,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282311893] [2022-12-13 13:48:28,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:48:28,709 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 13:48:28,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 13:48:28,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 13:48:28,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-13 13:48:29,790 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 323 [2022-12-13 13:48:29,791 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 32 transitions, 121 flow. Second operand has 7 states, 7 states have (on average 119.85714285714286) internal successors, (839), 7 states have internal predecessors, (839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:48:29,791 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:48:29,791 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 323 [2022-12-13 13:48:29,791 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:48:30,510 INFO L130 PetriNetUnfolder]: 315/635 cut-off events. [2022-12-13 13:48:30,510 INFO L131 PetriNetUnfolder]: For 434/434 co-relation queries the response was YES. [2022-12-13 13:48:30,511 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1839 conditions, 635 events. 315/635 cut-off events. For 434/434 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 3016 event pairs, 113 based on Foata normal form. 2/637 useless extension candidates. Maximal degree in co-relation 1831. Up to 356 conditions per place. [2022-12-13 13:48:30,512 INFO L137 encePairwiseOnDemand]: 315/323 looper letters, 72 selfloop transitions, 9 changer transitions 0/82 dead transitions. [2022-12-13 13:48:30,513 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 82 transitions, 495 flow [2022-12-13 13:48:30,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 13:48:30,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 13:48:30,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 759 transitions. [2022-12-13 13:48:30,514 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.39164086687306504 [2022-12-13 13:48:30,514 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 759 transitions. [2022-12-13 13:48:30,514 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 759 transitions. [2022-12-13 13:48:30,515 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:48:30,515 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 759 transitions. [2022-12-13 13:48:30,516 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 126.5) internal successors, (759), 6 states have internal predecessors, (759), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:48:30,517 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 323.0) internal successors, (2261), 7 states have internal predecessors, (2261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:48:30,517 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 323.0) internal successors, (2261), 7 states have internal predecessors, (2261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:48:30,517 INFO L175 Difference]: Start difference. First operand has 45 places, 32 transitions, 121 flow. Second operand 6 states and 759 transitions. [2022-12-13 13:48:30,517 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 82 transitions, 495 flow [2022-12-13 13:48:30,519 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 82 transitions, 492 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 13:48:30,520 INFO L231 Difference]: Finished difference. Result has 51 places, 39 transitions, 175 flow [2022-12-13 13:48:30,520 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=323, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=175, PETRI_PLACES=51, PETRI_TRANSITIONS=39} [2022-12-13 13:48:30,520 INFO L288 CegarLoopForPetriNet]: 83 programPoint places, -32 predicate places. [2022-12-13 13:48:30,520 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 39 transitions, 175 flow [2022-12-13 13:48:30,521 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 119.85714285714286) internal successors, (839), 7 states have internal predecessors, (839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:48:30,521 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:48:30,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] [2022-12-13 13:48:30,529 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ff8853c-4614-4805-9a13-aaae87bb1caa/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2022-12-13 13:48:30,721 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ff8853c-4614-4805-9a13-aaae87bb1caa/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 13:48:30,721 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2022-12-13 13:48:30,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:48:30,722 INFO L85 PathProgramCache]: Analyzing trace with hash 1033337335, now seen corresponding path program 3 times [2022-12-13 13:48:30,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 13:48:30,722 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [380156486] [2022-12-13 13:48:30,722 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 13:48:30,722 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 13:48:30,722 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ff8853c-4614-4805-9a13-aaae87bb1caa/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 13:48:30,723 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ff8853c-4614-4805-9a13-aaae87bb1caa/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 13:48:30,724 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ff8853c-4614-4805-9a13-aaae87bb1caa/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 13:48:30,853 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-12-13 13:48:30,854 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 13:48:30,860 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 45 conjunts are in the unsatisfiable core [2022-12-13 13:48:30,866 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:48:31,056 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 33 [2022-12-13 13:48:31,268 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2022-12-13 13:48:31,379 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2022-12-13 13:48:31,528 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 36 [2022-12-13 13:48:31,849 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2022-12-13 13:48:31,914 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 13:48:31,914 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 13:48:31,914 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 13:48:31,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [380156486] [2022-12-13 13:48:31,914 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [380156486] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:48:31,914 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:48:31,914 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 13:48:31,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456548013] [2022-12-13 13:48:31,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:48:31,915 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 13:48:31,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 13:48:31,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 13:48:31,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-13 13:48:33,060 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 323 [2022-12-13 13:48:33,062 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 39 transitions, 175 flow. Second operand has 8 states, 8 states have (on average 119.5) internal successors, (956), 8 states have internal predecessors, (956), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:48:33,062 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:48:33,062 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 323 [2022-12-13 13:48:33,062 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:48:33,880 INFO L130 PetriNetUnfolder]: 363/752 cut-off events. [2022-12-13 13:48:33,880 INFO L131 PetriNetUnfolder]: For 742/742 co-relation queries the response was YES. [2022-12-13 13:48:33,881 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2508 conditions, 752 events. 363/752 cut-off events. For 742/742 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 3889 event pairs, 146 based on Foata normal form. 1/753 useless extension candidates. Maximal degree in co-relation 2497. Up to 339 conditions per place. [2022-12-13 13:48:33,882 INFO L137 encePairwiseOnDemand]: 317/323 looper letters, 62 selfloop transitions, 9 changer transitions 0/72 dead transitions. [2022-12-13 13:48:33,882 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 72 transitions, 469 flow [2022-12-13 13:48:33,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 13:48:33,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 13:48:33,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 751 transitions. [2022-12-13 13:48:33,884 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.3875128998968008 [2022-12-13 13:48:33,884 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 751 transitions. [2022-12-13 13:48:33,884 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 751 transitions. [2022-12-13 13:48:33,885 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:48:33,885 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 751 transitions. [2022-12-13 13:48:33,886 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 125.16666666666667) internal successors, (751), 6 states have internal predecessors, (751), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:48:33,887 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 323.0) internal successors, (2261), 7 states have internal predecessors, (2261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:48:33,887 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 323.0) internal successors, (2261), 7 states have internal predecessors, (2261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:48:33,887 INFO L175 Difference]: Start difference. First operand has 51 places, 39 transitions, 175 flow. Second operand 6 states and 751 transitions. [2022-12-13 13:48:33,887 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 72 transitions, 469 flow [2022-12-13 13:48:33,890 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 72 transitions, 468 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 13:48:33,891 INFO L231 Difference]: Finished difference. Result has 57 places, 42 transitions, 220 flow [2022-12-13 13:48:33,891 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=323, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=220, PETRI_PLACES=57, PETRI_TRANSITIONS=42} [2022-12-13 13:48:33,891 INFO L288 CegarLoopForPetriNet]: 83 programPoint places, -26 predicate places. [2022-12-13 13:48:33,891 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 42 transitions, 220 flow [2022-12-13 13:48:33,892 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 119.5) internal successors, (956), 8 states have internal predecessors, (956), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:48:33,892 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:48:33,892 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 13:48:33,900 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ff8853c-4614-4805-9a13-aaae87bb1caa/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2022-12-13 13:48:34,092 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ff8853c-4614-4805-9a13-aaae87bb1caa/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 13:48:34,093 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2022-12-13 13:48:34,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:48:34,094 INFO L85 PathProgramCache]: Analyzing trace with hash -264651741, now seen corresponding path program 4 times [2022-12-13 13:48:34,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 13:48:34,095 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1857877599] [2022-12-13 13:48:34,095 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-13 13:48:34,095 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 13:48:34,095 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ff8853c-4614-4805-9a13-aaae87bb1caa/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 13:48:34,096 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ff8853c-4614-4805-9a13-aaae87bb1caa/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 13:48:34,097 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ff8853c-4614-4805-9a13-aaae87bb1caa/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 (13)] Waiting until timeout for monitored process [2022-12-13 13:48:34,233 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-13 13:48:34,233 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 13:48:34,240 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 13 conjunts are in the unsatisfiable core [2022-12-13 13:48:34,242 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:48:34,267 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-13 13:48:34,312 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-13 13:48:34,329 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 13:48:34,329 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 13:48:34,329 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 13:48:34,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1857877599] [2022-12-13 13:48:34,329 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1857877599] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:48:34,329 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:48:34,330 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 13:48:34,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168516547] [2022-12-13 13:48:34,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:48:34,330 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 13:48:34,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 13:48:34,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 13:48:34,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 13:48:34,367 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 323 [2022-12-13 13:48:34,368 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 42 transitions, 220 flow. Second operand has 5 states, 5 states have (on average 128.0) internal successors, (640), 5 states have internal predecessors, (640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:48:34,368 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:48:34,368 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 323 [2022-12-13 13:48:34,368 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:48:34,666 INFO L130 PetriNetUnfolder]: 489/1031 cut-off events. [2022-12-13 13:48:34,666 INFO L131 PetriNetUnfolder]: For 1512/1512 co-relation queries the response was YES. [2022-12-13 13:48:34,667 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3663 conditions, 1031 events. 489/1031 cut-off events. For 1512/1512 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 5870 event pairs, 228 based on Foata normal form. 1/1032 useless extension candidates. Maximal degree in co-relation 3650. Up to 703 conditions per place. [2022-12-13 13:48:34,669 INFO L137 encePairwiseOnDemand]: 315/323 looper letters, 74 selfloop transitions, 13 changer transitions 0/88 dead transitions. [2022-12-13 13:48:34,670 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 88 transitions, 609 flow [2022-12-13 13:48:34,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 13:48:34,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 13:48:34,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 802 transitions. [2022-12-13 13:48:34,671 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.41382868937048506 [2022-12-13 13:48:34,671 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 802 transitions. [2022-12-13 13:48:34,671 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 802 transitions. [2022-12-13 13:48:34,671 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:48:34,672 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 802 transitions. [2022-12-13 13:48:34,672 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 133.66666666666666) internal successors, (802), 6 states have internal predecessors, (802), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:48:34,674 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 323.0) internal successors, (2261), 7 states have internal predecessors, (2261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:48:34,674 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 323.0) internal successors, (2261), 7 states have internal predecessors, (2261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:48:34,675 INFO L175 Difference]: Start difference. First operand has 57 places, 42 transitions, 220 flow. Second operand 6 states and 802 transitions. [2022-12-13 13:48:34,675 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 88 transitions, 609 flow [2022-12-13 13:48:34,680 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 88 transitions, 604 flow, removed 2 selfloop flow, removed 1 redundant places. [2022-12-13 13:48:34,681 INFO L231 Difference]: Finished difference. Result has 64 places, 51 transitions, 320 flow [2022-12-13 13:48:34,681 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=323, PETRI_DIFFERENCE_MINUEND_FLOW=217, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=320, PETRI_PLACES=64, PETRI_TRANSITIONS=51} [2022-12-13 13:48:34,681 INFO L288 CegarLoopForPetriNet]: 83 programPoint places, -19 predicate places. [2022-12-13 13:48:34,682 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 51 transitions, 320 flow [2022-12-13 13:48:34,682 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 128.0) internal successors, (640), 5 states have internal predecessors, (640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:48:34,682 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:48:34,682 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 13:48:34,691 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ff8853c-4614-4805-9a13-aaae87bb1caa/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 (13)] Ended with exit code 0 [2022-12-13 13:48:34,883 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ff8853c-4614-4805-9a13-aaae87bb1caa/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 13:48:34,883 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2022-12-13 13:48:34,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:48:34,884 INFO L85 PathProgramCache]: Analyzing trace with hash 1424720455, now seen corresponding path program 5 times [2022-12-13 13:48:34,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 13:48:34,884 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [624353303] [2022-12-13 13:48:34,884 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-13 13:48:34,884 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 13:48:34,884 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ff8853c-4614-4805-9a13-aaae87bb1caa/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 13:48:34,885 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ff8853c-4614-4805-9a13-aaae87bb1caa/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 13:48:34,886 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ff8853c-4614-4805-9a13-aaae87bb1caa/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 (14)] Waiting until timeout for monitored process [2022-12-13 13:48:35,020 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-12-13 13:48:35,020 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 13:48:35,027 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 18 conjunts are in the unsatisfiable core [2022-12-13 13:48:35,030 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:48:35,086 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-13 13:48:35,121 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2022-12-13 13:48:35,198 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-13 13:48:35,214 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 13:48:35,214 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 13:48:35,214 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 13:48:35,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [624353303] [2022-12-13 13:48:35,215 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [624353303] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:48:35,215 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:48:35,215 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 13:48:35,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512018908] [2022-12-13 13:48:35,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:48:35,215 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 13:48:35,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 13:48:35,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 13:48:35,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 13:48:35,513 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 323 [2022-12-13 13:48:35,514 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 51 transitions, 320 flow. Second operand has 6 states, 6 states have (on average 122.33333333333333) internal successors, (734), 6 states have internal predecessors, (734), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:48:35,514 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:48:35,514 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 323 [2022-12-13 13:48:35,514 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:48:36,030 INFO L130 PetriNetUnfolder]: 607/1322 cut-off events. [2022-12-13 13:48:36,031 INFO L131 PetriNetUnfolder]: For 3205/3213 co-relation queries the response was YES. [2022-12-13 13:48:36,033 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5411 conditions, 1322 events. 607/1322 cut-off events. For 3205/3213 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 8227 event pairs, 166 based on Foata normal form. 9/1331 useless extension candidates. Maximal degree in co-relation 5395. Up to 629 conditions per place. [2022-12-13 13:48:36,036 INFO L137 encePairwiseOnDemand]: 315/323 looper letters, 86 selfloop transitions, 20 changer transitions 0/107 dead transitions. [2022-12-13 13:48:36,036 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 107 transitions, 839 flow [2022-12-13 13:48:36,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 13:48:36,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 13:48:36,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 776 transitions. [2022-12-13 13:48:36,038 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4004127966976264 [2022-12-13 13:48:36,038 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 776 transitions. [2022-12-13 13:48:36,038 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 776 transitions. [2022-12-13 13:48:36,038 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:48:36,038 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 776 transitions. [2022-12-13 13:48:36,039 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 129.33333333333334) internal successors, (776), 6 states have internal predecessors, (776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:48:36,040 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 323.0) internal successors, (2261), 7 states have internal predecessors, (2261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:48:36,040 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 323.0) internal successors, (2261), 7 states have internal predecessors, (2261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:48:36,041 INFO L175 Difference]: Start difference. First operand has 64 places, 51 transitions, 320 flow. Second operand 6 states and 776 transitions. [2022-12-13 13:48:36,041 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 107 transitions, 839 flow [2022-12-13 13:48:36,050 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 107 transitions, 822 flow, removed 4 selfloop flow, removed 2 redundant places. [2022-12-13 13:48:36,051 INFO L231 Difference]: Finished difference. Result has 70 places, 60 transitions, 451 flow [2022-12-13 13:48:36,051 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=323, PETRI_DIFFERENCE_MINUEND_FLOW=303, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=451, PETRI_PLACES=70, PETRI_TRANSITIONS=60} [2022-12-13 13:48:36,052 INFO L288 CegarLoopForPetriNet]: 83 programPoint places, -13 predicate places. [2022-12-13 13:48:36,052 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 60 transitions, 451 flow [2022-12-13 13:48:36,052 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 122.33333333333333) internal successors, (734), 6 states have internal predecessors, (734), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:48:36,052 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:48:36,053 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 13:48:36,061 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ff8853c-4614-4805-9a13-aaae87bb1caa/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 (14)] Ended with exit code 0 [2022-12-13 13:48:36,253 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ff8853c-4614-4805-9a13-aaae87bb1caa/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 13:48:36,253 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2022-12-13 13:48:36,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:48:36,254 INFO L85 PathProgramCache]: Analyzing trace with hash 598182649, now seen corresponding path program 6 times [2022-12-13 13:48:36,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 13:48:36,254 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [582045567] [2022-12-13 13:48:36,254 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-12-13 13:48:36,254 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 13:48:36,254 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ff8853c-4614-4805-9a13-aaae87bb1caa/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 13:48:36,255 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ff8853c-4614-4805-9a13-aaae87bb1caa/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 13:48:36,256 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ff8853c-4614-4805-9a13-aaae87bb1caa/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 (15)] Waiting until timeout for monitored process [2022-12-13 13:48:36,374 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2022-12-13 13:48:36,374 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 13:48:36,381 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 28 conjunts are in the unsatisfiable core [2022-12-13 13:48:36,385 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:48:36,508 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-13 13:48:36,553 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2022-12-13 13:48:36,666 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2022-12-13 13:48:36,735 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-13 13:48:36,752 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 13:48:36,752 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 13:48:36,752 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 13:48:36,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [582045567] [2022-12-13 13:48:36,752 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [582045567] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:48:36,753 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:48:36,753 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 13:48:36,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796322426] [2022-12-13 13:48:36,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:48:36,753 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 13:48:36,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 13:48:36,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 13:48:36,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-13 13:48:37,167 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 323 [2022-12-13 13:48:37,168 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 60 transitions, 451 flow. Second operand has 7 states, 7 states have (on average 121.85714285714286) internal successors, (853), 7 states have internal predecessors, (853), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:48:37,168 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:48:37,168 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 323 [2022-12-13 13:48:37,168 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:48:37,790 INFO L130 PetriNetUnfolder]: 808/1815 cut-off events. [2022-12-13 13:48:37,790 INFO L131 PetriNetUnfolder]: For 6229/6229 co-relation queries the response was YES. [2022-12-13 13:48:37,793 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7886 conditions, 1815 events. 808/1815 cut-off events. For 6229/6229 co-relation queries the response was YES. Maximal size of possible extension queue 181. Compared 12795 event pairs, 231 based on Foata normal form. 1/1816 useless extension candidates. Maximal degree in co-relation 7867. Up to 594 conditions per place. [2022-12-13 13:48:37,797 INFO L137 encePairwiseOnDemand]: 317/323 looper letters, 104 selfloop transitions, 17 changer transitions 0/122 dead transitions. [2022-12-13 13:48:37,797 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 122 transitions, 1063 flow [2022-12-13 13:48:37,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 13:48:37,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 13:48:37,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 776 transitions. [2022-12-13 13:48:37,800 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4004127966976264 [2022-12-13 13:48:37,801 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 776 transitions. [2022-12-13 13:48:37,801 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 776 transitions. [2022-12-13 13:48:37,801 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:48:37,801 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 776 transitions. [2022-12-13 13:48:37,803 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 129.33333333333334) internal successors, (776), 6 states have internal predecessors, (776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:48:37,805 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 323.0) internal successors, (2261), 7 states have internal predecessors, (2261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:48:37,806 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 323.0) internal successors, (2261), 7 states have internal predecessors, (2261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:48:37,806 INFO L175 Difference]: Start difference. First operand has 70 places, 60 transitions, 451 flow. Second operand 6 states and 776 transitions. [2022-12-13 13:48:37,806 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 122 transitions, 1063 flow [2022-12-13 13:48:37,847 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 122 transitions, 1046 flow, removed 8 selfloop flow, removed 1 redundant places. [2022-12-13 13:48:37,848 INFO L231 Difference]: Finished difference. Result has 77 places, 65 transitions, 545 flow [2022-12-13 13:48:37,849 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=323, PETRI_DIFFERENCE_MINUEND_FLOW=434, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=545, PETRI_PLACES=77, PETRI_TRANSITIONS=65} [2022-12-13 13:48:37,849 INFO L288 CegarLoopForPetriNet]: 83 programPoint places, -6 predicate places. [2022-12-13 13:48:37,849 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 65 transitions, 545 flow [2022-12-13 13:48:37,849 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 121.85714285714286) internal successors, (853), 7 states have internal predecessors, (853), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:48:37,849 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:48:37,849 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 13:48:37,857 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ff8853c-4614-4805-9a13-aaae87bb1caa/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 (15)] Ended with exit code 0 [2022-12-13 13:48:38,050 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ff8853c-4614-4805-9a13-aaae87bb1caa/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 13:48:38,051 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2022-12-13 13:48:38,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:48:38,054 INFO L85 PathProgramCache]: Analyzing trace with hash 2088312355, now seen corresponding path program 7 times [2022-12-13 13:48:38,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 13:48:38,055 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [515538433] [2022-12-13 13:48:38,056 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-13 13:48:38,056 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 13:48:38,057 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ff8853c-4614-4805-9a13-aaae87bb1caa/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 13:48:38,060 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ff8853c-4614-4805-9a13-aaae87bb1caa/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 13:48:38,062 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ff8853c-4614-4805-9a13-aaae87bb1caa/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 (16)] Waiting until timeout for monitored process [2022-12-13 13:48:38,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 13:48:38,290 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 13:48:38,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 13:48:38,465 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-12-13 13:48:38,465 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 13:48:38,465 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK (84 of 85 remaining) [2022-12-13 13:48:38,466 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (83 of 85 remaining) [2022-12-13 13:48:38,467 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (82 of 85 remaining) [2022-12-13 13:48:38,467 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (81 of 85 remaining) [2022-12-13 13:48:38,467 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (80 of 85 remaining) [2022-12-13 13:48:38,467 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (79 of 85 remaining) [2022-12-13 13:48:38,467 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (78 of 85 remaining) [2022-12-13 13:48:38,467 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (77 of 85 remaining) [2022-12-13 13:48:38,467 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (76 of 85 remaining) [2022-12-13 13:48:38,467 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 85 remaining) [2022-12-13 13:48:38,467 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 85 remaining) [2022-12-13 13:48:38,467 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 85 remaining) [2022-12-13 13:48:38,467 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 85 remaining) [2022-12-13 13:48:38,467 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 85 remaining) [2022-12-13 13:48:38,467 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 85 remaining) [2022-12-13 13:48:38,468 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 85 remaining) [2022-12-13 13:48:38,468 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 85 remaining) [2022-12-13 13:48:38,468 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 85 remaining) [2022-12-13 13:48:38,468 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 85 remaining) [2022-12-13 13:48:38,468 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 85 remaining) [2022-12-13 13:48:38,468 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 85 remaining) [2022-12-13 13:48:38,468 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 85 remaining) [2022-12-13 13:48:38,468 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 85 remaining) [2022-12-13 13:48:38,468 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 85 remaining) [2022-12-13 13:48:38,468 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 85 remaining) [2022-12-13 13:48:38,468 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 85 remaining) [2022-12-13 13:48:38,468 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 85 remaining) [2022-12-13 13:48:38,468 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 85 remaining) [2022-12-13 13:48:38,468 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 85 remaining) [2022-12-13 13:48:38,468 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 85 remaining) [2022-12-13 13:48:38,468 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 85 remaining) [2022-12-13 13:48:38,469 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 85 remaining) [2022-12-13 13:48:38,469 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 85 remaining) [2022-12-13 13:48:38,469 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 85 remaining) [2022-12-13 13:48:38,469 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 85 remaining) [2022-12-13 13:48:38,469 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 85 remaining) [2022-12-13 13:48:38,469 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 85 remaining) [2022-12-13 13:48:38,469 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 85 remaining) [2022-12-13 13:48:38,469 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 85 remaining) [2022-12-13 13:48:38,469 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 85 remaining) [2022-12-13 13:48:38,469 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 85 remaining) [2022-12-13 13:48:38,469 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 85 remaining) [2022-12-13 13:48:38,469 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 85 remaining) [2022-12-13 13:48:38,469 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 85 remaining) [2022-12-13 13:48:38,469 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 85 remaining) [2022-12-13 13:48:38,469 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 85 remaining) [2022-12-13 13:48:38,469 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 85 remaining) [2022-12-13 13:48:38,470 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK (37 of 85 remaining) [2022-12-13 13:48:38,470 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (36 of 85 remaining) [2022-12-13 13:48:38,470 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (35 of 85 remaining) [2022-12-13 13:48:38,470 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (34 of 85 remaining) [2022-12-13 13:48:38,470 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 85 remaining) [2022-12-13 13:48:38,470 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 85 remaining) [2022-12-13 13:48:38,470 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 85 remaining) [2022-12-13 13:48:38,470 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 85 remaining) [2022-12-13 13:48:38,470 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 85 remaining) [2022-12-13 13:48:38,470 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 85 remaining) [2022-12-13 13:48:38,470 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 85 remaining) [2022-12-13 13:48:38,470 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 85 remaining) [2022-12-13 13:48:38,470 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 85 remaining) [2022-12-13 13:48:38,470 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 85 remaining) [2022-12-13 13:48:38,470 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 85 remaining) [2022-12-13 13:48:38,470 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 85 remaining) [2022-12-13 13:48:38,471 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 85 remaining) [2022-12-13 13:48:38,471 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 85 remaining) [2022-12-13 13:48:38,471 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 85 remaining) [2022-12-13 13:48:38,471 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 85 remaining) [2022-12-13 13:48:38,471 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 85 remaining) [2022-12-13 13:48:38,471 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 85 remaining) [2022-12-13 13:48:38,471 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 85 remaining) [2022-12-13 13:48:38,471 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 85 remaining) [2022-12-13 13:48:38,471 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 85 remaining) [2022-12-13 13:48:38,471 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 85 remaining) [2022-12-13 13:48:38,471 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 85 remaining) [2022-12-13 13:48:38,471 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 85 remaining) [2022-12-13 13:48:38,471 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 85 remaining) [2022-12-13 13:48:38,471 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 85 remaining) [2022-12-13 13:48:38,471 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 85 remaining) [2022-12-13 13:48:38,471 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 85 remaining) [2022-12-13 13:48:38,472 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 85 remaining) [2022-12-13 13:48:38,472 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 85 remaining) [2022-12-13 13:48:38,472 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 85 remaining) [2022-12-13 13:48:38,472 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 85 remaining) [2022-12-13 13:48:38,472 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 85 remaining) [2022-12-13 13:48:38,472 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 85 remaining) [2022-12-13 13:48:38,485 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ff8853c-4614-4805-9a13-aaae87bb1caa/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 (16)] Ended with exit code 0 [2022-12-13 13:48:38,672 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ff8853c-4614-4805-9a13-aaae87bb1caa/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 13:48:38,673 INFO L445 BasicCegarLoop]: Path program histogram: [7, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:48:38,682 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 13:48:38,682 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 13:48:38,731 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 01:48:38 BasicIcfg [2022-12-13 13:48:38,731 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 13:48:38,731 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-13 13:48:38,731 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-13 13:48:38,732 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-13 13:48:38,732 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 01:48:04" (3/4) ... [2022-12-13 13:48:38,734 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-12-13 13:48:38,734 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-13 13:48:38,734 INFO L158 Benchmark]: Toolchain (without parser) took 36047.11ms. Allocated memory was 62.9MB in the beginning and 1.7GB in the end (delta: 1.6GB). Free memory was 40.4MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 225.2MB. Max. memory is 16.1GB. [2022-12-13 13:48:38,735 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 48.2MB. Free memory was 26.7MB in the beginning and 26.7MB in the end (delta: 52.5kB). There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 13:48:38,735 INFO L158 Benchmark]: CACSL2BoogieTranslator took 404.22ms. Allocated memory is still 62.9MB. Free memory was 40.0MB in the beginning and 27.5MB in the end (delta: 12.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-12-13 13:48:38,735 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.03ms. Allocated memory is still 62.9MB. Free memory was 27.4MB in the beginning and 40.6MB in the end (delta: -13.2MB). Peak memory consumption was 5.1MB. Max. memory is 16.1GB. [2022-12-13 13:48:38,735 INFO L158 Benchmark]: Boogie Preprocessor took 25.00ms. Allocated memory is still 62.9MB. Free memory was 40.6MB in the beginning and 38.0MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 13:48:38,735 INFO L158 Benchmark]: RCFGBuilder took 1047.12ms. Allocated memory was 62.9MB in the beginning and 75.5MB in the end (delta: 12.6MB). Free memory was 38.0MB in the beginning and 36.4MB in the end (delta: 1.6MB). Peak memory consumption was 26.8MB. Max. memory is 16.1GB. [2022-12-13 13:48:38,735 INFO L158 Benchmark]: TraceAbstraction took 34525.69ms. Allocated memory was 75.5MB in the beginning and 1.7GB in the end (delta: 1.6GB). Free memory was 35.9MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 206.5MB. Max. memory is 16.1GB. [2022-12-13 13:48:38,736 INFO L158 Benchmark]: Witness Printer took 2.70ms. Allocated memory is still 1.7GB. Free memory is still 1.5GB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 13:48:38,737 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 48.2MB. Free memory was 26.7MB in the beginning and 26.7MB in the end (delta: 52.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 404.22ms. Allocated memory is still 62.9MB. Free memory was 40.0MB in the beginning and 27.5MB in the end (delta: 12.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.03ms. Allocated memory is still 62.9MB. Free memory was 27.4MB in the beginning and 40.6MB in the end (delta: -13.2MB). Peak memory consumption was 5.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 25.00ms. Allocated memory is still 62.9MB. Free memory was 40.6MB in the beginning and 38.0MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1047.12ms. Allocated memory was 62.9MB in the beginning and 75.5MB in the end (delta: 12.6MB). Free memory was 38.0MB in the beginning and 36.4MB in the end (delta: 1.6MB). Peak memory consumption was 26.8MB. Max. memory is 16.1GB. * TraceAbstraction took 34525.69ms. Allocated memory was 75.5MB in the beginning and 1.7GB in the end (delta: 1.6GB). Free memory was 35.9MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 206.5MB. Max. memory is 16.1GB. * Witness Printer took 2.70ms. Allocated memory is still 1.7GB. Free memory is still 1.5GB. 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: 10.8s, 186 PlacesBefore, 83 PlacesAfterwards, 178 TransitionsBefore, 74 TransitionsAfterwards, 7128 CoEnabledTransitionPairs, 8 FixpointIterations, 67 TrivialSequentialCompositions, 71 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 1 ChoiceCompositions, 142 TotalNumberOfCompositions, 41835 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 10485, independent: 9762, independent conditional: 0, independent unconditional: 9762, dependent: 723, dependent conditional: 0, dependent unconditional: 723, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 2912, independent: 2824, independent conditional: 0, independent unconditional: 2824, dependent: 88, dependent conditional: 0, dependent unconditional: 88, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 10485, independent: 6938, independent conditional: 0, independent unconditional: 6938, dependent: 635, dependent conditional: 0, dependent unconditional: 635, unknown: 2912, unknown conditional: 0, unknown unconditional: 2912] , Statistics on independence cache: Total cache size (in pairs): 428, Positive cache size: 382, Positive conditional cache size: 0, Positive unconditional cache size: 382, Negative cache size: 46, Negative conditional cache size: 0, Negative unconditional cache size: 46, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 19]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 19. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L715] 0 _Bool __unbuffered_p2_EAX$flush_delayed; [L716] 0 int __unbuffered_p2_EAX$mem_tmp; [L717] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd0; [L718] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd1; [L719] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd2; [L720] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd3; [L721] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd0; [L722] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd1; [L723] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd2; [L724] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd3; [L725] 0 _Bool __unbuffered_p2_EAX$read_delayed; [L726] 0 int *__unbuffered_p2_EAX$read_delayed_var; [L727] 0 int __unbuffered_p2_EAX$w_buff0; [L728] 0 _Bool __unbuffered_p2_EAX$w_buff0_used; [L729] 0 int __unbuffered_p2_EAX$w_buff1; [L730] 0 _Bool __unbuffered_p2_EAX$w_buff1_used; [L731] 0 _Bool main$tmp_guard0; [L732] 0 _Bool main$tmp_guard1; [L734] 0 int x = 0; [L735] 0 _Bool x$flush_delayed; [L736] 0 int x$mem_tmp; [L737] 0 _Bool x$r_buff0_thd0; [L738] 0 _Bool x$r_buff0_thd1; [L739] 0 _Bool x$r_buff0_thd2; [L740] 0 _Bool x$r_buff0_thd3; [L741] 0 _Bool x$r_buff1_thd0; [L742] 0 _Bool x$r_buff1_thd1; [L743] 0 _Bool x$r_buff1_thd2; [L744] 0 _Bool x$r_buff1_thd3; [L745] 0 _Bool x$read_delayed; [L746] 0 int *x$read_delayed_var; [L747] 0 int x$w_buff0; [L748] 0 _Bool x$w_buff0_used; [L749] 0 int x$w_buff1; [L750] 0 _Bool x$w_buff1_used; [L752] 0 int y = 0; [L753] 0 _Bool weak$$choice0; [L754] 0 _Bool weak$$choice1; [L755] 0 _Bool weak$$choice2; [L849] 0 pthread_t t2269; [L850] FCALL, FORK 0 pthread_create(&t2269, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2269, ((void *)0), P0, ((void *)0))=-2, t2269={15:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L851] 0 pthread_t t2270; [L852] FCALL, FORK 0 pthread_create(&t2270, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2270, ((void *)0), P1, ((void *)0))=-1, t2269={15:0}, t2270={5:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L853] 0 pthread_t t2271; [L854] FCALL, FORK 0 pthread_create(&t2271, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2271, ((void *)0), P2, ((void *)0))=0, t2269={15:0}, t2270={5:0}, t2271={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L806] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L807] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L808] 3 x$flush_delayed = weak$$choice2 [L809] EXPR 3 \read(x) [L809] 3 x$mem_tmp = x [L810] EXPR 3 !x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff1) [L810] EXPR 3 \read(x) [L810] EXPR 3 !x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff1) [L810] 3 x = !x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff1) [L811] 3 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff0)) [L812] 3 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff1 : x$w_buff1)) [L813] 3 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used)) [L814] 3 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L815] 3 x$r_buff0_thd3 = weak$$choice2 ? x$r_buff0_thd3 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$r_buff0_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3)) [L816] 3 x$r_buff1_thd3 = weak$$choice2 ? x$r_buff1_thd3 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$r_buff1_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L817] 3 __unbuffered_p2_EAX$read_delayed = (_Bool)1 [L818] 3 __unbuffered_p2_EAX$read_delayed_var = &x [L819] EXPR 3 \read(x) [L819] 3 __unbuffered_p2_EAX = x [L820] EXPR 3 x$flush_delayed ? x$mem_tmp : x [L820] EXPR 3 \read(x) [L820] EXPR 3 x$flush_delayed ? x$mem_tmp : x [L820] 3 x = x$flush_delayed ? x$mem_tmp : x [L821] 3 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$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=7, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L824] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$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=7, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L759] 1 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$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=7, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L764] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L765] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L766] 1 x$flush_delayed = weak$$choice2 [L767] EXPR 1 \read(x) [L767] 1 x$mem_tmp = x [L768] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L768] EXPR 1 \read(x) [L768] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L768] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L769] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L770] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L771] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L772] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L773] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L774] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L775] EXPR 1 \read(x) [L775] 1 __unbuffered_p0_EAX = x [L776] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L776] 1 x = x$flush_delayed ? x$mem_tmp : x [L777] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$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=6, weak$$choice1=0, weak$$choice2=2, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L782] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L784] 1 return 0; [L827] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L827] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L827] EXPR 3 \read(x) [L827] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L827] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L827] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L828] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L829] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L830] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L831] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$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=6, weak$$choice1=0, weak$$choice2=2, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L789] 2 x = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$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=6, weak$$choice1=0, weak$$choice2=2, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L792] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L792] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L792] EXPR 2 \read(x) [L792] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L792] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L792] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L793] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L794] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L795] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L796] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$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=6, weak$$choice1=0, weak$$choice2=2, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L799] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L801] 2 return 0; [L834] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L836] 3 return 0; [L856] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L858] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L858] RET 0 assume_abort_if_not(main$tmp_guard0) [L860] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L860] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L860] EXPR 0 \read(x) [L860] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L860] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L860] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L861] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L862] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L863] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L864] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$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, t2269={15:0}, t2270={5:0}, t2271={7:0}, weak$$choice0=6, weak$$choice1=0, weak$$choice2=2, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L867] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L868] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L868] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L868] EXPR 0 \read(*__unbuffered_p2_EAX$read_delayed_var) [L868] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L868] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L868] 0 __unbuffered_p2_EAX = __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L869] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 1) [L871] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice1=2, weak$$choice2=2, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - 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: -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: -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: -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: -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: -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: 847]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 854]: 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: 850]: 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: 852]: 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 7 procedures, 239 locations, 85 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: 34.3s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 7, EmptinessCheckTime: 0.0s, AutomataDifference: 14.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 11.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1313 SdHoareTripleChecker+Valid, 6.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 889 mSDsluCounter, 625 SdHoareTripleChecker+Invalid, 5.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 578 mSDsCounter, 258 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2966 IncrementalHoareTripleChecker+Invalid, 3224 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 258 mSolverCounterUnsat, 47 mSDtfsCounter, 2966 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 220 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=545occurred in iteration=14, InterpolantAutomatonStates: 60, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 240 NumberOfCodeBlocks, 240 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 205 ConstructedInterpolants, 0 QuantifiedInterpolants, 2593 SizeOfPredicates, 70 NumberOfNonLiveVariables, 2370 ConjunctsInSsa, 188 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 13:48:38,751 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ff8853c-4614-4805-9a13-aaae87bb1caa/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample