./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/rfi008.opt.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_19c6198e-24fd-408a-a3f9-94ea17ed2144/bin/uautomizer-ZsLfNo2U6R/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19c6198e-24fd-408a-a3f9-94ea17ed2144/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_19c6198e-24fd-408a-a3f9-94ea17ed2144/bin/uautomizer-ZsLfNo2U6R/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19c6198e-24fd-408a-a3f9-94ea17ed2144/bin/uautomizer-ZsLfNo2U6R/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/rfi008.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19c6198e-24fd-408a-a3f9-94ea17ed2144/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_19c6198e-24fd-408a-a3f9-94ea17ed2144/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 0d082f4414248fc35e1fa616a9787901263e0e45c6e6a28545f00aa25d14032e --- 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 17:07:07,311 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 17:07:07,314 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 17:07:07,339 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 17:07:07,339 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 17:07:07,341 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 17:07:07,343 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 17:07:07,345 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 17:07:07,347 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 17:07:07,348 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 17:07:07,349 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 17:07:07,351 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 17:07:07,352 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 17:07:07,353 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 17:07:07,354 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 17:07:07,356 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 17:07:07,357 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 17:07:07,358 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 17:07:07,361 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 17:07:07,363 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 17:07:07,366 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 17:07:07,367 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 17:07:07,369 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 17:07:07,371 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 17:07:07,375 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 17:07:07,376 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 17:07:07,377 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 17:07:07,378 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 17:07:07,379 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 17:07:07,380 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 17:07:07,381 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 17:07:07,382 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 17:07:07,383 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 17:07:07,384 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 17:07:07,385 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 17:07:07,386 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 17:07:07,387 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 17:07:07,387 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 17:07:07,388 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 17:07:07,389 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 17:07:07,390 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 17:07:07,391 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19c6198e-24fd-408a-a3f9-94ea17ed2144/bin/uautomizer-ZsLfNo2U6R/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-11-25 17:07:07,420 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 17:07:07,420 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 17:07:07,421 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 17:07:07,421 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 17:07:07,422 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 17:07:07,423 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 17:07:07,424 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 17:07:07,424 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 17:07:07,425 INFO L138 SettingsManager]: * Use SBE=true [2022-11-25 17:07:07,425 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 17:07:07,426 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 17:07:07,426 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-25 17:07:07,427 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 17:07:07,427 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 17:07:07,427 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 17:07:07,428 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-25 17:07:07,428 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-25 17:07:07,429 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-25 17:07:07,429 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 17:07:07,430 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-25 17:07:07,430 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 17:07:07,430 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 17:07:07,431 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 17:07:07,431 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-25 17:07:07,432 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 17:07:07,432 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 17:07:07,433 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 17:07:07,433 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 17:07:07,434 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-25 17:07:07,434 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-25 17:07:07,434 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-25 17:07:07,435 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-25 17:07:07,435 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-25 17:07:07,436 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_19c6198e-24fd-408a-a3f9-94ea17ed2144/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_19c6198e-24fd-408a-a3f9-94ea17ed2144/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 -> 0d082f4414248fc35e1fa616a9787901263e0e45c6e6a28545f00aa25d14032e [2022-11-25 17:07:07,716 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 17:07:07,759 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 17:07:07,762 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 17:07:07,764 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 17:07:07,764 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 17:07:07,766 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19c6198e-24fd-408a-a3f9-94ea17ed2144/bin/uautomizer-ZsLfNo2U6R/../../sv-benchmarks/c/pthread-wmm/rfi008.opt.i [2022-11-25 17:07:11,143 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 17:07:11,576 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 17:07:11,577 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19c6198e-24fd-408a-a3f9-94ea17ed2144/sv-benchmarks/c/pthread-wmm/rfi008.opt.i [2022-11-25 17:07:11,593 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19c6198e-24fd-408a-a3f9-94ea17ed2144/bin/uautomizer-ZsLfNo2U6R/data/0d43e7411/88ce5188c0da47ee9f4c69b1ebc2580a/FLAG249644688 [2022-11-25 17:07:11,611 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19c6198e-24fd-408a-a3f9-94ea17ed2144/bin/uautomizer-ZsLfNo2U6R/data/0d43e7411/88ce5188c0da47ee9f4c69b1ebc2580a [2022-11-25 17:07:11,614 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 17:07:11,616 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 17:07:11,618 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 17:07:11,618 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 17:07:11,622 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 17:07:11,623 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 05:07:11" (1/1) ... [2022-11-25 17:07:11,625 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@646310ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:07:11, skipping insertion in model container [2022-11-25 17:07:11,625 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 05:07:11" (1/1) ... [2022-11-25 17:07:11,634 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 17:07:11,682 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 17:07:11,879 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_19c6198e-24fd-408a-a3f9-94ea17ed2144/sv-benchmarks/c/pthread-wmm/rfi008.opt.i[987,1000] [2022-11-25 17:07:12,123 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:07:12,125 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:07:12,126 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:07:12,127 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:07:12,129 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:07:12,163 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:07:12,164 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:07:12,164 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:07:12,165 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:07:12,166 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:07:12,173 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:07:12,177 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:07:12,179 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:07:12,189 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:07:12,192 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:07:12,193 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:07:12,193 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:07:12,205 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:07:12,205 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:07:12,206 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:07:12,215 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:07:12,225 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:07:12,226 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:07:12,233 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:07:12,240 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:07:12,241 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:07:12,243 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 17:07:12,257 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 17:07:12,276 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_19c6198e-24fd-408a-a3f9-94ea17ed2144/sv-benchmarks/c/pthread-wmm/rfi008.opt.i[987,1000] [2022-11-25 17:07:12,328 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:07:12,328 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:07:12,329 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:07:12,329 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:07:12,330 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:07:12,336 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:07:12,336 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:07:12,337 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:07:12,337 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:07:12,338 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:07:12,339 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:07:12,340 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:07:12,340 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:07:12,347 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:07:12,347 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:07:12,348 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:07:12,348 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:07:12,350 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:07:12,356 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:07:12,356 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:07:12,360 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:07:12,368 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:07:12,368 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:07:12,370 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:07:12,371 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:07:12,371 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:07:12,373 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 17:07:12,427 INFO L208 MainTranslator]: Completed translation [2022-11-25 17:07:12,427 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:07:12 WrapperNode [2022-11-25 17:07:12,428 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 17:07:12,429 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 17:07:12,430 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 17:07:12,430 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 17:07:12,439 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:07:12" (1/1) ... [2022-11-25 17:07:12,474 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:07:12" (1/1) ... [2022-11-25 17:07:12,504 INFO L138 Inliner]: procedures = 175, calls = 45, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 133 [2022-11-25 17:07:12,504 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 17:07:12,505 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 17:07:12,506 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 17:07:12,506 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 17:07:12,516 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:07:12" (1/1) ... [2022-11-25 17:07:12,517 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:07:12" (1/1) ... [2022-11-25 17:07:12,521 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:07:12" (1/1) ... [2022-11-25 17:07:12,521 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:07:12" (1/1) ... [2022-11-25 17:07:12,529 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:07:12" (1/1) ... [2022-11-25 17:07:12,531 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:07:12" (1/1) ... [2022-11-25 17:07:12,534 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:07:12" (1/1) ... [2022-11-25 17:07:12,536 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:07:12" (1/1) ... [2022-11-25 17:07:12,540 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 17:07:12,541 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 17:07:12,541 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 17:07:12,541 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 17:07:12,542 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:07:12" (1/1) ... [2022-11-25 17:07:12,550 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 17:07:12,565 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19c6198e-24fd-408a-a3f9-94ea17ed2144/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:07:12,583 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19c6198e-24fd-408a-a3f9-94ea17ed2144/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 17:07:12,621 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19c6198e-24fd-408a-a3f9-94ea17ed2144/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 17:07:12,640 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-25 17:07:12,640 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-25 17:07:12,641 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 17:07:12,642 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-25 17:07:12,642 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-25 17:07:12,643 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-25 17:07:12,643 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-25 17:07:12,644 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-25 17:07:12,645 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-25 17:07:12,645 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-25 17:07:12,646 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-25 17:07:12,646 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 17:07:12,646 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 17:07:12,648 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 17:07:12,932 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 17:07:12,935 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 17:07:13,300 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 17:07:13,542 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 17:07:13,542 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-25 17:07:13,545 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:07:13 BoogieIcfgContainer [2022-11-25 17:07:13,545 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 17:07:13,556 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 17:07:13,556 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 17:07:13,560 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 17:07:13,573 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 05:07:11" (1/3) ... [2022-11-25 17:07:13,574 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@502647d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 05:07:13, skipping insertion in model container [2022-11-25 17:07:13,574 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:07:12" (2/3) ... [2022-11-25 17:07:13,575 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@502647d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 05:07:13, skipping insertion in model container [2022-11-25 17:07:13,575 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:07:13" (3/3) ... [2022-11-25 17:07:13,576 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi008.opt.i [2022-11-25 17:07:13,616 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 17:07:13,627 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2022-11-25 17:07:13,627 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-25 17:07:13,728 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-25 17:07:13,777 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 111 places, 106 transitions, 222 flow [2022-11-25 17:07:13,839 INFO L130 PetriNetUnfolder]: 2/104 cut-off events. [2022-11-25 17:07:13,840 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 17:07:13,847 INFO L83 FinitePrefix]: Finished finitePrefix Result has 111 conditions, 104 events. 2/104 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 59 event pairs, 0 based on Foata normal form. 0/95 useless extension candidates. Maximal degree in co-relation 61. Up to 2 conditions per place. [2022-11-25 17:07:13,847 INFO L82 GeneralOperation]: Start removeDead. Operand has 111 places, 106 transitions, 222 flow [2022-11-25 17:07:13,853 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 109 places, 104 transitions, 214 flow [2022-11-25 17:07:13,858 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-25 17:07:13,878 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 109 places, 104 transitions, 214 flow [2022-11-25 17:07:13,882 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 109 places, 104 transitions, 214 flow [2022-11-25 17:07:13,882 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 109 places, 104 transitions, 214 flow [2022-11-25 17:07:13,918 INFO L130 PetriNetUnfolder]: 2/104 cut-off events. [2022-11-25 17:07:13,918 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 17:07:13,919 INFO L83 FinitePrefix]: Finished finitePrefix Result has 111 conditions, 104 events. 2/104 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 59 event pairs, 0 based on Foata normal form. 0/95 useless extension candidates. Maximal degree in co-relation 61. Up to 2 conditions per place. [2022-11-25 17:07:13,921 INFO L119 LiptonReduction]: Number of co-enabled transitions 1340 [2022-11-25 17:07:19,628 INFO L134 LiptonReduction]: Checked pairs total: 3638 [2022-11-25 17:07:19,629 INFO L136 LiptonReduction]: Total number of compositions: 111 [2022-11-25 17:07:19,651 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 17:07:19,660 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;@6800237d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 17:07:19,660 INFO L358 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2022-11-25 17:07:19,663 INFO L130 PetriNetUnfolder]: 0/1 cut-off events. [2022-11-25 17:07:19,663 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 17:07:19,664 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:07:19,665 INFO L209 CegarLoopForPetriNet]: trace histogram [1] [2022-11-25 17:07:19,665 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-11-25 17:07:19,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:07:19,672 INFO L85 PathProgramCache]: Analyzing trace with hash 496, now seen corresponding path program 1 times [2022-11-25 17:07:19,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:07:19,685 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434555614] [2022-11-25 17:07:19,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:07:19,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:07:19,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:07:19,848 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 17:07:19,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:07:19,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434555614] [2022-11-25 17:07:19,852 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434555614] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:07:19,852 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:07:19,854 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-25 17:07:19,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330959533] [2022-11-25 17:07:19,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:07:19,874 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-25 17:07:19,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:07:19,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-25 17:07:19,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-25 17:07:19,912 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 217 [2022-11-25 17:07:19,916 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 25 transitions, 56 flow. Second operand has 2 states, 2 states have (on average 95.5) internal successors, (191), 2 states have internal predecessors, (191), 0 states have call successors, (0), 0 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 17:07:19,916 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:07:19,917 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 217 [2022-11-25 17:07:19,918 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:07:20,112 INFO L130 PetriNetUnfolder]: 249/434 cut-off events. [2022-11-25 17:07:20,113 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-11-25 17:07:20,115 INFO L83 FinitePrefix]: Finished finitePrefix Result has 874 conditions, 434 events. 249/434 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1793 event pairs, 249 based on Foata normal form. 0/352 useless extension candidates. Maximal degree in co-relation 864. Up to 427 conditions per place. [2022-11-25 17:07:20,119 INFO L137 encePairwiseOnDemand]: 212/217 looper letters, 18 selfloop transitions, 0 changer transitions 0/20 dead transitions. [2022-11-25 17:07:20,120 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 20 transitions, 82 flow [2022-11-25 17:07:20,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 17:07:20,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-11-25 17:07:20,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 213 transitions. [2022-11-25 17:07:20,137 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.49078341013824883 [2022-11-25 17:07:20,139 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 213 transitions. [2022-11-25 17:07:20,139 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 213 transitions. [2022-11-25 17:07:20,141 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:07:20,144 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 213 transitions. [2022-11-25 17:07:20,147 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 106.5) internal successors, (213), 2 states have internal predecessors, (213), 0 states have call successors, (0), 0 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 17:07:20,154 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 17:07:20,154 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 17:07:20,157 INFO L175 Difference]: Start difference. First operand has 31 places, 25 transitions, 56 flow. Second operand 2 states and 213 transitions. [2022-11-25 17:07:20,158 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 20 transitions, 82 flow [2022-11-25 17:07:20,161 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 20 transitions, 80 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-25 17:07:20,163 INFO L231 Difference]: Finished difference. Result has 26 places, 20 transitions, 44 flow [2022-11-25 17:07:20,165 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=44, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=44, PETRI_PLACES=26, PETRI_TRANSITIONS=20} [2022-11-25 17:07:20,169 INFO L288 CegarLoopForPetriNet]: 31 programPoint places, -5 predicate places. [2022-11-25 17:07:20,170 INFO L495 AbstractCegarLoop]: Abstraction has has 26 places, 20 transitions, 44 flow [2022-11-25 17:07:20,170 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 95.5) internal successors, (191), 2 states have internal predecessors, (191), 0 states have call successors, (0), 0 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 17:07:20,170 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:07:20,171 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-11-25 17:07:20,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-25 17:07:20,171 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-11-25 17:07:20,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:07:20,173 INFO L85 PathProgramCache]: Analyzing trace with hash 468081823, now seen corresponding path program 1 times [2022-11-25 17:07:20,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:07:20,174 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016709219] [2022-11-25 17:07:20,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:07:20,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:07:20,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:07:20,655 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 17:07:20,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:07:20,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016709219] [2022-11-25 17:07:20,656 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016709219] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:07:20,657 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:07:20,658 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-25 17:07:20,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550891533] [2022-11-25 17:07:20,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:07:20,660 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 17:07:20,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:07:20,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 17:07:20,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:07:20,670 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 217 [2022-11-25 17:07:20,671 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 20 transitions, 44 flow. Second operand has 3 states, 3 states have (on average 95.66666666666667) internal successors, (287), 3 states have internal predecessors, (287), 0 states have call successors, (0), 0 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 17:07:20,672 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:07:20,673 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 217 [2022-11-25 17:07:20,673 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:07:20,885 INFO L130 PetriNetUnfolder]: 204/383 cut-off events. [2022-11-25 17:07:20,886 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 17:07:20,891 INFO L83 FinitePrefix]: Finished finitePrefix Result has 749 conditions, 383 events. 204/383 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1707 event pairs, 24 based on Foata normal form. 0/342 useless extension candidates. Maximal degree in co-relation 746. Up to 293 conditions per place. [2022-11-25 17:07:20,897 INFO L137 encePairwiseOnDemand]: 214/217 looper letters, 22 selfloop transitions, 2 changer transitions 2/28 dead transitions. [2022-11-25 17:07:20,898 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 28 transitions, 112 flow [2022-11-25 17:07:20,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 17:07:20,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 17:07:20,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 309 transitions. [2022-11-25 17:07:20,907 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.47465437788018433 [2022-11-25 17:07:20,908 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 309 transitions. [2022-11-25 17:07:20,908 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 309 transitions. [2022-11-25 17:07:20,910 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:07:20,911 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 309 transitions. [2022-11-25 17:07:20,914 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 103.0) internal successors, (309), 3 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:07:20,918 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 17:07:20,919 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 17:07:20,919 INFO L175 Difference]: Start difference. First operand has 26 places, 20 transitions, 44 flow. Second operand 3 states and 309 transitions. [2022-11-25 17:07:20,920 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 28 transitions, 112 flow [2022-11-25 17:07:20,920 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 28 transitions, 112 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-25 17:07:20,922 INFO L231 Difference]: Finished difference. Result has 27 places, 18 transitions, 44 flow [2022-11-25 17:07:20,922 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=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=44, PETRI_PLACES=27, PETRI_TRANSITIONS=18} [2022-11-25 17:07:20,923 INFO L288 CegarLoopForPetriNet]: 31 programPoint places, -4 predicate places. [2022-11-25 17:07:20,923 INFO L495 AbstractCegarLoop]: Abstraction has has 27 places, 18 transitions, 44 flow [2022-11-25 17:07:20,924 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 95.66666666666667) internal successors, (287), 3 states have internal predecessors, (287), 0 states have call successors, (0), 0 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 17:07:20,924 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:07:20,925 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:07:20,925 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-25 17:07:20,925 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-11-25 17:07:20,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:07:20,929 INFO L85 PathProgramCache]: Analyzing trace with hash -1131233112, now seen corresponding path program 1 times [2022-11-25 17:07:20,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:07:20,931 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480346736] [2022-11-25 17:07:20,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:07:20,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:07:21,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:07:21,257 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 17:07:21,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:07:21,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480346736] [2022-11-25 17:07:21,258 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480346736] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:07:21,258 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:07:21,258 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 17:07:21,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197050940] [2022-11-25 17:07:21,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:07:21,259 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:07:21,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:07:21,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:07:21,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 17:07:21,285 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 217 [2022-11-25 17:07:21,286 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 18 transitions, 44 flow. Second operand has 4 states, 4 states have (on average 90.0) internal successors, (360), 4 states have internal predecessors, (360), 0 states have call successors, (0), 0 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 17:07:21,286 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:07:21,286 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 217 [2022-11-25 17:07:21,287 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:07:21,555 INFO L130 PetriNetUnfolder]: 321/560 cut-off events. [2022-11-25 17:07:21,556 INFO L131 PetriNetUnfolder]: For 32/32 co-relation queries the response was YES. [2022-11-25 17:07:21,557 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1171 conditions, 560 events. 321/560 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 2218 event pairs, 141 based on Foata normal form. 0/534 useless extension candidates. Maximal degree in co-relation 1167. Up to 401 conditions per place. [2022-11-25 17:07:21,560 INFO L137 encePairwiseOnDemand]: 212/217 looper letters, 36 selfloop transitions, 6 changer transitions 0/42 dead transitions. [2022-11-25 17:07:21,561 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 42 transitions, 184 flow [2022-11-25 17:07:21,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 17:07:21,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-25 17:07:21,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 484 transitions. [2022-11-25 17:07:21,569 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.44608294930875575 [2022-11-25 17:07:21,569 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 484 transitions. [2022-11-25 17:07:21,569 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 484 transitions. [2022-11-25 17:07:21,570 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:07:21,570 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 484 transitions. [2022-11-25 17:07:21,571 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 96.8) internal successors, (484), 5 states have internal predecessors, (484), 0 states have call successors, (0), 0 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 17:07:21,574 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 17:07:21,575 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 17:07:21,576 INFO L175 Difference]: Start difference. First operand has 27 places, 18 transitions, 44 flow. Second operand 5 states and 484 transitions. [2022-11-25 17:07:21,576 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 42 transitions, 184 flow [2022-11-25 17:07:21,577 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 42 transitions, 174 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-25 17:07:21,578 INFO L231 Difference]: Finished difference. Result has 31 places, 23 transitions, 85 flow [2022-11-25 17:07:21,578 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=40, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=85, PETRI_PLACES=31, PETRI_TRANSITIONS=23} [2022-11-25 17:07:21,579 INFO L288 CegarLoopForPetriNet]: 31 programPoint places, 0 predicate places. [2022-11-25 17:07:21,580 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 23 transitions, 85 flow [2022-11-25 17:07:21,580 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 90.0) internal successors, (360), 4 states have internal predecessors, (360), 0 states have call successors, (0), 0 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 17:07:21,580 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:07:21,581 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:07:21,581 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-25 17:07:21,581 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-11-25 17:07:21,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:07:21,582 INFO L85 PathProgramCache]: Analyzing trace with hash -1131233094, now seen corresponding path program 1 times [2022-11-25 17:07:21,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:07:21,583 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708688977] [2022-11-25 17:07:21,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:07:21,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:07:21,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:07:21,987 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 17:07:21,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:07:21,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708688977] [2022-11-25 17:07:21,988 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1708688977] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:07:21,988 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:07:21,988 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 17:07:21,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729764689] [2022-11-25 17:07:21,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:07:21,989 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:07:21,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:07:21,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:07:21,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 17:07:22,112 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 217 [2022-11-25 17:07:22,113 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 23 transitions, 85 flow. Second operand has 4 states, 4 states have (on average 87.0) internal successors, (348), 4 states have internal predecessors, (348), 0 states have call successors, (0), 0 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 17:07:22,113 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:07:22,113 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 217 [2022-11-25 17:07:22,113 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:07:22,267 INFO L130 PetriNetUnfolder]: 167/330 cut-off events. [2022-11-25 17:07:22,268 INFO L131 PetriNetUnfolder]: For 95/95 co-relation queries the response was YES. [2022-11-25 17:07:22,269 INFO L83 FinitePrefix]: Finished finitePrefix Result has 795 conditions, 330 events. 167/330 cut-off events. For 95/95 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1386 event pairs, 80 based on Foata normal form. 44/371 useless extension candidates. Maximal degree in co-relation 788. Up to 297 conditions per place. [2022-11-25 17:07:22,271 INFO L137 encePairwiseOnDemand]: 214/217 looper letters, 17 selfloop transitions, 2 changer transitions 3/25 dead transitions. [2022-11-25 17:07:22,271 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 25 transitions, 131 flow [2022-11-25 17:07:22,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 17:07:22,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-25 17:07:22,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 359 transitions. [2022-11-25 17:07:22,274 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.41359447004608296 [2022-11-25 17:07:22,274 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 359 transitions. [2022-11-25 17:07:22,274 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 359 transitions. [2022-11-25 17:07:22,275 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:07:22,275 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 359 transitions. [2022-11-25 17:07:22,276 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 89.75) internal successors, (359), 4 states have internal predecessors, (359), 0 states have call successors, (0), 0 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 17:07:22,279 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 17:07:22,280 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 17:07:22,280 INFO L175 Difference]: Start difference. First operand has 31 places, 23 transitions, 85 flow. Second operand 4 states and 359 transitions. [2022-11-25 17:07:22,281 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 25 transitions, 131 flow [2022-11-25 17:07:22,285 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 25 transitions, 128 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-25 17:07:22,286 INFO L231 Difference]: Finished difference. Result has 32 places, 19 transitions, 66 flow [2022-11-25 17:07:22,286 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=66, PETRI_PLACES=32, PETRI_TRANSITIONS=19} [2022-11-25 17:07:22,288 INFO L288 CegarLoopForPetriNet]: 31 programPoint places, 1 predicate places. [2022-11-25 17:07:22,288 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 19 transitions, 66 flow [2022-11-25 17:07:22,289 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 87.0) internal successors, (348), 4 states have internal predecessors, (348), 0 states have call successors, (0), 0 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 17:07:22,289 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:07:22,289 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:07:22,290 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-25 17:07:22,290 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-11-25 17:07:22,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:07:22,293 INFO L85 PathProgramCache]: Analyzing trace with hash -178526072, now seen corresponding path program 1 times [2022-11-25 17:07:22,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:07:22,294 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413790683] [2022-11-25 17:07:22,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:07:22,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:07:22,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:07:22,502 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 17:07:22,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:07:22,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413790683] [2022-11-25 17:07:22,503 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413790683] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:07:22,504 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:07:22,504 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 17:07:22,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486163096] [2022-11-25 17:07:22,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:07:22,505 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 17:07:22,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:07:22,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 17:07:22,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:07:22,540 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 217 [2022-11-25 17:07:22,541 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 19 transitions, 66 flow. Second operand has 5 states, 5 states have (on average 90.0) internal successors, (450), 5 states have internal predecessors, (450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:07:22,541 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:07:22,541 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 217 [2022-11-25 17:07:22,541 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:07:22,723 INFO L130 PetriNetUnfolder]: 203/362 cut-off events. [2022-11-25 17:07:22,723 INFO L131 PetriNetUnfolder]: For 162/162 co-relation queries the response was YES. [2022-11-25 17:07:22,724 INFO L83 FinitePrefix]: Finished finitePrefix Result has 894 conditions, 362 events. 203/362 cut-off events. For 162/162 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1257 event pairs, 68 based on Foata normal form. 18/380 useless extension candidates. Maximal degree in co-relation 887. Up to 251 conditions per place. [2022-11-25 17:07:22,727 INFO L137 encePairwiseOnDemand]: 213/217 looper letters, 21 selfloop transitions, 3 changer transitions 10/34 dead transitions. [2022-11-25 17:07:22,727 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 34 transitions, 170 flow [2022-11-25 17:07:22,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 17:07:22,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-25 17:07:22,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 475 transitions. [2022-11-25 17:07:22,729 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4377880184331797 [2022-11-25 17:07:22,730 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 475 transitions. [2022-11-25 17:07:22,730 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 475 transitions. [2022-11-25 17:07:22,730 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:07:22,731 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 475 transitions. [2022-11-25 17:07:22,732 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 95.0) internal successors, (475), 5 states have internal predecessors, (475), 0 states have call successors, (0), 0 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 17:07:22,735 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 17:07:22,736 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 17:07:22,736 INFO L175 Difference]: Start difference. First operand has 32 places, 19 transitions, 66 flow. Second operand 5 states and 475 transitions. [2022-11-25 17:07:22,736 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 34 transitions, 170 flow [2022-11-25 17:07:22,738 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 34 transitions, 161 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-11-25 17:07:22,739 INFO L231 Difference]: Finished difference. Result has 34 places, 19 transitions, 74 flow [2022-11-25 17:07:22,740 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=59, 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=5, PETRI_FLOW=74, PETRI_PLACES=34, PETRI_TRANSITIONS=19} [2022-11-25 17:07:22,740 INFO L288 CegarLoopForPetriNet]: 31 programPoint places, 3 predicate places. [2022-11-25 17:07:22,741 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 19 transitions, 74 flow [2022-11-25 17:07:22,741 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 90.0) internal successors, (450), 5 states have internal predecessors, (450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:07:22,742 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:07:22,742 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:07:22,742 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-25 17:07:22,742 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-11-25 17:07:22,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:07:22,743 INFO L85 PathProgramCache]: Analyzing trace with hash -1946553925, now seen corresponding path program 1 times [2022-11-25 17:07:22,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:07:22,744 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666608967] [2022-11-25 17:07:22,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:07:22,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:07:22,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:07:23,050 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 17:07:23,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:07:23,051 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666608967] [2022-11-25 17:07:23,051 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666608967] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:07:23,051 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:07:23,051 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 17:07:23,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111128762] [2022-11-25 17:07:23,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:07:23,058 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 17:07:23,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:07:23,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 17:07:23,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:07:23,095 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 217 [2022-11-25 17:07:23,096 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 19 transitions, 74 flow. Second operand has 5 states, 5 states have (on average 90.0) internal successors, (450), 5 states have internal predecessors, (450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:07:23,096 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:07:23,097 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 217 [2022-11-25 17:07:23,097 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:07:23,307 INFO L130 PetriNetUnfolder]: 179/324 cut-off events. [2022-11-25 17:07:23,307 INFO L131 PetriNetUnfolder]: For 253/253 co-relation queries the response was YES. [2022-11-25 17:07:23,309 INFO L83 FinitePrefix]: Finished finitePrefix Result has 837 conditions, 324 events. 179/324 cut-off events. For 253/253 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1095 event pairs, 97 based on Foata normal form. 20/344 useless extension candidates. Maximal degree in co-relation 828. Up to 206 conditions per place. [2022-11-25 17:07:23,311 INFO L137 encePairwiseOnDemand]: 213/217 looper letters, 24 selfloop transitions, 3 changer transitions 11/38 dead transitions. [2022-11-25 17:07:23,312 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 38 transitions, 199 flow [2022-11-25 17:07:23,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 17:07:23,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-25 17:07:23,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 479 transitions. [2022-11-25 17:07:23,315 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4414746543778802 [2022-11-25 17:07:23,315 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 479 transitions. [2022-11-25 17:07:23,315 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 479 transitions. [2022-11-25 17:07:23,316 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:07:23,316 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 479 transitions. [2022-11-25 17:07:23,319 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 95.8) internal successors, (479), 5 states have internal predecessors, (479), 0 states have call successors, (0), 0 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 17:07:23,321 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 17:07:23,322 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 17:07:23,322 INFO L175 Difference]: Start difference. First operand has 34 places, 19 transitions, 74 flow. Second operand 5 states and 479 transitions. [2022-11-25 17:07:23,323 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 38 transitions, 199 flow [2022-11-25 17:07:23,326 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 38 transitions, 185 flow, removed 4 selfloop flow, removed 4 redundant places. [2022-11-25 17:07:23,327 INFO L231 Difference]: Finished difference. Result has 35 places, 19 transitions, 77 flow [2022-11-25 17:07:23,328 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=28, 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=5, PETRI_FLOW=77, PETRI_PLACES=35, PETRI_TRANSITIONS=19} [2022-11-25 17:07:23,331 INFO L288 CegarLoopForPetriNet]: 31 programPoint places, 4 predicate places. [2022-11-25 17:07:23,331 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 19 transitions, 77 flow [2022-11-25 17:07:23,331 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 90.0) internal successors, (450), 5 states have internal predecessors, (450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:07:23,332 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:07:23,332 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:07:23,332 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-25 17:07:23,332 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-11-25 17:07:23,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:07:23,333 INFO L85 PathProgramCache]: Analyzing trace with hash -868289063, now seen corresponding path program 1 times [2022-11-25 17:07:23,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:07:23,334 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256828718] [2022-11-25 17:07:23,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:07:23,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:07:23,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:07:23,559 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 17:07:23,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:07:23,560 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256828718] [2022-11-25 17:07:23,560 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256828718] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:07:23,560 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:07:23,560 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 17:07:23,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701053942] [2022-11-25 17:07:23,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:07:23,561 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 17:07:23,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:07:23,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 17:07:23,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:07:23,569 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 217 [2022-11-25 17:07:23,570 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 19 transitions, 77 flow. Second operand has 3 states, 3 states have (on average 95.66666666666667) internal successors, (287), 3 states have internal predecessors, (287), 0 states have call successors, (0), 0 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 17:07:23,570 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:07:23,570 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 217 [2022-11-25 17:07:23,571 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:07:23,655 INFO L130 PetriNetUnfolder]: 41/107 cut-off events. [2022-11-25 17:07:23,655 INFO L131 PetriNetUnfolder]: For 39/39 co-relation queries the response was YES. [2022-11-25 17:07:23,656 INFO L83 FinitePrefix]: Finished finitePrefix Result has 286 conditions, 107 events. 41/107 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 307 event pairs, 14 based on Foata normal form. 14/120 useless extension candidates. Maximal degree in co-relation 276. Up to 70 conditions per place. [2022-11-25 17:07:23,657 INFO L137 encePairwiseOnDemand]: 213/217 looper letters, 22 selfloop transitions, 3 changer transitions 0/28 dead transitions. [2022-11-25 17:07:23,657 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 28 transitions, 151 flow [2022-11-25 17:07:23,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 17:07:23,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 17:07:23,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 301 transitions. [2022-11-25 17:07:23,659 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.46236559139784944 [2022-11-25 17:07:23,659 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 301 transitions. [2022-11-25 17:07:23,660 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 301 transitions. [2022-11-25 17:07:23,660 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:07:23,660 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 301 transitions. [2022-11-25 17:07:23,661 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 100.33333333333333) internal successors, (301), 3 states have internal predecessors, (301), 0 states have call successors, (0), 0 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 17:07:23,663 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 17:07:23,663 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 17:07:23,664 INFO L175 Difference]: Start difference. First operand has 35 places, 19 transitions, 77 flow. Second operand 3 states and 301 transitions. [2022-11-25 17:07:23,664 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 28 transitions, 151 flow [2022-11-25 17:07:23,668 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 28 transitions, 139 flow, removed 3 selfloop flow, removed 5 redundant places. [2022-11-25 17:07:23,669 INFO L231 Difference]: Finished difference. Result has 31 places, 21 transitions, 84 flow [2022-11-25 17:07:23,670 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=65, 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=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=84, PETRI_PLACES=31, PETRI_TRANSITIONS=21} [2022-11-25 17:07:23,671 INFO L288 CegarLoopForPetriNet]: 31 programPoint places, 0 predicate places. [2022-11-25 17:07:23,671 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 21 transitions, 84 flow [2022-11-25 17:07:23,672 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 95.66666666666667) internal successors, (287), 3 states have internal predecessors, (287), 0 states have call successors, (0), 0 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 17:07:23,672 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:07:23,672 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:07:23,672 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-25 17:07:23,673 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-11-25 17:07:23,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:07:23,674 INFO L85 PathProgramCache]: Analyzing trace with hash -657824736, now seen corresponding path program 1 times [2022-11-25 17:07:23,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:07:23,674 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964701546] [2022-11-25 17:07:23,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:07:23,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:07:23,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:07:24,075 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 17:07:24,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:07:24,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964701546] [2022-11-25 17:07:24,076 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [964701546] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:07:24,076 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:07:24,077 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 17:07:24,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440357526] [2022-11-25 17:07:24,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:07:24,078 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:07:24,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:07:24,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:07:24,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 17:07:24,091 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 217 [2022-11-25 17:07:24,092 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 21 transitions, 84 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 17:07:24,092 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:07:24,093 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 217 [2022-11-25 17:07:24,093 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:07:24,186 INFO L130 PetriNetUnfolder]: 19/61 cut-off events. [2022-11-25 17:07:24,186 INFO L131 PetriNetUnfolder]: For 8/8 co-relation queries the response was YES. [2022-11-25 17:07:24,186 INFO L83 FinitePrefix]: Finished finitePrefix Result has 181 conditions, 61 events. 19/61 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 140 event pairs, 10 based on Foata normal form. 8/68 useless extension candidates. Maximal degree in co-relation 173. Up to 31 conditions per place. [2022-11-25 17:07:24,187 INFO L137 encePairwiseOnDemand]: 213/217 looper letters, 20 selfloop transitions, 5 changer transitions 0/28 dead transitions. [2022-11-25 17:07:24,187 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 28 transitions, 154 flow [2022-11-25 17:07:24,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 17:07:24,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-25 17:07:24,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 393 transitions. [2022-11-25 17:07:24,190 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.45276497695852536 [2022-11-25 17:07:24,190 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 393 transitions. [2022-11-25 17:07:24,190 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 393 transitions. [2022-11-25 17:07:24,191 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:07:24,191 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 393 transitions. [2022-11-25 17:07:24,192 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 98.25) internal successors, (393), 4 states have internal predecessors, (393), 0 states have call successors, (0), 0 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 17:07:24,194 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 17:07:24,195 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 17:07:24,195 INFO L175 Difference]: Start difference. First operand has 31 places, 21 transitions, 84 flow. Second operand 4 states and 393 transitions. [2022-11-25 17:07:24,195 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 28 transitions, 154 flow [2022-11-25 17:07:24,196 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 28 transitions, 138 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-11-25 17:07:24,197 INFO L231 Difference]: Finished difference. Result has 32 places, 21 transitions, 85 flow [2022-11-25 17:07:24,197 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=69, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=85, PETRI_PLACES=32, PETRI_TRANSITIONS=21} [2022-11-25 17:07:24,198 INFO L288 CegarLoopForPetriNet]: 31 programPoint places, 1 predicate places. [2022-11-25 17:07:24,198 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 21 transitions, 85 flow [2022-11-25 17:07:24,199 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 17:07:24,199 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:07:24,199 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 17:07:24,199 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-25 17:07:24,200 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-11-25 17:07:24,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:07:24,200 INFO L85 PathProgramCache]: Analyzing trace with hash -220581578, now seen corresponding path program 1 times [2022-11-25 17:07:24,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:07:24,201 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406675895] [2022-11-25 17:07:24,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:07:24,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:07:24,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:07:24,636 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 17:07:24,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:07:24,636 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406675895] [2022-11-25 17:07:24,642 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [406675895] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:07:24,643 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:07:24,643 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 17:07:24,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330844117] [2022-11-25 17:07:24,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:07:24,645 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 17:07:24,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:07:24,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 17:07:24,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:07:24,675 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 217 [2022-11-25 17:07:24,676 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 21 transitions, 85 flow. Second operand has 5 states, 5 states have (on average 89.4) internal successors, (447), 5 states have internal predecessors, (447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:07:24,676 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:07:24,676 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 217 [2022-11-25 17:07:24,677 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:07:24,888 INFO L130 PetriNetUnfolder]: 33/93 cut-off events. [2022-11-25 17:07:24,888 INFO L131 PetriNetUnfolder]: For 74/74 co-relation queries the response was YES. [2022-11-25 17:07:24,889 INFO L83 FinitePrefix]: Finished finitePrefix Result has 277 conditions, 93 events. 33/93 cut-off events. For 74/74 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 255 event pairs, 2 based on Foata normal form. 1/94 useless extension candidates. Maximal degree in co-relation 270. Up to 59 conditions per place. [2022-11-25 17:07:24,889 INFO L137 encePairwiseOnDemand]: 209/217 looper letters, 27 selfloop transitions, 9 changer transitions 6/42 dead transitions. [2022-11-25 17:07:24,889 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 42 transitions, 250 flow [2022-11-25 17:07:24,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 17:07:24,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-25 17:07:24,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 554 transitions. [2022-11-25 17:07:24,893 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4254992319508449 [2022-11-25 17:07:24,893 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 554 transitions. [2022-11-25 17:07:24,893 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 554 transitions. [2022-11-25 17:07:24,894 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:07:24,894 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 554 transitions. [2022-11-25 17:07:24,895 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 92.33333333333333) internal successors, (554), 6 states have internal predecessors, (554), 0 states have call successors, (0), 0 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 17:07:24,898 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 217.0) internal successors, (1519), 7 states have internal predecessors, (1519), 0 states have call successors, (0), 0 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 17:07:24,899 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 217.0) internal successors, (1519), 7 states have internal predecessors, (1519), 0 states have call successors, (0), 0 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 17:07:24,899 INFO L175 Difference]: Start difference. First operand has 32 places, 21 transitions, 85 flow. Second operand 6 states and 554 transitions. [2022-11-25 17:07:24,899 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 42 transitions, 250 flow [2022-11-25 17:07:24,900 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 42 transitions, 231 flow, removed 4 selfloop flow, removed 2 redundant places. [2022-11-25 17:07:24,901 INFO L231 Difference]: Finished difference. Result has 38 places, 26 transitions, 129 flow [2022-11-25 17:07:24,901 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=75, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=129, PETRI_PLACES=38, PETRI_TRANSITIONS=26} [2022-11-25 17:07:24,902 INFO L288 CegarLoopForPetriNet]: 31 programPoint places, 7 predicate places. [2022-11-25 17:07:24,902 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 26 transitions, 129 flow [2022-11-25 17:07:24,903 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 89.4) internal successors, (447), 5 states have internal predecessors, (447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:07:24,903 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:07:24,903 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 17:07:24,903 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-25 17:07:24,904 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-11-25 17:07:24,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:07:24,904 INFO L85 PathProgramCache]: Analyzing trace with hash 997448498, now seen corresponding path program 2 times [2022-11-25 17:07:24,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:07:24,905 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281474155] [2022-11-25 17:07:24,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:07:24,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:07:24,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:07:25,229 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 17:07:25,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:07:25,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281474155] [2022-11-25 17:07:25,230 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [281474155] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:07:25,231 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:07:25,231 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 17:07:25,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026273223] [2022-11-25 17:07:25,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:07:25,233 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 17:07:25,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:07:25,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 17:07:25,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-25 17:07:25,275 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 217 [2022-11-25 17:07:25,276 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 26 transitions, 129 flow. Second operand has 6 states, 6 states have (on average 88.83333333333333) internal successors, (533), 6 states have internal predecessors, (533), 0 states have call successors, (0), 0 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 17:07:25,277 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:07:25,277 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 217 [2022-11-25 17:07:25,277 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:07:25,480 INFO L130 PetriNetUnfolder]: 36/107 cut-off events. [2022-11-25 17:07:25,482 INFO L131 PetriNetUnfolder]: For 94/94 co-relation queries the response was YES. [2022-11-25 17:07:25,482 INFO L83 FinitePrefix]: Finished finitePrefix Result has 370 conditions, 107 events. 36/107 cut-off events. For 94/94 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 333 event pairs, 7 based on Foata normal form. 1/108 useless extension candidates. Maximal degree in co-relation 360. Up to 53 conditions per place. [2022-11-25 17:07:25,483 INFO L137 encePairwiseOnDemand]: 210/217 looper letters, 18 selfloop transitions, 3 changer transitions 22/43 dead transitions. [2022-11-25 17:07:25,483 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 43 transitions, 279 flow [2022-11-25 17:07:25,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 17:07:25,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-25 17:07:25,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 641 transitions. [2022-11-25 17:07:25,487 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4219881500987492 [2022-11-25 17:07:25,487 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 641 transitions. [2022-11-25 17:07:25,487 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 641 transitions. [2022-11-25 17:07:25,488 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:07:25,488 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 641 transitions. [2022-11-25 17:07:25,490 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 91.57142857142857) internal successors, (641), 7 states have internal predecessors, (641), 0 states have call successors, (0), 0 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 17:07:25,494 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 217.0) internal successors, (1736), 8 states have internal predecessors, (1736), 0 states have call successors, (0), 0 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 17:07:25,495 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 217.0) internal successors, (1736), 8 states have internal predecessors, (1736), 0 states have call successors, (0), 0 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 17:07:25,495 INFO L175 Difference]: Start difference. First operand has 38 places, 26 transitions, 129 flow. Second operand 7 states and 641 transitions. [2022-11-25 17:07:25,495 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 43 transitions, 279 flow [2022-11-25 17:07:25,497 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 43 transitions, 277 flow, removed 1 selfloop flow, removed 1 redundant places. [2022-11-25 17:07:25,497 INFO L231 Difference]: Finished difference. Result has 44 places, 19 transitions, 92 flow [2022-11-25 17:07:25,498 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=127, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=92, PETRI_PLACES=44, PETRI_TRANSITIONS=19} [2022-11-25 17:07:25,498 INFO L288 CegarLoopForPetriNet]: 31 programPoint places, 13 predicate places. [2022-11-25 17:07:25,498 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 19 transitions, 92 flow [2022-11-25 17:07:25,499 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 88.83333333333333) internal successors, (533), 6 states have internal predecessors, (533), 0 states have call successors, (0), 0 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 17:07:25,499 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:07:25,499 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 17:07:25,499 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-25 17:07:25,500 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-11-25 17:07:25,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:07:25,500 INFO L85 PathProgramCache]: Analyzing trace with hash -432308646, now seen corresponding path program 3 times [2022-11-25 17:07:25,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:07:25,500 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749111079] [2022-11-25 17:07:25,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:07:25,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:07:25,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:07:27,261 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 17:07:27,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:07:27,262 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749111079] [2022-11-25 17:07:27,262 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749111079] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:07:27,262 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:07:27,262 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 17:07:27,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838016008] [2022-11-25 17:07:27,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:07:27,263 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-25 17:07:27,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:07:27,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-25 17:07:27,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-25 17:07:27,473 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 217 [2022-11-25 17:07:27,475 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 19 transitions, 92 flow. Second operand has 8 states, 8 states have (on average 87.875) internal successors, (703), 8 states have internal predecessors, (703), 0 states have call successors, (0), 0 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 17:07:27,477 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:07:27,477 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 217 [2022-11-25 17:07:27,478 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:07:28,040 INFO L130 PetriNetUnfolder]: 6/40 cut-off events. [2022-11-25 17:07:28,040 INFO L131 PetriNetUnfolder]: For 42/44 co-relation queries the response was YES. [2022-11-25 17:07:28,040 INFO L83 FinitePrefix]: Finished finitePrefix Result has 147 conditions, 40 events. 6/40 cut-off events. For 42/44 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 72 event pairs, 0 based on Foata normal form. 1/41 useless extension candidates. Maximal degree in co-relation 135. Up to 13 conditions per place. [2022-11-25 17:07:28,041 INFO L137 encePairwiseOnDemand]: 209/217 looper letters, 13 selfloop transitions, 5 changer transitions 9/29 dead transitions. [2022-11-25 17:07:28,041 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 29 transitions, 197 flow [2022-11-25 17:07:28,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-25 17:07:28,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-25 17:07:28,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 798 transitions. [2022-11-25 17:07:28,044 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.40860215053763443 [2022-11-25 17:07:28,045 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 798 transitions. [2022-11-25 17:07:28,045 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 798 transitions. [2022-11-25 17:07:28,045 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:07:28,046 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 798 transitions. [2022-11-25 17:07:28,048 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 88.66666666666667) internal successors, (798), 9 states have internal predecessors, (798), 0 states have call successors, (0), 0 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 17:07:28,051 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 217.0) internal successors, (2170), 10 states have internal predecessors, (2170), 0 states have call successors, (0), 0 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 17:07:28,052 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 217.0) internal successors, (2170), 10 states have internal predecessors, (2170), 0 states have call successors, (0), 0 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 17:07:28,052 INFO L175 Difference]: Start difference. First operand has 44 places, 19 transitions, 92 flow. Second operand 9 states and 798 transitions. [2022-11-25 17:07:28,052 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 29 transitions, 197 flow [2022-11-25 17:07:28,054 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 29 transitions, 167 flow, removed 9 selfloop flow, removed 8 redundant places. [2022-11-25 17:07:28,054 INFO L231 Difference]: Finished difference. Result has 43 places, 19 transitions, 87 flow [2022-11-25 17:07:28,055 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=69, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=87, PETRI_PLACES=43, PETRI_TRANSITIONS=19} [2022-11-25 17:07:28,055 INFO L288 CegarLoopForPetriNet]: 31 programPoint places, 12 predicate places. [2022-11-25 17:07:28,055 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 19 transitions, 87 flow [2022-11-25 17:07:28,056 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 87.875) internal successors, (703), 8 states have internal predecessors, (703), 0 states have call successors, (0), 0 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 17:07:28,056 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:07:28,056 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 17:07:28,057 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-25 17:07:28,057 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-11-25 17:07:28,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:07:28,058 INFO L85 PathProgramCache]: Analyzing trace with hash 71823462, now seen corresponding path program 4 times [2022-11-25 17:07:28,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:07:28,058 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933018362] [2022-11-25 17:07:28,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:07:28,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:07:28,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 17:07:28,111 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 17:07:28,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 17:07:28,183 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 17:07:28,184 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-11-25 17:07:28,185 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK (9 of 10 remaining) [2022-11-25 17:07:28,187 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (8 of 10 remaining) [2022-11-25 17:07:28,188 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 10 remaining) [2022-11-25 17:07:28,188 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 10 remaining) [2022-11-25 17:07:28,188 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 10 remaining) [2022-11-25 17:07:28,188 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 10 remaining) [2022-11-25 17:07:28,189 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK (3 of 10 remaining) [2022-11-25 17:07:28,189 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 10 remaining) [2022-11-25 17:07:28,189 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 10 remaining) [2022-11-25 17:07:28,189 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 10 remaining) [2022-11-25 17:07:28,190 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-25 17:07:28,190 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:07:28,197 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-25 17:07:28,197 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-25 17:07:28,268 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 05:07:28 BasicIcfg [2022-11-25 17:07:28,274 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-25 17:07:28,275 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-25 17:07:28,275 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-25 17:07:28,275 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-25 17:07:28,276 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:07:13" (3/4) ... [2022-11-25 17:07:28,279 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-25 17:07:28,280 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-25 17:07:28,281 INFO L158 Benchmark]: Toolchain (without parser) took 16664.95ms. Allocated memory was 205.5MB in the beginning and 297.8MB in the end (delta: 92.3MB). Free memory was 170.7MB in the beginning and 144.0MB in the end (delta: 26.7MB). Peak memory consumption was 122.1MB. Max. memory is 16.1GB. [2022-11-25 17:07:28,281 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 136.3MB. Free memory was 78.2MB in the beginning and 78.2MB in the end (delta: 26.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 17:07:28,281 INFO L158 Benchmark]: CACSL2BoogieTranslator took 810.58ms. Allocated memory is still 205.5MB. Free memory was 170.7MB in the beginning and 144.5MB in the end (delta: 26.2MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2022-11-25 17:07:28,282 INFO L158 Benchmark]: Boogie Procedure Inliner took 75.49ms. Allocated memory is still 205.5MB. Free memory was 144.5MB in the beginning and 141.4MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 17:07:28,282 INFO L158 Benchmark]: Boogie Preprocessor took 34.70ms. Allocated memory is still 205.5MB. Free memory was 141.4MB in the beginning and 140.3MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 17:07:28,283 INFO L158 Benchmark]: RCFGBuilder took 1004.37ms. Allocated memory is still 205.5MB. Free memory was 139.3MB in the beginning and 103.7MB in the end (delta: 35.7MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. [2022-11-25 17:07:28,283 INFO L158 Benchmark]: TraceAbstraction took 14718.38ms. Allocated memory was 205.5MB in the beginning and 297.8MB in the end (delta: 92.3MB). Free memory was 102.6MB in the beginning and 144.0MB in the end (delta: -41.4MB). Peak memory consumption was 52.9MB. Max. memory is 16.1GB. [2022-11-25 17:07:28,284 INFO L158 Benchmark]: Witness Printer took 5.42ms. Allocated memory is still 297.8MB. Free memory is still 144.0MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 17:07:28,286 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.26ms. Allocated memory is still 136.3MB. Free memory was 78.2MB in the beginning and 78.2MB in the end (delta: 26.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 810.58ms. Allocated memory is still 205.5MB. Free memory was 170.7MB in the beginning and 144.5MB in the end (delta: 26.2MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 75.49ms. Allocated memory is still 205.5MB. Free memory was 144.5MB in the beginning and 141.4MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 34.70ms. Allocated memory is still 205.5MB. Free memory was 141.4MB in the beginning and 140.3MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1004.37ms. Allocated memory is still 205.5MB. Free memory was 139.3MB in the beginning and 103.7MB in the end (delta: 35.7MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. * TraceAbstraction took 14718.38ms. Allocated memory was 205.5MB in the beginning and 297.8MB in the end (delta: 92.3MB). Free memory was 102.6MB in the beginning and 144.0MB in the end (delta: -41.4MB). Peak memory consumption was 52.9MB. Max. memory is 16.1GB. * Witness Printer took 5.42ms. Allocated memory is still 297.8MB. Free memory is still 144.0MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.7s, 109 PlacesBefore, 31 PlacesAfterwards, 104 TransitionsBefore, 25 TransitionsAfterwards, 1340 CoEnabledTransitionPairs, 7 FixpointIterations, 51 TrivialSequentialCompositions, 53 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 1 ChoiceCompositions, 111 TotalNumberOfCompositions, 3638 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1805, independent: 1668, independent conditional: 0, independent unconditional: 1668, dependent: 137, dependent conditional: 0, dependent unconditional: 137, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 951, independent: 913, independent conditional: 0, independent unconditional: 913, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 951, independent: 901, independent conditional: 0, independent unconditional: 901, dependent: 50, dependent conditional: 0, dependent unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 50, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 446, independent: 18, independent conditional: 0, independent unconditional: 18, dependent: 428, dependent conditional: 0, dependent unconditional: 428, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1805, independent: 755, independent conditional: 0, independent unconditional: 755, dependent: 99, dependent conditional: 0, dependent unconditional: 99, unknown: 951, unknown conditional: 0, unknown unconditional: 951] , Statistics on independence cache: Total cache size (in pairs): 100, Positive cache size: 85, Positive conditional cache size: 0, Positive unconditional cache size: 85, Negative cache size: 15, Negative conditional cache size: 0, Negative unconditional cache size: 15, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 19]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 19. Possible FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p0_EBX = 0; [L715] 0 int __unbuffered_p1_EAX = 0; [L717] 0 int __unbuffered_p1_EBX = 0; [L718] 0 _Bool main$tmp_guard0; [L719] 0 _Bool main$tmp_guard1; [L721] 0 int x = 0; [L723] 0 int y = 0; [L724] 0 _Bool y$flush_delayed; [L725] 0 int y$mem_tmp; [L726] 0 _Bool y$r_buff0_thd0; [L727] 0 _Bool y$r_buff0_thd1; [L728] 0 _Bool y$r_buff0_thd2; [L729] 0 _Bool y$r_buff1_thd0; [L730] 0 _Bool y$r_buff1_thd1; [L731] 0 _Bool y$r_buff1_thd2; [L732] 0 _Bool y$read_delayed; [L733] 0 int *y$read_delayed_var; [L734] 0 int y$w_buff0; [L735] 0 _Bool y$w_buff0_used; [L736] 0 int y$w_buff1; [L737] 0 _Bool y$w_buff1_used; [L738] 0 _Bool weak$$choice0; [L739] 0 _Bool weak$$choice2; [L826] 0 pthread_t t1723; [L827] FCALL, FORK 0 pthread_create(&t1723, ((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, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1723, ((void *)0), P0, ((void *)0))=0, t1723={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L828] 0 pthread_t t1724; [L829] FCALL, FORK 0 pthread_create(&t1724, ((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, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1724, ((void *)0), P1, ((void *)0))=1, t1723={5:0}, t1724={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L774] 2 y$w_buff1 = y$w_buff0 [L775] 2 y$w_buff0 = 1 [L776] 2 y$w_buff1_used = y$w_buff0_used [L777] 2 y$w_buff0_used = (_Bool)1 [L778] CALL 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L778] RET 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L779] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L780] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L781] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L782] 2 y$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L785] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L786] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L787] 2 y$flush_delayed = weak$$choice2 [L788] 2 y$mem_tmp = y [L789] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L790] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L791] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L792] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L793] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L794] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L795] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L796] 2 __unbuffered_p1_EAX = y [L797] 2 y = y$flush_delayed ? y$mem_tmp : y [L798] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L801] 2 __unbuffered_p1_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L743] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L746] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L749] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L750] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L751] 1 y$flush_delayed = weak$$choice2 [L752] 1 y$mem_tmp = y [L753] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L754] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L755] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L756] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L757] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L758] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L759] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L760] 1 __unbuffered_p0_EBX = y [L761] 1 y = y$flush_delayed ? y$mem_tmp : y [L762] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L804] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L805] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L806] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L807] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L808] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L811] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L813] 2 return 0; [L767] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L769] 1 return 0; [L831] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L833] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) VAL [\old(cond)=1, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L833] RET 0 assume_abort_if_not(main$tmp_guard0) [L835] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L836] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L837] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L838] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L839] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1723={5:0}, t1724={3:0}, weak$$choice0=49, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L842] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) [L844] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 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, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - UnprovableResult [Line: 19]: 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: 824]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 829]: 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: 827]: 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, 125 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: 14.4s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 3.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.9s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 435 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 298 mSDsluCounter, 301 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 233 mSDsCounter, 53 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 974 IncrementalHoareTripleChecker+Invalid, 1027 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 53 mSolverCounterUnsat, 68 mSDtfsCounter, 974 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 45 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=129occurred in iteration=9, InterpolantAutomatonStates: 53, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 4.3s InterpolantComputationTime, 136 NumberOfCodeBlocks, 136 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 108 ConstructedInterpolants, 0 QuantifiedInterpolants, 931 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-11-25 17:07:28,324 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19c6198e-24fd-408a-a3f9-94ea17ed2144/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally 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_19c6198e-24fd-408a-a3f9-94ea17ed2144/bin/uautomizer-ZsLfNo2U6R/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19c6198e-24fd-408a-a3f9-94ea17ed2144/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_19c6198e-24fd-408a-a3f9-94ea17ed2144/bin/uautomizer-ZsLfNo2U6R/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19c6198e-24fd-408a-a3f9-94ea17ed2144/bin/uautomizer-ZsLfNo2U6R/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/rfi008.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19c6198e-24fd-408a-a3f9-94ea17ed2144/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_19c6198e-24fd-408a-a3f9-94ea17ed2144/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 0d082f4414248fc35e1fa616a9787901263e0e45c6e6a28545f00aa25d14032e --- 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 17:07:31,199 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 17:07:31,202 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 17:07:31,248 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 17:07:31,249 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 17:07:31,253 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 17:07:31,256 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 17:07:31,263 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 17:07:31,266 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 17:07:31,272 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 17:07:31,273 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 17:07:31,275 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 17:07:31,276 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 17:07:31,278 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 17:07:31,280 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 17:07:31,285 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 17:07:31,289 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 17:07:31,291 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 17:07:31,292 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 17:07:31,295 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 17:07:31,300 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 17:07:31,302 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 17:07:31,306 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 17:07:31,307 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 17:07:31,314 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 17:07:31,320 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 17:07:31,320 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 17:07:31,322 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 17:07:31,323 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 17:07:31,325 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 17:07:31,326 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 17:07:31,327 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 17:07:31,329 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 17:07:31,330 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 17:07:31,332 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 17:07:31,333 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 17:07:31,334 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 17:07:31,334 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 17:07:31,335 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 17:07:31,336 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 17:07:31,337 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 17:07:31,342 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19c6198e-24fd-408a-a3f9-94ea17ed2144/bin/uautomizer-ZsLfNo2U6R/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-11-25 17:07:31,389 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 17:07:31,389 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 17:07:31,390 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 17:07:31,390 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 17:07:31,391 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 17:07:31,391 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 17:07:31,392 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 17:07:31,392 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 17:07:31,392 INFO L138 SettingsManager]: * Use SBE=true [2022-11-25 17:07:31,393 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 17:07:31,393 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 17:07:31,393 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-25 17:07:31,393 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 17:07:31,394 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 17:07:31,394 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 17:07:31,394 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-25 17:07:31,394 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-25 17:07:31,395 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-25 17:07:31,395 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 17:07:31,395 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-25 17:07:31,395 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-25 17:07:31,396 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-25 17:07:31,396 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 17:07:31,396 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 17:07:31,396 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 17:07:31,397 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-25 17:07:31,397 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 17:07:31,397 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 17:07:31,398 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 17:07:31,398 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 17:07:31,398 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-11-25 17:07:31,398 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-25 17:07:31,399 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-25 17:07:31,399 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-25 17:07:31,399 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-25 17:07:31,399 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2022-11-25 17:07:31,399 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_19c6198e-24fd-408a-a3f9-94ea17ed2144/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_19c6198e-24fd-408a-a3f9-94ea17ed2144/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 -> 0d082f4414248fc35e1fa616a9787901263e0e45c6e6a28545f00aa25d14032e [2022-11-25 17:07:31,857 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 17:07:31,891 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 17:07:31,896 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 17:07:31,898 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 17:07:31,898 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 17:07:31,900 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19c6198e-24fd-408a-a3f9-94ea17ed2144/bin/uautomizer-ZsLfNo2U6R/../../sv-benchmarks/c/pthread-wmm/rfi008.opt.i [2022-11-25 17:07:35,375 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 17:07:35,678 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 17:07:35,679 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19c6198e-24fd-408a-a3f9-94ea17ed2144/sv-benchmarks/c/pthread-wmm/rfi008.opt.i [2022-11-25 17:07:35,695 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19c6198e-24fd-408a-a3f9-94ea17ed2144/bin/uautomizer-ZsLfNo2U6R/data/a23199861/86144ea90608478e8d1b605558d4fc51/FLAGa33c16dd7 [2022-11-25 17:07:35,711 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19c6198e-24fd-408a-a3f9-94ea17ed2144/bin/uautomizer-ZsLfNo2U6R/data/a23199861/86144ea90608478e8d1b605558d4fc51 [2022-11-25 17:07:35,713 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 17:07:35,715 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 17:07:35,716 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 17:07:35,717 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 17:07:35,720 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 17:07:35,721 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 05:07:35" (1/1) ... [2022-11-25 17:07:35,723 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37e55848 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:07:35, skipping insertion in model container [2022-11-25 17:07:35,723 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 05:07:35" (1/1) ... [2022-11-25 17:07:35,731 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 17:07:35,778 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 17:07:35,993 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_19c6198e-24fd-408a-a3f9-94ea17ed2144/sv-benchmarks/c/pthread-wmm/rfi008.opt.i[987,1000] [2022-11-25 17:07:36,253 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:07:36,254 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:07:36,254 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:07:36,255 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:07:36,255 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:07:36,263 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:07:36,263 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:07:36,264 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:07:36,264 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:07:36,264 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:07:36,266 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:07:36,268 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:07:36,268 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:07:36,275 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:07:36,275 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:07:36,276 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:07:36,276 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:07:36,278 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:07:36,279 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:07:36,279 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:07:36,285 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:07:36,285 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:07:36,286 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:07:36,288 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:07:36,288 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:07:36,289 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:07:36,290 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 17:07:36,309 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 17:07:36,323 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_19c6198e-24fd-408a-a3f9-94ea17ed2144/sv-benchmarks/c/pthread-wmm/rfi008.opt.i[987,1000] [2022-11-25 17:07:36,367 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:07:36,367 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:07:36,368 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:07:36,368 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:07:36,369 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:07:36,383 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:07:36,388 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:07:36,388 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:07:36,388 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:07:36,389 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:07:36,390 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:07:36,391 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:07:36,393 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:07:36,398 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:07:36,403 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:07:36,403 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:07:36,404 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:07:36,405 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:07:36,406 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:07:36,406 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:07:36,411 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:07:36,412 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:07:36,412 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:07:36,416 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:07:36,417 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:07:36,421 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:07:36,424 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 17:07:36,476 INFO L208 MainTranslator]: Completed translation [2022-11-25 17:07:36,477 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:07:36 WrapperNode [2022-11-25 17:07:36,478 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 17:07:36,479 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 17:07:36,479 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 17:07:36,480 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 17:07:36,487 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:07:36" (1/1) ... [2022-11-25 17:07:36,518 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:07:36" (1/1) ... [2022-11-25 17:07:36,555 INFO L138 Inliner]: procedures = 178, calls = 45, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 134 [2022-11-25 17:07:36,556 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 17:07:36,557 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 17:07:36,557 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 17:07:36,557 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 17:07:36,566 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:07:36" (1/1) ... [2022-11-25 17:07:36,567 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:07:36" (1/1) ... [2022-11-25 17:07:36,573 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:07:36" (1/1) ... [2022-11-25 17:07:36,573 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:07:36" (1/1) ... [2022-11-25 17:07:36,583 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:07:36" (1/1) ... [2022-11-25 17:07:36,590 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:07:36" (1/1) ... [2022-11-25 17:07:36,593 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:07:36" (1/1) ... [2022-11-25 17:07:36,594 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:07:36" (1/1) ... [2022-11-25 17:07:36,598 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 17:07:36,613 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 17:07:36,613 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 17:07:36,613 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 17:07:36,615 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:07:36" (1/1) ... [2022-11-25 17:07:36,621 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 17:07:36,643 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19c6198e-24fd-408a-a3f9-94ea17ed2144/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:07:36,657 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19c6198e-24fd-408a-a3f9-94ea17ed2144/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 17:07:36,671 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19c6198e-24fd-408a-a3f9-94ea17ed2144/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 17:07:36,706 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-25 17:07:36,706 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 17:07:36,707 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-25 17:07:36,707 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-25 17:07:36,708 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-11-25 17:07:36,708 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-25 17:07:36,709 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-25 17:07:36,709 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-25 17:07:36,709 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-25 17:07:36,709 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-25 17:07:36,709 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-25 17:07:36,710 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 17:07:36,710 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 17:07:36,711 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 17:07:36,928 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 17:07:36,930 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 17:07:37,383 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 17:07:37,552 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 17:07:37,552 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-25 17:07:37,555 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:07:37 BoogieIcfgContainer [2022-11-25 17:07:37,555 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 17:07:37,557 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 17:07:37,557 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 17:07:37,560 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 17:07:37,561 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 05:07:35" (1/3) ... [2022-11-25 17:07:37,561 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@208d257a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 05:07:37, skipping insertion in model container [2022-11-25 17:07:37,562 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:07:36" (2/3) ... [2022-11-25 17:07:37,562 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@208d257a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 05:07:37, skipping insertion in model container [2022-11-25 17:07:37,562 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:07:37" (3/3) ... [2022-11-25 17:07:37,564 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi008.opt.i [2022-11-25 17:07:37,583 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 17:07:37,583 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2022-11-25 17:07:37,583 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-25 17:07:37,654 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-25 17:07:37,691 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 112 places, 107 transitions, 224 flow [2022-11-25 17:07:37,735 INFO L130 PetriNetUnfolder]: 2/105 cut-off events. [2022-11-25 17:07:37,735 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 17:07:37,740 INFO L83 FinitePrefix]: Finished finitePrefix Result has 112 conditions, 105 events. 2/105 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 59 event pairs, 0 based on Foata normal form. 0/96 useless extension candidates. Maximal degree in co-relation 61. Up to 2 conditions per place. [2022-11-25 17:07:37,741 INFO L82 GeneralOperation]: Start removeDead. Operand has 112 places, 107 transitions, 224 flow [2022-11-25 17:07:37,751 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 110 places, 105 transitions, 216 flow [2022-11-25 17:07:37,755 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-25 17:07:37,770 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 110 places, 105 transitions, 216 flow [2022-11-25 17:07:37,779 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 110 places, 105 transitions, 216 flow [2022-11-25 17:07:37,780 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 110 places, 105 transitions, 216 flow [2022-11-25 17:07:37,827 INFO L130 PetriNetUnfolder]: 2/105 cut-off events. [2022-11-25 17:07:37,832 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 17:07:37,833 INFO L83 FinitePrefix]: Finished finitePrefix Result has 112 conditions, 105 events. 2/105 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 59 event pairs, 0 based on Foata normal form. 0/96 useless extension candidates. Maximal degree in co-relation 61. Up to 2 conditions per place. [2022-11-25 17:07:37,835 INFO L119 LiptonReduction]: Number of co-enabled transitions 1340 [2022-11-25 17:07:46,342 INFO L134 LiptonReduction]: Checked pairs total: 3398 [2022-11-25 17:07:46,342 INFO L136 LiptonReduction]: Total number of compositions: 110 [2022-11-25 17:07:46,362 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 17:07:46,370 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;@10610645, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 17:07:46,370 INFO L358 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2022-11-25 17:07:46,374 INFO L130 PetriNetUnfolder]: 0/1 cut-off events. [2022-11-25 17:07:46,374 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 17:07:46,374 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:07:46,375 INFO L209 CegarLoopForPetriNet]: trace histogram [1] [2022-11-25 17:07:46,376 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-11-25 17:07:46,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:07:46,382 INFO L85 PathProgramCache]: Analyzing trace with hash 498, now seen corresponding path program 1 times [2022-11-25 17:07:46,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 17:07:46,399 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1589452931] [2022-11-25 17:07:46,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:07:46,400 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 17:07:46,400 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19c6198e-24fd-408a-a3f9-94ea17ed2144/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 17:07:46,410 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19c6198e-24fd-408a-a3f9-94ea17ed2144/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 17:07:46,452 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19c6198e-24fd-408a-a3f9-94ea17ed2144/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 17:07:46,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:07:46,524 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2022-11-25 17:07:46,527 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:07:46,531 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 17:07:46,531 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 17:07:46,532 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 17:07:46,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1589452931] [2022-11-25 17:07:46,532 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1589452931] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:07:46,533 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:07:46,533 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-25 17:07:46,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158432128] [2022-11-25 17:07:46,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:07:46,541 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-25 17:07:46,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 17:07:46,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-25 17:07:46,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-25 17:07:46,565 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 217 [2022-11-25 17:07:46,568 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 25 transitions, 56 flow. Second operand has 2 states, 2 states have (on average 96.5) internal successors, (193), 2 states have internal predecessors, (193), 0 states have call successors, (0), 0 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 17:07:46,568 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:07:46,569 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 217 [2022-11-25 17:07:46,570 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:07:46,873 INFO L130 PetriNetUnfolder]: 249/437 cut-off events. [2022-11-25 17:07:46,884 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-11-25 17:07:46,886 INFO L83 FinitePrefix]: Finished finitePrefix Result has 877 conditions, 437 events. 249/437 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 1829 event pairs, 249 based on Foata normal form. 0/354 useless extension candidates. Maximal degree in co-relation 867. Up to 427 conditions per place. [2022-11-25 17:07:46,891 INFO L137 encePairwiseOnDemand]: 212/217 looper letters, 18 selfloop transitions, 0 changer transitions 0/20 dead transitions. [2022-11-25 17:07:46,891 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 20 transitions, 82 flow [2022-11-25 17:07:46,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 17:07:46,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-11-25 17:07:46,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 215 transitions. [2022-11-25 17:07:46,908 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.49539170506912444 [2022-11-25 17:07:46,909 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 215 transitions. [2022-11-25 17:07:46,910 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 215 transitions. [2022-11-25 17:07:46,912 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:07:46,915 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 215 transitions. [2022-11-25 17:07:46,918 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 107.5) internal successors, (215), 2 states have internal predecessors, (215), 0 states have call successors, (0), 0 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 17:07:46,925 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 17:07:46,926 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 17:07:46,928 INFO L175 Difference]: Start difference. First operand has 31 places, 25 transitions, 56 flow. Second operand 2 states and 215 transitions. [2022-11-25 17:07:46,929 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 20 transitions, 82 flow [2022-11-25 17:07:46,932 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 20 transitions, 80 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-25 17:07:46,934 INFO L231 Difference]: Finished difference. Result has 26 places, 20 transitions, 44 flow [2022-11-25 17:07:46,936 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=44, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=44, PETRI_PLACES=26, PETRI_TRANSITIONS=20} [2022-11-25 17:07:46,941 INFO L288 CegarLoopForPetriNet]: 31 programPoint places, -5 predicate places. [2022-11-25 17:07:46,941 INFO L495 AbstractCegarLoop]: Abstraction has has 26 places, 20 transitions, 44 flow [2022-11-25 17:07:46,942 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 96.5) internal successors, (193), 2 states have internal predecessors, (193), 0 states have call successors, (0), 0 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 17:07:46,942 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:07:46,942 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-11-25 17:07:46,960 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19c6198e-24fd-408a-a3f9-94ea17ed2144/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)] Ended with exit code 0 [2022-11-25 17:07:47,156 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19c6198e-24fd-408a-a3f9-94ea17ed2144/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 17:07:47,157 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-11-25 17:07:47,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:07:47,164 INFO L85 PathProgramCache]: Analyzing trace with hash 470004848, now seen corresponding path program 1 times [2022-11-25 17:07:47,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 17:07:47,166 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [476432366] [2022-11-25 17:07:47,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:07:47,170 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 17:07:47,170 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19c6198e-24fd-408a-a3f9-94ea17ed2144/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 17:07:47,172 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19c6198e-24fd-408a-a3f9-94ea17ed2144/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 17:07:47,208 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19c6198e-24fd-408a-a3f9-94ea17ed2144/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 17:07:47,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:07:47,310 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-25 17:07:47,311 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:07:47,348 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 17:07:47,348 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 17:07:47,361 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 17:07:47,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [476432366] [2022-11-25 17:07:47,362 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [476432366] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:07:47,362 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:07:47,362 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-25 17:07:47,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798507458] [2022-11-25 17:07:47,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:07:47,364 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 17:07:47,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 17:07:47,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 17:07:47,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:07:47,381 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 217 [2022-11-25 17:07:47,386 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 20 transitions, 44 flow. Second operand has 3 states, 3 states have (on average 96.66666666666667) internal successors, (290), 3 states have internal predecessors, (290), 0 states have call successors, (0), 0 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 17:07:47,387 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:07:47,387 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 217 [2022-11-25 17:07:47,387 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:07:47,637 INFO L130 PetriNetUnfolder]: 204/383 cut-off events. [2022-11-25 17:07:47,637 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 17:07:47,639 INFO L83 FinitePrefix]: Finished finitePrefix Result has 749 conditions, 383 events. 204/383 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1673 event pairs, 24 based on Foata normal form. 0/342 useless extension candidates. Maximal degree in co-relation 746. Up to 293 conditions per place. [2022-11-25 17:07:47,642 INFO L137 encePairwiseOnDemand]: 214/217 looper letters, 22 selfloop transitions, 2 changer transitions 2/28 dead transitions. [2022-11-25 17:07:47,642 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 28 transitions, 112 flow [2022-11-25 17:07:47,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 17:07:47,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 17:07:47,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 312 transitions. [2022-11-25 17:07:47,652 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4792626728110599 [2022-11-25 17:07:47,654 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 312 transitions. [2022-11-25 17:07:47,654 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 312 transitions. [2022-11-25 17:07:47,655 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:07:47,659 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 312 transitions. [2022-11-25 17:07:47,661 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 104.0) internal successors, (312), 3 states have internal predecessors, (312), 0 states have call successors, (0), 0 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 17:07:47,665 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 17:07:47,667 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 17:07:47,668 INFO L175 Difference]: Start difference. First operand has 26 places, 20 transitions, 44 flow. Second operand 3 states and 312 transitions. [2022-11-25 17:07:47,668 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 28 transitions, 112 flow [2022-11-25 17:07:47,668 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 28 transitions, 112 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-25 17:07:47,670 INFO L231 Difference]: Finished difference. Result has 27 places, 18 transitions, 44 flow [2022-11-25 17:07:47,670 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=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=44, PETRI_PLACES=27, PETRI_TRANSITIONS=18} [2022-11-25 17:07:47,671 INFO L288 CegarLoopForPetriNet]: 31 programPoint places, -4 predicate places. [2022-11-25 17:07:47,671 INFO L495 AbstractCegarLoop]: Abstraction has has 27 places, 18 transitions, 44 flow [2022-11-25 17:07:47,672 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 96.66666666666667) internal successors, (290), 3 states have internal predecessors, (290), 0 states have call successors, (0), 0 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 17:07:47,672 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:07:47,672 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:07:47,692 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19c6198e-24fd-408a-a3f9-94ea17ed2144/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 17:07:47,885 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19c6198e-24fd-408a-a3f9-94ea17ed2144/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 17:07:47,886 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-11-25 17:07:47,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:07:47,887 INFO L85 PathProgramCache]: Analyzing trace with hash 323093386, now seen corresponding path program 1 times [2022-11-25 17:07:47,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 17:07:47,888 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [288791702] [2022-11-25 17:07:47,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:07:47,888 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 17:07:47,888 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19c6198e-24fd-408a-a3f9-94ea17ed2144/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 17:07:47,897 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19c6198e-24fd-408a-a3f9-94ea17ed2144/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 17:07:47,901 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19c6198e-24fd-408a-a3f9-94ea17ed2144/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 17:07:48,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:07:48,005 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-25 17:07:48,006 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:07:48,047 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 17:07:48,047 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 17:07:48,048 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 17:07:48,048 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [288791702] [2022-11-25 17:07:48,048 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [288791702] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:07:48,048 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:07:48,049 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 17:07:48,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154129997] [2022-11-25 17:07:48,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:07:48,050 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 17:07:48,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 17:07:48,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 17:07:48,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:07:48,062 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 217 [2022-11-25 17:07:48,063 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 18 transitions, 44 flow. Second operand has 3 states, 3 states have (on average 95.66666666666667) internal successors, (287), 3 states have internal predecessors, (287), 0 states have call successors, (0), 0 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 17:07:48,063 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:07:48,064 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 217 [2022-11-25 17:07:48,064 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:07:48,185 INFO L130 PetriNetUnfolder]: 53/127 cut-off events. [2022-11-25 17:07:48,186 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-11-25 17:07:48,186 INFO L83 FinitePrefix]: Finished finitePrefix Result has 273 conditions, 127 events. 53/127 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 403 event pairs, 15 based on Foata normal form. 12/130 useless extension candidates. Maximal degree in co-relation 269. Up to 94 conditions per place. [2022-11-25 17:07:48,187 INFO L137 encePairwiseOnDemand]: 213/217 looper letters, 22 selfloop transitions, 3 changer transitions 0/27 dead transitions. [2022-11-25 17:07:48,188 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 27 transitions, 116 flow [2022-11-25 17:07:48,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 17:07:48,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 17:07:48,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 305 transitions. [2022-11-25 17:07:48,190 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4685099846390169 [2022-11-25 17:07:48,190 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 305 transitions. [2022-11-25 17:07:48,190 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 305 transitions. [2022-11-25 17:07:48,191 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:07:48,191 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 305 transitions. [2022-11-25 17:07:48,192 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 101.66666666666667) internal successors, (305), 3 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:07:48,195 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 17:07:48,195 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 17:07:48,196 INFO L175 Difference]: Start difference. First operand has 27 places, 18 transitions, 44 flow. Second operand 3 states and 305 transitions. [2022-11-25 17:07:48,196 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 27 transitions, 116 flow [2022-11-25 17:07:48,197 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 27 transitions, 110 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-25 17:07:48,197 INFO L231 Difference]: Finished difference. Result has 27 places, 20 transitions, 59 flow [2022-11-25 17:07:48,198 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=40, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=59, PETRI_PLACES=27, PETRI_TRANSITIONS=20} [2022-11-25 17:07:48,199 INFO L288 CegarLoopForPetriNet]: 31 programPoint places, -4 predicate places. [2022-11-25 17:07:48,199 INFO L495 AbstractCegarLoop]: Abstraction has has 27 places, 20 transitions, 59 flow [2022-11-25 17:07:48,199 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 95.66666666666667) internal successors, (287), 3 states have internal predecessors, (287), 0 states have call successors, (0), 0 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 17:07:48,200 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:07:48,200 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:07:48,219 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19c6198e-24fd-408a-a3f9-94ea17ed2144/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-11-25 17:07:48,419 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19c6198e-24fd-408a-a3f9-94ea17ed2144/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 17:07:48,420 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-11-25 17:07:48,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:07:48,421 INFO L85 PathProgramCache]: Analyzing trace with hash -54803628, now seen corresponding path program 1 times [2022-11-25 17:07:48,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 17:07:48,422 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [456122917] [2022-11-25 17:07:48,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:07:48,422 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 17:07:48,423 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19c6198e-24fd-408a-a3f9-94ea17ed2144/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 17:07:48,424 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19c6198e-24fd-408a-a3f9-94ea17ed2144/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 17:07:48,446 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19c6198e-24fd-408a-a3f9-94ea17ed2144/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 17:07:48,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:07:48,549 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-25 17:07:48,551 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:07:48,598 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 17:07:48,598 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 17:07:48,598 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 17:07:48,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [456122917] [2022-11-25 17:07:48,599 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [456122917] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:07:48,599 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:07:48,600 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 17:07:48,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823063870] [2022-11-25 17:07:48,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:07:48,601 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:07:48,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 17:07:48,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:07:48,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 17:07:48,620 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 217 [2022-11-25 17:07:48,621 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 20 transitions, 59 flow. Second operand has 4 states, 4 states have (on average 95.75) internal successors, (383), 4 states have internal predecessors, (383), 0 states have call successors, (0), 0 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 17:07:48,622 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:07:48,622 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 217 [2022-11-25 17:07:48,622 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:07:48,761 INFO L130 PetriNetUnfolder]: 18/57 cut-off events. [2022-11-25 17:07:48,762 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-11-25 17:07:48,762 INFO L83 FinitePrefix]: Finished finitePrefix Result has 146 conditions, 57 events. 18/57 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 124 event pairs, 10 based on Foata normal form. 7/62 useless extension candidates. Maximal degree in co-relation 141. Up to 29 conditions per place. [2022-11-25 17:07:48,763 INFO L137 encePairwiseOnDemand]: 213/217 looper letters, 20 selfloop transitions, 5 changer transitions 0/27 dead transitions. [2022-11-25 17:07:48,763 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 27 transitions, 125 flow [2022-11-25 17:07:48,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 17:07:48,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-25 17:07:48,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 398 transitions. [2022-11-25 17:07:48,765 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.45852534562211983 [2022-11-25 17:07:48,765 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 398 transitions. [2022-11-25 17:07:48,766 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 398 transitions. [2022-11-25 17:07:48,766 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:07:48,766 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 398 transitions. [2022-11-25 17:07:48,768 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 99.5) internal successors, (398), 4 states have internal predecessors, (398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:07:48,770 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 17:07:48,771 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 17:07:48,771 INFO L175 Difference]: Start difference. First operand has 27 places, 20 transitions, 59 flow. Second operand 4 states and 398 transitions. [2022-11-25 17:07:48,771 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 27 transitions, 125 flow [2022-11-25 17:07:48,772 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 27 transitions, 122 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-25 17:07:48,773 INFO L231 Difference]: Finished difference. Result has 30 places, 20 transitions, 72 flow [2022-11-25 17:07:48,773 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=72, PETRI_PLACES=30, PETRI_TRANSITIONS=20} [2022-11-25 17:07:48,774 INFO L288 CegarLoopForPetriNet]: 31 programPoint places, -1 predicate places. [2022-11-25 17:07:48,774 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 20 transitions, 72 flow [2022-11-25 17:07:48,775 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 95.75) internal successors, (383), 4 states have internal predecessors, (383), 0 states have call successors, (0), 0 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 17:07:48,775 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:07:48,775 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 17:07:48,794 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19c6198e-24fd-408a-a3f9-94ea17ed2144/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 17:07:48,994 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19c6198e-24fd-408a-a3f9-94ea17ed2144/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 17:07:48,995 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-11-25 17:07:48,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:07:48,996 INFO L85 PathProgramCache]: Analyzing trace with hash 2028173498, now seen corresponding path program 1 times [2022-11-25 17:07:48,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 17:07:48,997 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [296591892] [2022-11-25 17:07:48,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:07:48,997 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 17:07:48,998 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19c6198e-24fd-408a-a3f9-94ea17ed2144/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 17:07:48,999 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19c6198e-24fd-408a-a3f9-94ea17ed2144/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 17:07:49,009 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19c6198e-24fd-408a-a3f9-94ea17ed2144/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 17:07:49,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:07:49,192 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-25 17:07:49,194 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:07:49,569 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 17:07:49,569 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 17:07:49,569 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 17:07:49,570 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [296591892] [2022-11-25 17:07:49,570 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [296591892] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:07:49,570 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:07:49,570 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 17:07:49,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897184180] [2022-11-25 17:07:49,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:07:49,571 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:07:49,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 17:07:49,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:07:49,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 17:07:49,759 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 217 [2022-11-25 17:07:49,759 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 20 transitions, 72 flow. Second operand has 4 states, 4 states have (on average 87.75) internal successors, (351), 4 states have internal predecessors, (351), 0 states have call successors, (0), 0 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 17:07:49,760 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:07:49,760 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 217 [2022-11-25 17:07:49,760 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:07:49,896 INFO L130 PetriNetUnfolder]: 18/55 cut-off events. [2022-11-25 17:07:49,896 INFO L131 PetriNetUnfolder]: For 33/33 co-relation queries the response was YES. [2022-11-25 17:07:49,896 INFO L83 FinitePrefix]: Finished finitePrefix Result has 150 conditions, 55 events. 18/55 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 114 event pairs, 9 based on Foata normal form. 0/54 useless extension candidates. Maximal degree in co-relation 144. Up to 46 conditions per place. [2022-11-25 17:07:49,897 INFO L137 encePairwiseOnDemand]: 214/217 looper letters, 18 selfloop transitions, 2 changer transitions 0/22 dead transitions. [2022-11-25 17:07:49,897 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 22 transitions, 121 flow [2022-11-25 17:07:49,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 17:07:49,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-25 17:07:49,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 355 transitions. [2022-11-25 17:07:49,904 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.40898617511520735 [2022-11-25 17:07:49,905 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 355 transitions. [2022-11-25 17:07:49,906 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 355 transitions. [2022-11-25 17:07:49,906 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:07:49,906 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 355 transitions. [2022-11-25 17:07:49,908 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 88.75) internal successors, (355), 4 states have internal predecessors, (355), 0 states have call successors, (0), 0 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 17:07:49,910 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 17:07:49,911 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 17:07:49,912 INFO L175 Difference]: Start difference. First operand has 30 places, 20 transitions, 72 flow. Second operand 4 states and 355 transitions. [2022-11-25 17:07:49,912 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 22 transitions, 121 flow [2022-11-25 17:07:49,914 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 22 transitions, 110 flow, removed 2 selfloop flow, removed 2 redundant places. [2022-11-25 17:07:49,915 INFO L231 Difference]: Finished difference. Result has 30 places, 19 transitions, 64 flow [2022-11-25 17:07:49,916 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=64, PETRI_PLACES=30, PETRI_TRANSITIONS=19} [2022-11-25 17:07:49,923 INFO L288 CegarLoopForPetriNet]: 31 programPoint places, -1 predicate places. [2022-11-25 17:07:49,923 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 19 transitions, 64 flow [2022-11-25 17:07:49,923 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 87.75) internal successors, (351), 4 states have internal predecessors, (351), 0 states have call successors, (0), 0 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 17:07:49,924 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:07:49,924 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 17:07:49,945 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19c6198e-24fd-408a-a3f9-94ea17ed2144/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-11-25 17:07:50,138 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19c6198e-24fd-408a-a3f9-94ea17ed2144/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 17:07:50,139 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-11-25 17:07:50,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:07:50,140 INFO L85 PathProgramCache]: Analyzing trace with hash -1394619302, now seen corresponding path program 1 times [2022-11-25 17:07:50,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 17:07:50,140 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1133744541] [2022-11-25 17:07:50,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:07:50,141 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 17:07:50,141 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19c6198e-24fd-408a-a3f9-94ea17ed2144/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 17:07:50,142 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19c6198e-24fd-408a-a3f9-94ea17ed2144/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 17:07:50,159 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19c6198e-24fd-408a-a3f9-94ea17ed2144/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 17:07:50,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:07:50,327 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-25 17:07:50,328 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:07:50,388 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 17:07:50,389 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 17:07:50,389 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 17:07:50,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1133744541] [2022-11-25 17:07:50,389 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1133744541] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:07:50,390 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:07:50,390 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 17:07:50,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560821798] [2022-11-25 17:07:50,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:07:50,391 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 17:07:50,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 17:07:50,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 17:07:50,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:07:50,428 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 217 [2022-11-25 17:07:50,429 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 19 transitions, 64 flow. Second operand has 5 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 17:07:50,430 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:07:50,430 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 217 [2022-11-25 17:07:50,430 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:07:50,627 INFO L130 PetriNetUnfolder]: 24/81 cut-off events. [2022-11-25 17:07:50,627 INFO L131 PetriNetUnfolder]: For 27/27 co-relation queries the response was YES. [2022-11-25 17:07:50,628 INFO L83 FinitePrefix]: Finished finitePrefix Result has 212 conditions, 81 events. 24/81 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 239 event pairs, 0 based on Foata normal form. 1/82 useless extension candidates. Maximal degree in co-relation 206. Up to 46 conditions per place. [2022-11-25 17:07:50,628 INFO L137 encePairwiseOnDemand]: 213/217 looper letters, 19 selfloop transitions, 1 changer transitions 14/35 dead transitions. [2022-11-25 17:07:50,629 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 35 transitions, 188 flow [2022-11-25 17:07:50,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 17:07:50,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-25 17:07:50,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 486 transitions. [2022-11-25 17:07:50,632 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.447926267281106 [2022-11-25 17:07:50,632 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 486 transitions. [2022-11-25 17:07:50,632 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 486 transitions. [2022-11-25 17:07:50,633 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:07:50,633 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 486 transitions. [2022-11-25 17:07:50,635 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 97.2) internal successors, (486), 5 states have internal predecessors, (486), 0 states have call successors, (0), 0 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 17:07:50,638 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 17:07:50,639 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 17:07:50,639 INFO L175 Difference]: Start difference. First operand has 30 places, 19 transitions, 64 flow. Second operand 5 states and 486 transitions. [2022-11-25 17:07:50,639 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 35 transitions, 188 flow [2022-11-25 17:07:50,640 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 35 transitions, 184 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-25 17:07:50,641 INFO L231 Difference]: Finished difference. Result has 35 places, 19 transitions, 70 flow [2022-11-25 17:07:50,641 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=61, 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=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=70, PETRI_PLACES=35, PETRI_TRANSITIONS=19} [2022-11-25 17:07:50,642 INFO L288 CegarLoopForPetriNet]: 31 programPoint places, 4 predicate places. [2022-11-25 17:07:50,642 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 19 transitions, 70 flow [2022-11-25 17:07:50,643 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 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 17:07:50,643 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:07:50,643 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 17:07:50,664 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19c6198e-24fd-408a-a3f9-94ea17ed2144/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 17:07:50,864 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19c6198e-24fd-408a-a3f9-94ea17ed2144/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 17:07:50,865 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-11-25 17:07:50,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:07:50,865 INFO L85 PathProgramCache]: Analyzing trace with hash 1816446408, now seen corresponding path program 2 times [2022-11-25 17:07:50,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 17:07:50,866 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1001884301] [2022-11-25 17:07:50,866 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-25 17:07:50,866 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 17:07:50,866 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19c6198e-24fd-408a-a3f9-94ea17ed2144/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 17:07:50,868 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19c6198e-24fd-408a-a3f9-94ea17ed2144/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 17:07:50,871 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19c6198e-24fd-408a-a3f9-94ea17ed2144/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 17:07:51,020 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-25 17:07:51,021 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 17:07:51,027 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 18 conjunts are in the unsatisfiable core [2022-11-25 17:07:51,029 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:07:51,760 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 17:07:51,760 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 17:07:51,760 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 17:07:51,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1001884301] [2022-11-25 17:07:51,761 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1001884301] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:07:51,761 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:07:51,761 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 17:07:51,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745936527] [2022-11-25 17:07:51,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:07:51,763 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-25 17:07:51,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 17:07:51,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-25 17:07:51,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-25 17:07:51,880 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 217 [2022-11-25 17:07:51,882 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 19 transitions, 70 flow. Second operand has 8 states, 8 states have (on average 91.875) internal successors, (735), 8 states have internal predecessors, (735), 0 states have call successors, (0), 0 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 17:07:51,882 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:07:51,882 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 217 [2022-11-25 17:07:51,882 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:07:52,301 INFO L130 PetriNetUnfolder]: 18/64 cut-off events. [2022-11-25 17:07:52,302 INFO L131 PetriNetUnfolder]: For 48/48 co-relation queries the response was YES. [2022-11-25 17:07:52,302 INFO L83 FinitePrefix]: Finished finitePrefix Result has 193 conditions, 64 events. 18/64 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 151 event pairs, 6 based on Foata normal form. 1/64 useless extension candidates. Maximal degree in co-relation 184. Up to 19 conditions per place. [2022-11-25 17:07:52,303 INFO L137 encePairwiseOnDemand]: 210/217 looper letters, 14 selfloop transitions, 4 changer transitions 15/35 dead transitions. [2022-11-25 17:07:52,303 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 35 transitions, 207 flow [2022-11-25 17:07:52,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 17:07:52,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-11-25 17:07:52,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 750 transitions. [2022-11-25 17:07:52,306 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.43202764976958524 [2022-11-25 17:07:52,307 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 750 transitions. [2022-11-25 17:07:52,307 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 750 transitions. [2022-11-25 17:07:52,308 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:07:52,308 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 750 transitions. [2022-11-25 17:07:52,310 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 93.75) internal successors, (750), 8 states have internal predecessors, (750), 0 states have call successors, (0), 0 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 17:07:52,313 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 17:07:52,314 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 17:07:52,314 INFO L175 Difference]: Start difference. First operand has 35 places, 19 transitions, 70 flow. Second operand 8 states and 750 transitions. [2022-11-25 17:07:52,315 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 35 transitions, 207 flow [2022-11-25 17:07:52,316 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 35 transitions, 197 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-11-25 17:07:52,317 INFO L231 Difference]: Finished difference. Result has 40 places, 19 transitions, 80 flow [2022-11-25 17:07:52,317 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=65, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=80, PETRI_PLACES=40, PETRI_TRANSITIONS=19} [2022-11-25 17:07:52,318 INFO L288 CegarLoopForPetriNet]: 31 programPoint places, 9 predicate places. [2022-11-25 17:07:52,318 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 19 transitions, 80 flow [2022-11-25 17:07:52,319 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 91.875) internal successors, (735), 8 states have internal predecessors, (735), 0 states have call successors, (0), 0 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 17:07:52,319 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:07:52,319 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 17:07:52,340 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19c6198e-24fd-408a-a3f9-94ea17ed2144/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 17:07:52,548 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19c6198e-24fd-408a-a3f9-94ea17ed2144/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 17:07:52,549 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-11-25 17:07:52,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:07:52,549 INFO L85 PathProgramCache]: Analyzing trace with hash -1918977520, now seen corresponding path program 3 times [2022-11-25 17:07:52,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 17:07:52,550 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1883052729] [2022-11-25 17:07:52,550 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-25 17:07:52,551 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 17:07:52,551 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19c6198e-24fd-408a-a3f9-94ea17ed2144/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 17:07:52,552 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19c6198e-24fd-408a-a3f9-94ea17ed2144/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 17:07:52,569 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19c6198e-24fd-408a-a3f9-94ea17ed2144/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 17:07:52,717 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-11-25 17:07:52,718 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-11-25 17:07:52,718 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 17:07:52,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 17:07:52,907 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-11-25 17:07:52,907 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-11-25 17:07:52,908 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK (9 of 10 remaining) [2022-11-25 17:07:52,910 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (8 of 10 remaining) [2022-11-25 17:07:52,925 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 10 remaining) [2022-11-25 17:07:52,925 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 10 remaining) [2022-11-25 17:07:52,925 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 10 remaining) [2022-11-25 17:07:52,926 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 10 remaining) [2022-11-25 17:07:52,926 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK (3 of 10 remaining) [2022-11-25 17:07:52,926 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 10 remaining) [2022-11-25 17:07:52,926 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 10 remaining) [2022-11-25 17:07:52,927 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 10 remaining) [2022-11-25 17:07:52,948 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19c6198e-24fd-408a-a3f9-94ea17ed2144/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 17:07:53,127 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19c6198e-24fd-408a-a3f9-94ea17ed2144/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 17:07:53,128 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1] [2022-11-25 17:07:53,133 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-25 17:07:53,134 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-25 17:07:53,194 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 05:07:53 BasicIcfg [2022-11-25 17:07:53,194 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-25 17:07:53,195 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-25 17:07:53,195 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-25 17:07:53,195 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-25 17:07:53,196 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:07:37" (3/4) ... [2022-11-25 17:07:53,198 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-25 17:07:53,199 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-25 17:07:53,199 INFO L158 Benchmark]: Toolchain (without parser) took 17484.42ms. Allocated memory was 75.5MB in the beginning and 134.2MB in the end (delta: 58.7MB). Free memory was 50.7MB in the beginning and 66.6MB in the end (delta: -15.9MB). Peak memory consumption was 45.6MB. Max. memory is 16.1GB. [2022-11-25 17:07:53,200 INFO L158 Benchmark]: CDTParser took 0.38ms. Allocated memory is still 75.5MB. Free memory is still 53.0MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 17:07:53,200 INFO L158 Benchmark]: CACSL2BoogieTranslator took 761.68ms. Allocated memory was 75.5MB in the beginning and 92.3MB in the end (delta: 16.8MB). Free memory was 50.5MB in the beginning and 56.1MB in the end (delta: -5.5MB). Peak memory consumption was 13.8MB. Max. memory is 16.1GB. [2022-11-25 17:07:53,201 INFO L158 Benchmark]: Boogie Procedure Inliner took 76.90ms. Allocated memory is still 92.3MB. Free memory was 56.1MB in the beginning and 53.3MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 17:07:53,201 INFO L158 Benchmark]: Boogie Preprocessor took 41.79ms. Allocated memory is still 92.3MB. Free memory was 53.3MB in the beginning and 51.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 17:07:53,202 INFO L158 Benchmark]: RCFGBuilder took 942.00ms. Allocated memory is still 92.3MB. Free memory was 51.2MB in the beginning and 60.0MB in the end (delta: -8.7MB). Peak memory consumption was 16.0MB. Max. memory is 16.1GB. [2022-11-25 17:07:53,202 INFO L158 Benchmark]: TraceAbstraction took 15637.53ms. Allocated memory was 92.3MB in the beginning and 134.2MB in the end (delta: 41.9MB). Free memory was 59.0MB in the beginning and 67.7MB in the end (delta: -8.7MB). Peak memory consumption was 32.6MB. Max. memory is 16.1GB. [2022-11-25 17:07:53,203 INFO L158 Benchmark]: Witness Printer took 4.03ms. Allocated memory is still 134.2MB. Free memory was 67.7MB in the beginning and 66.6MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 17:07:53,206 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.38ms. Allocated memory is still 75.5MB. Free memory is still 53.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 761.68ms. Allocated memory was 75.5MB in the beginning and 92.3MB in the end (delta: 16.8MB). Free memory was 50.5MB in the beginning and 56.1MB in the end (delta: -5.5MB). Peak memory consumption was 13.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 76.90ms. Allocated memory is still 92.3MB. Free memory was 56.1MB in the beginning and 53.3MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 41.79ms. Allocated memory is still 92.3MB. Free memory was 53.3MB in the beginning and 51.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 942.00ms. Allocated memory is still 92.3MB. Free memory was 51.2MB in the beginning and 60.0MB in the end (delta: -8.7MB). Peak memory consumption was 16.0MB. Max. memory is 16.1GB. * TraceAbstraction took 15637.53ms. Allocated memory was 92.3MB in the beginning and 134.2MB in the end (delta: 41.9MB). Free memory was 59.0MB in the beginning and 67.7MB in the end (delta: -8.7MB). Peak memory consumption was 32.6MB. Max. memory is 16.1GB. * Witness Printer took 4.03ms. Allocated memory is still 134.2MB. Free memory was 67.7MB in the beginning and 66.6MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 8.6s, 110 PlacesBefore, 31 PlacesAfterwards, 105 TransitionsBefore, 25 TransitionsAfterwards, 1340 CoEnabledTransitionPairs, 6 FixpointIterations, 52 TrivialSequentialCompositions, 51 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 1 ChoiceCompositions, 110 TotalNumberOfCompositions, 3398 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1711, independent: 1592, independent conditional: 0, independent unconditional: 1592, dependent: 119, dependent conditional: 0, dependent unconditional: 119, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 959, independent: 921, independent conditional: 0, independent unconditional: 921, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 959, independent: 909, independent conditional: 0, independent unconditional: 909, dependent: 50, dependent conditional: 0, dependent unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 50, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 455, independent: 30, independent conditional: 0, independent unconditional: 30, dependent: 425, dependent conditional: 0, dependent unconditional: 425, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1711, independent: 671, independent conditional: 0, independent unconditional: 671, dependent: 81, dependent conditional: 0, dependent unconditional: 81, unknown: 959, unknown conditional: 0, unknown unconditional: 959] , Statistics on independence cache: Total cache size (in pairs): 101, Positive cache size: 86, Positive conditional cache size: 0, Positive unconditional cache size: 86, Negative cache size: 15, Negative conditional cache size: 0, Negative unconditional cache size: 15, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 19]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 19. Possible FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p0_EBX = 0; [L715] 0 int __unbuffered_p1_EAX = 0; [L717] 0 int __unbuffered_p1_EBX = 0; [L718] 0 _Bool main$tmp_guard0; [L719] 0 _Bool main$tmp_guard1; [L721] 0 int x = 0; [L723] 0 int y = 0; [L724] 0 _Bool y$flush_delayed; [L725] 0 int y$mem_tmp; [L726] 0 _Bool y$r_buff0_thd0; [L727] 0 _Bool y$r_buff0_thd1; [L728] 0 _Bool y$r_buff0_thd2; [L729] 0 _Bool y$r_buff1_thd0; [L730] 0 _Bool y$r_buff1_thd1; [L731] 0 _Bool y$r_buff1_thd2; [L732] 0 _Bool y$read_delayed; [L733] 0 int *y$read_delayed_var; [L734] 0 int y$w_buff0; [L735] 0 _Bool y$w_buff0_used; [L736] 0 int y$w_buff1; [L737] 0 _Bool y$w_buff1_used; [L738] 0 _Bool weak$$choice0; [L739] 0 _Bool weak$$choice2; [L826] 0 pthread_t t1723; [L827] FCALL, FORK 0 pthread_create(&t1723, ((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, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1723, ((void *)0), P0, ((void *)0))=0, t1723={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L828] 0 pthread_t t1724; [L829] FCALL, FORK 0 pthread_create(&t1724, ((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, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1724, ((void *)0), P1, ((void *)0))=1, t1723={3:0}, t1724={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L774] 2 y$w_buff1 = y$w_buff0 [L775] 2 y$w_buff0 = 1 [L776] 2 y$w_buff1_used = y$w_buff0_used [L777] 2 y$w_buff0_used = (_Bool)1 [L778] CALL 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L778] RET 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L779] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L780] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L781] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L782] 2 y$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L785] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L786] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L787] 2 y$flush_delayed = weak$$choice2 [L788] 2 y$mem_tmp = y [L789] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L790] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L791] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L792] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L793] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L794] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L795] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L796] 2 __unbuffered_p1_EAX = y [L797] 2 y = y$flush_delayed ? y$mem_tmp : y [L798] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=2, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L801] 2 __unbuffered_p1_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=2, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L743] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=2, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L746] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=2, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L749] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L750] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L751] 1 y$flush_delayed = weak$$choice2 [L752] 1 y$mem_tmp = y [L753] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L754] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L755] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L756] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L757] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L758] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L759] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L760] 1 __unbuffered_p0_EBX = y [L761] 1 y = y$flush_delayed ? y$mem_tmp : y [L762] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L804] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L805] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L806] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L807] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L808] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L811] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L813] 2 return 0; [L767] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L769] 1 return 0; [L831] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L833] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) VAL [\old(cond)=1, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L833] RET 0 assume_abort_if_not(main$tmp_guard0) [L835] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L836] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L837] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L838] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L839] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1723={3:0}, t1724={7:0}, weak$$choice0=3, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L842] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) [L844] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 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, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - UnprovableResult [Line: 19]: 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: 824]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 829]: 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: 827]: 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, 126 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: 15.4s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 2.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 8.7s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 180 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 122 mSDsluCounter, 133 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 107 mSDsCounter, 36 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 515 IncrementalHoareTripleChecker+Invalid, 551 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 36 mSolverCounterUnsat, 26 mSDtfsCounter, 515 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 75 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=80occurred in iteration=7, InterpolantAutomatonStates: 29, 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.4s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 94 NumberOfCodeBlocks, 94 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 70 ConstructedInterpolants, 14 QuantifiedInterpolants, 630 SizeOfPredicates, 15 NumberOfNonLiveVariables, 708 ConjunctsInSsa, 51 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 17:07:53,261 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19c6198e-24fd-408a-a3f9-94ea17ed2144/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