./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/mix031.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 38b53e6a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03b508e4-fc93-41c2-8a03-e71be20a7886/bin/uautomizer-ZsLfNo2U6R/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03b508e4-fc93-41c2-8a03-e71be20a7886/bin/uautomizer-ZsLfNo2U6R/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03b508e4-fc93-41c2-8a03-e71be20a7886/bin/uautomizer-ZsLfNo2U6R/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03b508e4-fc93-41c2-8a03-e71be20a7886/bin/uautomizer-ZsLfNo2U6R/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix031.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03b508e4-fc93-41c2-8a03-e71be20a7886/bin/uautomizer-ZsLfNo2U6R/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03b508e4-fc93-41c2-8a03-e71be20a7886/bin/uautomizer-ZsLfNo2U6R --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c5191c614040da54c6fe77b0fb4d91d943009a345a9252a69568f58113a0aaaf --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-38b53e6 [2022-11-25 16:46:27,924 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 16:46:27,927 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 16:46:27,980 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 16:46:27,981 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 16:46:27,985 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 16:46:27,988 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 16:46:27,993 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 16:46:27,996 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 16:46:28,003 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 16:46:28,005 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 16:46:28,007 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 16:46:28,008 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 16:46:28,011 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 16:46:28,014 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 16:46:28,019 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 16:46:28,021 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 16:46:28,022 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 16:46:28,025 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 16:46:28,030 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 16:46:28,034 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 16:46:28,037 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 16:46:28,039 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 16:46:28,041 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 16:46:28,052 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 16:46:28,055 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 16:46:28,056 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 16:46:28,057 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 16:46:28,059 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 16:46:28,062 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 16:46:28,062 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 16:46:28,064 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 16:46:28,066 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 16:46:28,067 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 16:46:28,069 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 16:46:28,070 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 16:46:28,071 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 16:46:28,071 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 16:46:28,072 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 16:46:28,074 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 16:46:28,075 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 16:46:28,077 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03b508e4-fc93-41c2-8a03-e71be20a7886/bin/uautomizer-ZsLfNo2U6R/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-11-25 16:46:28,129 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 16:46:28,130 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 16:46:28,131 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 16:46:28,131 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 16:46:28,132 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 16:46:28,133 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 16:46:28,134 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 16:46:28,134 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 16:46:28,135 INFO L138 SettingsManager]: * Use SBE=true [2022-11-25 16:46:28,135 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 16:46:28,137 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 16:46:28,137 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-25 16:46:28,137 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 16:46:28,138 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 16:46:28,138 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 16:46:28,139 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-25 16:46:28,139 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-25 16:46:28,139 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-25 16:46:28,140 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 16:46:28,140 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-25 16:46:28,140 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 16:46:28,141 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 16:46:28,141 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 16:46:28,142 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-25 16:46:28,142 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 16:46:28,142 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 16:46:28,143 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 16:46:28,143 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 16:46:28,144 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-25 16:46:28,145 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-25 16:46:28,145 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-25 16:46:28,145 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-25 16:46:28,146 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-25 16:46:28,146 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_03b508e4-fc93-41c2-8a03-e71be20a7886/bin/uautomizer-ZsLfNo2U6R/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03b508e4-fc93-41c2-8a03-e71be20a7886/bin/uautomizer-ZsLfNo2U6R Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c5191c614040da54c6fe77b0fb4d91d943009a345a9252a69568f58113a0aaaf [2022-11-25 16:46:28,536 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 16:46:28,566 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 16:46:28,570 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 16:46:28,571 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 16:46:28,572 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 16:46:28,574 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03b508e4-fc93-41c2-8a03-e71be20a7886/bin/uautomizer-ZsLfNo2U6R/../../sv-benchmarks/c/pthread-wmm/mix031.oepc.i [2022-11-25 16:46:32,059 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 16:46:32,612 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 16:46:32,612 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03b508e4-fc93-41c2-8a03-e71be20a7886/sv-benchmarks/c/pthread-wmm/mix031.oepc.i [2022-11-25 16:46:32,636 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03b508e4-fc93-41c2-8a03-e71be20a7886/bin/uautomizer-ZsLfNo2U6R/data/19f1e9b07/1803b08cf20a4d33974cda9d8b8adeb4/FLAG82f825b7c [2022-11-25 16:46:32,666 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03b508e4-fc93-41c2-8a03-e71be20a7886/bin/uautomizer-ZsLfNo2U6R/data/19f1e9b07/1803b08cf20a4d33974cda9d8b8adeb4 [2022-11-25 16:46:32,670 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 16:46:32,672 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 16:46:32,676 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 16:46:32,676 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 16:46:32,681 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 16:46:32,682 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 04:46:32" (1/1) ... [2022-11-25 16:46:32,683 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ad5879 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:46:32, skipping insertion in model container [2022-11-25 16:46:32,684 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 04:46:32" (1/1) ... [2022-11-25 16:46:32,694 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 16:46:32,770 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 16:46:33,058 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_03b508e4-fc93-41c2-8a03-e71be20a7886/sv-benchmarks/c/pthread-wmm/mix031.oepc.i[945,958] [2022-11-25 16:46:33,355 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:46:33,360 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:46:33,361 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:46:33,362 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:46:33,363 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:46:33,364 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:46:33,364 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:46:33,365 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:46:33,366 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:46:33,375 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:46:33,375 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:46:33,377 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:46:33,379 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:46:33,380 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:46:33,380 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:46:33,381 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:46:33,381 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:46:33,382 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:46:33,383 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:46:33,413 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:46:33,415 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:46:33,424 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:46:33,430 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:46:33,431 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:46:33,438 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:46:33,443 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:46:33,445 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:46:33,449 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:46:33,453 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:46:33,454 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:46:33,461 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 16:46:33,476 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 16:46:33,493 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_03b508e4-fc93-41c2-8a03-e71be20a7886/sv-benchmarks/c/pthread-wmm/mix031.oepc.i[945,958] [2022-11-25 16:46:33,544 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:46:33,545 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:46:33,546 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:46:33,546 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:46:33,547 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:46:33,547 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:46:33,548 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:46:33,548 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:46:33,549 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:46:33,551 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:46:33,552 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:46:33,552 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:46:33,553 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:46:33,554 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:46:33,554 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:46:33,555 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:46:33,555 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:46:33,555 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:46:33,556 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:46:33,563 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:46:33,564 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:46:33,567 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:46:33,567 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:46:33,568 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:46:33,571 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:46:33,572 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:46:33,573 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:46:33,575 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:46:33,576 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:46:33,577 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:46:33,578 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 16:46:33,622 INFO L208 MainTranslator]: Completed translation [2022-11-25 16:46:33,623 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:46:33 WrapperNode [2022-11-25 16:46:33,623 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 16:46:33,625 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 16:46:33,625 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 16:46:33,625 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 16:46:33,635 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:46:33" (1/1) ... [2022-11-25 16:46:33,653 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:46:33" (1/1) ... [2022-11-25 16:46:33,682 INFO L138 Inliner]: procedures = 175, calls = 49, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 123 [2022-11-25 16:46:33,683 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 16:46:33,684 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 16:46:33,684 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 16:46:33,684 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 16:46:33,696 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:46:33" (1/1) ... [2022-11-25 16:46:33,697 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:46:33" (1/1) ... [2022-11-25 16:46:33,701 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:46:33" (1/1) ... [2022-11-25 16:46:33,702 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:46:33" (1/1) ... [2022-11-25 16:46:33,714 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:46:33" (1/1) ... [2022-11-25 16:46:33,717 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:46:33" (1/1) ... [2022-11-25 16:46:33,719 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:46:33" (1/1) ... [2022-11-25 16:46:33,721 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:46:33" (1/1) ... [2022-11-25 16:46:33,725 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 16:46:33,726 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 16:46:33,726 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 16:46:33,726 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 16:46:33,727 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:46:33" (1/1) ... [2022-11-25 16:46:33,735 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 16:46:33,750 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03b508e4-fc93-41c2-8a03-e71be20a7886/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:46:33,770 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03b508e4-fc93-41c2-8a03-e71be20a7886/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 16:46:33,804 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03b508e4-fc93-41c2-8a03-e71be20a7886/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 16:46:33,835 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-25 16:46:33,836 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-25 16:46:33,836 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 16:46:33,836 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-25 16:46:33,836 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-25 16:46:33,837 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-25 16:46:33,837 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-25 16:46:33,837 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-25 16:46:33,837 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-25 16:46:33,837 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-25 16:46:33,838 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-25 16:46:33,838 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 16:46:33,838 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 16:46:33,840 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-25 16:46:34,061 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 16:46:34,064 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 16:46:34,618 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 16:46:34,796 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 16:46:34,797 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-25 16:46:34,800 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 04:46:34 BoogieIcfgContainer [2022-11-25 16:46:34,800 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 16:46:34,803 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 16:46:34,803 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 16:46:34,807 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 16:46:34,808 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 04:46:32" (1/3) ... [2022-11-25 16:46:34,809 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e669867 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 04:46:34, skipping insertion in model container [2022-11-25 16:46:34,809 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:46:33" (2/3) ... [2022-11-25 16:46:34,809 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e669867 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 04:46:34, skipping insertion in model container [2022-11-25 16:46:34,810 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 04:46:34" (3/3) ... [2022-11-25 16:46:34,811 INFO L112 eAbstractionObserver]: Analyzing ICFG mix031.oepc.i [2022-11-25 16:46:34,836 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 16:46:34,836 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2022-11-25 16:46:34,837 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-25 16:46:34,907 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-25 16:46:34,967 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 116 places, 111 transitions, 232 flow [2022-11-25 16:46:35,082 INFO L130 PetriNetUnfolder]: 2/109 cut-off events. [2022-11-25 16:46:35,083 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 16:46:35,088 INFO L83 FinitePrefix]: Finished finitePrefix Result has 116 conditions, 109 events. 2/109 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 68 event pairs, 0 based on Foata normal form. 0/100 useless extension candidates. Maximal degree in co-relation 64. Up to 2 conditions per place. [2022-11-25 16:46:35,089 INFO L82 GeneralOperation]: Start removeDead. Operand has 116 places, 111 transitions, 232 flow [2022-11-25 16:46:35,094 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 114 places, 109 transitions, 224 flow [2022-11-25 16:46:35,099 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-25 16:46:35,127 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 114 places, 109 transitions, 224 flow [2022-11-25 16:46:35,136 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 114 places, 109 transitions, 224 flow [2022-11-25 16:46:35,137 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 114 places, 109 transitions, 224 flow [2022-11-25 16:46:35,201 INFO L130 PetriNetUnfolder]: 2/109 cut-off events. [2022-11-25 16:46:35,201 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 16:46:35,204 INFO L83 FinitePrefix]: Finished finitePrefix Result has 116 conditions, 109 events. 2/109 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 68 event pairs, 0 based on Foata normal form. 0/100 useless extension candidates. Maximal degree in co-relation 64. Up to 2 conditions per place. [2022-11-25 16:46:35,207 INFO L119 LiptonReduction]: Number of co-enabled transitions 1652 [2022-11-25 16:46:41,419 INFO L134 LiptonReduction]: Checked pairs total: 4335 [2022-11-25 16:46:41,420 INFO L136 LiptonReduction]: Total number of compositions: 104 [2022-11-25 16:46:41,441 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 16:46:41,449 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;@3c2edeb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 16:46:41,450 INFO L358 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2022-11-25 16:46:41,452 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2022-11-25 16:46:41,452 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 16:46:41,452 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 16:46:41,453 INFO L209 CegarLoopForPetriNet]: trace histogram [1] [2022-11-25 16:46:41,454 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-11-25 16:46:41,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:46:41,461 INFO L85 PathProgramCache]: Analyzing trace with hash 481, now seen corresponding path program 1 times [2022-11-25 16:46:41,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:46:41,475 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144945918] [2022-11-25 16:46:41,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:46:41,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:46:41,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:46:41,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:46:41,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:46:41,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144945918] [2022-11-25 16:46:41,631 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144945918] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:46:41,631 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:46:41,632 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-25 16:46:41,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309861261] [2022-11-25 16:46:41,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:46:41,646 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-25 16:46:41,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:46:41,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-25 16:46:41,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-25 16:46:41,679 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 215 [2022-11-25 16:46:41,682 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 58 flow. Second operand has 2 states, 2 states have (on average 100.5) internal successors, (201), 2 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:46:41,682 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 16:46:41,683 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 215 [2022-11-25 16:46:41,684 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 16:46:41,923 INFO L130 PetriNetUnfolder]: 224/410 cut-off events. [2022-11-25 16:46:41,923 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-11-25 16:46:41,927 INFO L83 FinitePrefix]: Finished finitePrefix Result has 811 conditions, 410 events. 224/410 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1777 event pairs, 224 based on Foata normal form. 0/347 useless extension candidates. Maximal degree in co-relation 801. Up to 386 conditions per place. [2022-11-25 16:46:41,933 INFO L137 encePairwiseOnDemand]: 210/215 looper letters, 17 selfloop transitions, 0 changer transitions 0/21 dead transitions. [2022-11-25 16:46:41,934 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 21 transitions, 82 flow [2022-11-25 16:46:41,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 16:46:41,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-11-25 16:46:41,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 222 transitions. [2022-11-25 16:46:41,953 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5162790697674419 [2022-11-25 16:46:41,955 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 222 transitions. [2022-11-25 16:46:41,955 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 222 transitions. [2022-11-25 16:46:41,957 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 16:46:41,960 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 222 transitions. [2022-11-25 16:46:41,964 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 111.0) internal successors, (222), 2 states have internal predecessors, (222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:46:41,970 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 215.0) internal successors, (645), 3 states have internal predecessors, (645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:46:41,971 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 215.0) internal successors, (645), 3 states have internal predecessors, (645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:46:41,973 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 58 flow. Second operand 2 states and 222 transitions. [2022-11-25 16:46:41,975 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 21 transitions, 82 flow [2022-11-25 16:46:41,978 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 21 transitions, 80 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-25 16:46:41,980 INFO L231 Difference]: Finished difference. Result has 27 places, 21 transitions, 46 flow [2022-11-25 16:46:41,982 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=46, PETRI_PLACES=27, PETRI_TRANSITIONS=21} [2022-11-25 16:46:41,988 INFO L288 CegarLoopForPetriNet]: 32 programPoint places, -5 predicate places. [2022-11-25 16:46:41,988 INFO L495 AbstractCegarLoop]: Abstraction has has 27 places, 21 transitions, 46 flow [2022-11-25 16:46:41,989 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 100.5) internal successors, (201), 2 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:46:41,989 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 16:46:41,989 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-11-25 16:46:41,990 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-25 16:46:41,990 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-11-25 16:46:42,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:46:42,004 INFO L85 PathProgramCache]: Analyzing trace with hash 472421, now seen corresponding path program 1 times [2022-11-25 16:46:42,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:46:42,005 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545961607] [2022-11-25 16:46:42,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:46:42,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:46:42,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:46:42,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:46:42,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:46:42,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545961607] [2022-11-25 16:46:42,409 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545961607] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:46:42,409 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:46:42,409 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-25 16:46:42,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430798741] [2022-11-25 16:46:42,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:46:42,418 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 16:46:42,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:46:42,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 16:46:42,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 16:46:42,427 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 215 [2022-11-25 16:46:42,428 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 21 transitions, 46 flow. Second operand has 3 states, 3 states have (on average 100.0) internal successors, (300), 3 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:46:42,429 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 16:46:42,429 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 215 [2022-11-25 16:46:42,429 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 16:46:42,594 INFO L130 PetriNetUnfolder]: 173/371 cut-off events. [2022-11-25 16:46:42,595 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 16:46:42,596 INFO L83 FinitePrefix]: Finished finitePrefix Result has 686 conditions, 371 events. 173/371 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1776 event pairs, 20 based on Foata normal form. 0/350 useless extension candidates. Maximal degree in co-relation 683. Up to 250 conditions per place. [2022-11-25 16:46:42,599 INFO L137 encePairwiseOnDemand]: 212/215 looper letters, 23 selfloop transitions, 2 changer transitions 2/31 dead transitions. [2022-11-25 16:46:42,599 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 31 transitions, 122 flow [2022-11-25 16:46:42,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 16:46:42,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 16:46:42,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 325 transitions. [2022-11-25 16:46:42,609 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5038759689922481 [2022-11-25 16:46:42,610 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 325 transitions. [2022-11-25 16:46:42,610 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 325 transitions. [2022-11-25 16:46:42,613 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 16:46:42,613 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 325 transitions. [2022-11-25 16:46:42,615 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 108.33333333333333) internal successors, (325), 3 states have internal predecessors, (325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:46:42,619 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 215.0) internal successors, (860), 4 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-11-25 16:46:42,621 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 215.0) internal successors, (860), 4 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-11-25 16:46:42,621 INFO L175 Difference]: Start difference. First operand has 27 places, 21 transitions, 46 flow. Second operand 3 states and 325 transitions. [2022-11-25 16:46:42,622 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 31 transitions, 122 flow [2022-11-25 16:46:42,622 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 31 transitions, 122 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-25 16:46:42,624 INFO L231 Difference]: Finished difference. Result has 28 places, 19 transitions, 46 flow [2022-11-25 16:46:42,624 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=44, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=46, PETRI_PLACES=28, PETRI_TRANSITIONS=19} [2022-11-25 16:46:42,625 INFO L288 CegarLoopForPetriNet]: 32 programPoint places, -4 predicate places. [2022-11-25 16:46:42,626 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 19 transitions, 46 flow [2022-11-25 16:46:42,627 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 100.0) internal successors, (300), 3 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:46:42,627 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 16:46:42,628 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:46:42,628 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-25 16:46:42,629 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-11-25 16:46:42,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:46:42,633 INFO L85 PathProgramCache]: Analyzing trace with hash -1741843160, now seen corresponding path program 1 times [2022-11-25 16:46:42,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:46:42,633 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981857719] [2022-11-25 16:46:42,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:46:42,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:46:42,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:46:43,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:46:43,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:46:43,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981857719] [2022-11-25 16:46:43,017 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981857719] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:46:43,017 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:46:43,018 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-25 16:46:43,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136629827] [2022-11-25 16:46:43,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:46:43,019 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 16:46:43,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:46:43,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 16:46:43,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 16:46:43,037 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 215 [2022-11-25 16:46:43,038 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 19 transitions, 46 flow. Second operand has 3 states, 3 states have (on average 95.33333333333333) internal successors, (286), 3 states have internal predecessors, (286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:46:43,039 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 16:46:43,039 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 215 [2022-11-25 16:46:43,039 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 16:46:43,255 INFO L130 PetriNetUnfolder]: 287/544 cut-off events. [2022-11-25 16:46:43,255 INFO L131 PetriNetUnfolder]: For 33/33 co-relation queries the response was YES. [2022-11-25 16:46:43,257 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1105 conditions, 544 events. 287/544 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 2413 event pairs, 115 based on Foata normal form. 0/512 useless extension candidates. Maximal degree in co-relation 1101. Up to 409 conditions per place. [2022-11-25 16:46:43,261 INFO L137 encePairwiseOnDemand]: 208/215 looper letters, 27 selfloop transitions, 6 changer transitions 0/34 dead transitions. [2022-11-25 16:46:43,261 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 34 transitions, 146 flow [2022-11-25 16:46:43,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 16:46:43,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 16:46:43,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 313 transitions. [2022-11-25 16:46:43,263 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.48527131782945737 [2022-11-25 16:46:43,263 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 313 transitions. [2022-11-25 16:46:43,263 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 313 transitions. [2022-11-25 16:46:43,264 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 16:46:43,264 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 313 transitions. [2022-11-25 16:46:43,265 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 104.33333333333333) internal successors, (313), 3 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:46:43,267 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 215.0) internal successors, (860), 4 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-11-25 16:46:43,268 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 215.0) internal successors, (860), 4 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-11-25 16:46:43,268 INFO L175 Difference]: Start difference. First operand has 28 places, 19 transitions, 46 flow. Second operand 3 states and 313 transitions. [2022-11-25 16:46:43,268 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 34 transitions, 146 flow [2022-11-25 16:46:43,269 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 34 transitions, 140 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-25 16:46:43,270 INFO L231 Difference]: Finished difference. Result has 29 places, 24 transitions, 88 flow [2022-11-25 16:46:43,270 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=42, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=88, PETRI_PLACES=29, PETRI_TRANSITIONS=24} [2022-11-25 16:46:43,271 INFO L288 CegarLoopForPetriNet]: 32 programPoint places, -3 predicate places. [2022-11-25 16:46:43,272 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 24 transitions, 88 flow [2022-11-25 16:46:43,272 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 95.33333333333333) internal successors, (286), 3 states have internal predecessors, (286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:46:43,272 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 16:46:43,272 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:46:43,273 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-25 16:46:43,273 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-11-25 16:46:43,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:46:43,274 INFO L85 PathProgramCache]: Analyzing trace with hash 1837437292, now seen corresponding path program 1 times [2022-11-25 16:46:43,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:46:43,274 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622411455] [2022-11-25 16:46:43,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:46:43,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:46:43,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:46:43,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:46:43,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:46:43,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622411455] [2022-11-25 16:46:43,611 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622411455] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:46:43,611 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:46:43,611 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 16:46:43,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530931071] [2022-11-25 16:46:43,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:46:43,612 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 16:46:43,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:46:43,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 16:46:43,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 16:46:43,710 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 215 [2022-11-25 16:46:43,711 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 24 transitions, 88 flow. Second operand has 5 states, 5 states have (on average 90.6) internal successors, (453), 5 states have internal predecessors, (453), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:46:43,711 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 16:46:43,711 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 215 [2022-11-25 16:46:43,711 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 16:46:43,923 INFO L130 PetriNetUnfolder]: 220/423 cut-off events. [2022-11-25 16:46:43,923 INFO L131 PetriNetUnfolder]: For 111/120 co-relation queries the response was YES. [2022-11-25 16:46:43,924 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1030 conditions, 423 events. 220/423 cut-off events. For 111/120 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 1920 event pairs, 126 based on Foata normal form. 52/462 useless extension candidates. Maximal degree in co-relation 1025. Up to 254 conditions per place. [2022-11-25 16:46:43,927 INFO L137 encePairwiseOnDemand]: 211/215 looper letters, 15 selfloop transitions, 2 changer transitions 11/33 dead transitions. [2022-11-25 16:46:43,927 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 33 transitions, 162 flow [2022-11-25 16:46:43,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 16:46:43,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-25 16:46:43,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 471 transitions. [2022-11-25 16:46:43,930 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4381395348837209 [2022-11-25 16:46:43,930 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 471 transitions. [2022-11-25 16:46:43,930 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 471 transitions. [2022-11-25 16:46:43,930 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 16:46:43,931 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 471 transitions. [2022-11-25 16:46:43,932 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 94.2) internal successors, (471), 5 states have internal predecessors, (471), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:46:43,935 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 215.0) internal successors, (1290), 6 states have internal predecessors, (1290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:46:43,936 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 215.0) internal successors, (1290), 6 states have internal predecessors, (1290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:46:43,936 INFO L175 Difference]: Start difference. First operand has 29 places, 24 transitions, 88 flow. Second operand 5 states and 471 transitions. [2022-11-25 16:46:43,936 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 33 transitions, 162 flow [2022-11-25 16:46:43,939 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 33 transitions, 150 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-25 16:46:43,940 INFO L231 Difference]: Finished difference. Result has 30 places, 19 transitions, 62 flow [2022-11-25 16:46:43,941 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=62, PETRI_PLACES=30, PETRI_TRANSITIONS=19} [2022-11-25 16:46:43,941 INFO L288 CegarLoopForPetriNet]: 32 programPoint places, -2 predicate places. [2022-11-25 16:46:43,942 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 19 transitions, 62 flow [2022-11-25 16:46:43,942 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 90.6) internal successors, (453), 5 states have internal predecessors, (453), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:46:43,943 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 16:46:43,943 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:46:43,943 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-25 16:46:43,943 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-11-25 16:46:43,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:46:43,944 INFO L85 PathProgramCache]: Analyzing trace with hash 882696084, now seen corresponding path program 1 times [2022-11-25 16:46:43,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:46:43,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038395866] [2022-11-25 16:46:43,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:46:43,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:46:43,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:46:44,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:46:44,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:46:44,194 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038395866] [2022-11-25 16:46:44,194 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038395866] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:46:44,195 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:46:44,195 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 16:46:44,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83857448] [2022-11-25 16:46:44,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:46:44,196 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 16:46:44,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:46:44,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 16:46:44,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 16:46:44,225 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 215 [2022-11-25 16:46:44,226 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 19 transitions, 62 flow. Second operand has 4 states, 4 states have (on average 95.25) internal successors, (381), 4 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:46:44,226 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 16:46:44,226 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 215 [2022-11-25 16:46:44,226 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 16:46:44,363 INFO L130 PetriNetUnfolder]: 193/338 cut-off events. [2022-11-25 16:46:44,363 INFO L131 PetriNetUnfolder]: For 56/56 co-relation queries the response was YES. [2022-11-25 16:46:44,364 INFO L83 FinitePrefix]: Finished finitePrefix Result has 817 conditions, 338 events. 193/338 cut-off events. For 56/56 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1114 event pairs, 65 based on Foata normal form. 8/346 useless extension candidates. Maximal degree in co-relation 812. Up to 243 conditions per place. [2022-11-25 16:46:44,366 INFO L137 encePairwiseOnDemand]: 212/215 looper letters, 22 selfloop transitions, 3 changer transitions 0/25 dead transitions. [2022-11-25 16:46:44,366 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 25 transitions, 126 flow [2022-11-25 16:46:44,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 16:46:44,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 16:46:44,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 304 transitions. [2022-11-25 16:46:44,368 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.47131782945736433 [2022-11-25 16:46:44,368 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 304 transitions. [2022-11-25 16:46:44,369 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 304 transitions. [2022-11-25 16:46:44,369 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 16:46:44,369 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 304 transitions. [2022-11-25 16:46:44,371 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 101.33333333333333) internal successors, (304), 3 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:46:44,373 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 215.0) internal successors, (860), 4 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-11-25 16:46:44,374 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 215.0) internal successors, (860), 4 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-11-25 16:46:44,374 INFO L175 Difference]: Start difference. First operand has 30 places, 19 transitions, 62 flow. Second operand 3 states and 304 transitions. [2022-11-25 16:46:44,374 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 25 transitions, 126 flow [2022-11-25 16:46:44,376 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 25 transitions, 123 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-25 16:46:44,377 INFO L231 Difference]: Finished difference. Result has 29 places, 19 transitions, 70 flow [2022-11-25 16:46:44,377 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=59, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=70, PETRI_PLACES=29, PETRI_TRANSITIONS=19} [2022-11-25 16:46:44,380 INFO L288 CegarLoopForPetriNet]: 32 programPoint places, -3 predicate places. [2022-11-25 16:46:44,382 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 19 transitions, 70 flow [2022-11-25 16:46:44,383 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 95.25) internal successors, (381), 4 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:46:44,385 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 16:46:44,386 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:46:44,386 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-25 16:46:44,386 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-11-25 16:46:44,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:46:44,387 INFO L85 PathProgramCache]: Analyzing trace with hash 1124814864, now seen corresponding path program 1 times [2022-11-25 16:46:44,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:46:44,390 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386728960] [2022-11-25 16:46:44,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:46:44,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:46:44,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:46:44,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:46:44,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:46:44,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386728960] [2022-11-25 16:46:44,590 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386728960] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:46:44,590 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:46:44,590 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-25 16:46:44,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993286621] [2022-11-25 16:46:44,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:46:44,597 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 16:46:44,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:46:44,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 16:46:44,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 16:46:44,606 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 215 [2022-11-25 16:46:44,607 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 19 transitions, 70 flow. Second operand has 3 states, 3 states have (on average 100.66666666666667) internal successors, (302), 3 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:46:44,607 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 16:46:44,607 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 215 [2022-11-25 16:46:44,607 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 16:46:44,723 INFO L130 PetriNetUnfolder]: 142/271 cut-off events. [2022-11-25 16:46:44,724 INFO L131 PetriNetUnfolder]: For 86/92 co-relation queries the response was YES. [2022-11-25 16:46:44,725 INFO L83 FinitePrefix]: Finished finitePrefix Result has 661 conditions, 271 events. 142/271 cut-off events. For 86/92 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 971 event pairs, 79 based on Foata normal form. 8/272 useless extension candidates. Maximal degree in co-relation 655. Up to 178 conditions per place. [2022-11-25 16:46:44,727 INFO L137 encePairwiseOnDemand]: 212/215 looper letters, 21 selfloop transitions, 3 changer transitions 0/27 dead transitions. [2022-11-25 16:46:44,728 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 27 transitions, 139 flow [2022-11-25 16:46:44,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 16:46:44,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 16:46:44,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 318 transitions. [2022-11-25 16:46:44,730 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4930232558139535 [2022-11-25 16:46:44,731 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 318 transitions. [2022-11-25 16:46:44,731 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 318 transitions. [2022-11-25 16:46:44,731 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 16:46:44,732 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 318 transitions. [2022-11-25 16:46:44,733 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:46:44,736 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 215.0) internal successors, (860), 4 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-11-25 16:46:44,736 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 215.0) internal successors, (860), 4 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-11-25 16:46:44,737 INFO L175 Difference]: Start difference. First operand has 29 places, 19 transitions, 70 flow. Second operand 3 states and 318 transitions. [2022-11-25 16:46:44,737 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 27 transitions, 139 flow [2022-11-25 16:46:44,739 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 27 transitions, 133 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-25 16:46:44,740 INFO L231 Difference]: Finished difference. Result has 30 places, 19 transitions, 75 flow [2022-11-25 16:46:44,741 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=75, PETRI_PLACES=30, PETRI_TRANSITIONS=19} [2022-11-25 16:46:44,743 INFO L288 CegarLoopForPetriNet]: 32 programPoint places, -2 predicate places. [2022-11-25 16:46:44,744 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 19 transitions, 75 flow [2022-11-25 16:46:44,747 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 100.66666666666667) internal successors, (302), 3 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:46:44,747 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 16:46:44,747 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:46:44,747 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-25 16:46:44,748 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-11-25 16:46:44,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:46:44,748 INFO L85 PathProgramCache]: Analyzing trace with hash 2129426106, now seen corresponding path program 1 times [2022-11-25 16:46:44,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:46:44,749 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365226207] [2022-11-25 16:46:44,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:46:44,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:46:44,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:46:44,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:46:44,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:46:44,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365226207] [2022-11-25 16:46:44,993 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365226207] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:46:44,993 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:46:44,993 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 16:46:44,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856611762] [2022-11-25 16:46:44,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:46:44,994 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 16:46:44,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:46:44,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 16:46:44,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 16:46:45,016 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 215 [2022-11-25 16:46:45,017 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 19 transitions, 75 flow. Second operand has 4 states, 4 states have (on average 95.25) internal successors, (381), 4 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:46:45,017 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 16:46:45,017 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 215 [2022-11-25 16:46:45,017 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 16:46:45,215 INFO L130 PetriNetUnfolder]: 74/171 cut-off events. [2022-11-25 16:46:45,216 INFO L131 PetriNetUnfolder]: For 36/41 co-relation queries the response was YES. [2022-11-25 16:46:45,216 INFO L83 FinitePrefix]: Finished finitePrefix Result has 416 conditions, 171 events. 74/171 cut-off events. For 36/41 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 625 event pairs, 18 based on Foata normal form. 28/196 useless extension candidates. Maximal degree in co-relation 409. Up to 67 conditions per place. [2022-11-25 16:46:45,218 INFO L137 encePairwiseOnDemand]: 210/215 looper letters, 23 selfloop transitions, 4 changer transitions 11/43 dead transitions. [2022-11-25 16:46:45,218 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 43 transitions, 208 flow [2022-11-25 16:46:45,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 16:46:45,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-25 16:46:45,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 505 transitions. [2022-11-25 16:46:45,221 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4697674418604651 [2022-11-25 16:46:45,222 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 505 transitions. [2022-11-25 16:46:45,222 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 505 transitions. [2022-11-25 16:46:45,222 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 16:46:45,223 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 505 transitions. [2022-11-25 16:46:45,224 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 101.0) internal successors, (505), 5 states have internal predecessors, (505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:46:45,227 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 215.0) internal successors, (1290), 6 states have internal predecessors, (1290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:46:45,228 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 215.0) internal successors, (1290), 6 states have internal predecessors, (1290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:46:45,228 INFO L175 Difference]: Start difference. First operand has 30 places, 19 transitions, 75 flow. Second operand 5 states and 505 transitions. [2022-11-25 16:46:45,228 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 43 transitions, 208 flow [2022-11-25 16:46:45,231 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 43 transitions, 202 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-25 16:46:45,233 INFO L231 Difference]: Finished difference. Result has 35 places, 22 transitions, 102 flow [2022-11-25 16:46:45,234 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=69, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=102, PETRI_PLACES=35, PETRI_TRANSITIONS=22} [2022-11-25 16:46:45,237 INFO L288 CegarLoopForPetriNet]: 32 programPoint places, 3 predicate places. [2022-11-25 16:46:45,237 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 22 transitions, 102 flow [2022-11-25 16:46:45,238 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 95.25) internal successors, (381), 4 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:46:45,238 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 16:46:45,238 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:46:45,238 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-25 16:46:45,239 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-11-25 16:46:45,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:46:45,240 INFO L85 PathProgramCache]: Analyzing trace with hash -1482252137, now seen corresponding path program 1 times [2022-11-25 16:46:45,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:46:45,241 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108916182] [2022-11-25 16:46:45,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:46:45,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:46:45,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:46:45,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:46:45,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:46:45,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108916182] [2022-11-25 16:46:45,593 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108916182] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:46:45,593 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:46:45,593 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 16:46:45,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128674905] [2022-11-25 16:46:45,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:46:45,594 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 16:46:45,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:46:45,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 16:46:45,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-25 16:46:45,615 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 215 [2022-11-25 16:46:45,616 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 22 transitions, 102 flow. Second operand has 5 states, 5 states have (on average 95.2) internal successors, (476), 5 states have internal predecessors, (476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:46:45,616 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 16:46:45,616 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 215 [2022-11-25 16:46:45,616 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 16:46:45,788 INFO L130 PetriNetUnfolder]: 51/123 cut-off events. [2022-11-25 16:46:45,789 INFO L131 PetriNetUnfolder]: For 70/72 co-relation queries the response was YES. [2022-11-25 16:46:45,790 INFO L83 FinitePrefix]: Finished finitePrefix Result has 370 conditions, 123 events. 51/123 cut-off events. For 70/72 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 430 event pairs, 13 based on Foata normal form. 10/130 useless extension candidates. Maximal degree in co-relation 360. Up to 42 conditions per place. [2022-11-25 16:46:45,791 INFO L137 encePairwiseOnDemand]: 210/215 looper letters, 24 selfloop transitions, 7 changer transitions 6/42 dead transitions. [2022-11-25 16:46:45,791 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 42 transitions, 235 flow [2022-11-25 16:46:45,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 16:46:45,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-25 16:46:45,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 690 transitions. [2022-11-25 16:46:45,794 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4584717607973422 [2022-11-25 16:46:45,795 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 690 transitions. [2022-11-25 16:46:45,795 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 690 transitions. [2022-11-25 16:46:45,795 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 16:46:45,796 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 690 transitions. [2022-11-25 16:46:45,798 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 98.57142857142857) internal successors, (690), 7 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-11-25 16:46:45,801 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 215.0) internal successors, (1720), 8 states have internal predecessors, (1720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:46:45,802 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 215.0) internal successors, (1720), 8 states have internal predecessors, (1720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:46:45,802 INFO L175 Difference]: Start difference. First operand has 35 places, 22 transitions, 102 flow. Second operand 7 states and 690 transitions. [2022-11-25 16:46:45,802 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 42 transitions, 235 flow [2022-11-25 16:46:45,804 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 42 transitions, 218 flow, removed 4 selfloop flow, removed 4 redundant places. [2022-11-25 16:46:45,805 INFO L231 Difference]: Finished difference. Result has 39 places, 23 transitions, 115 flow [2022-11-25 16:46:45,805 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=85, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=115, PETRI_PLACES=39, PETRI_TRANSITIONS=23} [2022-11-25 16:46:45,806 INFO L288 CegarLoopForPetriNet]: 32 programPoint places, 7 predicate places. [2022-11-25 16:46:45,806 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 23 transitions, 115 flow [2022-11-25 16:46:45,807 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 95.2) internal successors, (476), 5 states have internal predecessors, (476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:46:45,807 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 16:46:45,807 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:46:45,808 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-25 16:46:45,808 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-11-25 16:46:45,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:46:45,809 INFO L85 PathProgramCache]: Analyzing trace with hash -2027481149, now seen corresponding path program 1 times [2022-11-25 16:46:45,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:46:45,809 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408219004] [2022-11-25 16:46:45,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:46:45,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:46:45,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:46:46,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:46:46,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:46:46,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408219004] [2022-11-25 16:46:46,840 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408219004] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:46:46,841 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:46:46,841 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 16:46:46,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026218434] [2022-11-25 16:46:46,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:46:46,842 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 16:46:46,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:46:46,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 16:46:46,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 16:46:46,873 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 215 [2022-11-25 16:46:46,874 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 23 transitions, 115 flow. Second operand has 5 states, 5 states have (on average 97.8) internal successors, (489), 5 states have internal predecessors, (489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:46:46,875 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 16:46:46,875 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 215 [2022-11-25 16:46:46,875 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 16:46:47,114 INFO L130 PetriNetUnfolder]: 69/193 cut-off events. [2022-11-25 16:46:47,114 INFO L131 PetriNetUnfolder]: For 262/264 co-relation queries the response was YES. [2022-11-25 16:46:47,115 INFO L83 FinitePrefix]: Finished finitePrefix Result has 614 conditions, 193 events. 69/193 cut-off events. For 262/264 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 824 event pairs, 21 based on Foata normal form. 1/194 useless extension candidates. Maximal degree in co-relation 604. Up to 75 conditions per place. [2022-11-25 16:46:47,116 INFO L137 encePairwiseOnDemand]: 209/215 looper letters, 27 selfloop transitions, 6 changer transitions 19/57 dead transitions. [2022-11-25 16:46:47,117 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 57 transitions, 423 flow [2022-11-25 16:46:47,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 16:46:47,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-25 16:46:47,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 609 transitions. [2022-11-25 16:46:47,120 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4720930232558139 [2022-11-25 16:46:47,120 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 609 transitions. [2022-11-25 16:46:47,121 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 609 transitions. [2022-11-25 16:46:47,121 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 16:46:47,121 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 609 transitions. [2022-11-25 16:46:47,123 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 101.5) internal successors, (609), 6 states have internal predecessors, (609), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:46:47,126 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 215.0) internal successors, (1505), 7 states have internal predecessors, (1505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:46:47,127 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 215.0) internal successors, (1505), 7 states have internal predecessors, (1505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:46:47,127 INFO L175 Difference]: Start difference. First operand has 39 places, 23 transitions, 115 flow. Second operand 6 states and 609 transitions. [2022-11-25 16:46:47,128 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 57 transitions, 423 flow [2022-11-25 16:46:47,132 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 57 transitions, 362 flow, removed 20 selfloop flow, removed 3 redundant places. [2022-11-25 16:46:47,133 INFO L231 Difference]: Finished difference. Result has 43 places, 28 transitions, 143 flow [2022-11-25 16:46:47,133 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=143, PETRI_PLACES=43, PETRI_TRANSITIONS=28} [2022-11-25 16:46:47,134 INFO L288 CegarLoopForPetriNet]: 32 programPoint places, 11 predicate places. [2022-11-25 16:46:47,135 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 28 transitions, 143 flow [2022-11-25 16:46:47,137 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 97.8) internal successors, (489), 5 states have internal predecessors, (489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:46:47,138 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 16:46:47,138 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:46:47,138 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-25 16:46:47,140 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-11-25 16:46:47,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:46:47,141 INFO L85 PathProgramCache]: Analyzing trace with hash 1021190003, now seen corresponding path program 2 times [2022-11-25 16:46:47,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:46:47,144 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670145786] [2022-11-25 16:46:47,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:46:47,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:46:47,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:46:47,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:46:47,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:46:47,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670145786] [2022-11-25 16:46:47,435 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670145786] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:46:47,435 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:46:47,436 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 16:46:47,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924686071] [2022-11-25 16:46:47,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:46:47,437 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 16:46:47,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:46:47,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 16:46:47,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-25 16:46:47,470 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 215 [2022-11-25 16:46:47,471 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 28 transitions, 143 flow. Second operand has 5 states, 5 states have (on average 94.4) internal successors, (472), 5 states have internal predecessors, (472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:46:47,471 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 16:46:47,471 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 215 [2022-11-25 16:46:47,472 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 16:46:47,695 INFO L130 PetriNetUnfolder]: 118/266 cut-off events. [2022-11-25 16:46:47,695 INFO L131 PetriNetUnfolder]: For 314/314 co-relation queries the response was YES. [2022-11-25 16:46:47,697 INFO L83 FinitePrefix]: Finished finitePrefix Result has 992 conditions, 266 events. 118/266 cut-off events. For 314/314 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1101 event pairs, 13 based on Foata normal form. 1/267 useless extension candidates. Maximal degree in co-relation 980. Up to 127 conditions per place. [2022-11-25 16:46:47,698 INFO L137 encePairwiseOnDemand]: 209/215 looper letters, 18 selfloop transitions, 3 changer transitions 34/55 dead transitions. [2022-11-25 16:46:47,698 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 55 transitions, 396 flow [2022-11-25 16:46:47,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 16:46:47,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-25 16:46:47,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 586 transitions. [2022-11-25 16:46:47,701 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4542635658914729 [2022-11-25 16:46:47,701 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 586 transitions. [2022-11-25 16:46:47,702 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 586 transitions. [2022-11-25 16:46:47,702 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 16:46:47,703 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 586 transitions. [2022-11-25 16:46:47,704 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 97.66666666666667) internal successors, (586), 6 states have internal predecessors, (586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:46:47,707 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 215.0) internal successors, (1505), 7 states have internal predecessors, (1505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:46:47,708 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 215.0) internal successors, (1505), 7 states have internal predecessors, (1505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:46:47,709 INFO L175 Difference]: Start difference. First operand has 43 places, 28 transitions, 143 flow. Second operand 6 states and 586 transitions. [2022-11-25 16:46:47,709 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 55 transitions, 396 flow [2022-11-25 16:46:47,713 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 55 transitions, 394 flow, removed 1 selfloop flow, removed 1 redundant places. [2022-11-25 16:46:47,714 INFO L231 Difference]: Finished difference. Result has 47 places, 19 transitions, 98 flow [2022-11-25 16:46:47,715 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=141, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=98, PETRI_PLACES=47, PETRI_TRANSITIONS=19} [2022-11-25 16:46:47,716 INFO L288 CegarLoopForPetriNet]: 32 programPoint places, 15 predicate places. [2022-11-25 16:46:47,717 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 19 transitions, 98 flow [2022-11-25 16:46:47,717 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 94.4) internal successors, (472), 5 states have internal predecessors, (472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:46:47,717 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 16:46:47,718 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:46:47,718 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-25 16:46:47,718 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-11-25 16:46:47,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:46:47,719 INFO L85 PathProgramCache]: Analyzing trace with hash -753341489, now seen corresponding path program 3 times [2022-11-25 16:46:47,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:46:47,719 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654367752] [2022-11-25 16:46:47,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:46:47,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:46:47,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 16:46:47,818 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 16:46:47,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 16:46:47,927 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 16:46:47,928 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-11-25 16:46:47,929 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK (9 of 10 remaining) [2022-11-25 16:46:47,931 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (8 of 10 remaining) [2022-11-25 16:46:47,932 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 10 remaining) [2022-11-25 16:46:47,932 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 10 remaining) [2022-11-25 16:46:47,933 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 10 remaining) [2022-11-25 16:46:47,933 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 10 remaining) [2022-11-25 16:46:47,934 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK (3 of 10 remaining) [2022-11-25 16:46:47,934 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 10 remaining) [2022-11-25 16:46:47,934 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 10 remaining) [2022-11-25 16:46:47,935 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 10 remaining) [2022-11-25 16:46:47,935 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-25 16:46:47,935 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:46:47,943 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-25 16:46:47,943 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-25 16:46:48,056 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 04:46:48 BasicIcfg [2022-11-25 16:46:48,058 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-25 16:46:48,058 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-25 16:46:48,059 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-25 16:46:48,059 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-25 16:46:48,059 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 04:46:34" (3/4) ... [2022-11-25 16:46:48,063 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-25 16:46:48,063 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-25 16:46:48,063 INFO L158 Benchmark]: Toolchain (without parser) took 15391.29ms. Allocated memory was 211.8MB in the beginning and 308.3MB in the end (delta: 96.5MB). Free memory was 178.0MB in the beginning and 225.7MB in the end (delta: -47.6MB). Peak memory consumption was 49.5MB. Max. memory is 16.1GB. [2022-11-25 16:46:48,064 INFO L158 Benchmark]: CDTParser took 0.37ms. Allocated memory is still 148.9MB. Free memory was 95.3MB in the beginning and 95.2MB in the end (delta: 168.0kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 16:46:48,064 INFO L158 Benchmark]: CACSL2BoogieTranslator took 947.77ms. Allocated memory is still 211.8MB. Free memory was 177.3MB in the beginning and 152.2MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2022-11-25 16:46:48,065 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.49ms. Allocated memory is still 211.8MB. Free memory was 151.5MB in the beginning and 149.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 16:46:48,065 INFO L158 Benchmark]: Boogie Preprocessor took 41.34ms. Allocated memory is still 211.8MB. Free memory was 149.4MB in the beginning and 147.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 16:46:48,065 INFO L158 Benchmark]: RCFGBuilder took 1074.34ms. Allocated memory is still 211.8MB. Free memory was 147.3MB in the beginning and 115.8MB in the end (delta: 31.5MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2022-11-25 16:46:48,066 INFO L158 Benchmark]: TraceAbstraction took 13255.07ms. Allocated memory was 211.8MB in the beginning and 308.3MB in the end (delta: 96.5MB). Free memory was 115.1MB in the beginning and 226.7MB in the end (delta: -111.6MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 16:46:48,067 INFO L158 Benchmark]: Witness Printer took 4.57ms. Allocated memory is still 308.3MB. Free memory was 226.7MB in the beginning and 225.7MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 16:46:48,069 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.37ms. Allocated memory is still 148.9MB. Free memory was 95.3MB in the beginning and 95.2MB in the end (delta: 168.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 947.77ms. Allocated memory is still 211.8MB. Free memory was 177.3MB in the beginning and 152.2MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 58.49ms. Allocated memory is still 211.8MB. Free memory was 151.5MB in the beginning and 149.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 41.34ms. Allocated memory is still 211.8MB. Free memory was 149.4MB in the beginning and 147.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1074.34ms. Allocated memory is still 211.8MB. Free memory was 147.3MB in the beginning and 115.8MB in the end (delta: 31.5MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * TraceAbstraction took 13255.07ms. Allocated memory was 211.8MB in the beginning and 308.3MB in the end (delta: 96.5MB). Free memory was 115.1MB in the beginning and 226.7MB in the end (delta: -111.6MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 4.57ms. Allocated memory is still 308.3MB. Free memory was 226.7MB in the beginning and 225.7MB 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: 6.3s, 114 PlacesBefore, 32 PlacesAfterwards, 109 TransitionsBefore, 26 TransitionsAfterwards, 1652 CoEnabledTransitionPairs, 7 FixpointIterations, 47 TrivialSequentialCompositions, 49 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 1 ChoiceCompositions, 104 TotalNumberOfCompositions, 4335 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2123, independent: 1960, independent conditional: 0, independent unconditional: 1960, dependent: 163, dependent conditional: 0, dependent unconditional: 163, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1226, independent: 1175, independent conditional: 0, independent unconditional: 1175, dependent: 51, dependent conditional: 0, dependent unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1226, independent: 1162, independent conditional: 0, independent unconditional: 1162, dependent: 64, dependent conditional: 0, dependent unconditional: 64, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 64, independent: 13, independent conditional: 0, independent unconditional: 13, dependent: 51, dependent conditional: 0, dependent unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 482, independent: 23, independent conditional: 0, independent unconditional: 23, dependent: 459, dependent conditional: 0, dependent unconditional: 459, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2123, independent: 785, independent conditional: 0, independent unconditional: 785, dependent: 112, dependent conditional: 0, dependent unconditional: 112, unknown: 1226, unknown conditional: 0, unknown unconditional: 1226] , Statistics on independence cache: Total cache size (in pairs): 121, Positive cache size: 103, Positive conditional cache size: 0, Positive unconditional cache size: 103, Negative cache size: 18, Negative conditional cache size: 0, Negative unconditional cache size: 18, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L708] 0 int __unbuffered_cnt = 0; [L710] 0 int __unbuffered_p0_EAX = 0; [L712] 0 int __unbuffered_p0_EBX = 0; [L714] 0 int __unbuffered_p1_EAX = 0; [L716] 0 int __unbuffered_p1_EBX = 0; [L718] 0 int a = 0; [L719] 0 _Bool a$flush_delayed; [L720] 0 int a$mem_tmp; [L721] 0 _Bool a$r_buff0_thd0; [L722] 0 _Bool a$r_buff0_thd1; [L723] 0 _Bool a$r_buff0_thd2; [L724] 0 _Bool a$r_buff1_thd0; [L725] 0 _Bool a$r_buff1_thd1; [L726] 0 _Bool a$r_buff1_thd2; [L727] 0 _Bool a$read_delayed; [L728] 0 int *a$read_delayed_var; [L729] 0 int a$w_buff0; [L730] 0 _Bool a$w_buff0_used; [L731] 0 int a$w_buff1; [L732] 0 _Bool a$w_buff1_used; [L733] 0 _Bool main$tmp_guard0; [L734] 0 _Bool main$tmp_guard1; [L736] 0 int x = 0; [L738] 0 int y = 0; [L740] 0 int z = 0; [L741] 0 _Bool weak$$choice0; [L742] 0 _Bool weak$$choice2; [L827] 0 pthread_t t833; [L828] FCALL, FORK 0 pthread_create(&t833, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t833, ((void *)0), P0, ((void *)0))=-2, t833={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L746] 1 a$w_buff1 = a$w_buff0 [L747] 1 a$w_buff0 = 1 [L748] 1 a$w_buff1_used = a$w_buff0_used [L749] 1 a$w_buff0_used = (_Bool)1 [L750] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L750] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L751] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L752] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L753] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L754] 1 a$r_buff0_thd1 = (_Bool)1 [L757] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L829] 0 pthread_t t834; [L830] FCALL, FORK 0 pthread_create(&t834, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t834, ((void *)0), P1, ((void *)0))=-1, t833={5:0}, t834={3:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L760] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L763] 1 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L780] 2 y = 1 [L783] 2 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L786] 2 __unbuffered_p1_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L789] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L790] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L791] 2 a$flush_delayed = weak$$choice2 [L792] 2 a$mem_tmp = a [L793] 2 a = !a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff1) [L794] 2 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff0)) [L795] 2 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff1 : a$w_buff1)) [L796] 2 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used)) [L797] 2 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L798] 2 a$r_buff0_thd2 = weak$$choice2 ? a$r_buff0_thd2 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$r_buff0_thd2 : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2)) [L799] 2 a$r_buff1_thd2 = weak$$choice2 ? a$r_buff1_thd2 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$r_buff1_thd2 : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L800] 2 __unbuffered_p1_EBX = a [L801] 2 a = a$flush_delayed ? a$mem_tmp : a [L802] 2 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=1, z=1] [L805] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L806] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L807] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L808] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L809] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=1, z=1] [L812] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L814] 2 return 0; [L766] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L767] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L768] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L769] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L770] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=1, z=1] [L773] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L775] 1 return 0; [L832] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L834] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L834] RET 0 assume_abort_if_not(main$tmp_guard0) [L836] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L837] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L838] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L839] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L840] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t833={5:0}, t834={3:0}, weak$$choice0=49, weak$$choice2=255, x=1, y=1, z=1] [L843] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) [L845] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=1, z=1] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 825]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 830]: 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: 828]: 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 5 procedures, 133 locations, 10 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: 13.0s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 2.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 281 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 199 mSDsluCounter, 79 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 61 mSDsCounter, 40 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 679 IncrementalHoareTripleChecker+Invalid, 719 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 40 mSolverCounterUnsat, 18 mSDtfsCounter, 679 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 29 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=143occurred in iteration=9, InterpolantAutomatonStates: 43, 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.4s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 113 NumberOfCodeBlocks, 113 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 86 ConstructedInterpolants, 0 QuantifiedInterpolants, 633 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-11-25 16:46:48,113 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03b508e4-fc93-41c2-8a03-e71be20a7886/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03b508e4-fc93-41c2-8a03-e71be20a7886/bin/uautomizer-ZsLfNo2U6R/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03b508e4-fc93-41c2-8a03-e71be20a7886/bin/uautomizer-ZsLfNo2U6R/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03b508e4-fc93-41c2-8a03-e71be20a7886/bin/uautomizer-ZsLfNo2U6R/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03b508e4-fc93-41c2-8a03-e71be20a7886/bin/uautomizer-ZsLfNo2U6R/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix031.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03b508e4-fc93-41c2-8a03-e71be20a7886/bin/uautomizer-ZsLfNo2U6R/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03b508e4-fc93-41c2-8a03-e71be20a7886/bin/uautomizer-ZsLfNo2U6R --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c5191c614040da54c6fe77b0fb4d91d943009a345a9252a69568f58113a0aaaf --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-38b53e6 [2022-11-25 16:46:51,001 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 16:46:51,004 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 16:46:51,041 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 16:46:51,044 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 16:46:51,046 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 16:46:51,050 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 16:46:51,056 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 16:46:51,061 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 16:46:51,063 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 16:46:51,065 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 16:46:51,068 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 16:46:51,071 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 16:46:51,074 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 16:46:51,076 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 16:46:51,080 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 16:46:51,082 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 16:46:51,089 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 16:46:51,091 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 16:46:51,094 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 16:46:51,100 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 16:46:51,106 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 16:46:51,107 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 16:46:51,111 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 16:46:51,115 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 16:46:51,121 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 16:46:51,122 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 16:46:51,123 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 16:46:51,125 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 16:46:51,127 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 16:46:51,128 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 16:46:51,129 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 16:46:51,133 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 16:46:51,135 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 16:46:51,139 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 16:46:51,140 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 16:46:51,141 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 16:46:51,142 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 16:46:51,142 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 16:46:51,144 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 16:46:51,144 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 16:46:51,146 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03b508e4-fc93-41c2-8a03-e71be20a7886/bin/uautomizer-ZsLfNo2U6R/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-11-25 16:46:51,193 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 16:46:51,194 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 16:46:51,196 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 16:46:51,196 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 16:46:51,197 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 16:46:51,198 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 16:46:51,199 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 16:46:51,199 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 16:46:51,199 INFO L138 SettingsManager]: * Use SBE=true [2022-11-25 16:46:51,200 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 16:46:51,201 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 16:46:51,202 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-25 16:46:51,202 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 16:46:51,202 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 16:46:51,203 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 16:46:51,203 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-25 16:46:51,203 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-25 16:46:51,204 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-25 16:46:51,204 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 16:46:51,204 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-25 16:46:51,205 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-25 16:46:51,205 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-25 16:46:51,205 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 16:46:51,206 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 16:46:51,206 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 16:46:51,206 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-25 16:46:51,207 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 16:46:51,207 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 16:46:51,208 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 16:46:51,208 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 16:46:51,208 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-11-25 16:46:51,209 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-25 16:46:51,209 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-25 16:46:51,210 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-25 16:46:51,210 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-25 16:46:51,210 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2022-11-25 16:46:51,211 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_03b508e4-fc93-41c2-8a03-e71be20a7886/bin/uautomizer-ZsLfNo2U6R/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03b508e4-fc93-41c2-8a03-e71be20a7886/bin/uautomizer-ZsLfNo2U6R Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c5191c614040da54c6fe77b0fb4d91d943009a345a9252a69568f58113a0aaaf [2022-11-25 16:46:51,658 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 16:46:51,696 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 16:46:51,701 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 16:46:51,703 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 16:46:51,703 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 16:46:51,705 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03b508e4-fc93-41c2-8a03-e71be20a7886/bin/uautomizer-ZsLfNo2U6R/../../sv-benchmarks/c/pthread-wmm/mix031.oepc.i [2022-11-25 16:46:55,205 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 16:46:55,594 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 16:46:55,595 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03b508e4-fc93-41c2-8a03-e71be20a7886/sv-benchmarks/c/pthread-wmm/mix031.oepc.i [2022-11-25 16:46:55,610 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03b508e4-fc93-41c2-8a03-e71be20a7886/bin/uautomizer-ZsLfNo2U6R/data/102b6a382/b34d1882138a4c0a94dcc031a60b5b3d/FLAGece9ffc26 [2022-11-25 16:46:55,642 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03b508e4-fc93-41c2-8a03-e71be20a7886/bin/uautomizer-ZsLfNo2U6R/data/102b6a382/b34d1882138a4c0a94dcc031a60b5b3d [2022-11-25 16:46:55,649 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 16:46:55,654 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 16:46:55,658 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 16:46:55,658 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 16:46:55,663 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 16:46:55,664 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 04:46:55" (1/1) ... [2022-11-25 16:46:55,666 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7de66523 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:46:55, skipping insertion in model container [2022-11-25 16:46:55,667 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 04:46:55" (1/1) ... [2022-11-25 16:46:55,676 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 16:46:55,727 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 16:46:56,019 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_03b508e4-fc93-41c2-8a03-e71be20a7886/sv-benchmarks/c/pthread-wmm/mix031.oepc.i[945,958] [2022-11-25 16:46:56,373 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:46:56,380 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:46:56,380 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:46:56,381 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:46:56,381 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:46:56,382 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:46:56,382 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:46:56,383 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:46:56,383 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:46:56,395 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:46:56,395 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:46:56,397 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:46:56,398 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:46:56,401 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:46:56,401 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:46:56,402 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:46:56,403 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:46:56,404 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:46:56,405 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:46:56,435 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:46:56,436 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:46:56,439 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:46:56,440 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:46:56,440 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:46:56,447 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:46:56,448 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:46:56,448 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:46:56,451 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:46:56,452 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:46:56,453 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:46:56,454 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 16:46:56,484 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 16:46:56,503 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_03b508e4-fc93-41c2-8a03-e71be20a7886/sv-benchmarks/c/pthread-wmm/mix031.oepc.i[945,958] [2022-11-25 16:46:56,563 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:46:56,576 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:46:56,577 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:46:56,577 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:46:56,578 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:46:56,580 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:46:56,580 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:46:56,581 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:46:56,581 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:46:56,583 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:46:56,587 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:46:56,588 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:46:56,590 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:46:56,592 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:46:56,593 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:46:56,593 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:46:56,594 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:46:56,595 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:46:56,596 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:46:56,601 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:46:56,604 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:46:56,606 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:46:56,610 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:46:56,611 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:46:56,615 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:46:56,616 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:46:56,616 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:46:56,618 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:46:56,619 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:46:56,620 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:46:56,621 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 16:46:56,674 INFO L208 MainTranslator]: Completed translation [2022-11-25 16:46:56,675 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:46:56 WrapperNode [2022-11-25 16:46:56,676 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 16:46:56,678 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 16:46:56,678 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 16:46:56,680 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 16:46:56,689 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:46:56" (1/1) ... [2022-11-25 16:46:56,717 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:46:56" (1/1) ... [2022-11-25 16:46:56,771 INFO L138 Inliner]: procedures = 178, calls = 49, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 124 [2022-11-25 16:46:56,772 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 16:46:56,773 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 16:46:56,774 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 16:46:56,774 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 16:46:56,786 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:46:56" (1/1) ... [2022-11-25 16:46:56,787 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:46:56" (1/1) ... [2022-11-25 16:46:56,809 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:46:56" (1/1) ... [2022-11-25 16:46:56,809 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:46:56" (1/1) ... [2022-11-25 16:46:56,820 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:46:56" (1/1) ... [2022-11-25 16:46:56,836 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:46:56" (1/1) ... [2022-11-25 16:46:56,839 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:46:56" (1/1) ... [2022-11-25 16:46:56,845 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:46:56" (1/1) ... [2022-11-25 16:46:56,849 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 16:46:56,850 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 16:46:56,851 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 16:46:56,851 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 16:46:56,852 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:46:56" (1/1) ... [2022-11-25 16:46:56,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 16:46:56,882 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03b508e4-fc93-41c2-8a03-e71be20a7886/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:46:56,900 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03b508e4-fc93-41c2-8a03-e71be20a7886/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 16:46:56,914 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03b508e4-fc93-41c2-8a03-e71be20a7886/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 16:46:56,958 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-25 16:46:56,958 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 16:46:56,959 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-25 16:46:56,959 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-25 16:46:56,959 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-11-25 16:46:56,959 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-25 16:46:56,960 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-25 16:46:56,960 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-25 16:46:56,960 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-25 16:46:56,960 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-25 16:46:56,960 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-25 16:46:56,961 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 16:46:56,961 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 16:46:56,963 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-25 16:46:57,196 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 16:46:57,199 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 16:46:57,602 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 16:46:57,773 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 16:46:57,773 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-25 16:46:57,777 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 04:46:57 BoogieIcfgContainer [2022-11-25 16:46:57,777 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 16:46:57,780 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 16:46:57,780 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 16:46:57,786 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 16:46:57,790 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 04:46:55" (1/3) ... [2022-11-25 16:46:57,792 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66e62936 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 04:46:57, skipping insertion in model container [2022-11-25 16:46:57,792 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:46:56" (2/3) ... [2022-11-25 16:46:57,793 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66e62936 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 04:46:57, skipping insertion in model container [2022-11-25 16:46:57,794 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 04:46:57" (3/3) ... [2022-11-25 16:46:57,796 INFO L112 eAbstractionObserver]: Analyzing ICFG mix031.oepc.i [2022-11-25 16:46:57,836 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 16:46:57,837 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2022-11-25 16:46:57,838 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-25 16:46:57,953 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-25 16:46:58,016 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 117 places, 112 transitions, 234 flow [2022-11-25 16:46:58,076 INFO L130 PetriNetUnfolder]: 2/110 cut-off events. [2022-11-25 16:46:58,077 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 16:46:58,083 INFO L83 FinitePrefix]: Finished finitePrefix Result has 117 conditions, 110 events. 2/110 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 65 event pairs, 0 based on Foata normal form. 0/101 useless extension candidates. Maximal degree in co-relation 64. Up to 2 conditions per place. [2022-11-25 16:46:58,083 INFO L82 GeneralOperation]: Start removeDead. Operand has 117 places, 112 transitions, 234 flow [2022-11-25 16:46:58,088 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 115 places, 110 transitions, 226 flow [2022-11-25 16:46:58,093 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-25 16:46:58,111 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 115 places, 110 transitions, 226 flow [2022-11-25 16:46:58,114 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 115 places, 110 transitions, 226 flow [2022-11-25 16:46:58,115 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 115 places, 110 transitions, 226 flow [2022-11-25 16:46:58,176 INFO L130 PetriNetUnfolder]: 2/110 cut-off events. [2022-11-25 16:46:58,176 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 16:46:58,179 INFO L83 FinitePrefix]: Finished finitePrefix Result has 117 conditions, 110 events. 2/110 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 65 event pairs, 0 based on Foata normal form. 0/101 useless extension candidates. Maximal degree in co-relation 64. Up to 2 conditions per place. [2022-11-25 16:46:58,182 INFO L119 LiptonReduction]: Number of co-enabled transitions 1652 [2022-11-25 16:47:07,999 INFO L134 LiptonReduction]: Checked pairs total: 4227 [2022-11-25 16:47:07,999 INFO L136 LiptonReduction]: Total number of compositions: 105 [2022-11-25 16:47:08,037 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 16:47:08,049 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;@23d6e3db, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 16:47:08,050 INFO L358 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2022-11-25 16:47:08,064 INFO L130 PetriNetUnfolder]: 0/1 cut-off events. [2022-11-25 16:47:08,065 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 16:47:08,065 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 16:47:08,066 INFO L209 CegarLoopForPetriNet]: trace histogram [1] [2022-11-25 16:47:08,066 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-11-25 16:47:08,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:47:08,075 INFO L85 PathProgramCache]: Analyzing trace with hash 485, now seen corresponding path program 1 times [2022-11-25 16:47:08,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 16:47:08,092 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1242953715] [2022-11-25 16:47:08,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:47:08,100 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 16:47:08,101 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03b508e4-fc93-41c2-8a03-e71be20a7886/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 16:47:08,111 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03b508e4-fc93-41c2-8a03-e71be20a7886/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 16:47:08,126 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03b508e4-fc93-41c2-8a03-e71be20a7886/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-11-25 16:47:08,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:47:08,231 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2022-11-25 16:47:08,236 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 16:47:08,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:47:08,256 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 16:47:08,257 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 16:47:08,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1242953715] [2022-11-25 16:47:08,258 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1242953715] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:47:08,258 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:47:08,259 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-25 16:47:08,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631171761] [2022-11-25 16:47:08,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:47:08,271 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-25 16:47:08,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 16:47:08,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-25 16:47:08,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-25 16:47:08,315 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 217 [2022-11-25 16:47:08,319 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 58 flow. Second operand has 2 states, 2 states have (on average 101.5) internal successors, (203), 2 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:47:08,319 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 16:47:08,320 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 217 [2022-11-25 16:47:08,321 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 16:47:08,709 INFO L130 PetriNetUnfolder]: 264/462 cut-off events. [2022-11-25 16:47:08,709 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-11-25 16:47:08,713 INFO L83 FinitePrefix]: Finished finitePrefix Result has 928 conditions, 462 events. 264/462 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1963 event pairs, 264 based on Foata normal form. 0/368 useless extension candidates. Maximal degree in co-relation 918. Up to 451 conditions per place. [2022-11-25 16:47:08,720 INFO L137 encePairwiseOnDemand]: 212/217 looper letters, 18 selfloop transitions, 0 changer transitions 0/21 dead transitions. [2022-11-25 16:47:08,720 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 21 transitions, 84 flow [2022-11-25 16:47:08,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 16:47:08,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-11-25 16:47:08,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 225 transitions. [2022-11-25 16:47:08,743 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5184331797235023 [2022-11-25 16:47:08,744 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 225 transitions. [2022-11-25 16:47:08,744 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 225 transitions. [2022-11-25 16:47:08,747 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 16:47:08,750 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 225 transitions. [2022-11-25 16:47:08,759 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 112.5) internal successors, (225), 2 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:47:08,766 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 217.0) internal successors, (651), 3 states have internal predecessors, (651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:47:08,767 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 217.0) internal successors, (651), 3 states have internal predecessors, (651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:47:08,770 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 58 flow. Second operand 2 states and 225 transitions. [2022-11-25 16:47:08,771 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 21 transitions, 84 flow [2022-11-25 16:47:08,774 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 21 transitions, 82 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-25 16:47:08,776 INFO L231 Difference]: Finished difference. Result has 27 places, 21 transitions, 46 flow [2022-11-25 16:47:08,778 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=46, PETRI_PLACES=27, PETRI_TRANSITIONS=21} [2022-11-25 16:47:08,783 INFO L288 CegarLoopForPetriNet]: 32 programPoint places, -5 predicate places. [2022-11-25 16:47:08,783 INFO L495 AbstractCegarLoop]: Abstraction has has 27 places, 21 transitions, 46 flow [2022-11-25 16:47:08,784 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 101.5) internal successors, (203), 2 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:47:08,784 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 16:47:08,784 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-11-25 16:47:08,814 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03b508e4-fc93-41c2-8a03-e71be20a7886/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-11-25 16:47:09,014 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03b508e4-fc93-41c2-8a03-e71be20a7886/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 16:47:09,014 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-11-25 16:47:09,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:47:09,015 INFO L85 PathProgramCache]: Analyzing trace with hash 475309, now seen corresponding path program 1 times [2022-11-25 16:47:09,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 16:47:09,016 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1761962526] [2022-11-25 16:47:09,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:47:09,017 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 16:47:09,017 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03b508e4-fc93-41c2-8a03-e71be20a7886/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 16:47:09,018 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03b508e4-fc93-41c2-8a03-e71be20a7886/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 16:47:09,045 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03b508e4-fc93-41c2-8a03-e71be20a7886/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-11-25 16:47:09,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:47:09,138 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-25 16:47:09,139 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 16:47:09,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:47:09,183 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 16:47:09,184 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 16:47:09,184 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1761962526] [2022-11-25 16:47:09,184 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1761962526] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:47:09,184 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:47:09,184 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-25 16:47:09,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980555666] [2022-11-25 16:47:09,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:47:09,186 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 16:47:09,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 16:47:09,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 16:47:09,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 16:47:09,196 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 217 [2022-11-25 16:47:09,197 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 21 transitions, 46 flow. Second operand has 3 states, 3 states have (on average 101.0) internal successors, (303), 3 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:47:09,198 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 16:47:09,198 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 217 [2022-11-25 16:47:09,198 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 16:47:09,397 INFO L130 PetriNetUnfolder]: 204/387 cut-off events. [2022-11-25 16:47:09,398 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 16:47:09,399 INFO L83 FinitePrefix]: Finished finitePrefix Result has 753 conditions, 387 events. 204/387 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1693 event pairs, 66 based on Foata normal form. 0/346 useless extension candidates. Maximal degree in co-relation 750. Up to 292 conditions per place. [2022-11-25 16:47:09,401 INFO L137 encePairwiseOnDemand]: 214/217 looper letters, 25 selfloop transitions, 2 changer transitions 2/32 dead transitions. [2022-11-25 16:47:09,402 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 32 transitions, 128 flow [2022-11-25 16:47:09,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 16:47:09,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 16:47:09,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 330 transitions. [2022-11-25 16:47:09,406 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5069124423963134 [2022-11-25 16:47:09,406 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 330 transitions. [2022-11-25 16:47:09,406 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 330 transitions. [2022-11-25 16:47:09,407 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 16:47:09,407 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 330 transitions. [2022-11-25 16:47:09,409 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:47:09,411 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 217.0) internal successors, (868), 4 states have internal predecessors, (868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:47:09,412 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 217.0) internal successors, (868), 4 states have internal predecessors, (868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:47:09,412 INFO L175 Difference]: Start difference. First operand has 27 places, 21 transitions, 46 flow. Second operand 3 states and 330 transitions. [2022-11-25 16:47:09,412 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 32 transitions, 128 flow [2022-11-25 16:47:09,413 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 32 transitions, 128 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-25 16:47:09,414 INFO L231 Difference]: Finished difference. Result has 28 places, 19 transitions, 46 flow [2022-11-25 16:47:09,414 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=44, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=46, PETRI_PLACES=28, PETRI_TRANSITIONS=19} [2022-11-25 16:47:09,415 INFO L288 CegarLoopForPetriNet]: 32 programPoint places, -4 predicate places. [2022-11-25 16:47:09,415 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 19 transitions, 46 flow [2022-11-25 16:47:09,416 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 101.0) internal successors, (303), 3 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:47:09,416 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 16:47:09,416 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:47:09,436 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03b508e4-fc93-41c2-8a03-e71be20a7886/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-11-25 16:47:09,630 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03b508e4-fc93-41c2-8a03-e71be20a7886/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 16:47:09,630 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-11-25 16:47:09,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:47:09,631 INFO L85 PathProgramCache]: Analyzing trace with hash -1521187374, now seen corresponding path program 1 times [2022-11-25 16:47:09,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 16:47:09,632 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [33925311] [2022-11-25 16:47:09,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:47:09,632 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 16:47:09,633 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03b508e4-fc93-41c2-8a03-e71be20a7886/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 16:47:09,634 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03b508e4-fc93-41c2-8a03-e71be20a7886/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 16:47:09,639 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03b508e4-fc93-41c2-8a03-e71be20a7886/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-11-25 16:47:09,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:47:09,770 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-25 16:47:09,772 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 16:47:09,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:47:09,853 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 16:47:09,854 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 16:47:09,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [33925311] [2022-11-25 16:47:09,855 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [33925311] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:47:09,855 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:47:09,855 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 16:47:09,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444499364] [2022-11-25 16:47:09,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:47:09,859 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 16:47:09,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 16:47:09,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 16:47:09,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 16:47:09,884 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 217 [2022-11-25 16:47:09,887 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 19 transitions, 46 flow. Second operand has 4 states, 4 states have (on average 98.0) internal successors, (392), 4 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-11-25 16:47:09,887 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 16:47:09,888 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 217 [2022-11-25 16:47:09,888 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 16:47:10,117 INFO L130 PetriNetUnfolder]: 76/175 cut-off events. [2022-11-25 16:47:10,117 INFO L131 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2022-11-25 16:47:10,118 INFO L83 FinitePrefix]: Finished finitePrefix Result has 372 conditions, 175 events. 76/175 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 673 event pairs, 27 based on Foata normal form. 20/184 useless extension candidates. Maximal degree in co-relation 368. Up to 76 conditions per place. [2022-11-25 16:47:10,120 INFO L137 encePairwiseOnDemand]: 212/217 looper letters, 28 selfloop transitions, 4 changer transitions 1/36 dead transitions. [2022-11-25 16:47:10,120 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 36 transitions, 152 flow [2022-11-25 16:47:10,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 16:47:10,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-25 16:47:10,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 419 transitions. [2022-11-25 16:47:10,129 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4827188940092166 [2022-11-25 16:47:10,129 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 419 transitions. [2022-11-25 16:47:10,129 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 419 transitions. [2022-11-25 16:47:10,130 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 16:47:10,131 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 419 transitions. [2022-11-25 16:47:10,134 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 104.75) internal successors, (419), 4 states have internal predecessors, (419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:47:10,139 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 217.0) internal successors, (1085), 5 states have internal predecessors, (1085), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:47:10,140 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 217.0) internal successors, (1085), 5 states have internal predecessors, (1085), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:47:10,140 INFO L175 Difference]: Start difference. First operand has 28 places, 19 transitions, 46 flow. Second operand 4 states and 419 transitions. [2022-11-25 16:47:10,140 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 36 transitions, 152 flow [2022-11-25 16:47:10,141 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 144 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-25 16:47:10,142 INFO L231 Difference]: Finished difference. Result has 30 places, 21 transitions, 68 flow [2022-11-25 16:47:10,142 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=42, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=68, PETRI_PLACES=30, PETRI_TRANSITIONS=21} [2022-11-25 16:47:10,144 INFO L288 CegarLoopForPetriNet]: 32 programPoint places, -2 predicate places. [2022-11-25 16:47:10,144 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 21 transitions, 68 flow [2022-11-25 16:47:10,145 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 98.0) internal successors, (392), 4 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-11-25 16:47:10,145 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 16:47:10,145 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:47:10,166 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03b508e4-fc93-41c2-8a03-e71be20a7886/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2022-11-25 16:47:10,359 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03b508e4-fc93-41c2-8a03-e71be20a7886/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 16:47:10,360 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-11-25 16:47:10,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:47:10,361 INFO L85 PathProgramCache]: Analyzing trace with hash 1583142653, now seen corresponding path program 1 times [2022-11-25 16:47:10,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 16:47:10,362 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [156883506] [2022-11-25 16:47:10,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:47:10,362 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 16:47:10,362 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03b508e4-fc93-41c2-8a03-e71be20a7886/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 16:47:10,363 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03b508e4-fc93-41c2-8a03-e71be20a7886/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 16:47:10,395 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03b508e4-fc93-41c2-8a03-e71be20a7886/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-11-25 16:47:10,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:47:10,517 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-25 16:47:10,519 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 16:47:10,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:47:10,592 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 16:47:10,593 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 16:47:10,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [156883506] [2022-11-25 16:47:10,594 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [156883506] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:47:10,594 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:47:10,594 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 16:47:10,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017749919] [2022-11-25 16:47:10,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:47:10,597 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 16:47:10,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 16:47:10,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 16:47:10,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 16:47:10,619 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 217 [2022-11-25 16:47:10,620 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 21 transitions, 68 flow. Second operand has 5 states, 5 states have (on average 98.2) internal successors, (491), 5 states have internal predecessors, (491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:47:10,620 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 16:47:10,620 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 217 [2022-11-25 16:47:10,620 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 16:47:10,810 INFO L130 PetriNetUnfolder]: 24/73 cut-off events. [2022-11-25 16:47:10,810 INFO L131 PetriNetUnfolder]: For 21/21 co-relation queries the response was YES. [2022-11-25 16:47:10,811 INFO L83 FinitePrefix]: Finished finitePrefix Result has 196 conditions, 73 events. 24/73 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 188 event pairs, 10 based on Foata normal form. 8/78 useless extension candidates. Maximal degree in co-relation 190. Up to 29 conditions per place. [2022-11-25 16:47:10,811 INFO L137 encePairwiseOnDemand]: 212/217 looper letters, 19 selfloop transitions, 6 changer transitions 1/29 dead transitions. [2022-11-25 16:47:10,811 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 29 transitions, 141 flow [2022-11-25 16:47:10,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 16:47:10,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-25 16:47:10,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 508 transitions. [2022-11-25 16:47:10,819 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4682027649769585 [2022-11-25 16:47:10,819 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 508 transitions. [2022-11-25 16:47:10,819 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 508 transitions. [2022-11-25 16:47:10,820 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 16:47:10,820 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 508 transitions. [2022-11-25 16:47:10,822 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 101.6) internal successors, (508), 5 states have internal predecessors, (508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:47:10,824 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 217.0) internal successors, (1302), 6 states have internal predecessors, (1302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:47:10,826 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 217.0) internal successors, (1302), 6 states have internal predecessors, (1302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:47:10,826 INFO L175 Difference]: Start difference. First operand has 30 places, 21 transitions, 68 flow. Second operand 5 states and 508 transitions. [2022-11-25 16:47:10,826 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 29 transitions, 141 flow [2022-11-25 16:47:10,828 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 29 transitions, 132 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-11-25 16:47:10,830 INFO L231 Difference]: Finished difference. Result has 34 places, 21 transitions, 84 flow [2022-11-25 16:47:10,830 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=61, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=84, PETRI_PLACES=34, PETRI_TRANSITIONS=21} [2022-11-25 16:47:10,832 INFO L288 CegarLoopForPetriNet]: 32 programPoint places, 2 predicate places. [2022-11-25 16:47:10,832 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 21 transitions, 84 flow [2022-11-25 16:47:10,833 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 98.2) internal successors, (491), 5 states have internal predecessors, (491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:47:10,833 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 16:47:10,834 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:47:10,848 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03b508e4-fc93-41c2-8a03-e71be20a7886/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-11-25 16:47:11,048 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03b508e4-fc93-41c2-8a03-e71be20a7886/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 16:47:11,048 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-11-25 16:47:11,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:47:11,049 INFO L85 PathProgramCache]: Analyzing trace with hash -1072393344, now seen corresponding path program 1 times [2022-11-25 16:47:11,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 16:47:11,050 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2112443857] [2022-11-25 16:47:11,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:47:11,050 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 16:47:11,050 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03b508e4-fc93-41c2-8a03-e71be20a7886/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 16:47:11,052 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03b508e4-fc93-41c2-8a03-e71be20a7886/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 16:47:11,057 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03b508e4-fc93-41c2-8a03-e71be20a7886/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-11-25 16:47:11,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:47:11,207 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-25 16:47:11,209 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 16:47:11,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:47:11,462 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 16:47:11,462 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 16:47:11,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2112443857] [2022-11-25 16:47:11,463 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2112443857] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:47:11,463 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:47:11,463 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 16:47:11,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260785123] [2022-11-25 16:47:11,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:47:11,464 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 16:47:11,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 16:47:11,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 16:47:11,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-25 16:47:11,537 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 217 [2022-11-25 16:47:11,538 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 21 transitions, 84 flow. Second operand has 7 states, 7 states have (on average 96.14285714285714) internal successors, (673), 7 states have internal predecessors, (673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:47:11,538 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 16:47:11,539 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 217 [2022-11-25 16:47:11,539 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 16:47:11,835 INFO L130 PetriNetUnfolder]: 19/72 cut-off events. [2022-11-25 16:47:11,835 INFO L131 PetriNetUnfolder]: For 57/57 co-relation queries the response was YES. [2022-11-25 16:47:11,836 INFO L83 FinitePrefix]: Finished finitePrefix Result has 212 conditions, 72 events. 19/72 cut-off events. For 57/57 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 176 event pairs, 0 based on Foata normal form. 0/71 useless extension candidates. Maximal degree in co-relation 205. Up to 25 conditions per place. [2022-11-25 16:47:11,836 INFO L137 encePairwiseOnDemand]: 210/217 looper letters, 32 selfloop transitions, 7 changer transitions 0/42 dead transitions. [2022-11-25 16:47:11,837 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 42 transitions, 254 flow [2022-11-25 16:47:11,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 16:47:11,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-11-25 16:47:11,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 788 transitions. [2022-11-25 16:47:11,841 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4539170506912442 [2022-11-25 16:47:11,841 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 788 transitions. [2022-11-25 16:47:11,841 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 788 transitions. [2022-11-25 16:47:11,842 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 16:47:11,842 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 788 transitions. [2022-11-25 16:47:11,845 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 98.5) internal successors, (788), 8 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:47:11,848 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 217.0) internal successors, (1953), 9 states have internal predecessors, (1953), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:47:11,850 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 217.0) internal successors, (1953), 9 states have internal predecessors, (1953), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:47:11,850 INFO L175 Difference]: Start difference. First operand has 34 places, 21 transitions, 84 flow. Second operand 8 states and 788 transitions. [2022-11-25 16:47:11,850 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 42 transitions, 254 flow [2022-11-25 16:47:11,852 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 42 transitions, 188 flow, removed 10 selfloop flow, removed 7 redundant places. [2022-11-25 16:47:11,853 INFO L231 Difference]: Finished difference. Result has 37 places, 24 transitions, 86 flow [2022-11-25 16:47:11,853 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=86, PETRI_PLACES=37, PETRI_TRANSITIONS=24} [2022-11-25 16:47:11,854 INFO L288 CegarLoopForPetriNet]: 32 programPoint places, 5 predicate places. [2022-11-25 16:47:11,854 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 24 transitions, 86 flow [2022-11-25 16:47:11,855 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 96.14285714285714) internal successors, (673), 7 states have internal predecessors, (673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:47:11,855 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 16:47:11,856 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:47:11,876 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03b508e4-fc93-41c2-8a03-e71be20a7886/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2022-11-25 16:47:12,070 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03b508e4-fc93-41c2-8a03-e71be20a7886/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 16:47:12,070 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-11-25 16:47:12,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:47:12,071 INFO L85 PathProgramCache]: Analyzing trace with hash -1970909870, now seen corresponding path program 2 times [2022-11-25 16:47:12,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 16:47:12,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2139419167] [2022-11-25 16:47:12,072 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-25 16:47:12,072 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 16:47:12,072 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03b508e4-fc93-41c2-8a03-e71be20a7886/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 16:47:12,074 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03b508e4-fc93-41c2-8a03-e71be20a7886/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 16:47:12,079 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03b508e4-fc93-41c2-8a03-e71be20a7886/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-11-25 16:47:12,245 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-25 16:47:12,245 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 16:47:12,251 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-25 16:47:12,253 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 16:47:12,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:47:12,326 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 16:47:12,326 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 16:47:12,327 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2139419167] [2022-11-25 16:47:12,327 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2139419167] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:47:12,327 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:47:12,328 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 16:47:12,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142188393] [2022-11-25 16:47:12,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:47:12,329 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 16:47:12,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 16:47:12,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 16:47:12,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 16:47:12,362 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 217 [2022-11-25 16:47:12,363 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 24 transitions, 86 flow. Second operand has 5 states, 5 states have (on average 99.2) internal successors, (496), 5 states have internal predecessors, (496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:47:12,363 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 16:47:12,363 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 217 [2022-11-25 16:47:12,364 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 16:47:12,551 INFO L130 PetriNetUnfolder]: 31/115 cut-off events. [2022-11-25 16:47:12,554 INFO L131 PetriNetUnfolder]: For 42/42 co-relation queries the response was YES. [2022-11-25 16:47:12,554 INFO L83 FinitePrefix]: Finished finitePrefix Result has 311 conditions, 115 events. 31/115 cut-off events. For 42/42 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 384 event pairs, 13 based on Foata normal form. 1/115 useless extension candidates. Maximal degree in co-relation 304. Up to 48 conditions per place. [2022-11-25 16:47:12,559 INFO L137 encePairwiseOnDemand]: 213/217 looper letters, 36 selfloop transitions, 4 changer transitions 0/42 dead transitions. [2022-11-25 16:47:12,560 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 42 transitions, 237 flow [2022-11-25 16:47:12,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 16:47:12,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-25 16:47:12,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 511 transitions. [2022-11-25 16:47:12,564 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.47096774193548385 [2022-11-25 16:47:12,564 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 511 transitions. [2022-11-25 16:47:12,565 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 511 transitions. [2022-11-25 16:47:12,565 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 16:47:12,565 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 511 transitions. [2022-11-25 16:47:12,567 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 102.2) internal successors, (511), 5 states have internal predecessors, (511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:47:12,580 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 217.0) internal successors, (1302), 6 states have internal predecessors, (1302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:47:12,581 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 217.0) internal successors, (1302), 6 states have internal predecessors, (1302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:47:12,581 INFO L175 Difference]: Start difference. First operand has 37 places, 24 transitions, 86 flow. Second operand 5 states and 511 transitions. [2022-11-25 16:47:12,581 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 42 transitions, 237 flow [2022-11-25 16:47:12,585 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 42 transitions, 226 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-25 16:47:12,587 INFO L231 Difference]: Finished difference. Result has 41 places, 27 transitions, 115 flow [2022-11-25 16:47:12,587 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=115, PETRI_PLACES=41, PETRI_TRANSITIONS=27} [2022-11-25 16:47:12,590 INFO L288 CegarLoopForPetriNet]: 32 programPoint places, 9 predicate places. [2022-11-25 16:47:12,590 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 27 transitions, 115 flow [2022-11-25 16:47:12,591 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 99.2) internal successors, (496), 5 states have internal predecessors, (496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:47:12,591 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 16:47:12,591 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:47:12,613 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03b508e4-fc93-41c2-8a03-e71be20a7886/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-11-25 16:47:12,812 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03b508e4-fc93-41c2-8a03-e71be20a7886/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 16:47:12,813 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-11-25 16:47:12,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:47:12,814 INFO L85 PathProgramCache]: Analyzing trace with hash 2124741534, now seen corresponding path program 1 times [2022-11-25 16:47:12,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 16:47:12,815 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1659736072] [2022-11-25 16:47:12,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:47:12,815 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 16:47:12,815 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03b508e4-fc93-41c2-8a03-e71be20a7886/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 16:47:12,816 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03b508e4-fc93-41c2-8a03-e71be20a7886/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 16:47:12,818 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03b508e4-fc93-41c2-8a03-e71be20a7886/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-11-25 16:47:12,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:47:12,998 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-25 16:47:13,001 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 16:47:13,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:47:13,288 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 16:47:13,288 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 16:47:13,288 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1659736072] [2022-11-25 16:47:13,289 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1659736072] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:47:13,289 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:47:13,289 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 16:47:13,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755636060] [2022-11-25 16:47:13,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:47:13,291 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 16:47:13,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 16:47:13,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 16:47:13,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 16:47:13,429 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 217 [2022-11-25 16:47:13,430 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 27 transitions, 115 flow. Second operand has 4 states, 4 states have (on average 92.75) internal successors, (371), 4 states have internal predecessors, (371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:47:13,430 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 16:47:13,430 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 217 [2022-11-25 16:47:13,430 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 16:47:13,587 INFO L130 PetriNetUnfolder]: 26/100 cut-off events. [2022-11-25 16:47:13,587 INFO L131 PetriNetUnfolder]: For 45/47 co-relation queries the response was YES. [2022-11-25 16:47:13,588 INFO L83 FinitePrefix]: Finished finitePrefix Result has 285 conditions, 100 events. 26/100 cut-off events. For 45/47 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 342 event pairs, 8 based on Foata normal form. 5/104 useless extension candidates. Maximal degree in co-relation 275. Up to 87 conditions per place. [2022-11-25 16:47:13,593 INFO L137 encePairwiseOnDemand]: 214/217 looper letters, 16 selfloop transitions, 2 changer transitions 8/29 dead transitions. [2022-11-25 16:47:13,594 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 29 transitions, 173 flow [2022-11-25 16:47:13,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 16:47:13,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-25 16:47:13,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 375 transitions. [2022-11-25 16:47:13,597 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.43202764976958524 [2022-11-25 16:47:13,597 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 375 transitions. [2022-11-25 16:47:13,597 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 375 transitions. [2022-11-25 16:47:13,598 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 16:47:13,598 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 375 transitions. [2022-11-25 16:47:13,599 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 93.75) internal successors, (375), 4 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:47:13,601 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 217.0) internal successors, (1085), 5 states have internal predecessors, (1085), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:47:13,602 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 217.0) internal successors, (1085), 5 states have internal predecessors, (1085), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:47:13,602 INFO L175 Difference]: Start difference. First operand has 41 places, 27 transitions, 115 flow. Second operand 4 states and 375 transitions. [2022-11-25 16:47:13,602 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 29 transitions, 173 flow [2022-11-25 16:47:13,604 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 29 transitions, 172 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-25 16:47:13,605 INFO L231 Difference]: Finished difference. Result has 42 places, 20 transitions, 74 flow [2022-11-25 16:47:13,605 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=74, PETRI_PLACES=42, PETRI_TRANSITIONS=20} [2022-11-25 16:47:13,606 INFO L288 CegarLoopForPetriNet]: 32 programPoint places, 10 predicate places. [2022-11-25 16:47:13,606 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 20 transitions, 74 flow [2022-11-25 16:47:13,607 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 92.75) internal successors, (371), 4 states have internal predecessors, (371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:47:13,607 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 16:47:13,607 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:47:13,625 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03b508e4-fc93-41c2-8a03-e71be20a7886/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-11-25 16:47:13,822 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03b508e4-fc93-41c2-8a03-e71be20a7886/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 16:47:13,823 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-11-25 16:47:13,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:47:13,823 INFO L85 PathProgramCache]: Analyzing trace with hash 1393237846, now seen corresponding path program 3 times [2022-11-25 16:47:13,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 16:47:13,824 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [434209823] [2022-11-25 16:47:13,824 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-25 16:47:13,825 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 16:47:13,825 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03b508e4-fc93-41c2-8a03-e71be20a7886/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 16:47:13,826 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03b508e4-fc93-41c2-8a03-e71be20a7886/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 16:47:13,832 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03b508e4-fc93-41c2-8a03-e71be20a7886/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-11-25 16:47:13,982 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-11-25 16:47:13,982 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-11-25 16:47:13,982 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 16:47:14,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 16:47:14,147 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-11-25 16:47:14,148 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-11-25 16:47:14,149 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK (9 of 10 remaining) [2022-11-25 16:47:14,152 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (8 of 10 remaining) [2022-11-25 16:47:14,152 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 10 remaining) [2022-11-25 16:47:14,152 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 10 remaining) [2022-11-25 16:47:14,153 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 10 remaining) [2022-11-25 16:47:14,153 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 10 remaining) [2022-11-25 16:47:14,153 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK (3 of 10 remaining) [2022-11-25 16:47:14,153 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 10 remaining) [2022-11-25 16:47:14,154 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 10 remaining) [2022-11-25 16:47:14,154 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 10 remaining) [2022-11-25 16:47:14,191 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03b508e4-fc93-41c2-8a03-e71be20a7886/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-11-25 16:47:14,365 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03b508e4-fc93-41c2-8a03-e71be20a7886/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 16:47:14,365 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1] [2022-11-25 16:47:14,371 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-25 16:47:14,371 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-25 16:47:14,452 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 04:47:14 BasicIcfg [2022-11-25 16:47:14,452 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-25 16:47:14,470 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-25 16:47:14,470 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-25 16:47:14,470 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-25 16:47:14,471 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 04:46:57" (3/4) ... [2022-11-25 16:47:14,474 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-25 16:47:14,475 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-25 16:47:14,479 INFO L158 Benchmark]: Toolchain (without parser) took 18824.20ms. Allocated memory was 67.1MB in the beginning and 125.8MB in the end (delta: 58.7MB). Free memory was 42.9MB in the beginning and 98.8MB in the end (delta: -55.9MB). Peak memory consumption was 5.0MB. Max. memory is 16.1GB. [2022-11-25 16:47:14,479 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 67.1MB. Free memory is still 44.0MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 16:47:14,480 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1018.81ms. Allocated memory was 67.1MB in the beginning and 86.0MB in the end (delta: 18.9MB). Free memory was 42.7MB in the beginning and 50.1MB in the end (delta: -7.4MB). Peak memory consumption was 14.1MB. Max. memory is 16.1GB. [2022-11-25 16:47:14,480 INFO L158 Benchmark]: Boogie Procedure Inliner took 94.27ms. Allocated memory is still 86.0MB. Free memory was 50.1MB in the beginning and 47.7MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 16:47:14,481 INFO L158 Benchmark]: Boogie Preprocessor took 76.18ms. Allocated memory is still 86.0MB. Free memory was 47.7MB in the beginning and 45.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 16:47:14,481 INFO L158 Benchmark]: RCFGBuilder took 926.75ms. Allocated memory is still 86.0MB. Free memory was 45.6MB in the beginning and 33.3MB in the end (delta: 12.3MB). Peak memory consumption was 14.5MB. Max. memory is 16.1GB. [2022-11-25 16:47:14,482 INFO L158 Benchmark]: TraceAbstraction took 16689.56ms. Allocated memory was 86.0MB in the beginning and 125.8MB in the end (delta: 39.8MB). Free memory was 32.8MB in the beginning and 98.8MB in the end (delta: -66.0MB). Peak memory consumption was 44.7MB. Max. memory is 16.1GB. [2022-11-25 16:47:14,485 INFO L158 Benchmark]: Witness Printer took 7.88ms. Allocated memory is still 125.8MB. Free memory is still 98.8MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 16:47:14,488 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.31ms. Allocated memory is still 67.1MB. Free memory is still 44.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1018.81ms. Allocated memory was 67.1MB in the beginning and 86.0MB in the end (delta: 18.9MB). Free memory was 42.7MB in the beginning and 50.1MB in the end (delta: -7.4MB). Peak memory consumption was 14.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 94.27ms. Allocated memory is still 86.0MB. Free memory was 50.1MB in the beginning and 47.7MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 76.18ms. Allocated memory is still 86.0MB. Free memory was 47.7MB in the beginning and 45.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 926.75ms. Allocated memory is still 86.0MB. Free memory was 45.6MB in the beginning and 33.3MB in the end (delta: 12.3MB). Peak memory consumption was 14.5MB. Max. memory is 16.1GB. * TraceAbstraction took 16689.56ms. Allocated memory was 86.0MB in the beginning and 125.8MB in the end (delta: 39.8MB). Free memory was 32.8MB in the beginning and 98.8MB in the end (delta: -66.0MB). Peak memory consumption was 44.7MB. Max. memory is 16.1GB. * Witness Printer took 7.88ms. Allocated memory is still 125.8MB. Free memory is still 98.8MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 9.9s, 115 PlacesBefore, 32 PlacesAfterwards, 110 TransitionsBefore, 26 TransitionsAfterwards, 1652 CoEnabledTransitionPairs, 7 FixpointIterations, 48 TrivialSequentialCompositions, 48 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 1 ChoiceCompositions, 105 TotalNumberOfCompositions, 4227 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1880, independent: 1726, independent conditional: 0, independent unconditional: 1726, dependent: 154, dependent conditional: 0, dependent unconditional: 154, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1150, independent: 1109, independent conditional: 0, independent unconditional: 1109, dependent: 41, dependent conditional: 0, dependent unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1150, independent: 1101, independent conditional: 0, independent unconditional: 1101, dependent: 49, dependent conditional: 0, dependent unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 49, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 41, dependent conditional: 0, dependent unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 426, independent: 32, independent conditional: 0, independent unconditional: 32, dependent: 394, dependent conditional: 0, dependent unconditional: 394, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1880, independent: 617, independent conditional: 0, independent unconditional: 617, dependent: 113, dependent conditional: 0, dependent unconditional: 113, unknown: 1150, unknown conditional: 0, unknown unconditional: 1150] , Statistics on independence cache: Total cache size (in pairs): 84, Positive cache size: 67, Positive conditional cache size: 0, Positive unconditional cache size: 67, Negative cache size: 17, Negative conditional cache size: 0, Negative unconditional cache size: 17, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L708] 0 int __unbuffered_cnt = 0; [L710] 0 int __unbuffered_p0_EAX = 0; [L712] 0 int __unbuffered_p0_EBX = 0; [L714] 0 int __unbuffered_p1_EAX = 0; [L716] 0 int __unbuffered_p1_EBX = 0; [L718] 0 int a = 0; [L719] 0 _Bool a$flush_delayed; [L720] 0 int a$mem_tmp; [L721] 0 _Bool a$r_buff0_thd0; [L722] 0 _Bool a$r_buff0_thd1; [L723] 0 _Bool a$r_buff0_thd2; [L724] 0 _Bool a$r_buff1_thd0; [L725] 0 _Bool a$r_buff1_thd1; [L726] 0 _Bool a$r_buff1_thd2; [L727] 0 _Bool a$read_delayed; [L728] 0 int *a$read_delayed_var; [L729] 0 int a$w_buff0; [L730] 0 _Bool a$w_buff0_used; [L731] 0 int a$w_buff1; [L732] 0 _Bool a$w_buff1_used; [L733] 0 _Bool main$tmp_guard0; [L734] 0 _Bool main$tmp_guard1; [L736] 0 int x = 0; [L738] 0 int y = 0; [L740] 0 int z = 0; [L741] 0 _Bool weak$$choice0; [L742] 0 _Bool weak$$choice2; [L827] 0 pthread_t t833; [L828] FCALL, FORK 0 pthread_create(&t833, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t833, ((void *)0), P0, ((void *)0))=-1, t833={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L746] 1 a$w_buff1 = a$w_buff0 [L747] 1 a$w_buff0 = 1 [L748] 1 a$w_buff1_used = a$w_buff0_used [L749] 1 a$w_buff0_used = (_Bool)1 [L750] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L750] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L751] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L752] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L753] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L754] 1 a$r_buff0_thd1 = (_Bool)1 [L757] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L760] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L763] 1 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L829] 0 pthread_t t834; [L830] FCALL, FORK 0 pthread_create(&t834, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t834, ((void *)0), P1, ((void *)0))=0, t833={3:0}, t834={7:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L780] 2 y = 1 [L783] 2 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L786] 2 __unbuffered_p1_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L789] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L790] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L791] 2 a$flush_delayed = weak$$choice2 [L792] 2 a$mem_tmp = a [L793] 2 a = !a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff1) [L794] 2 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff0)) [L795] 2 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff1 : a$w_buff1)) [L796] 2 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used)) [L797] 2 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L798] 2 a$r_buff0_thd2 = weak$$choice2 ? a$r_buff0_thd2 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$r_buff0_thd2 : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2)) [L799] 2 a$r_buff1_thd2 = weak$$choice2 ? a$r_buff1_thd2 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$r_buff1_thd2 : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L800] 2 __unbuffered_p1_EBX = a [L801] 2 a = a$flush_delayed ? a$mem_tmp : a [L802] 2 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=0, x=1, y=1, z=1] [L766] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L767] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L768] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L769] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L770] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=0, x=1, y=1, z=1] [L773] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L775] 1 return 0; [L805] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L806] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L807] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L808] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L809] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=0, x=1, y=1, z=1] [L812] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L814] 2 return 0; [L832] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t833={3:0}, t834={7:0}, weak$$choice0=2, weak$$choice2=0, x=1, y=1, z=1] [L834] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L834] RET 0 assume_abort_if_not(main$tmp_guard0) [L836] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L837] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L838] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L839] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L840] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t833={3:0}, t834={7:0}, weak$$choice0=2, weak$$choice2=0, x=1, y=1, z=1] [L843] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) [L845] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=0, x=1, y=1, z=1] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 825]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 830]: 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: 828]: 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 5 procedures, 134 locations, 10 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 16.4s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 2.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 10.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 219 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 166 mSDsluCounter, 108 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 100 mSDsCounter, 27 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 543 IncrementalHoareTripleChecker+Invalid, 570 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 27 mSolverCounterUnsat, 8 mSDtfsCounter, 543 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 80 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=115occurred in iteration=6, InterpolantAutomatonStates: 31, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 97 NumberOfCodeBlocks, 97 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 72 ConstructedInterpolants, 15 QuantifiedInterpolants, 612 SizeOfPredicates, 13 NumberOfNonLiveVariables, 696 ConjunctsInSsa, 44 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-11-25 16:47:14,521 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03b508e4-fc93-41c2-8a03-e71be20a7886/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample