./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/mix028_power.opt_pso.opt_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0af340b9-813b-4879-82e3-1ae81d317d05/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0af340b9-813b-4879-82e3-1ae81d317d05/bin/uautomizer-uyxdKDjOR8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0af340b9-813b-4879-82e3-1ae81d317d05/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0af340b9-813b-4879-82e3-1ae81d317d05/bin/uautomizer-uyxdKDjOR8/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix028_power.opt_pso.opt_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0af340b9-813b-4879-82e3-1ae81d317d05/bin/uautomizer-uyxdKDjOR8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0af340b9-813b-4879-82e3-1ae81d317d05/bin/uautomizer-uyxdKDjOR8 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a86612b573a63cde2c4106f45bf8b3ea66989a894eb80420a80ff8b17f8f03d1 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-2329fc7 [2022-12-13 16:35:22,302 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 16:35:22,304 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 16:35:22,322 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 16:35:22,322 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 16:35:22,323 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 16:35:22,324 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 16:35:22,326 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 16:35:22,327 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 16:35:22,328 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 16:35:22,328 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 16:35:22,329 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 16:35:22,330 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 16:35:22,331 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 16:35:22,332 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 16:35:22,333 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 16:35:22,334 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 16:35:22,334 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 16:35:22,336 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 16:35:22,337 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 16:35:22,339 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 16:35:22,340 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 16:35:22,341 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 16:35:22,342 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 16:35:22,345 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 16:35:22,345 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 16:35:22,345 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 16:35:22,346 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 16:35:22,346 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 16:35:22,347 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 16:35:22,348 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 16:35:22,348 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 16:35:22,349 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 16:35:22,350 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 16:35:22,350 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 16:35:22,351 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 16:35:22,351 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 16:35:22,351 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 16:35:22,351 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 16:35:22,352 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 16:35:22,353 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 16:35:22,353 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0af340b9-813b-4879-82e3-1ae81d317d05/bin/uautomizer-uyxdKDjOR8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-12-13 16:35:22,374 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 16:35:22,374 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 16:35:22,374 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 16:35:22,374 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 16:35:22,375 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 16:35:22,375 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 16:35:22,382 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 16:35:22,382 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 16:35:22,383 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 16:35:22,383 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 16:35:22,383 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 16:35:22,383 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-13 16:35:22,383 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 16:35:22,384 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 16:35:22,384 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 16:35:22,384 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-12-13 16:35:22,384 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-12-13 16:35:22,384 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-12-13 16:35:22,384 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 16:35:22,385 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-12-13 16:35:22,385 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 16:35:22,385 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 16:35:22,385 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 16:35:22,385 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 16:35:22,386 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 16:35:22,386 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 16:35:22,386 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 16:35:22,386 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 16:35:22,386 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 16:35:22,386 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 16:35:22,387 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 16:35:22,387 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 16:35:22,387 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 16:35:22,387 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 16:35:22,387 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_0af340b9-813b-4879-82e3-1ae81d317d05/bin/uautomizer-uyxdKDjOR8/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0af340b9-813b-4879-82e3-1ae81d317d05/bin/uautomizer-uyxdKDjOR8 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a86612b573a63cde2c4106f45bf8b3ea66989a894eb80420a80ff8b17f8f03d1 [2022-12-13 16:35:22,574 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 16:35:22,592 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 16:35:22,594 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 16:35:22,595 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 16:35:22,595 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 16:35:22,596 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0af340b9-813b-4879-82e3-1ae81d317d05/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/pthread-wmm/mix028_power.opt_pso.opt_rmo.opt.i [2022-12-13 16:35:25,140 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 16:35:25,341 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 16:35:25,342 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0af340b9-813b-4879-82e3-1ae81d317d05/sv-benchmarks/c/pthread-wmm/mix028_power.opt_pso.opt_rmo.opt.i [2022-12-13 16:35:25,354 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0af340b9-813b-4879-82e3-1ae81d317d05/bin/uautomizer-uyxdKDjOR8/data/62e0200c4/e0cace4428d643ab9b917dc9ed65c89b/FLAG16cdf4fd5 [2022-12-13 16:35:25,720 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0af340b9-813b-4879-82e3-1ae81d317d05/bin/uautomizer-uyxdKDjOR8/data/62e0200c4/e0cace4428d643ab9b917dc9ed65c89b [2022-12-13 16:35:25,724 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 16:35:25,726 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 16:35:25,728 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 16:35:25,728 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 16:35:25,732 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 16:35:25,733 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 04:35:25" (1/1) ... [2022-12-13 16:35:25,734 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6026c31a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:35:25, skipping insertion in model container [2022-12-13 16:35:25,735 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 04:35:25" (1/1) ... [2022-12-13 16:35:25,742 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 16:35:25,768 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 16:35:25,874 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_0af340b9-813b-4879-82e3-1ae81d317d05/sv-benchmarks/c/pthread-wmm/mix028_power.opt_pso.opt_rmo.opt.i[966,979] [2022-12-13 16:35:25,972 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:35:25,973 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:35:25,973 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:35:25,973 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:35:25,973 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:35:25,976 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:35:25,976 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:35:25,976 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:35:25,977 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:35:25,978 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:35:25,979 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:35:25,979 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:35:25,979 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:35:25,981 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:35:25,981 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:35:25,981 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:35:25,982 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:35:25,982 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:35:25,982 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:35:25,982 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:35:25,983 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:35:25,983 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:35:25,983 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:35:25,985 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:35:25,985 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:35:25,985 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:35:25,990 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:35:25,991 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:35:25,991 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:35:25,993 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:35:25,993 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:35:26,000 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:35:26,001 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 16:35:26,009 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 16:35:26,018 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_0af340b9-813b-4879-82e3-1ae81d317d05/sv-benchmarks/c/pthread-wmm/mix028_power.opt_pso.opt_rmo.opt.i[966,979] [2022-12-13 16:35:26,034 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:35:26,034 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:35:26,034 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:35:26,034 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:35:26,035 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:35:26,036 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:35:26,037 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:35:26,037 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:35:26,037 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:35:26,038 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:35:26,038 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:35:26,039 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:35:26,039 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:35:26,040 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:35:26,041 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:35:26,041 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:35:26,041 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:35:26,041 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:35:26,042 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:35:26,042 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:35:26,042 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:35:26,042 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:35:26,042 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:35:26,044 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:35:26,044 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:35:26,044 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:35:26,047 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:35:26,047 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:35:26,048 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:35:26,049 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:35:26,049 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:35:26,054 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:35:26,055 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 16:35:26,087 INFO L208 MainTranslator]: Completed translation [2022-12-13 16:35:26,087 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:35:26 WrapperNode [2022-12-13 16:35:26,087 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 16:35:26,088 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 16:35:26,088 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 16:35:26,088 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 16:35:26,094 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:35:26" (1/1) ... [2022-12-13 16:35:26,107 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:35:26" (1/1) ... [2022-12-13 16:35:26,137 INFO L138 Inliner]: procedures = 176, calls = 56, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 143 [2022-12-13 16:35:26,137 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 16:35:26,138 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 16:35:26,138 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 16:35:26,138 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 16:35:26,147 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:35:26" (1/1) ... [2022-12-13 16:35:26,147 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:35:26" (1/1) ... [2022-12-13 16:35:26,151 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:35:26" (1/1) ... [2022-12-13 16:35:26,151 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:35:26" (1/1) ... [2022-12-13 16:35:26,158 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:35:26" (1/1) ... [2022-12-13 16:35:26,160 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:35:26" (1/1) ... [2022-12-13 16:35:26,162 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:35:26" (1/1) ... [2022-12-13 16:35:26,164 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:35:26" (1/1) ... [2022-12-13 16:35:26,167 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 16:35:26,168 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 16:35:26,168 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 16:35:26,168 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 16:35:26,169 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:35:26" (1/1) ... [2022-12-13 16:35:26,174 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 16:35:26,183 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0af340b9-813b-4879-82e3-1ae81d317d05/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 16:35:26,193 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0af340b9-813b-4879-82e3-1ae81d317d05/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 16:35:26,195 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0af340b9-813b-4879-82e3-1ae81d317d05/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 16:35:26,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 16:35:26,230 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 16:35:26,230 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 16:35:26,230 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 16:35:26,230 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 16:35:26,230 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 16:35:26,231 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 16:35:26,231 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 16:35:26,231 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 16:35:26,231 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-13 16:35:26,231 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-13 16:35:26,231 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 16:35:26,231 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 16:35:26,232 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 16:35:26,232 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 16:35:26,233 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-12-13 16:35:26,334 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 16:35:26,335 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 16:35:26,594 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 16:35:26,674 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 16:35:26,674 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 16:35:26,676 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 04:35:26 BoogieIcfgContainer [2022-12-13 16:35:26,676 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 16:35:26,678 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 16:35:26,678 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 16:35:26,680 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 16:35:26,680 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 04:35:25" (1/3) ... [2022-12-13 16:35:26,681 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@205030f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 04:35:26, skipping insertion in model container [2022-12-13 16:35:26,681 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:35:26" (2/3) ... [2022-12-13 16:35:26,681 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@205030f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 04:35:26, skipping insertion in model container [2022-12-13 16:35:26,681 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 04:35:26" (3/3) ... [2022-12-13 16:35:26,682 INFO L112 eAbstractionObserver]: Analyzing ICFG mix028_power.opt_pso.opt_rmo.opt.i [2022-12-13 16:35:26,695 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 16:35:26,695 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2022-12-13 16:35:26,695 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 16:35:26,731 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 16:35:26,758 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 134 places, 126 transitions, 267 flow [2022-12-13 16:35:26,798 INFO L130 PetriNetUnfolder]: 2/123 cut-off events. [2022-12-13 16:35:26,798 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 16:35:26,802 INFO L83 FinitePrefix]: Finished finitePrefix Result has 133 conditions, 123 events. 2/123 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 85 event pairs, 0 based on Foata normal form. 0/112 useless extension candidates. Maximal degree in co-relation 81. Up to 2 conditions per place. [2022-12-13 16:35:26,802 INFO L82 GeneralOperation]: Start removeDead. Operand has 134 places, 126 transitions, 267 flow [2022-12-13 16:35:26,805 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 131 places, 123 transitions, 255 flow [2022-12-13 16:35:26,808 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-12-13 16:35:26,815 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 131 places, 123 transitions, 255 flow [2022-12-13 16:35:26,817 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 131 places, 123 transitions, 255 flow [2022-12-13 16:35:26,818 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 131 places, 123 transitions, 255 flow [2022-12-13 16:35:26,836 INFO L130 PetriNetUnfolder]: 2/123 cut-off events. [2022-12-13 16:35:26,836 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 16:35:26,837 INFO L83 FinitePrefix]: Finished finitePrefix Result has 133 conditions, 123 events. 2/123 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 85 event pairs, 0 based on Foata normal form. 0/112 useless extension candidates. Maximal degree in co-relation 81. Up to 2 conditions per place. [2022-12-13 16:35:26,838 INFO L119 LiptonReduction]: Number of co-enabled transitions 2404 [2022-12-13 16:35:30,032 INFO L134 LiptonReduction]: Checked pairs total: 7217 [2022-12-13 16:35:30,032 INFO L136 LiptonReduction]: Total number of compositions: 118 [2022-12-13 16:35:30,042 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 16:35:30,046 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;@6b6272ca, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 16:35:30,046 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2022-12-13 16:35:30,047 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2022-12-13 16:35:30,047 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 16:35:30,047 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 16:35:30,048 INFO L209 CegarLoopForPetriNet]: trace histogram [1] [2022-12-13 16:35:30,048 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-12-13 16:35:30,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:35:30,051 INFO L85 PathProgramCache]: Analyzing trace with hash 538, now seen corresponding path program 1 times [2022-12-13 16:35:30,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:35:30,058 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329899900] [2022-12-13 16:35:30,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:35:30,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:35:30,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:35:30,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:35:30,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:35:30,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329899900] [2022-12-13 16:35:30,133 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1329899900] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:35:30,133 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:35:30,133 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-12-13 16:35:30,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613329162] [2022-12-13 16:35:30,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:35:30,140 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-13 16:35:30,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:35:30,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-13 16:35:30,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-13 16:35:30,156 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 244 [2022-12-13 16:35:30,157 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 34 transitions, 77 flow. Second operand has 2 states, 2 states have (on average 113.5) internal successors, (227), 2 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:35:30,158 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 16:35:30,158 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 244 [2022-12-13 16:35:30,158 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 16:35:30,509 INFO L130 PetriNetUnfolder]: 1461/2190 cut-off events. [2022-12-13 16:35:30,509 INFO L131 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2022-12-13 16:35:30,514 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4395 conditions, 2190 events. 1461/2190 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 10819 event pairs, 1461 based on Foata normal form. 80/1830 useless extension candidates. Maximal degree in co-relation 4384. Up to 2151 conditions per place. [2022-12-13 16:35:30,524 INFO L137 encePairwiseOnDemand]: 237/244 looper letters, 23 selfloop transitions, 0 changer transitions 0/27 dead transitions. [2022-12-13 16:35:30,524 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 27 transitions, 109 flow [2022-12-13 16:35:30,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 16:35:30,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-12-13 16:35:30,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 256 transitions. [2022-12-13 16:35:30,537 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5245901639344263 [2022-12-13 16:35:30,538 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 256 transitions. [2022-12-13 16:35:30,538 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 256 transitions. [2022-12-13 16:35:30,539 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 16:35:30,542 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 256 transitions. [2022-12-13 16:35:30,544 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 128.0) internal successors, (256), 2 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:35:30,549 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 244.0) internal successors, (732), 3 states have internal predecessors, (732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:35:30,549 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 244.0) internal successors, (732), 3 states have internal predecessors, (732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:35:30,551 INFO L175 Difference]: Start difference. First operand has 43 places, 34 transitions, 77 flow. Second operand 2 states and 256 transitions. [2022-12-13 16:35:30,552 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 27 transitions, 109 flow [2022-12-13 16:35:30,554 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 27 transitions, 106 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-13 16:35:30,556 INFO L231 Difference]: Finished difference. Result has 35 places, 27 transitions, 60 flow [2022-12-13 16:35:30,557 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=60, PETRI_PLACES=35, PETRI_TRANSITIONS=27} [2022-12-13 16:35:30,561 INFO L288 CegarLoopForPetriNet]: 43 programPoint places, -8 predicate places. [2022-12-13 16:35:30,561 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 27 transitions, 60 flow [2022-12-13 16:35:30,561 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 113.5) internal successors, (227), 2 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:35:30,561 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 16:35:30,561 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-12-13 16:35:30,562 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 16:35:30,562 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-12-13 16:35:30,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:35:30,563 INFO L85 PathProgramCache]: Analyzing trace with hash 510766626, now seen corresponding path program 1 times [2022-12-13 16:35:30,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:35:30,563 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722951130] [2022-12-13 16:35:30,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:35:30,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:35:30,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:35:30,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:35:30,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:35:30,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722951130] [2022-12-13 16:35:30,814 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722951130] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:35:30,814 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:35:30,814 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 16:35:30,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775351892] [2022-12-13 16:35:30,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:35:30,816 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 16:35:30,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:35:30,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 16:35:30,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 16:35:30,819 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 244 [2022-12-13 16:35:30,820 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 27 transitions, 60 flow. Second operand has 3 states, 3 states have (on average 113.66666666666667) internal successors, (341), 3 states have internal predecessors, (341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:35:30,820 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 16:35:30,820 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 244 [2022-12-13 16:35:30,820 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 16:35:31,038 INFO L130 PetriNetUnfolder]: 1143/1778 cut-off events. [2022-12-13 16:35:31,038 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 16:35:31,039 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3519 conditions, 1778 events. 1143/1778 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 8852 event pairs, 317 based on Foata normal form. 0/1565 useless extension candidates. Maximal degree in co-relation 3516. Up to 1363 conditions per place. [2022-12-13 16:35:31,043 INFO L137 encePairwiseOnDemand]: 241/244 looper letters, 31 selfloop transitions, 2 changer transitions 4/41 dead transitions. [2022-12-13 16:35:31,043 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 41 transitions, 164 flow [2022-12-13 16:35:31,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 16:35:31,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 16:35:31,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 374 transitions. [2022-12-13 16:35:31,046 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5109289617486339 [2022-12-13 16:35:31,046 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 374 transitions. [2022-12-13 16:35:31,046 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 374 transitions. [2022-12-13 16:35:31,047 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 16:35:31,047 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 374 transitions. [2022-12-13 16:35:31,048 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 124.66666666666667) internal successors, (374), 3 states have internal predecessors, (374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:35:31,050 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 244.0) internal successors, (976), 4 states have internal predecessors, (976), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:35:31,051 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 244.0) internal successors, (976), 4 states have internal predecessors, (976), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:35:31,051 INFO L175 Difference]: Start difference. First operand has 35 places, 27 transitions, 60 flow. Second operand 3 states and 374 transitions. [2022-12-13 16:35:31,051 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 41 transitions, 164 flow [2022-12-13 16:35:31,051 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 41 transitions, 164 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-13 16:35:31,052 INFO L231 Difference]: Finished difference. Result has 36 places, 24 transitions, 58 flow [2022-12-13 16:35:31,052 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=58, PETRI_PLACES=36, PETRI_TRANSITIONS=24} [2022-12-13 16:35:31,053 INFO L288 CegarLoopForPetriNet]: 43 programPoint places, -7 predicate places. [2022-12-13 16:35:31,053 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 24 transitions, 58 flow [2022-12-13 16:35:31,053 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 113.66666666666667) internal successors, (341), 3 states have internal predecessors, (341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:35:31,054 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 16:35:31,054 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:35:31,054 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 16:35:31,054 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-12-13 16:35:31,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:35:31,055 INFO L85 PathProgramCache]: Analyzing trace with hash -242481229, now seen corresponding path program 1 times [2022-12-13 16:35:31,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:35:31,055 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250467727] [2022-12-13 16:35:31,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:35:31,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:35:31,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:35:31,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:35:31,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:35:31,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250467727] [2022-12-13 16:35:31,362 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250467727] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:35:31,362 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:35:31,362 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 16:35:31,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822542355] [2022-12-13 16:35:31,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:35:31,362 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 16:35:31,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:35:31,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 16:35:31,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 16:35:31,433 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 244 [2022-12-13 16:35:31,433 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 24 transitions, 58 flow. Second operand has 5 states, 5 states have (on average 100.0) internal successors, (500), 5 states have internal predecessors, (500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:35:31,433 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 16:35:31,433 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 244 [2022-12-13 16:35:31,433 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 16:35:31,616 INFO L130 PetriNetUnfolder]: 711/1109 cut-off events. [2022-12-13 16:35:31,616 INFO L131 PetriNetUnfolder]: For 84/84 co-relation queries the response was YES. [2022-12-13 16:35:31,617 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2316 conditions, 1109 events. 711/1109 cut-off events. For 84/84 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 5142 event pairs, 192 based on Foata normal form. 0/1077 useless extension candidates. Maximal degree in co-relation 2312. Up to 1032 conditions per place. [2022-12-13 16:35:31,620 INFO L137 encePairwiseOnDemand]: 240/244 looper letters, 25 selfloop transitions, 3 changer transitions 0/32 dead transitions. [2022-12-13 16:35:31,620 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 32 transitions, 132 flow [2022-12-13 16:35:31,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 16:35:31,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 16:35:31,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 519 transitions. [2022-12-13 16:35:31,622 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.42540983606557375 [2022-12-13 16:35:31,622 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 519 transitions. [2022-12-13 16:35:31,622 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 519 transitions. [2022-12-13 16:35:31,622 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 16:35:31,622 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 519 transitions. [2022-12-13 16:35:31,623 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 103.8) internal successors, (519), 5 states have internal predecessors, (519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:35:31,625 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 244.0) internal successors, (1464), 6 states have internal predecessors, (1464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:35:31,625 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 244.0) internal successors, (1464), 6 states have internal predecessors, (1464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:35:31,625 INFO L175 Difference]: Start difference. First operand has 36 places, 24 transitions, 58 flow. Second operand 5 states and 519 transitions. [2022-12-13 16:35:31,625 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 32 transitions, 132 flow [2022-12-13 16:35:31,626 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 32 transitions, 126 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 16:35:31,626 INFO L231 Difference]: Finished difference. Result has 35 places, 23 transitions, 58 flow [2022-12-13 16:35:31,627 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=58, PETRI_PLACES=35, PETRI_TRANSITIONS=23} [2022-12-13 16:35:31,627 INFO L288 CegarLoopForPetriNet]: 43 programPoint places, -8 predicate places. [2022-12-13 16:35:31,627 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 23 transitions, 58 flow [2022-12-13 16:35:31,627 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 100.0) internal successors, (500), 5 states have internal predecessors, (500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:35:31,627 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 16:35:31,627 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:35:31,628 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 16:35:31,628 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-12-13 16:35:31,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:35:31,628 INFO L85 PathProgramCache]: Analyzing trace with hash -242481273, now seen corresponding path program 1 times [2022-12-13 16:35:31,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:35:31,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947352746] [2022-12-13 16:35:31,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:35:31,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:35:31,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:35:31,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:35:31,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:35:31,938 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947352746] [2022-12-13 16:35:31,938 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947352746] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:35:31,938 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:35:31,939 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 16:35:31,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468710956] [2022-12-13 16:35:31,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:35:31,939 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 16:35:31,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:35:31,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 16:35:31,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 16:35:31,987 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 244 [2022-12-13 16:35:31,987 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 23 transitions, 58 flow. Second operand has 5 states, 5 states have (on average 103.0) internal successors, (515), 5 states have internal predecessors, (515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:35:31,988 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 16:35:31,988 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 244 [2022-12-13 16:35:31,988 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 16:35:32,519 INFO L130 PetriNetUnfolder]: 1589/2375 cut-off events. [2022-12-13 16:35:32,520 INFO L131 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2022-12-13 16:35:32,521 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4828 conditions, 2375 events. 1589/2375 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 10877 event pairs, 395 based on Foata normal form. 136/2510 useless extension candidates. Maximal degree in co-relation 4824. Up to 1377 conditions per place. [2022-12-13 16:35:32,533 INFO L137 encePairwiseOnDemand]: 234/244 looper letters, 33 selfloop transitions, 8 changer transitions 28/70 dead transitions. [2022-12-13 16:35:32,533 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 70 transitions, 290 flow [2022-12-13 16:35:32,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 16:35:32,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 16:35:32,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 779 transitions. [2022-12-13 16:35:32,535 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4560889929742389 [2022-12-13 16:35:32,535 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 779 transitions. [2022-12-13 16:35:32,535 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 779 transitions. [2022-12-13 16:35:32,535 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 16:35:32,535 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 779 transitions. [2022-12-13 16:35:32,537 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 111.28571428571429) internal successors, (779), 7 states have internal predecessors, (779), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:35:32,539 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 244.0) internal successors, (1952), 8 states have internal predecessors, (1952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:35:32,540 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 244.0) internal successors, (1952), 8 states have internal predecessors, (1952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:35:32,540 INFO L175 Difference]: Start difference. First operand has 35 places, 23 transitions, 58 flow. Second operand 7 states and 779 transitions. [2022-12-13 16:35:32,540 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 70 transitions, 290 flow [2022-12-13 16:35:32,540 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 70 transitions, 285 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-13 16:35:32,541 INFO L231 Difference]: Finished difference. Result has 44 places, 29 transitions, 129 flow [2022-12-13 16:35:32,541 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=53, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=129, PETRI_PLACES=44, PETRI_TRANSITIONS=29} [2022-12-13 16:35:32,542 INFO L288 CegarLoopForPetriNet]: 43 programPoint places, 1 predicate places. [2022-12-13 16:35:32,542 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 29 transitions, 129 flow [2022-12-13 16:35:32,542 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 103.0) internal successors, (515), 5 states have internal predecessors, (515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:35:32,542 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 16:35:32,542 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:35:32,542 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 16:35:32,542 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-12-13 16:35:32,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:35:32,543 INFO L85 PathProgramCache]: Analyzing trace with hash -1687176990, now seen corresponding path program 1 times [2022-12-13 16:35:32,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:35:32,543 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427660611] [2022-12-13 16:35:32,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:35:32,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:35:32,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:35:33,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:35:33,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:35:33,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427660611] [2022-12-13 16:35:33,001 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427660611] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:35:33,001 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:35:33,002 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 16:35:33,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097462548] [2022-12-13 16:35:33,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:35:33,002 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 16:35:33,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:35:33,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 16:35:33,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-13 16:35:33,053 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 244 [2022-12-13 16:35:33,054 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 29 transitions, 129 flow. Second operand has 6 states, 6 states have (on average 102.0) internal successors, (612), 6 states have internal predecessors, (612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:35:33,054 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 16:35:33,054 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 244 [2022-12-13 16:35:33,054 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 16:35:33,573 INFO L130 PetriNetUnfolder]: 2109/3130 cut-off events. [2022-12-13 16:35:33,574 INFO L131 PetriNetUnfolder]: For 3012/3012 co-relation queries the response was YES. [2022-12-13 16:35:33,577 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9631 conditions, 3130 events. 2109/3130 cut-off events. For 3012/3012 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 14281 event pairs, 421 based on Foata normal form. 130/3260 useless extension candidates. Maximal degree in co-relation 9622. Up to 2200 conditions per place. [2022-12-13 16:35:33,587 INFO L137 encePairwiseOnDemand]: 231/244 looper letters, 45 selfloop transitions, 18 changer transitions 32/95 dead transitions. [2022-12-13 16:35:33,587 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 95 transitions, 579 flow [2022-12-13 16:35:33,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 16:35:33,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 16:35:33,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 788 transitions. [2022-12-13 16:35:33,589 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4613583138173302 [2022-12-13 16:35:33,589 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 788 transitions. [2022-12-13 16:35:33,589 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 788 transitions. [2022-12-13 16:35:33,590 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 16:35:33,590 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 788 transitions. [2022-12-13 16:35:33,591 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 112.57142857142857) internal successors, (788), 7 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:35:33,594 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 244.0) internal successors, (1952), 8 states have internal predecessors, (1952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:35:33,594 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 244.0) internal successors, (1952), 8 states have internal predecessors, (1952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:35:33,594 INFO L175 Difference]: Start difference. First operand has 44 places, 29 transitions, 129 flow. Second operand 7 states and 788 transitions. [2022-12-13 16:35:33,594 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 95 transitions, 579 flow [2022-12-13 16:35:33,603 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 95 transitions, 567 flow, removed 4 selfloop flow, removed 2 redundant places. [2022-12-13 16:35:33,604 INFO L231 Difference]: Finished difference. Result has 51 places, 41 transitions, 290 flow [2022-12-13 16:35:33,604 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=123, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=290, PETRI_PLACES=51, PETRI_TRANSITIONS=41} [2022-12-13 16:35:33,605 INFO L288 CegarLoopForPetriNet]: 43 programPoint places, 8 predicate places. [2022-12-13 16:35:33,605 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 41 transitions, 290 flow [2022-12-13 16:35:33,605 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 102.0) internal successors, (612), 6 states have internal predecessors, (612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:35:33,605 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 16:35:33,605 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:35:33,605 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 16:35:33,606 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-12-13 16:35:33,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:35:33,606 INFO L85 PathProgramCache]: Analyzing trace with hash -853764850, now seen corresponding path program 1 times [2022-12-13 16:35:33,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:35:33,606 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782216985] [2022-12-13 16:35:33,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:35:33,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:35:33,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:35:34,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:35:34,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:35:34,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782216985] [2022-12-13 16:35:34,183 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1782216985] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:35:34,183 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:35:34,183 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 16:35:34,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176369063] [2022-12-13 16:35:34,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:35:34,183 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 16:35:34,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:35:34,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 16:35:34,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 16:35:34,235 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 244 [2022-12-13 16:35:34,236 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 41 transitions, 290 flow. Second operand has 6 states, 6 states have (on average 99.16666666666667) internal successors, (595), 6 states have internal predecessors, (595), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:35:34,236 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 16:35:34,236 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 244 [2022-12-13 16:35:34,236 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 16:35:34,899 INFO L130 PetriNetUnfolder]: 2178/3223 cut-off events. [2022-12-13 16:35:34,899 INFO L131 PetriNetUnfolder]: For 7083/7083 co-relation queries the response was YES. [2022-12-13 16:35:34,905 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13758 conditions, 3223 events. 2178/3223 cut-off events. For 7083/7083 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 14539 event pairs, 637 based on Foata normal form. 100/3323 useless extension candidates. Maximal degree in co-relation 13744. Up to 2288 conditions per place. [2022-12-13 16:35:34,917 INFO L137 encePairwiseOnDemand]: 231/244 looper letters, 85 selfloop transitions, 40 changer transitions 38/163 dead transitions. [2022-12-13 16:35:34,917 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 163 transitions, 1486 flow [2022-12-13 16:35:34,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 16:35:34,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-13 16:35:34,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1184 transitions. [2022-12-13 16:35:34,921 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.44113263785394935 [2022-12-13 16:35:34,921 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1184 transitions. [2022-12-13 16:35:34,921 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1184 transitions. [2022-12-13 16:35:34,922 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 16:35:34,922 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1184 transitions. [2022-12-13 16:35:34,925 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 107.63636363636364) internal successors, (1184), 11 states have internal predecessors, (1184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:35:34,929 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 244.0) internal successors, (2928), 12 states have internal predecessors, (2928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:35:34,930 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 244.0) internal successors, (2928), 12 states have internal predecessors, (2928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:35:34,930 INFO L175 Difference]: Start difference. First operand has 51 places, 41 transitions, 290 flow. Second operand 11 states and 1184 transitions. [2022-12-13 16:35:34,930 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 163 transitions, 1486 flow [2022-12-13 16:35:34,952 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 163 transitions, 1366 flow, removed 60 selfloop flow, removed 2 redundant places. [2022-12-13 16:35:34,954 INFO L231 Difference]: Finished difference. Result has 66 places, 76 transitions, 757 flow [2022-12-13 16:35:34,954 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=264, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=757, PETRI_PLACES=66, PETRI_TRANSITIONS=76} [2022-12-13 16:35:34,955 INFO L288 CegarLoopForPetriNet]: 43 programPoint places, 23 predicate places. [2022-12-13 16:35:34,955 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 76 transitions, 757 flow [2022-12-13 16:35:34,956 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 99.16666666666667) internal successors, (595), 6 states have internal predecessors, (595), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:35:34,956 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 16:35:34,956 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:35:34,956 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 16:35:34,956 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-12-13 16:35:34,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:35:34,956 INFO L85 PathProgramCache]: Analyzing trace with hash -763887434, now seen corresponding path program 2 times [2022-12-13 16:35:34,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:35:34,957 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371639004] [2022-12-13 16:35:34,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:35:34,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:35:34,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:35:35,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:35:35,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:35:35,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371639004] [2022-12-13 16:35:35,549 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1371639004] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:35:35,549 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:35:35,549 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 16:35:35,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079589781] [2022-12-13 16:35:35,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:35:35,550 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 16:35:35,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:35:35,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 16:35:35,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-13 16:35:35,613 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 244 [2022-12-13 16:35:35,613 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 76 transitions, 757 flow. Second operand has 7 states, 7 states have (on average 100.85714285714286) internal successors, (706), 7 states have internal predecessors, (706), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:35:35,613 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 16:35:35,613 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 244 [2022-12-13 16:35:35,614 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 16:35:36,242 INFO L130 PetriNetUnfolder]: 2258/3347 cut-off events. [2022-12-13 16:35:36,242 INFO L131 PetriNetUnfolder]: For 14185/14185 co-relation queries the response was YES. [2022-12-13 16:35:36,247 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16190 conditions, 3347 events. 2258/3347 cut-off events. For 14185/14185 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 15249 event pairs, 637 based on Foata normal form. 118/3465 useless extension candidates. Maximal degree in co-relation 16168. Up to 2199 conditions per place. [2022-12-13 16:35:36,256 INFO L137 encePairwiseOnDemand]: 231/244 looper letters, 85 selfloop transitions, 61 changer transitions 35/181 dead transitions. [2022-12-13 16:35:36,256 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 181 transitions, 1979 flow [2022-12-13 16:35:36,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 16:35:36,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 16:35:36,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 892 transitions. [2022-12-13 16:35:36,258 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4569672131147541 [2022-12-13 16:35:36,258 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 892 transitions. [2022-12-13 16:35:36,258 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 892 transitions. [2022-12-13 16:35:36,259 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 16:35:36,259 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 892 transitions. [2022-12-13 16:35:36,260 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 111.5) internal successors, (892), 8 states have internal predecessors, (892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:35:36,261 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 244.0) internal successors, (2196), 9 states have internal predecessors, (2196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:35:36,262 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 244.0) internal successors, (2196), 9 states have internal predecessors, (2196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:35:36,262 INFO L175 Difference]: Start difference. First operand has 66 places, 76 transitions, 757 flow. Second operand 8 states and 892 transitions. [2022-12-13 16:35:36,262 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 181 transitions, 1979 flow [2022-12-13 16:35:36,311 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 181 transitions, 1927 flow, removed 26 selfloop flow, removed 3 redundant places. [2022-12-13 16:35:36,313 INFO L231 Difference]: Finished difference. Result has 72 places, 107 transitions, 1371 flow [2022-12-13 16:35:36,313 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=733, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1371, PETRI_PLACES=72, PETRI_TRANSITIONS=107} [2022-12-13 16:35:36,313 INFO L288 CegarLoopForPetriNet]: 43 programPoint places, 29 predicate places. [2022-12-13 16:35:36,313 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 107 transitions, 1371 flow [2022-12-13 16:35:36,314 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 100.85714285714286) internal successors, (706), 7 states have internal predecessors, (706), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:35:36,314 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 16:35:36,314 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:35:36,314 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 16:35:36,314 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-12-13 16:35:36,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:35:36,314 INFO L85 PathProgramCache]: Analyzing trace with hash 560542, now seen corresponding path program 1 times [2022-12-13 16:35:36,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:35:36,314 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967814184] [2022-12-13 16:35:36,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:35:36,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:35:36,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:35:36,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:35:36,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:35:36,590 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967814184] [2022-12-13 16:35:36,591 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967814184] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:35:36,591 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:35:36,591 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 16:35:36,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677434739] [2022-12-13 16:35:36,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:35:36,591 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 16:35:36,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:35:36,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 16:35:36,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 16:35:36,613 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 244 [2022-12-13 16:35:36,613 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 107 transitions, 1371 flow. Second operand has 6 states, 6 states have (on average 112.16666666666667) internal successors, (673), 6 states have internal predecessors, (673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:35:36,614 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 16:35:36,614 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 244 [2022-12-13 16:35:36,614 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 16:35:37,081 INFO L130 PetriNetUnfolder]: 1804/2779 cut-off events. [2022-12-13 16:35:37,081 INFO L131 PetriNetUnfolder]: For 18558/18863 co-relation queries the response was YES. [2022-12-13 16:35:37,086 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16625 conditions, 2779 events. 1804/2779 cut-off events. For 18558/18863 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 13618 event pairs, 341 based on Foata normal form. 239/2989 useless extension candidates. Maximal degree in co-relation 16600. Up to 1964 conditions per place. [2022-12-13 16:35:37,094 INFO L137 encePairwiseOnDemand]: 239/244 looper letters, 97 selfloop transitions, 10 changer transitions 15/148 dead transitions. [2022-12-13 16:35:37,094 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 148 transitions, 1983 flow [2022-12-13 16:35:37,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 16:35:37,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 16:35:37,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 715 transitions. [2022-12-13 16:35:37,096 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4883879781420765 [2022-12-13 16:35:37,096 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 715 transitions. [2022-12-13 16:35:37,096 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 715 transitions. [2022-12-13 16:35:37,097 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 16:35:37,097 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 715 transitions. [2022-12-13 16:35:37,098 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 119.16666666666667) internal successors, (715), 6 states have internal predecessors, (715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:35:37,100 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 244.0) internal successors, (1708), 7 states have internal predecessors, (1708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:35:37,101 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 244.0) internal successors, (1708), 7 states have internal predecessors, (1708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:35:37,101 INFO L175 Difference]: Start difference. First operand has 72 places, 107 transitions, 1371 flow. Second operand 6 states and 715 transitions. [2022-12-13 16:35:37,101 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 148 transitions, 1983 flow [2022-12-13 16:35:37,159 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 148 transitions, 1950 flow, removed 13 selfloop flow, removed 3 redundant places. [2022-12-13 16:35:37,160 INFO L231 Difference]: Finished difference. Result has 74 places, 107 transitions, 1372 flow [2022-12-13 16:35:37,161 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=1340, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1372, PETRI_PLACES=74, PETRI_TRANSITIONS=107} [2022-12-13 16:35:37,161 INFO L288 CegarLoopForPetriNet]: 43 programPoint places, 31 predicate places. [2022-12-13 16:35:37,161 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 107 transitions, 1372 flow [2022-12-13 16:35:37,161 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 112.16666666666667) internal successors, (673), 6 states have internal predecessors, (673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:35:37,161 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 16:35:37,161 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:35:37,161 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 16:35:37,162 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-12-13 16:35:37,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:35:37,162 INFO L85 PathProgramCache]: Analyzing trace with hash -245998800, now seen corresponding path program 1 times [2022-12-13 16:35:37,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:35:37,162 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499666157] [2022-12-13 16:35:37,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:35:37,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:35:37,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:35:37,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:35:37,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:35:37,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499666157] [2022-12-13 16:35:37,514 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499666157] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:35:37,514 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:35:37,514 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 16:35:37,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849103830] [2022-12-13 16:35:37,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:35:37,515 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 16:35:37,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:35:37,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 16:35:37,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-13 16:35:37,545 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 244 [2022-12-13 16:35:37,546 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 107 transitions, 1372 flow. Second operand has 7 states, 7 states have (on average 110.0) internal successors, (770), 7 states have internal predecessors, (770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:35:37,546 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 16:35:37,546 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 244 [2022-12-13 16:35:37,547 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 16:35:38,155 INFO L130 PetriNetUnfolder]: 1960/3030 cut-off events. [2022-12-13 16:35:38,155 INFO L131 PetriNetUnfolder]: For 21034/21384 co-relation queries the response was YES. [2022-12-13 16:35:38,162 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18561 conditions, 3030 events. 1960/3030 cut-off events. For 21034/21384 co-relation queries the response was YES. Maximal size of possible extension queue 150. Compared 15412 event pairs, 317 based on Foata normal form. 271/3235 useless extension candidates. Maximal degree in co-relation 18534. Up to 1757 conditions per place. [2022-12-13 16:35:38,171 INFO L137 encePairwiseOnDemand]: 235/244 looper letters, 70 selfloop transitions, 56 changer transitions 18/170 dead transitions. [2022-12-13 16:35:38,171 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 170 transitions, 2290 flow [2022-12-13 16:35:38,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 16:35:38,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 16:35:38,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 824 transitions. [2022-12-13 16:35:38,172 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.48243559718969553 [2022-12-13 16:35:38,172 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 824 transitions. [2022-12-13 16:35:38,172 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 824 transitions. [2022-12-13 16:35:38,173 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 16:35:38,173 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 824 transitions. [2022-12-13 16:35:38,174 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 117.71428571428571) internal successors, (824), 7 states have internal predecessors, (824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:35:38,175 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 244.0) internal successors, (1952), 8 states have internal predecessors, (1952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:35:38,175 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 244.0) internal successors, (1952), 8 states have internal predecessors, (1952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:35:38,175 INFO L175 Difference]: Start difference. First operand has 74 places, 107 transitions, 1372 flow. Second operand 7 states and 824 transitions. [2022-12-13 16:35:38,175 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 170 transitions, 2290 flow [2022-12-13 16:35:38,221 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 170 transitions, 2265 flow, removed 5 selfloop flow, removed 6 redundant places. [2022-12-13 16:35:38,223 INFO L231 Difference]: Finished difference. Result has 76 places, 123 transitions, 1794 flow [2022-12-13 16:35:38,223 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=1348, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1794, PETRI_PLACES=76, PETRI_TRANSITIONS=123} [2022-12-13 16:35:38,224 INFO L288 CegarLoopForPetriNet]: 43 programPoint places, 33 predicate places. [2022-12-13 16:35:38,224 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 123 transitions, 1794 flow [2022-12-13 16:35:38,224 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 110.0) internal successors, (770), 7 states have internal predecessors, (770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:35:38,224 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 16:35:38,224 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:35:38,224 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 16:35:38,224 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-12-13 16:35:38,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:35:38,225 INFO L85 PathProgramCache]: Analyzing trace with hash 680592907, now seen corresponding path program 1 times [2022-12-13 16:35:38,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:35:38,225 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330772782] [2022-12-13 16:35:38,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:35:38,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:35:38,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:35:38,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:35:38,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:35:38,327 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330772782] [2022-12-13 16:35:38,327 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1330772782] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:35:38,327 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:35:38,327 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 16:35:38,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271518333] [2022-12-13 16:35:38,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:35:38,328 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 16:35:38,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:35:38,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 16:35:38,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 16:35:38,339 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 244 [2022-12-13 16:35:38,339 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 123 transitions, 1794 flow. Second operand has 4 states, 4 states have (on average 110.25) internal successors, (441), 4 states have internal predecessors, (441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:35:38,339 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 16:35:38,339 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 244 [2022-12-13 16:35:38,340 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 16:35:38,705 INFO L130 PetriNetUnfolder]: 1183/1943 cut-off events. [2022-12-13 16:35:38,705 INFO L131 PetriNetUnfolder]: For 22592/22989 co-relation queries the response was YES. [2022-12-13 16:35:38,709 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13059 conditions, 1943 events. 1183/1943 cut-off events. For 22592/22989 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 10197 event pairs, 198 based on Foata normal form. 505/2403 useless extension candidates. Maximal degree in co-relation 13032. Up to 1085 conditions per place. [2022-12-13 16:35:38,714 INFO L137 encePairwiseOnDemand]: 238/244 looper letters, 128 selfloop transitions, 5 changer transitions 0/161 dead transitions. [2022-12-13 16:35:38,714 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 161 transitions, 2604 flow [2022-12-13 16:35:38,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 16:35:38,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 16:35:38,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 472 transitions. [2022-12-13 16:35:38,715 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.48360655737704916 [2022-12-13 16:35:38,715 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 472 transitions. [2022-12-13 16:35:38,715 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 472 transitions. [2022-12-13 16:35:38,716 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 16:35:38,716 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 472 transitions. [2022-12-13 16:35:38,716 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 118.0) internal successors, (472), 4 states have internal predecessors, (472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:35:38,717 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 244.0) internal successors, (1220), 5 states have internal predecessors, (1220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:35:38,717 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 244.0) internal successors, (1220), 5 states have internal predecessors, (1220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:35:38,717 INFO L175 Difference]: Start difference. First operand has 76 places, 123 transitions, 1794 flow. Second operand 4 states and 472 transitions. [2022-12-13 16:35:38,717 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 161 transitions, 2604 flow [2022-12-13 16:35:38,743 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 161 transitions, 2508 flow, removed 23 selfloop flow, removed 3 redundant places. [2022-12-13 16:35:38,744 INFO L231 Difference]: Finished difference. Result has 76 places, 108 transitions, 1527 flow [2022-12-13 16:35:38,744 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=1465, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1527, PETRI_PLACES=76, PETRI_TRANSITIONS=108} [2022-12-13 16:35:38,745 INFO L288 CegarLoopForPetriNet]: 43 programPoint places, 33 predicate places. [2022-12-13 16:35:38,745 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 108 transitions, 1527 flow [2022-12-13 16:35:38,745 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 110.25) internal successors, (441), 4 states have internal predecessors, (441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:35:38,745 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 16:35:38,745 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:35:38,745 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 16:35:38,745 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-12-13 16:35:38,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:35:38,746 INFO L85 PathProgramCache]: Analyzing trace with hash -210617496, now seen corresponding path program 1 times [2022-12-13 16:35:38,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:35:38,746 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135511094] [2022-12-13 16:35:38,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:35:38,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:35:38,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:35:38,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:35:38,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:35:38,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135511094] [2022-12-13 16:35:38,849 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1135511094] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:35:38,849 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:35:38,849 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 16:35:38,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878575420] [2022-12-13 16:35:38,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:35:38,850 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 16:35:38,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:35:38,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 16:35:38,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 16:35:38,857 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 244 [2022-12-13 16:35:38,858 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 108 transitions, 1527 flow. Second operand has 5 states, 5 states have (on average 109.8) internal successors, (549), 5 states have internal predecessors, (549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:35:38,858 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 16:35:38,858 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 244 [2022-12-13 16:35:38,858 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 16:35:39,186 INFO L130 PetriNetUnfolder]: 885/1499 cut-off events. [2022-12-13 16:35:39,187 INFO L131 PetriNetUnfolder]: For 17090/17463 co-relation queries the response was YES. [2022-12-13 16:35:39,189 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9945 conditions, 1499 events. 885/1499 cut-off events. For 17090/17463 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 7746 event pairs, 151 based on Foata normal form. 316/1781 useless extension candidates. Maximal degree in co-relation 9918. Up to 800 conditions per place. [2022-12-13 16:35:39,193 INFO L137 encePairwiseOnDemand]: 238/244 looper letters, 117 selfloop transitions, 8 changer transitions 0/152 dead transitions. [2022-12-13 16:35:39,193 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 152 transitions, 2278 flow [2022-12-13 16:35:39,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 16:35:39,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 16:35:39,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 591 transitions. [2022-12-13 16:35:39,194 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.48442622950819675 [2022-12-13 16:35:39,194 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 591 transitions. [2022-12-13 16:35:39,194 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 591 transitions. [2022-12-13 16:35:39,194 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 16:35:39,195 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 591 transitions. [2022-12-13 16:35:39,195 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 118.2) internal successors, (591), 5 states have internal predecessors, (591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:35:39,196 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 244.0) internal successors, (1464), 6 states have internal predecessors, (1464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:35:39,196 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 244.0) internal successors, (1464), 6 states have internal predecessors, (1464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:35:39,196 INFO L175 Difference]: Start difference. First operand has 76 places, 108 transitions, 1527 flow. Second operand 5 states and 591 transitions. [2022-12-13 16:35:39,196 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 152 transitions, 2278 flow [2022-12-13 16:35:39,235 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 152 transitions, 2259 flow, removed 6 selfloop flow, removed 2 redundant places. [2022-12-13 16:35:39,237 INFO L231 Difference]: Finished difference. Result has 80 places, 103 transitions, 1416 flow [2022-12-13 16:35:39,237 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=1358, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1416, PETRI_PLACES=80, PETRI_TRANSITIONS=103} [2022-12-13 16:35:39,237 INFO L288 CegarLoopForPetriNet]: 43 programPoint places, 37 predicate places. [2022-12-13 16:35:39,237 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 103 transitions, 1416 flow [2022-12-13 16:35:39,238 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 109.8) internal successors, (549), 5 states have internal predecessors, (549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:35:39,238 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 16:35:39,238 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:35:39,238 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 16:35:39,238 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-12-13 16:35:39,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:35:39,238 INFO L85 PathProgramCache]: Analyzing trace with hash -1692705083, now seen corresponding path program 1 times [2022-12-13 16:35:39,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:35:39,238 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43967810] [2022-12-13 16:35:39,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:35:39,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:35:39,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:35:39,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:35:39,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:35:39,357 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43967810] [2022-12-13 16:35:39,357 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43967810] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:35:39,357 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:35:39,358 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 16:35:39,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383596027] [2022-12-13 16:35:39,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:35:39,358 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 16:35:39,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:35:39,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 16:35:39,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-13 16:35:39,372 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 244 [2022-12-13 16:35:39,373 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 103 transitions, 1416 flow. Second operand has 6 states, 6 states have (on average 109.66666666666667) internal successors, (658), 6 states have internal predecessors, (658), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:35:39,373 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 16:35:39,373 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 244 [2022-12-13 16:35:39,374 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 16:35:39,673 INFO L130 PetriNetUnfolder]: 847/1424 cut-off events. [2022-12-13 16:35:39,674 INFO L131 PetriNetUnfolder]: For 14784/15055 co-relation queries the response was YES. [2022-12-13 16:35:39,677 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9664 conditions, 1424 events. 847/1424 cut-off events. For 14784/15055 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 7350 event pairs, 144 based on Foata normal form. 154/1544 useless extension candidates. Maximal degree in co-relation 9636. Up to 755 conditions per place. [2022-12-13 16:35:39,680 INFO L137 encePairwiseOnDemand]: 238/244 looper letters, 102 selfloop transitions, 11 changer transitions 0/140 dead transitions. [2022-12-13 16:35:39,680 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 140 transitions, 2125 flow [2022-12-13 16:35:39,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 16:35:39,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 16:35:39,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 690 transitions. [2022-12-13 16:35:39,681 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4713114754098361 [2022-12-13 16:35:39,681 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 690 transitions. [2022-12-13 16:35:39,681 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 690 transitions. [2022-12-13 16:35:39,681 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 16:35:39,681 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 690 transitions. [2022-12-13 16:35:39,682 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 115.0) internal successors, (690), 6 states have internal predecessors, (690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:35:39,683 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 244.0) internal successors, (1708), 7 states have internal predecessors, (1708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:35:39,684 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 244.0) internal successors, (1708), 7 states have internal predecessors, (1708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:35:39,684 INFO L175 Difference]: Start difference. First operand has 80 places, 103 transitions, 1416 flow. Second operand 6 states and 690 transitions. [2022-12-13 16:35:39,684 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 140 transitions, 2125 flow [2022-12-13 16:35:39,711 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 140 transitions, 2018 flow, removed 42 selfloop flow, removed 4 redundant places. [2022-12-13 16:35:39,712 INFO L231 Difference]: Finished difference. Result has 83 places, 103 transitions, 1347 flow [2022-12-13 16:35:39,713 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=1303, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1347, PETRI_PLACES=83, PETRI_TRANSITIONS=103} [2022-12-13 16:35:39,713 INFO L288 CegarLoopForPetriNet]: 43 programPoint places, 40 predicate places. [2022-12-13 16:35:39,713 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 103 transitions, 1347 flow [2022-12-13 16:35:39,713 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 109.66666666666667) internal successors, (658), 6 states have internal predecessors, (658), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:35:39,713 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 16:35:39,713 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:35:39,713 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 16:35:39,714 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-12-13 16:35:39,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:35:39,714 INFO L85 PathProgramCache]: Analyzing trace with hash -1561405058, now seen corresponding path program 1 times [2022-12-13 16:35:39,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:35:39,714 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616911909] [2022-12-13 16:35:39,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:35:39,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:35:39,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:35:39,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:35:39,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:35:39,966 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616911909] [2022-12-13 16:35:39,966 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1616911909] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:35:39,966 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:35:39,966 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 16:35:39,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17431610] [2022-12-13 16:35:39,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:35:39,966 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 16:35:39,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:35:39,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 16:35:39,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 16:35:40,029 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 244 [2022-12-13 16:35:40,030 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 103 transitions, 1347 flow. Second operand has 6 states, 6 states have (on average 102.66666666666667) internal successors, (616), 6 states have internal predecessors, (616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:35:40,030 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 16:35:40,031 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 244 [2022-12-13 16:35:40,031 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 16:35:40,638 INFO L130 PetriNetUnfolder]: 1477/2450 cut-off events. [2022-12-13 16:35:40,638 INFO L131 PetriNetUnfolder]: For 21934/21946 co-relation queries the response was YES. [2022-12-13 16:35:40,643 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16262 conditions, 2450 events. 1477/2450 cut-off events. For 21934/21946 co-relation queries the response was YES. Maximal size of possible extension queue 150. Compared 13174 event pairs, 205 based on Foata normal form. 7/2453 useless extension candidates. Maximal degree in co-relation 16234. Up to 1151 conditions per place. [2022-12-13 16:35:40,646 INFO L137 encePairwiseOnDemand]: 232/244 looper letters, 71 selfloop transitions, 35 changer transitions 113/224 dead transitions. [2022-12-13 16:35:40,646 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 224 transitions, 3241 flow [2022-12-13 16:35:40,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 16:35:40,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 16:35:40,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 766 transitions. [2022-12-13 16:35:40,648 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4484777517564403 [2022-12-13 16:35:40,648 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 766 transitions. [2022-12-13 16:35:40,648 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 766 transitions. [2022-12-13 16:35:40,648 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 16:35:40,648 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 766 transitions. [2022-12-13 16:35:40,649 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 109.42857142857143) internal successors, (766), 7 states have internal predecessors, (766), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:35:40,650 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 244.0) internal successors, (1952), 8 states have internal predecessors, (1952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:35:40,651 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 244.0) internal successors, (1952), 8 states have internal predecessors, (1952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:35:40,651 INFO L175 Difference]: Start difference. First operand has 83 places, 103 transitions, 1347 flow. Second operand 7 states and 766 transitions. [2022-12-13 16:35:40,651 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 224 transitions, 3241 flow [2022-12-13 16:35:40,705 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 224 transitions, 3091 flow, removed 57 selfloop flow, removed 6 redundant places. [2022-12-13 16:35:40,707 INFO L231 Difference]: Finished difference. Result has 88 places, 88 transitions, 1214 flow [2022-12-13 16:35:40,707 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=1283, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1214, PETRI_PLACES=88, PETRI_TRANSITIONS=88} [2022-12-13 16:35:40,708 INFO L288 CegarLoopForPetriNet]: 43 programPoint places, 45 predicate places. [2022-12-13 16:35:40,708 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 88 transitions, 1214 flow [2022-12-13 16:35:40,708 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 102.66666666666667) internal successors, (616), 6 states have internal predecessors, (616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:35:40,708 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 16:35:40,708 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:35:40,708 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-13 16:35:40,708 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-12-13 16:35:40,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:35:40,708 INFO L85 PathProgramCache]: Analyzing trace with hash -1127472046, now seen corresponding path program 2 times [2022-12-13 16:35:40,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:35:40,709 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950635409] [2022-12-13 16:35:40,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:35:40,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:35:40,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:35:40,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:35:40,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:35:40,958 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950635409] [2022-12-13 16:35:40,958 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950635409] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:35:40,958 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:35:40,958 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 16:35:40,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953479924] [2022-12-13 16:35:40,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:35:40,958 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 16:35:40,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:35:40,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 16:35:40,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 16:35:41,005 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 244 [2022-12-13 16:35:41,006 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 88 transitions, 1214 flow. Second operand has 5 states, 5 states have (on average 105.4) internal successors, (527), 5 states have internal predecessors, (527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:35:41,006 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 16:35:41,006 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 244 [2022-12-13 16:35:41,006 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 16:35:41,317 INFO L130 PetriNetUnfolder]: 966/1737 cut-off events. [2022-12-13 16:35:41,317 INFO L131 PetriNetUnfolder]: For 13445/13468 co-relation queries the response was YES. [2022-12-13 16:35:41,321 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10588 conditions, 1737 events. 966/1737 cut-off events. For 13445/13468 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 9790 event pairs, 216 based on Foata normal form. 2/1722 useless extension candidates. Maximal degree in co-relation 10558. Up to 836 conditions per place. [2022-12-13 16:35:41,323 INFO L137 encePairwiseOnDemand]: 238/244 looper letters, 38 selfloop transitions, 5 changer transitions 76/121 dead transitions. [2022-12-13 16:35:41,323 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 121 transitions, 1721 flow [2022-12-13 16:35:41,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 16:35:41,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 16:35:41,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 549 transitions. [2022-12-13 16:35:41,324 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.45 [2022-12-13 16:35:41,324 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 549 transitions. [2022-12-13 16:35:41,324 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 549 transitions. [2022-12-13 16:35:41,325 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 16:35:41,325 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 549 transitions. [2022-12-13 16:35:41,325 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 109.8) internal successors, (549), 5 states have internal predecessors, (549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:35:41,326 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 244.0) internal successors, (1464), 6 states have internal predecessors, (1464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:35:41,326 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 244.0) internal successors, (1464), 6 states have internal predecessors, (1464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:35:41,326 INFO L175 Difference]: Start difference. First operand has 88 places, 88 transitions, 1214 flow. Second operand 5 states and 549 transitions. [2022-12-13 16:35:41,327 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 121 transitions, 1721 flow [2022-12-13 16:35:41,359 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 121 transitions, 1625 flow, removed 21 selfloop flow, removed 5 redundant places. [2022-12-13 16:35:41,361 INFO L231 Difference]: Finished difference. Result has 87 places, 40 transitions, 365 flow [2022-12-13 16:35:41,361 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=1134, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=365, PETRI_PLACES=87, PETRI_TRANSITIONS=40} [2022-12-13 16:35:41,361 INFO L288 CegarLoopForPetriNet]: 43 programPoint places, 44 predicate places. [2022-12-13 16:35:41,361 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 40 transitions, 365 flow [2022-12-13 16:35:41,361 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 105.4) internal successors, (527), 5 states have internal predecessors, (527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:35:41,361 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 16:35:41,361 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:35:41,361 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-13 16:35:41,362 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-12-13 16:35:41,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:35:41,362 INFO L85 PathProgramCache]: Analyzing trace with hash 2140015094, now seen corresponding path program 3 times [2022-12-13 16:35:41,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:35:41,362 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480515291] [2022-12-13 16:35:41,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:35:41,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:35:41,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:35:42,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:35:42,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:35:42,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480515291] [2022-12-13 16:35:42,024 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480515291] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:35:42,024 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:35:42,024 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 16:35:42,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797597277] [2022-12-13 16:35:42,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:35:42,025 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 16:35:42,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:35:42,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 16:35:42,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-12-13 16:35:42,091 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 244 [2022-12-13 16:35:42,092 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 40 transitions, 365 flow. Second operand has 10 states, 10 states have (on average 109.0) internal successors, (1090), 10 states have internal predecessors, (1090), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:35:42,092 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 16:35:42,092 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 244 [2022-12-13 16:35:42,092 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 16:35:42,332 INFO L130 PetriNetUnfolder]: 362/708 cut-off events. [2022-12-13 16:35:42,332 INFO L131 PetriNetUnfolder]: For 3066/3087 co-relation queries the response was YES. [2022-12-13 16:35:42,333 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3586 conditions, 708 events. 362/708 cut-off events. For 3066/3087 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 3467 event pairs, 70 based on Foata normal form. 5/700 useless extension candidates. Maximal degree in co-relation 3557. Up to 259 conditions per place. [2022-12-13 16:35:42,334 INFO L137 encePairwiseOnDemand]: 238/244 looper letters, 30 selfloop transitions, 4 changer transitions 44/81 dead transitions. [2022-12-13 16:35:42,334 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 81 transitions, 801 flow [2022-12-13 16:35:42,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 16:35:42,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 16:35:42,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 799 transitions. [2022-12-13 16:35:42,336 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4677985948477752 [2022-12-13 16:35:42,336 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 799 transitions. [2022-12-13 16:35:42,336 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 799 transitions. [2022-12-13 16:35:42,336 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 16:35:42,336 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 799 transitions. [2022-12-13 16:35:42,337 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 114.14285714285714) internal successors, (799), 7 states have internal predecessors, (799), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:35:42,339 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 244.0) internal successors, (1952), 8 states have internal predecessors, (1952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:35:42,340 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 244.0) internal successors, (1952), 8 states have internal predecessors, (1952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:35:42,340 INFO L175 Difference]: Start difference. First operand has 87 places, 40 transitions, 365 flow. Second operand 7 states and 799 transitions. [2022-12-13 16:35:42,340 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 81 transitions, 801 flow [2022-12-13 16:35:42,346 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 81 transitions, 710 flow, removed 14 selfloop flow, removed 19 redundant places. [2022-12-13 16:35:42,346 INFO L231 Difference]: Finished difference. Result has 70 places, 34 transitions, 256 flow [2022-12-13 16:35:42,347 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=284, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=256, PETRI_PLACES=70, PETRI_TRANSITIONS=34} [2022-12-13 16:35:42,347 INFO L288 CegarLoopForPetriNet]: 43 programPoint places, 27 predicate places. [2022-12-13 16:35:42,347 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 34 transitions, 256 flow [2022-12-13 16:35:42,348 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 109.0) internal successors, (1090), 10 states have internal predecessors, (1090), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:35:42,348 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 16:35:42,348 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:35:42,348 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-13 16:35:42,348 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-12-13 16:35:42,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:35:42,348 INFO L85 PathProgramCache]: Analyzing trace with hash 937363254, now seen corresponding path program 4 times [2022-12-13 16:35:42,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:35:42,348 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56235442] [2022-12-13 16:35:42,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:35:42,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:35:42,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 16:35:42,378 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 16:35:42,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 16:35:42,432 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 16:35:42,432 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 16:35:42,433 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (12 of 13 remaining) [2022-12-13 16:35:42,435 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (11 of 13 remaining) [2022-12-13 16:35:42,435 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining) [2022-12-13 16:35:42,435 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 13 remaining) [2022-12-13 16:35:42,435 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining) [2022-12-13 16:35:42,435 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining) [2022-12-13 16:35:42,436 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 13 remaining) [2022-12-13 16:35:42,436 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2022-12-13 16:35:42,436 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (4 of 13 remaining) [2022-12-13 16:35:42,436 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 13 remaining) [2022-12-13 16:35:42,436 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 13 remaining) [2022-12-13 16:35:42,436 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 13 remaining) [2022-12-13 16:35:42,436 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining) [2022-12-13 16:35:42,436 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-13 16:35:42,437 INFO L445 BasicCegarLoop]: Path program histogram: [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:35:42,442 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 16:35:42,442 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 16:35:42,493 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 04:35:42 BasicIcfg [2022-12-13 16:35:42,493 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 16:35:42,493 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-13 16:35:42,493 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-13 16:35:42,493 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-13 16:35:42,494 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 04:35:26" (3/4) ... [2022-12-13 16:35:42,496 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-12-13 16:35:42,497 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-13 16:35:42,497 INFO L158 Benchmark]: Toolchain (without parser) took 16771.36ms. Allocated memory was 115.3MB in the beginning and 413.1MB in the end (delta: 297.8MB). Free memory was 73.6MB in the beginning and 148.9MB in the end (delta: -75.3MB). Peak memory consumption was 224.7MB. Max. memory is 16.1GB. [2022-12-13 16:35:42,497 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 115.3MB. Free memory is still 86.6MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 16:35:42,498 INFO L158 Benchmark]: CACSL2BoogieTranslator took 359.85ms. Allocated memory is still 115.3MB. Free memory was 73.2MB in the beginning and 87.0MB in the end (delta: -13.8MB). Peak memory consumption was 33.4MB. Max. memory is 16.1GB. [2022-12-13 16:35:42,498 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.33ms. Allocated memory was 115.3MB in the beginning and 155.2MB in the end (delta: 39.8MB). Free memory was 87.0MB in the beginning and 126.3MB in the end (delta: -39.3MB). Peak memory consumption was 5.8MB. Max. memory is 16.1GB. [2022-12-13 16:35:42,498 INFO L158 Benchmark]: Boogie Preprocessor took 29.17ms. Allocated memory is still 155.2MB. Free memory was 126.3MB in the beginning and 124.2MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 16:35:42,498 INFO L158 Benchmark]: RCFGBuilder took 508.00ms. Allocated memory is still 155.2MB. Free memory was 124.2MB in the beginning and 88.6MB in the end (delta: 35.6MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. [2022-12-13 16:35:42,499 INFO L158 Benchmark]: TraceAbstraction took 15815.30ms. Allocated memory was 155.2MB in the beginning and 413.1MB in the end (delta: 257.9MB). Free memory was 88.0MB in the beginning and 150.0MB in the end (delta: -62.0MB). Peak memory consumption was 196.0MB. Max. memory is 16.1GB. [2022-12-13 16:35:42,499 INFO L158 Benchmark]: Witness Printer took 3.37ms. Allocated memory is still 413.1MB. Free memory was 150.0MB in the beginning and 148.9MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 16:35:42,501 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 115.3MB. Free memory is still 86.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 359.85ms. Allocated memory is still 115.3MB. Free memory was 73.2MB in the beginning and 87.0MB in the end (delta: -13.8MB). Peak memory consumption was 33.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.33ms. Allocated memory was 115.3MB in the beginning and 155.2MB in the end (delta: 39.8MB). Free memory was 87.0MB in the beginning and 126.3MB in the end (delta: -39.3MB). Peak memory consumption was 5.8MB. Max. memory is 16.1GB. * Boogie Preprocessor took 29.17ms. Allocated memory is still 155.2MB. Free memory was 126.3MB in the beginning and 124.2MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 508.00ms. Allocated memory is still 155.2MB. Free memory was 124.2MB in the beginning and 88.6MB in the end (delta: 35.6MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. * TraceAbstraction took 15815.30ms. Allocated memory was 155.2MB in the beginning and 413.1MB in the end (delta: 257.9MB). Free memory was 88.0MB in the beginning and 150.0MB in the end (delta: -62.0MB). Peak memory consumption was 196.0MB. Max. memory is 16.1GB. * Witness Printer took 3.37ms. Allocated memory is still 413.1MB. Free memory was 150.0MB in the beginning and 148.9MB 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: 3.2s, 131 PlacesBefore, 43 PlacesAfterwards, 123 TransitionsBefore, 34 TransitionsAfterwards, 2404 CoEnabledTransitionPairs, 7 FixpointIterations, 50 TrivialSequentialCompositions, 59 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 1 ChoiceCompositions, 118 TotalNumberOfCompositions, 7217 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3080, independent: 2870, independent conditional: 0, independent unconditional: 2870, dependent: 210, dependent conditional: 0, dependent unconditional: 210, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1229, independent: 1194, independent conditional: 0, independent unconditional: 1194, dependent: 35, dependent conditional: 0, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3080, independent: 1676, independent conditional: 0, independent unconditional: 1676, dependent: 175, dependent conditional: 0, dependent unconditional: 175, unknown: 1229, unknown conditional: 0, unknown unconditional: 1229] , Statistics on independence cache: Total cache size (in pairs): 112, Positive cache size: 96, Positive conditional cache size: 0, Positive unconditional cache size: 96, Negative cache size: 16, Negative conditional cache size: 0, Negative unconditional cache size: 16, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p2_EAX = 0; [L713] 0 int __unbuffered_p2_EBX = 0; [L714] 0 _Bool main$tmp_guard0; [L715] 0 _Bool main$tmp_guard1; [L717] 0 int x = 0; [L718] 0 _Bool x$flush_delayed; [L719] 0 int x$mem_tmp; [L720] 0 _Bool x$r_buff0_thd0; [L721] 0 _Bool x$r_buff0_thd1; [L722] 0 _Bool x$r_buff0_thd2; [L723] 0 _Bool x$r_buff0_thd3; [L724] 0 _Bool x$r_buff1_thd0; [L725] 0 _Bool x$r_buff1_thd1; [L726] 0 _Bool x$r_buff1_thd2; [L727] 0 _Bool x$r_buff1_thd3; [L728] 0 _Bool x$read_delayed; [L729] 0 int *x$read_delayed_var; [L730] 0 int x$w_buff0; [L731] 0 _Bool x$w_buff0_used; [L732] 0 int x$w_buff1; [L733] 0 _Bool x$w_buff1_used; [L735] 0 int y = 0; [L737] 0 int z = 0; [L738] 0 _Bool weak$$choice0; [L739] 0 _Bool weak$$choice2; [L823] 0 pthread_t t748; [L824] FCALL, FORK 0 pthread_create(&t748, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t748, ((void *)0), P0, ((void *)0))=-3, t748={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L825] 0 pthread_t t749; [L826] FCALL, FORK 0 pthread_create(&t749, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t749, ((void *)0), P1, ((void *)0))=-2, t748={5:0}, t749={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L827] 0 pthread_t t750; [L828] FCALL, FORK 0 pthread_create(&t750, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t750, ((void *)0), P2, ((void *)0))=-1, t748={5:0}, t749={6:0}, t750={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L763] 2 x$w_buff1 = x$w_buff0 [L764] 2 x$w_buff0 = 2 [L765] 2 x$w_buff1_used = x$w_buff0_used [L766] 2 x$w_buff0_used = (_Bool)1 [L767] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L767] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L768] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L769] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L770] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L771] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L772] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L775] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L792] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=0] [L795] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=0] [L798] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=0] [L743] 1 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L746] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L749] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L750] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L751] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L752] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L753] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L778] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L779] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L780] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L781] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L782] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L756] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L758] 1 return 0; [L801] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L802] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L803] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L804] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L805] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L785] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L787] 2 return 0; [L808] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L810] 3 return 0; [L830] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L832] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L832] RET 0 assume_abort_if_not(main$tmp_guard0) [L834] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L835] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L836] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L837] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L838] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t748={5:0}, t749={6:0}, t750={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L841] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L842] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L843] 0 x$flush_delayed = weak$$choice2 [L844] 0 x$mem_tmp = x [L845] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L846] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L847] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L848] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L849] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L850] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L851] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L852] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 2 && __unbuffered_p2_EBX == 0) [L853] 0 x = x$flush_delayed ? x$mem_tmp : x [L854] 0 x$flush_delayed = (_Bool)0 [L856] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 821]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 826]: 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: 824]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 828]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 154 locations, 13 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.7s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 7.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1038 SdHoareTripleChecker+Valid, 2.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 832 mSDsluCounter, 683 SdHoareTripleChecker+Invalid, 2.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 557 mSDsCounter, 223 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2170 IncrementalHoareTripleChecker+Invalid, 2393 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 223 mSolverCounterUnsat, 126 mSDtfsCounter, 2170 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 87 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1794occurred in iteration=9, InterpolantAutomatonStates: 90, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 4.3s InterpolantComputationTime, 235 NumberOfCodeBlocks, 235 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 197 ConstructedInterpolants, 0 QuantifiedInterpolants, 2491 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-12-13 16:35:42,518 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0af340b9-813b-4879-82e3-1ae81d317d05/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0af340b9-813b-4879-82e3-1ae81d317d05/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0af340b9-813b-4879-82e3-1ae81d317d05/bin/uautomizer-uyxdKDjOR8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0af340b9-813b-4879-82e3-1ae81d317d05/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0af340b9-813b-4879-82e3-1ae81d317d05/bin/uautomizer-uyxdKDjOR8/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix028_power.opt_pso.opt_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0af340b9-813b-4879-82e3-1ae81d317d05/bin/uautomizer-uyxdKDjOR8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0af340b9-813b-4879-82e3-1ae81d317d05/bin/uautomizer-uyxdKDjOR8 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a86612b573a63cde2c4106f45bf8b3ea66989a894eb80420a80ff8b17f8f03d1 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-2329fc7 [2022-12-13 16:35:44,133 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 16:35:44,134 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 16:35:44,147 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 16:35:44,148 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 16:35:44,149 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 16:35:44,150 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 16:35:44,151 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 16:35:44,152 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 16:35:44,153 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 16:35:44,153 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 16:35:44,154 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 16:35:44,154 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 16:35:44,155 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 16:35:44,155 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 16:35:44,156 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 16:35:44,157 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 16:35:44,157 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 16:35:44,158 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 16:35:44,159 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 16:35:44,160 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 16:35:44,161 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 16:35:44,162 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 16:35:44,162 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 16:35:44,165 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 16:35:44,165 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 16:35:44,165 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 16:35:44,166 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 16:35:44,166 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 16:35:44,167 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 16:35:44,167 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 16:35:44,167 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 16:35:44,168 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 16:35:44,168 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 16:35:44,174 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 16:35:44,174 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 16:35:44,175 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 16:35:44,176 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 16:35:44,176 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 16:35:44,177 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 16:35:44,177 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 16:35:44,178 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0af340b9-813b-4879-82e3-1ae81d317d05/bin/uautomizer-uyxdKDjOR8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-12-13 16:35:44,203 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 16:35:44,203 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 16:35:44,203 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 16:35:44,204 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 16:35:44,204 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 16:35:44,204 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 16:35:44,205 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 16:35:44,205 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 16:35:44,205 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 16:35:44,205 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 16:35:44,205 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 16:35:44,206 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-13 16:35:44,206 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 16:35:44,206 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 16:35:44,206 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 16:35:44,206 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-12-13 16:35:44,207 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-12-13 16:35:44,207 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-12-13 16:35:44,207 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 16:35:44,207 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-12-13 16:35:44,207 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-12-13 16:35:44,207 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-12-13 16:35:44,207 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 16:35:44,208 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 16:35:44,208 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 16:35:44,208 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 16:35:44,208 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 16:35:44,208 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 16:35:44,208 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 16:35:44,209 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 16:35:44,209 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-12-13 16:35:44,209 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-12-13 16:35:44,209 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 16:35:44,209 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 16:35:44,209 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 16:35:44,209 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2022-12-13 16:35:44,209 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 16:35:44,209 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_0af340b9-813b-4879-82e3-1ae81d317d05/bin/uautomizer-uyxdKDjOR8/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0af340b9-813b-4879-82e3-1ae81d317d05/bin/uautomizer-uyxdKDjOR8 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a86612b573a63cde2c4106f45bf8b3ea66989a894eb80420a80ff8b17f8f03d1 [2022-12-13 16:35:44,430 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 16:35:44,445 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 16:35:44,447 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 16:35:44,448 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 16:35:44,448 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 16:35:44,449 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0af340b9-813b-4879-82e3-1ae81d317d05/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/pthread-wmm/mix028_power.opt_pso.opt_rmo.opt.i [2022-12-13 16:35:46,972 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 16:35:47,164 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 16:35:47,165 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0af340b9-813b-4879-82e3-1ae81d317d05/sv-benchmarks/c/pthread-wmm/mix028_power.opt_pso.opt_rmo.opt.i [2022-12-13 16:35:47,178 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0af340b9-813b-4879-82e3-1ae81d317d05/bin/uautomizer-uyxdKDjOR8/data/e34f2518c/85b05f4e7569427eaf1259fd2e99eb2b/FLAG03ac7c625 [2022-12-13 16:35:47,528 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0af340b9-813b-4879-82e3-1ae81d317d05/bin/uautomizer-uyxdKDjOR8/data/e34f2518c/85b05f4e7569427eaf1259fd2e99eb2b [2022-12-13 16:35:47,530 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 16:35:47,531 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 16:35:47,532 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 16:35:47,532 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 16:35:47,534 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 16:35:47,535 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 04:35:47" (1/1) ... [2022-12-13 16:35:47,536 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ed548cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:35:47, skipping insertion in model container [2022-12-13 16:35:47,536 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 04:35:47" (1/1) ... [2022-12-13 16:35:47,541 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 16:35:47,566 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 16:35:47,676 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_0af340b9-813b-4879-82e3-1ae81d317d05/sv-benchmarks/c/pthread-wmm/mix028_power.opt_pso.opt_rmo.opt.i[966,979] [2022-12-13 16:35:47,819 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:35:47,819 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:35:47,820 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:35:47,820 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:35:47,820 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:35:47,823 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:35:47,823 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:35:47,824 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:35:47,825 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:35:47,826 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:35:47,827 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:35:47,827 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:35:47,827 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:35:47,830 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:35:47,830 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:35:47,830 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:35:47,831 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:35:47,831 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:35:47,831 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:35:47,832 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:35:47,832 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:35:47,832 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:35:47,832 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:35:47,835 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:35:47,835 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:35:47,836 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:35:47,843 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:35:47,843 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:35:47,844 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:35:47,846 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:35:47,846 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:35:47,852 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:35:47,853 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 16:35:47,864 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 16:35:47,873 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_0af340b9-813b-4879-82e3-1ae81d317d05/sv-benchmarks/c/pthread-wmm/mix028_power.opt_pso.opt_rmo.opt.i[966,979] [2022-12-13 16:35:47,887 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:35:47,887 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:35:47,887 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:35:47,887 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:35:47,887 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:35:47,889 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:35:47,889 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:35:47,889 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:35:47,890 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:35:47,890 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:35:47,890 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:35:47,891 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:35:47,891 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:35:47,892 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:35:47,892 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:35:47,893 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:35:47,893 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:35:47,893 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:35:47,893 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:35:47,894 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:35:47,894 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:35:47,894 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:35:47,894 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:35:47,895 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:35:47,895 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:35:47,896 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:35:47,898 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:35:47,898 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:35:47,899 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:35:47,900 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:35:47,900 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:35:47,904 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:35:47,904 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 16:35:47,929 INFO L208 MainTranslator]: Completed translation [2022-12-13 16:35:47,929 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:35:47 WrapperNode [2022-12-13 16:35:47,929 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 16:35:47,930 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 16:35:47,930 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 16:35:47,930 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 16:35:47,935 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:35:47" (1/1) ... [2022-12-13 16:35:47,952 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:35:47" (1/1) ... [2022-12-13 16:35:47,970 INFO L138 Inliner]: procedures = 179, calls = 56, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 144 [2022-12-13 16:35:47,970 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 16:35:47,971 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 16:35:47,971 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 16:35:47,971 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 16:35:47,978 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:35:47" (1/1) ... [2022-12-13 16:35:47,978 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:35:47" (1/1) ... [2022-12-13 16:35:47,981 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:35:47" (1/1) ... [2022-12-13 16:35:47,981 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:35:47" (1/1) ... [2022-12-13 16:35:47,986 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:35:47" (1/1) ... [2022-12-13 16:35:47,987 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:35:47" (1/1) ... [2022-12-13 16:35:47,989 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:35:47" (1/1) ... [2022-12-13 16:35:47,990 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:35:47" (1/1) ... [2022-12-13 16:35:47,992 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 16:35:47,993 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 16:35:47,993 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 16:35:47,993 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 16:35:47,994 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:35:47" (1/1) ... [2022-12-13 16:35:47,999 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 16:35:48,008 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0af340b9-813b-4879-82e3-1ae81d317d05/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 16:35:48,018 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0af340b9-813b-4879-82e3-1ae81d317d05/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 16:35:48,020 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0af340b9-813b-4879-82e3-1ae81d317d05/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 16:35:48,053 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 16:35:48,054 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 16:35:48,054 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 16:35:48,054 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 16:35:48,054 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-12-13 16:35:48,054 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-12-13 16:35:48,054 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 16:35:48,055 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 16:35:48,055 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 16:35:48,055 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 16:35:48,055 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-13 16:35:48,055 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-13 16:35:48,055 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 16:35:48,055 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 16:35:48,055 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 16:35:48,057 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-12-13 16:35:48,181 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 16:35:48,183 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 16:35:48,460 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 16:35:48,612 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 16:35:48,612 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 16:35:48,615 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 04:35:48 BoogieIcfgContainer [2022-12-13 16:35:48,615 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 16:35:48,617 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 16:35:48,617 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 16:35:48,621 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 16:35:48,621 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 04:35:47" (1/3) ... [2022-12-13 16:35:48,622 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@109383bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 04:35:48, skipping insertion in model container [2022-12-13 16:35:48,622 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:35:47" (2/3) ... [2022-12-13 16:35:48,622 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@109383bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 04:35:48, skipping insertion in model container [2022-12-13 16:35:48,622 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 04:35:48" (3/3) ... [2022-12-13 16:35:48,624 INFO L112 eAbstractionObserver]: Analyzing ICFG mix028_power.opt_pso.opt_rmo.opt.i [2022-12-13 16:35:48,641 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 16:35:48,641 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2022-12-13 16:35:48,641 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 16:35:48,693 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 16:35:48,719 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 135 places, 127 transitions, 269 flow [2022-12-13 16:35:48,753 INFO L130 PetriNetUnfolder]: 2/124 cut-off events. [2022-12-13 16:35:48,753 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 16:35:48,757 INFO L83 FinitePrefix]: Finished finitePrefix Result has 134 conditions, 124 events. 2/124 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 85 event pairs, 0 based on Foata normal form. 0/113 useless extension candidates. Maximal degree in co-relation 81. Up to 2 conditions per place. [2022-12-13 16:35:48,757 INFO L82 GeneralOperation]: Start removeDead. Operand has 135 places, 127 transitions, 269 flow [2022-12-13 16:35:48,760 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 132 places, 124 transitions, 257 flow [2022-12-13 16:35:48,763 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-12-13 16:35:48,770 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 132 places, 124 transitions, 257 flow [2022-12-13 16:35:48,773 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 132 places, 124 transitions, 257 flow [2022-12-13 16:35:48,776 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 132 places, 124 transitions, 257 flow [2022-12-13 16:35:48,795 INFO L130 PetriNetUnfolder]: 2/124 cut-off events. [2022-12-13 16:35:48,795 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 16:35:48,796 INFO L83 FinitePrefix]: Finished finitePrefix Result has 134 conditions, 124 events. 2/124 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 85 event pairs, 0 based on Foata normal form. 0/113 useless extension candidates. Maximal degree in co-relation 81. Up to 2 conditions per place. [2022-12-13 16:35:48,797 INFO L119 LiptonReduction]: Number of co-enabled transitions 2404 [2022-12-13 16:35:55,701 INFO L134 LiptonReduction]: Checked pairs total: 7097 [2022-12-13 16:35:55,702 INFO L136 LiptonReduction]: Total number of compositions: 124 [2022-12-13 16:35:55,715 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 16:35:55,721 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;@72dd960, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 16:35:55,721 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2022-12-13 16:35:55,723 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2022-12-13 16:35:55,723 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 16:35:55,723 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 16:35:55,723 INFO L209 CegarLoopForPetriNet]: trace histogram [1] [2022-12-13 16:35:55,724 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-12-13 16:35:55,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:35:55,728 INFO L85 PathProgramCache]: Analyzing trace with hash 547, now seen corresponding path program 1 times [2022-12-13 16:35:55,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 16:35:55,737 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [914658866] [2022-12-13 16:35:55,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:35:55,738 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 16:35:55,738 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0af340b9-813b-4879-82e3-1ae81d317d05/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 16:35:55,739 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0af340b9-813b-4879-82e3-1ae81d317d05/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 16:35:55,744 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0af340b9-813b-4879-82e3-1ae81d317d05/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-12-13 16:35:55,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:35:55,790 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2022-12-13 16:35:55,793 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:35:55,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:35:55,796 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 16:35:55,796 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 16:35:55,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [914658866] [2022-12-13 16:35:55,797 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [914658866] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:35:55,797 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:35:55,797 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-12-13 16:35:55,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031303791] [2022-12-13 16:35:55,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:35:55,804 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-13 16:35:55,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 16:35:55,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-13 16:35:55,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-13 16:35:55,821 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 251 [2022-12-13 16:35:55,822 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 31 transitions, 71 flow. Second operand has 2 states, 2 states have (on average 114.5) internal successors, (229), 2 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:35:55,822 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 16:35:55,822 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 251 [2022-12-13 16:35:55,823 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 16:35:56,195 INFO L130 PetriNetUnfolder]: 1093/1661 cut-off events. [2022-12-13 16:35:56,195 INFO L131 PetriNetUnfolder]: For 18/18 co-relation queries the response was YES. [2022-12-13 16:35:56,199 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3338 conditions, 1661 events. 1093/1661 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 8003 event pairs, 1093 based on Foata normal form. 0/1351 useless extension candidates. Maximal degree in co-relation 3327. Up to 1623 conditions per place. [2022-12-13 16:35:56,207 INFO L137 encePairwiseOnDemand]: 245/251 looper letters, 21 selfloop transitions, 0 changer transitions 0/25 dead transitions. [2022-12-13 16:35:56,207 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 25 transitions, 101 flow [2022-12-13 16:35:56,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 16:35:56,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-12-13 16:35:56,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 255 transitions. [2022-12-13 16:35:56,218 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5079681274900398 [2022-12-13 16:35:56,219 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 255 transitions. [2022-12-13 16:35:56,219 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 255 transitions. [2022-12-13 16:35:56,220 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 16:35:56,222 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 255 transitions. [2022-12-13 16:35:56,224 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 127.5) internal successors, (255), 2 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:35:56,230 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 251.0) internal successors, (753), 3 states have internal predecessors, (753), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:35:56,231 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 251.0) internal successors, (753), 3 states have internal predecessors, (753), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:35:56,232 INFO L175 Difference]: Start difference. First operand has 41 places, 31 transitions, 71 flow. Second operand 2 states and 255 transitions. [2022-12-13 16:35:56,233 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 25 transitions, 101 flow [2022-12-13 16:35:56,235 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 25 transitions, 98 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-13 16:35:56,236 INFO L231 Difference]: Finished difference. Result has 33 places, 25 transitions, 56 flow [2022-12-13 16:35:56,237 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=56, PETRI_PLACES=33, PETRI_TRANSITIONS=25} [2022-12-13 16:35:56,241 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, -8 predicate places. [2022-12-13 16:35:56,241 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 25 transitions, 56 flow [2022-12-13 16:35:56,242 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 114.5) internal successors, (229), 2 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:35:56,242 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 16:35:56,242 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-12-13 16:35:56,254 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0af340b9-813b-4879-82e3-1ae81d317d05/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-12-13 16:35:56,443 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0af340b9-813b-4879-82e3-1ae81d317d05/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 16:35:56,444 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-12-13 16:35:56,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:35:56,445 INFO L85 PathProgramCache]: Analyzing trace with hash 516370282, now seen corresponding path program 1 times [2022-12-13 16:35:56,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 16:35:56,446 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1426868411] [2022-12-13 16:35:56,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:35:56,447 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 16:35:56,447 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0af340b9-813b-4879-82e3-1ae81d317d05/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 16:35:56,449 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0af340b9-813b-4879-82e3-1ae81d317d05/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 16:35:56,451 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0af340b9-813b-4879-82e3-1ae81d317d05/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-12-13 16:35:56,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:35:56,624 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-13 16:35:56,625 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:35:56,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:35:56,643 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 16:35:56,643 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 16:35:56,643 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1426868411] [2022-12-13 16:35:56,643 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1426868411] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:35:56,644 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:35:56,644 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 16:35:56,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935522760] [2022-12-13 16:35:56,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:35:56,645 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 16:35:56,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 16:35:56,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 16:35:56,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 16:35:56,652 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 251 [2022-12-13 16:35:56,653 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 25 transitions, 56 flow. Second operand has 3 states, 3 states have (on average 114.66666666666667) internal successors, (344), 3 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:35:56,653 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 16:35:56,653 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 251 [2022-12-13 16:35:56,654 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 16:35:56,884 INFO L130 PetriNetUnfolder]: 855/1393 cut-off events. [2022-12-13 16:35:56,884 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 16:35:56,885 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2718 conditions, 1393 events. 855/1393 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 7365 event pairs, 141 based on Foata normal form. 0/1252 useless extension candidates. Maximal degree in co-relation 2715. Up to 1027 conditions per place. [2022-12-13 16:35:56,888 INFO L137 encePairwiseOnDemand]: 248/251 looper letters, 29 selfloop transitions, 2 changer transitions 2/37 dead transitions. [2022-12-13 16:35:56,889 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 37 transitions, 148 flow [2022-12-13 16:35:56,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 16:35:56,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 16:35:56,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 373 transitions. [2022-12-13 16:35:56,892 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4953519256308101 [2022-12-13 16:35:56,892 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 373 transitions. [2022-12-13 16:35:56,892 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 373 transitions. [2022-12-13 16:35:56,892 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 16:35:56,893 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 373 transitions. [2022-12-13 16:35:56,894 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 124.33333333333333) internal successors, (373), 3 states have internal predecessors, (373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:35:56,896 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 251.0) internal successors, (1004), 4 states have internal predecessors, (1004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:35:56,897 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 251.0) internal successors, (1004), 4 states have internal predecessors, (1004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:35:56,897 INFO L175 Difference]: Start difference. First operand has 33 places, 25 transitions, 56 flow. Second operand 3 states and 373 transitions. [2022-12-13 16:35:56,897 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 37 transitions, 148 flow [2022-12-13 16:35:56,898 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 37 transitions, 148 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-13 16:35:56,898 INFO L231 Difference]: Finished difference. Result has 34 places, 23 transitions, 56 flow [2022-12-13 16:35:56,898 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=56, PETRI_PLACES=34, PETRI_TRANSITIONS=23} [2022-12-13 16:35:56,899 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, -7 predicate places. [2022-12-13 16:35:56,899 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 23 transitions, 56 flow [2022-12-13 16:35:56,899 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 114.66666666666667) internal successors, (344), 3 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:35:56,899 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 16:35:56,899 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:35:56,910 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0af340b9-813b-4879-82e3-1ae81d317d05/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2022-12-13 16:35:57,100 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0af340b9-813b-4879-82e3-1ae81d317d05/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 16:35:57,102 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-12-13 16:35:57,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:35:57,104 INFO L85 PathProgramCache]: Analyzing trace with hash 64455176, now seen corresponding path program 1 times [2022-12-13 16:35:57,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 16:35:57,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1231923081] [2022-12-13 16:35:57,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:35:57,109 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 16:35:57,110 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0af340b9-813b-4879-82e3-1ae81d317d05/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 16:35:57,113 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0af340b9-813b-4879-82e3-1ae81d317d05/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 16:35:57,117 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0af340b9-813b-4879-82e3-1ae81d317d05/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-12-13 16:35:57,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:35:57,217 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-13 16:35:57,218 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:35:57,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:35:57,252 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 16:35:57,252 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 16:35:57,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1231923081] [2022-12-13 16:35:57,252 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1231923081] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:35:57,252 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:35:57,252 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 16:35:57,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176854150] [2022-12-13 16:35:57,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:35:57,253 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 16:35:57,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 16:35:57,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 16:35:57,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 16:35:57,267 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 251 [2022-12-13 16:35:57,269 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 23 transitions, 56 flow. Second operand has 4 states, 4 states have (on average 111.25) internal successors, (445), 4 states have internal predecessors, (445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:35:57,269 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 16:35:57,269 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 251 [2022-12-13 16:35:57,269 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 16:35:57,498 INFO L130 PetriNetUnfolder]: 494/836 cut-off events. [2022-12-13 16:35:57,498 INFO L131 PetriNetUnfolder]: For 65/65 co-relation queries the response was YES. [2022-12-13 16:35:57,499 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1762 conditions, 836 events. 494/836 cut-off events. For 65/65 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 3997 event pairs, 102 based on Foata normal form. 64/853 useless extension candidates. Maximal degree in co-relation 1758. Up to 533 conditions per place. [2022-12-13 16:35:57,501 INFO L137 encePairwiseOnDemand]: 245/251 looper letters, 28 selfloop transitions, 4 changer transitions 19/55 dead transitions. [2022-12-13 16:35:57,501 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 55 transitions, 232 flow [2022-12-13 16:35:57,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 16:35:57,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 16:35:57,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 598 transitions. [2022-12-13 16:35:57,503 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.47649402390438245 [2022-12-13 16:35:57,503 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 598 transitions. [2022-12-13 16:35:57,503 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 598 transitions. [2022-12-13 16:35:57,503 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 16:35:57,503 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 598 transitions. [2022-12-13 16:35:57,505 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 119.6) internal successors, (598), 5 states have internal predecessors, (598), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:35:57,506 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 251.0) internal successors, (1506), 6 states have internal predecessors, (1506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:35:57,507 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 251.0) internal successors, (1506), 6 states have internal predecessors, (1506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:35:57,507 INFO L175 Difference]: Start difference. First operand has 34 places, 23 transitions, 56 flow. Second operand 5 states and 598 transitions. [2022-12-13 16:35:57,507 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 55 transitions, 232 flow [2022-12-13 16:35:57,508 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 55 transitions, 222 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 16:35:57,508 INFO L231 Difference]: Finished difference. Result has 38 places, 26 transitions, 88 flow [2022-12-13 16:35:57,508 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=88, PETRI_PLACES=38, PETRI_TRANSITIONS=26} [2022-12-13 16:35:57,509 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, -3 predicate places. [2022-12-13 16:35:57,509 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 26 transitions, 88 flow [2022-12-13 16:35:57,509 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 111.25) internal successors, (445), 4 states have internal predecessors, (445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:35:57,509 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 16:35:57,510 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:35:57,517 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0af340b9-813b-4879-82e3-1ae81d317d05/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2022-12-13 16:35:57,710 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0af340b9-813b-4879-82e3-1ae81d317d05/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 16:35:57,710 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-12-13 16:35:57,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:35:57,711 INFO L85 PathProgramCache]: Analyzing trace with hash -1914211978, now seen corresponding path program 1 times [2022-12-13 16:35:57,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 16:35:57,711 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [884768286] [2022-12-13 16:35:57,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:35:57,712 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 16:35:57,712 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0af340b9-813b-4879-82e3-1ae81d317d05/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 16:35:57,712 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0af340b9-813b-4879-82e3-1ae81d317d05/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 16:35:57,713 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0af340b9-813b-4879-82e3-1ae81d317d05/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-12-13 16:35:57,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:35:57,793 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 16:35:57,795 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:35:57,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:35:57,832 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 16:35:57,832 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 16:35:57,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [884768286] [2022-12-13 16:35:57,832 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [884768286] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:35:57,832 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:35:57,832 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 16:35:57,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729374121] [2022-12-13 16:35:57,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:35:57,833 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 16:35:57,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 16:35:57,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 16:35:57,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 16:35:57,851 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 251 [2022-12-13 16:35:57,852 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 26 transitions, 88 flow. Second operand has 5 states, 5 states have (on average 111.4) internal successors, (557), 5 states have internal predecessors, (557), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:35:57,852 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 16:35:57,852 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 251 [2022-12-13 16:35:57,853 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 16:35:58,057 INFO L130 PetriNetUnfolder]: 224/431 cut-off events. [2022-12-13 16:35:58,057 INFO L131 PetriNetUnfolder]: For 136/136 co-relation queries the response was YES. [2022-12-13 16:35:58,058 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1142 conditions, 431 events. 224/431 cut-off events. For 136/136 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1890 event pairs, 60 based on Foata normal form. 37/453 useless extension candidates. Maximal degree in co-relation 1135. Up to 137 conditions per place. [2022-12-13 16:35:58,059 INFO L137 encePairwiseOnDemand]: 245/251 looper letters, 36 selfloop transitions, 7 changer transitions 19/66 dead transitions. [2022-12-13 16:35:58,059 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 66 transitions, 336 flow [2022-12-13 16:35:58,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 16:35:58,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 16:35:58,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 718 transitions. [2022-12-13 16:35:58,064 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4767596281540505 [2022-12-13 16:35:58,064 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 718 transitions. [2022-12-13 16:35:58,064 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 718 transitions. [2022-12-13 16:35:58,065 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 16:35:58,065 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 718 transitions. [2022-12-13 16:35:58,066 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 119.66666666666667) internal successors, (718), 6 states have internal predecessors, (718), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:35:58,068 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 251.0) internal successors, (1757), 7 states have internal predecessors, (1757), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:35:58,069 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 251.0) internal successors, (1757), 7 states have internal predecessors, (1757), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:35:58,069 INFO L175 Difference]: Start difference. First operand has 38 places, 26 transitions, 88 flow. Second operand 6 states and 718 transitions. [2022-12-13 16:35:58,069 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 66 transitions, 336 flow [2022-12-13 16:35:58,071 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 66 transitions, 330 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-12-13 16:35:58,071 INFO L231 Difference]: Finished difference. Result has 42 places, 29 transitions, 138 flow [2022-12-13 16:35:58,072 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=138, PETRI_PLACES=42, PETRI_TRANSITIONS=29} [2022-12-13 16:35:58,072 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, 1 predicate places. [2022-12-13 16:35:58,072 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 29 transitions, 138 flow [2022-12-13 16:35:58,073 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 111.4) internal successors, (557), 5 states have internal predecessors, (557), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:35:58,073 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 16:35:58,073 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:35:58,082 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0af340b9-813b-4879-82e3-1ae81d317d05/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2022-12-13 16:35:58,274 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0af340b9-813b-4879-82e3-1ae81d317d05/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 16:35:58,274 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-12-13 16:35:58,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:35:58,275 INFO L85 PathProgramCache]: Analyzing trace with hash 315367137, now seen corresponding path program 1 times [2022-12-13 16:35:58,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 16:35:58,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [491803041] [2022-12-13 16:35:58,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:35:58,277 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 16:35:58,277 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0af340b9-813b-4879-82e3-1ae81d317d05/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 16:35:58,279 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0af340b9-813b-4879-82e3-1ae81d317d05/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 16:35:58,281 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0af340b9-813b-4879-82e3-1ae81d317d05/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-12-13 16:35:58,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:35:58,439 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-13 16:35:58,440 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:35:58,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:35:58,483 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 16:35:58,483 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 16:35:58,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [491803041] [2022-12-13 16:35:58,484 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [491803041] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:35:58,484 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:35:58,484 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 16:35:58,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727631912] [2022-12-13 16:35:58,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:35:58,485 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 16:35:58,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 16:35:58,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 16:35:58,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 16:35:58,507 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 251 [2022-12-13 16:35:58,508 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 29 transitions, 138 flow. Second operand has 6 states, 6 states have (on average 111.5) internal successors, (669), 6 states have internal predecessors, (669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:35:58,508 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 16:35:58,509 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 251 [2022-12-13 16:35:58,509 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 16:35:58,699 INFO L130 PetriNetUnfolder]: 143/287 cut-off events. [2022-12-13 16:35:58,699 INFO L131 PetriNetUnfolder]: For 263/263 co-relation queries the response was YES. [2022-12-13 16:35:58,700 INFO L83 FinitePrefix]: Finished finitePrefix Result has 819 conditions, 287 events. 143/287 cut-off events. For 263/263 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1147 event pairs, 56 based on Foata normal form. 10/291 useless extension candidates. Maximal degree in co-relation 810. Up to 108 conditions per place. [2022-12-13 16:35:58,701 INFO L137 encePairwiseOnDemand]: 245/251 looper letters, 33 selfloop transitions, 10 changer transitions 10/57 dead transitions. [2022-12-13 16:35:58,701 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 57 transitions, 334 flow [2022-12-13 16:35:58,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 16:35:58,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 16:35:58,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 818 transitions. [2022-12-13 16:35:58,703 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4655663062037564 [2022-12-13 16:35:58,703 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 818 transitions. [2022-12-13 16:35:58,703 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 818 transitions. [2022-12-13 16:35:58,704 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 16:35:58,704 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 818 transitions. [2022-12-13 16:35:58,705 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 116.85714285714286) internal successors, (818), 7 states have internal predecessors, (818), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:35:58,707 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 251.0) internal successors, (2008), 8 states have internal predecessors, (2008), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:35:58,708 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 251.0) internal successors, (2008), 8 states have internal predecessors, (2008), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:35:58,708 INFO L175 Difference]: Start difference. First operand has 42 places, 29 transitions, 138 flow. Second operand 7 states and 818 transitions. [2022-12-13 16:35:58,708 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 57 transitions, 334 flow [2022-12-13 16:35:58,711 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 57 transitions, 298 flow, removed 14 selfloop flow, removed 4 redundant places. [2022-12-13 16:35:58,712 INFO L231 Difference]: Finished difference. Result has 45 places, 29 transitions, 140 flow [2022-12-13 16:35:58,712 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=140, PETRI_PLACES=45, PETRI_TRANSITIONS=29} [2022-12-13 16:35:58,712 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, 4 predicate places. [2022-12-13 16:35:58,713 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 29 transitions, 140 flow [2022-12-13 16:35:58,713 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 111.5) internal successors, (669), 6 states have internal predecessors, (669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:35:58,713 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 16:35:58,713 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:35:58,721 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0af340b9-813b-4879-82e3-1ae81d317d05/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2022-12-13 16:35:58,914 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0af340b9-813b-4879-82e3-1ae81d317d05/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 16:35:58,914 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-12-13 16:35:58,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:35:58,914 INFO L85 PathProgramCache]: Analyzing trace with hash -559076995, now seen corresponding path program 1 times [2022-12-13 16:35:58,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 16:35:58,915 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1407862712] [2022-12-13 16:35:58,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:35:58,915 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 16:35:58,915 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0af340b9-813b-4879-82e3-1ae81d317d05/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 16:35:58,916 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0af340b9-813b-4879-82e3-1ae81d317d05/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 16:35:58,917 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0af340b9-813b-4879-82e3-1ae81d317d05/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-12-13 16:35:58,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:35:58,998 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 16:35:58,999 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:35:59,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:35:59,025 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 16:35:59,025 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 16:35:59,025 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1407862712] [2022-12-13 16:35:59,025 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1407862712] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:35:59,025 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:35:59,025 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 16:35:59,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833049834] [2022-12-13 16:35:59,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:35:59,026 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 16:35:59,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 16:35:59,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 16:35:59,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 16:35:59,030 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 251 [2022-12-13 16:35:59,030 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 29 transitions, 140 flow. Second operand has 4 states, 4 states have (on average 114.75) internal successors, (459), 4 states have internal predecessors, (459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:35:59,030 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 16:35:59,031 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 251 [2022-12-13 16:35:59,031 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 16:35:59,153 INFO L130 PetriNetUnfolder]: 198/396 cut-off events. [2022-12-13 16:35:59,153 INFO L131 PetriNetUnfolder]: For 420/420 co-relation queries the response was YES. [2022-12-13 16:35:59,154 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1119 conditions, 396 events. 198/396 cut-off events. For 420/420 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1814 event pairs, 18 based on Foata normal form. 0/394 useless extension candidates. Maximal degree in co-relation 1109. Up to 223 conditions per place. [2022-12-13 16:35:59,155 INFO L137 encePairwiseOnDemand]: 248/251 looper letters, 53 selfloop transitions, 2 changer transitions 0/58 dead transitions. [2022-12-13 16:35:59,155 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 58 transitions, 406 flow [2022-12-13 16:35:59,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 16:35:59,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 16:35:59,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 482 transitions. [2022-12-13 16:35:59,157 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4800796812749004 [2022-12-13 16:35:59,157 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 482 transitions. [2022-12-13 16:35:59,157 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 482 transitions. [2022-12-13 16:35:59,157 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 16:35:59,157 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 482 transitions. [2022-12-13 16:35:59,158 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 120.5) internal successors, (482), 4 states have internal predecessors, (482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:35:59,158 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 251.0) internal successors, (1255), 5 states have internal predecessors, (1255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:35:59,159 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 251.0) internal successors, (1255), 5 states have internal predecessors, (1255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:35:59,159 INFO L175 Difference]: Start difference. First operand has 45 places, 29 transitions, 140 flow. Second operand 4 states and 482 transitions. [2022-12-13 16:35:59,159 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 58 transitions, 406 flow [2022-12-13 16:35:59,161 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 58 transitions, 326 flow, removed 24 selfloop flow, removed 6 redundant places. [2022-12-13 16:35:59,161 INFO L231 Difference]: Finished difference. Result has 42 places, 30 transitions, 115 flow [2022-12-13 16:35:59,161 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=115, PETRI_PLACES=42, PETRI_TRANSITIONS=30} [2022-12-13 16:35:59,162 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, 1 predicate places. [2022-12-13 16:35:59,162 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 30 transitions, 115 flow [2022-12-13 16:35:59,162 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 114.75) internal successors, (459), 4 states have internal predecessors, (459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:35:59,162 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 16:35:59,162 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:35:59,170 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0af340b9-813b-4879-82e3-1ae81d317d05/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2022-12-13 16:35:59,363 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0af340b9-813b-4879-82e3-1ae81d317d05/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 16:35:59,364 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-12-13 16:35:59,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:35:59,365 INFO L85 PathProgramCache]: Analyzing trace with hash 1587394929, now seen corresponding path program 2 times [2022-12-13 16:35:59,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 16:35:59,367 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1896473887] [2022-12-13 16:35:59,367 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 16:35:59,368 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 16:35:59,368 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0af340b9-813b-4879-82e3-1ae81d317d05/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 16:35:59,371 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0af340b9-813b-4879-82e3-1ae81d317d05/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 16:35:59,374 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0af340b9-813b-4879-82e3-1ae81d317d05/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-12-13 16:35:59,529 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-12-13 16:35:59,529 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 16:35:59,533 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 18 conjunts are in the unsatisfiable core [2022-12-13 16:35:59,534 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:35:59,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:35:59,742 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 16:35:59,742 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 16:35:59,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1896473887] [2022-12-13 16:35:59,743 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1896473887] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:35:59,743 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:35:59,743 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 16:35:59,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724833604] [2022-12-13 16:35:59,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:35:59,744 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 16:35:59,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 16:35:59,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 16:35:59,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-12-13 16:35:59,784 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 251 [2022-12-13 16:35:59,785 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 30 transitions, 115 flow. Second operand has 9 states, 9 states have (on average 111.11111111111111) internal successors, (1000), 9 states have internal predecessors, (1000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:35:59,785 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 16:35:59,785 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 251 [2022-12-13 16:35:59,785 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 16:36:00,002 INFO L130 PetriNetUnfolder]: 300/608 cut-off events. [2022-12-13 16:36:00,002 INFO L131 PetriNetUnfolder]: For 430/430 co-relation queries the response was YES. [2022-12-13 16:36:00,003 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1649 conditions, 608 events. 300/608 cut-off events. For 430/430 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 2991 event pairs, 69 based on Foata normal form. 1/599 useless extension candidates. Maximal degree in co-relation 1640. Up to 266 conditions per place. [2022-12-13 16:36:00,005 INFO L137 encePairwiseOnDemand]: 245/251 looper letters, 51 selfloop transitions, 6 changer transitions 0/61 dead transitions. [2022-12-13 16:36:00,005 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 61 transitions, 352 flow [2022-12-13 16:36:00,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 16:36:00,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 16:36:00,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 589 transitions. [2022-12-13 16:36:00,008 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4693227091633466 [2022-12-13 16:36:00,008 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 589 transitions. [2022-12-13 16:36:00,008 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 589 transitions. [2022-12-13 16:36:00,008 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 16:36:00,008 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 589 transitions. [2022-12-13 16:36:00,010 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 117.8) internal successors, (589), 5 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:36:00,011 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 251.0) internal successors, (1506), 6 states have internal predecessors, (1506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:36:00,012 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 251.0) internal successors, (1506), 6 states have internal predecessors, (1506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:36:00,012 INFO L175 Difference]: Start difference. First operand has 42 places, 30 transitions, 115 flow. Second operand 5 states and 589 transitions. [2022-12-13 16:36:00,012 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 61 transitions, 352 flow [2022-12-13 16:36:00,014 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 61 transitions, 350 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 16:36:00,015 INFO L231 Difference]: Finished difference. Result has 47 places, 33 transitions, 146 flow [2022-12-13 16:36:00,016 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=146, PETRI_PLACES=47, PETRI_TRANSITIONS=33} [2022-12-13 16:36:00,016 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, 6 predicate places. [2022-12-13 16:36:00,016 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 33 transitions, 146 flow [2022-12-13 16:36:00,017 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 111.11111111111111) internal successors, (1000), 9 states have internal predecessors, (1000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:36:00,017 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 16:36:00,017 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:36:00,026 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0af340b9-813b-4879-82e3-1ae81d317d05/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2022-12-13 16:36:00,218 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0af340b9-813b-4879-82e3-1ae81d317d05/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 16:36:00,218 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-12-13 16:36:00,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:36:00,219 INFO L85 PathProgramCache]: Analyzing trace with hash 1572988485, now seen corresponding path program 1 times [2022-12-13 16:36:00,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 16:36:00,219 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [55283650] [2022-12-13 16:36:00,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:36:00,219 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 16:36:00,219 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0af340b9-813b-4879-82e3-1ae81d317d05/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 16:36:00,220 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0af340b9-813b-4879-82e3-1ae81d317d05/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 16:36:00,221 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0af340b9-813b-4879-82e3-1ae81d317d05/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-12-13 16:36:00,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:36:00,333 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 14 conjunts are in the unsatisfiable core [2022-12-13 16:36:00,336 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:36:00,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:36:00,600 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 16:36:00,600 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 16:36:00,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [55283650] [2022-12-13 16:36:00,601 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [55283650] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:36:00,601 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:36:00,601 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 16:36:00,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433561238] [2022-12-13 16:36:00,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:36:00,602 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 16:36:00,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 16:36:00,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 16:36:00,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 16:36:00,768 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 251 [2022-12-13 16:36:00,768 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 33 transitions, 146 flow. Second operand has 5 states, 5 states have (on average 101.6) internal successors, (508), 5 states have internal predecessors, (508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:36:00,768 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 16:36:00,768 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 251 [2022-12-13 16:36:00,768 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 16:36:00,969 INFO L130 PetriNetUnfolder]: 267/539 cut-off events. [2022-12-13 16:36:00,969 INFO L131 PetriNetUnfolder]: For 575/575 co-relation queries the response was YES. [2022-12-13 16:36:00,970 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1732 conditions, 539 events. 267/539 cut-off events. For 575/575 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 2575 event pairs, 79 based on Foata normal form. 4/536 useless extension candidates. Maximal degree in co-relation 1721. Up to 441 conditions per place. [2022-12-13 16:36:00,971 INFO L137 encePairwiseOnDemand]: 247/251 looper letters, 26 selfloop transitions, 3 changer transitions 10/44 dead transitions. [2022-12-13 16:36:00,971 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 44 transitions, 277 flow [2022-12-13 16:36:00,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 16:36:00,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 16:36:00,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 518 transitions. [2022-12-13 16:36:00,972 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4127490039840637 [2022-12-13 16:36:00,972 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 518 transitions. [2022-12-13 16:36:00,972 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 518 transitions. [2022-12-13 16:36:00,973 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 16:36:00,973 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 518 transitions. [2022-12-13 16:36:00,973 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 103.6) internal successors, (518), 5 states have internal predecessors, (518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:36:00,974 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 251.0) internal successors, (1506), 6 states have internal predecessors, (1506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:36:00,975 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 251.0) internal successors, (1506), 6 states have internal predecessors, (1506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:36:00,975 INFO L175 Difference]: Start difference. First operand has 47 places, 33 transitions, 146 flow. Second operand 5 states and 518 transitions. [2022-12-13 16:36:00,975 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 44 transitions, 277 flow [2022-12-13 16:36:00,977 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 44 transitions, 270 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 16:36:00,977 INFO L231 Difference]: Finished difference. Result has 48 places, 31 transitions, 140 flow [2022-12-13 16:36:00,978 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=140, PETRI_PLACES=48, PETRI_TRANSITIONS=31} [2022-12-13 16:36:00,978 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, 7 predicate places. [2022-12-13 16:36:00,978 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 31 transitions, 140 flow [2022-12-13 16:36:00,978 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 101.6) internal successors, (508), 5 states have internal predecessors, (508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:36:00,978 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 16:36:00,979 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:36:00,986 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0af340b9-813b-4879-82e3-1ae81d317d05/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2022-12-13 16:36:01,179 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0af340b9-813b-4879-82e3-1ae81d317d05/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 16:36:01,180 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-12-13 16:36:01,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:36:01,182 INFO L85 PathProgramCache]: Analyzing trace with hash 533152729, now seen corresponding path program 3 times [2022-12-13 16:36:01,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 16:36:01,183 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [185936670] [2022-12-13 16:36:01,184 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 16:36:01,184 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 16:36:01,185 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0af340b9-813b-4879-82e3-1ae81d317d05/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 16:36:01,187 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0af340b9-813b-4879-82e3-1ae81d317d05/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 16:36:01,190 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0af340b9-813b-4879-82e3-1ae81d317d05/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-12-13 16:36:01,334 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-12-13 16:36:01,335 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 16:36:01,338 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-13 16:36:01,340 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:36:01,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:36:01,356 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 16:36:01,356 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 16:36:01,357 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [185936670] [2022-12-13 16:36:01,357 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [185936670] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:36:01,357 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:36:01,357 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 16:36:01,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451451852] [2022-12-13 16:36:01,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:36:01,358 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 16:36:01,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 16:36:01,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 16:36:01,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 16:36:01,363 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 251 [2022-12-13 16:36:01,363 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 31 transitions, 140 flow. Second operand has 3 states, 3 states have (on average 117.33333333333333) internal successors, (352), 3 states have internal predecessors, (352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:36:01,364 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 16:36:01,364 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 251 [2022-12-13 16:36:01,364 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 16:36:01,493 INFO L130 PetriNetUnfolder]: 318/647 cut-off events. [2022-12-13 16:36:01,493 INFO L131 PetriNetUnfolder]: For 554/554 co-relation queries the response was YES. [2022-12-13 16:36:01,494 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2000 conditions, 647 events. 318/647 cut-off events. For 554/554 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 3161 event pairs, 100 based on Foata normal form. 1/642 useless extension candidates. Maximal degree in co-relation 1989. Up to 312 conditions per place. [2022-12-13 16:36:01,495 INFO L137 encePairwiseOnDemand]: 248/251 looper letters, 28 selfloop transitions, 2 changer transitions 16/50 dead transitions. [2022-12-13 16:36:01,495 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 50 transitions, 320 flow [2022-12-13 16:36:01,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 16:36:01,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 16:36:01,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 365 transitions. [2022-12-13 16:36:01,497 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4847277556440903 [2022-12-13 16:36:01,497 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 365 transitions. [2022-12-13 16:36:01,497 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 365 transitions. [2022-12-13 16:36:01,497 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 16:36:01,497 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 365 transitions. [2022-12-13 16:36:01,498 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 121.66666666666667) internal successors, (365), 3 states have internal predecessors, (365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:36:01,499 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 251.0) internal successors, (1004), 4 states have internal predecessors, (1004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:36:01,499 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 251.0) internal successors, (1004), 4 states have internal predecessors, (1004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:36:01,499 INFO L175 Difference]: Start difference. First operand has 48 places, 31 transitions, 140 flow. Second operand 3 states and 365 transitions. [2022-12-13 16:36:01,499 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 50 transitions, 320 flow [2022-12-13 16:36:01,501 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 50 transitions, 312 flow, removed 1 selfloop flow, removed 4 redundant places. [2022-12-13 16:36:01,501 INFO L231 Difference]: Finished difference. Result has 46 places, 30 transitions, 137 flow [2022-12-13 16:36:01,502 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=133, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=137, PETRI_PLACES=46, PETRI_TRANSITIONS=30} [2022-12-13 16:36:01,502 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, 5 predicate places. [2022-12-13 16:36:01,502 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 30 transitions, 137 flow [2022-12-13 16:36:01,502 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 117.33333333333333) internal successors, (352), 3 states have internal predecessors, (352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:36:01,502 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 16:36:01,503 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:36:01,514 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0af340b9-813b-4879-82e3-1ae81d317d05/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2022-12-13 16:36:01,703 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0af340b9-813b-4879-82e3-1ae81d317d05/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 16:36:01,704 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-12-13 16:36:01,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:36:01,705 INFO L85 PathProgramCache]: Analyzing trace with hash 2135770511, now seen corresponding path program 4 times [2022-12-13 16:36:01,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 16:36:01,705 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [335198663] [2022-12-13 16:36:01,705 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-13 16:36:01,706 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 16:36:01,706 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0af340b9-813b-4879-82e3-1ae81d317d05/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 16:36:01,707 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0af340b9-813b-4879-82e3-1ae81d317d05/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 16:36:01,709 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0af340b9-813b-4879-82e3-1ae81d317d05/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-12-13 16:36:01,873 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-13 16:36:01,873 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 16:36:01,877 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 20 conjunts are in the unsatisfiable core [2022-12-13 16:36:01,879 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:36:02,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:36:02,103 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 16:36:02,103 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 16:36:02,103 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [335198663] [2022-12-13 16:36:02,103 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [335198663] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:36:02,103 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:36:02,103 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 16:36:02,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580765875] [2022-12-13 16:36:02,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:36:02,104 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 16:36:02,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 16:36:02,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 16:36:02,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2022-12-13 16:36:02,155 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 251 [2022-12-13 16:36:02,156 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 30 transitions, 137 flow. Second operand has 9 states, 9 states have (on average 111.11111111111111) internal successors, (1000), 9 states have internal predecessors, (1000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:36:02,156 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 16:36:02,156 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 251 [2022-12-13 16:36:02,156 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 16:36:02,293 INFO L130 PetriNetUnfolder]: 192/390 cut-off events. [2022-12-13 16:36:02,293 INFO L131 PetriNetUnfolder]: For 371/371 co-relation queries the response was YES. [2022-12-13 16:36:02,294 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1327 conditions, 390 events. 192/390 cut-off events. For 371/371 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1589 event pairs, 58 based on Foata normal form. 1/389 useless extension candidates. Maximal degree in co-relation 1316. Up to 178 conditions per place. [2022-12-13 16:36:02,294 INFO L137 encePairwiseOnDemand]: 246/251 looper letters, 30 selfloop transitions, 3 changer transitions 21/57 dead transitions. [2022-12-13 16:36:02,295 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 57 transitions, 369 flow [2022-12-13 16:36:02,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 16:36:02,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 16:36:02,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 586 transitions. [2022-12-13 16:36:02,296 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.46693227091633466 [2022-12-13 16:36:02,296 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 586 transitions. [2022-12-13 16:36:02,296 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 586 transitions. [2022-12-13 16:36:02,297 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 16:36:02,297 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 586 transitions. [2022-12-13 16:36:02,297 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 117.2) internal successors, (586), 5 states have internal predecessors, (586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:36:02,298 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 251.0) internal successors, (1506), 6 states have internal predecessors, (1506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:36:02,299 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 251.0) internal successors, (1506), 6 states have internal predecessors, (1506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:36:02,299 INFO L175 Difference]: Start difference. First operand has 46 places, 30 transitions, 137 flow. Second operand 5 states and 586 transitions. [2022-12-13 16:36:02,299 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 57 transitions, 369 flow [2022-12-13 16:36:02,300 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 57 transitions, 359 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-12-13 16:36:02,301 INFO L231 Difference]: Finished difference. Result has 49 places, 28 transitions, 127 flow [2022-12-13 16:36:02,301 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=131, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=127, PETRI_PLACES=49, PETRI_TRANSITIONS=28} [2022-12-13 16:36:02,301 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, 8 predicate places. [2022-12-13 16:36:02,301 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 28 transitions, 127 flow [2022-12-13 16:36:02,302 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 111.11111111111111) internal successors, (1000), 9 states have internal predecessors, (1000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:36:02,302 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 16:36:02,302 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:36:02,309 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0af340b9-813b-4879-82e3-1ae81d317d05/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2022-12-13 16:36:02,502 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0af340b9-813b-4879-82e3-1ae81d317d05/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 16:36:02,503 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-12-13 16:36:02,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:36:02,504 INFO L85 PathProgramCache]: Analyzing trace with hash 92384783, now seen corresponding path program 5 times [2022-12-13 16:36:02,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 16:36:02,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1300303719] [2022-12-13 16:36:02,504 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-13 16:36:02,505 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 16:36:02,505 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0af340b9-813b-4879-82e3-1ae81d317d05/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 16:36:02,506 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0af340b9-813b-4879-82e3-1ae81d317d05/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 16:36:02,508 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0af340b9-813b-4879-82e3-1ae81d317d05/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-12-13 16:36:02,612 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-12-13 16:36:02,613 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-12-13 16:36:02,613 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 16:36:02,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 16:36:02,714 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-12-13 16:36:02,714 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 16:36:02,715 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (12 of 13 remaining) [2022-12-13 16:36:02,717 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (11 of 13 remaining) [2022-12-13 16:36:02,717 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining) [2022-12-13 16:36:02,717 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 13 remaining) [2022-12-13 16:36:02,717 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining) [2022-12-13 16:36:02,717 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining) [2022-12-13 16:36:02,717 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 13 remaining) [2022-12-13 16:36:02,717 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2022-12-13 16:36:02,717 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (4 of 13 remaining) [2022-12-13 16:36:02,717 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 13 remaining) [2022-12-13 16:36:02,718 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 13 remaining) [2022-12-13 16:36:02,718 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 13 remaining) [2022-12-13 16:36:02,718 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining) [2022-12-13 16:36:02,731 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0af340b9-813b-4879-82e3-1ae81d317d05/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2022-12-13 16:36:02,918 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0af340b9-813b-4879-82e3-1ae81d317d05/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 16:36:02,919 INFO L445 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1, 1, 1] [2022-12-13 16:36:02,934 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 16:36:02,935 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 16:36:02,993 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 04:36:02 BasicIcfg [2022-12-13 16:36:02,993 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 16:36:02,993 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-13 16:36:02,993 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-13 16:36:02,993 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-13 16:36:02,994 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 04:35:48" (3/4) ... [2022-12-13 16:36:02,997 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-12-13 16:36:02,997 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-13 16:36:02,998 INFO L158 Benchmark]: Toolchain (without parser) took 15466.70ms. Allocated memory was 60.8MB in the beginning and 130.0MB in the end (delta: 69.2MB). Free memory was 38.0MB in the beginning and 76.8MB in the end (delta: -38.8MB). Peak memory consumption was 31.6MB. Max. memory is 16.1GB. [2022-12-13 16:36:02,998 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 50.3MB. Free memory was 28.6MB in the beginning and 28.5MB in the end (delta: 52.4kB). There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 16:36:02,998 INFO L158 Benchmark]: CACSL2BoogieTranslator took 397.62ms. Allocated memory is still 60.8MB. Free memory was 37.8MB in the beginning and 25.9MB in the end (delta: 12.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-12-13 16:36:02,998 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.66ms. Allocated memory is still 60.8MB. Free memory was 25.9MB in the beginning and 39.1MB in the end (delta: -13.2MB). Peak memory consumption was 5.0MB. Max. memory is 16.1GB. [2022-12-13 16:36:02,998 INFO L158 Benchmark]: Boogie Preprocessor took 21.61ms. Allocated memory is still 60.8MB. Free memory was 39.1MB in the beginning and 37.1MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 16:36:02,999 INFO L158 Benchmark]: RCFGBuilder took 622.23ms. Allocated memory is still 60.8MB. Free memory was 36.9MB in the beginning and 25.0MB in the end (delta: 11.9MB). Peak memory consumption was 17.0MB. Max. memory is 16.1GB. [2022-12-13 16:36:02,999 INFO L158 Benchmark]: TraceAbstraction took 14375.49ms. Allocated memory was 60.8MB in the beginning and 130.0MB in the end (delta: 69.2MB). Free memory was 24.1MB in the beginning and 76.8MB in the end (delta: -52.7MB). Peak memory consumption was 16.5MB. Max. memory is 16.1GB. [2022-12-13 16:36:02,999 INFO L158 Benchmark]: Witness Printer took 4.07ms. Allocated memory is still 130.0MB. Free memory is still 76.8MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 16:36:03,000 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.15ms. Allocated memory is still 50.3MB. Free memory was 28.6MB in the beginning and 28.5MB in the end (delta: 52.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 397.62ms. Allocated memory is still 60.8MB. Free memory was 37.8MB in the beginning and 25.9MB in the end (delta: 12.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.66ms. Allocated memory is still 60.8MB. Free memory was 25.9MB in the beginning and 39.1MB in the end (delta: -13.2MB). Peak memory consumption was 5.0MB. Max. memory is 16.1GB. * Boogie Preprocessor took 21.61ms. Allocated memory is still 60.8MB. Free memory was 39.1MB in the beginning and 37.1MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 622.23ms. Allocated memory is still 60.8MB. Free memory was 36.9MB in the beginning and 25.0MB in the end (delta: 11.9MB). Peak memory consumption was 17.0MB. Max. memory is 16.1GB. * TraceAbstraction took 14375.49ms. Allocated memory was 60.8MB in the beginning and 130.0MB in the end (delta: 69.2MB). Free memory was 24.1MB in the beginning and 76.8MB in the end (delta: -52.7MB). Peak memory consumption was 16.5MB. Max. memory is 16.1GB. * Witness Printer took 4.07ms. Allocated memory is still 130.0MB. Free memory is still 76.8MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.9s, 132 PlacesBefore, 41 PlacesAfterwards, 124 TransitionsBefore, 31 TransitionsAfterwards, 2404 CoEnabledTransitionPairs, 7 FixpointIterations, 53 TrivialSequentialCompositions, 61 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 2 ChoiceCompositions, 124 TotalNumberOfCompositions, 7097 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2575, independent: 2368, independent conditional: 0, independent unconditional: 2368, dependent: 207, dependent conditional: 0, dependent unconditional: 207, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1240, independent: 1200, independent conditional: 0, independent unconditional: 1200, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2575, independent: 1168, independent conditional: 0, independent unconditional: 1168, dependent: 167, dependent conditional: 0, dependent unconditional: 167, unknown: 1240, unknown conditional: 0, unknown unconditional: 1240] , Statistics on independence cache: Total cache size (in pairs): 91, Positive cache size: 71, Positive conditional cache size: 0, Positive unconditional cache size: 71, Negative cache size: 20, Negative conditional cache size: 0, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p2_EAX = 0; [L713] 0 int __unbuffered_p2_EBX = 0; [L714] 0 _Bool main$tmp_guard0; [L715] 0 _Bool main$tmp_guard1; [L717] 0 int x = 0; [L718] 0 _Bool x$flush_delayed; [L719] 0 int x$mem_tmp; [L720] 0 _Bool x$r_buff0_thd0; [L721] 0 _Bool x$r_buff0_thd1; [L722] 0 _Bool x$r_buff0_thd2; [L723] 0 _Bool x$r_buff0_thd3; [L724] 0 _Bool x$r_buff1_thd0; [L725] 0 _Bool x$r_buff1_thd1; [L726] 0 _Bool x$r_buff1_thd2; [L727] 0 _Bool x$r_buff1_thd3; [L728] 0 _Bool x$read_delayed; [L729] 0 int *x$read_delayed_var; [L730] 0 int x$w_buff0; [L731] 0 _Bool x$w_buff0_used; [L732] 0 int x$w_buff1; [L733] 0 _Bool x$w_buff1_used; [L735] 0 int y = 0; [L737] 0 int z = 0; [L738] 0 _Bool weak$$choice0; [L739] 0 _Bool weak$$choice2; [L823] 0 pthread_t t748; [L824] FCALL, FORK 0 pthread_create(&t748, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t748, ((void *)0), P0, ((void *)0))=0, t748={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L825] 0 pthread_t t749; [L826] FCALL, FORK 0 pthread_create(&t749, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t749, ((void *)0), P1, ((void *)0))=1, t748={3:0}, t749={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L827] 0 pthread_t t750; [L828] FCALL, FORK 0 pthread_create(&t750, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t750, ((void *)0), P2, ((void *)0))=2, t748={3:0}, t749={7:0}, t750={11:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L763] 2 x$w_buff1 = x$w_buff0 [L764] 2 x$w_buff0 = 2 [L765] 2 x$w_buff1_used = x$w_buff0_used [L766] 2 x$w_buff0_used = (_Bool)1 [L767] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L767] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L768] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L769] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L770] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L771] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L772] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L775] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L792] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=0] [L795] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=0] [L798] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=0] [L743] 1 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L746] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L749] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L750] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L751] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L752] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L753] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L778] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L779] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L780] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L781] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L782] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L785] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L787] 2 return 0; [L756] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L758] 1 return 0; [L801] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L802] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L803] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L804] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L805] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L808] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L810] 3 return 0; [L830] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L832] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L832] RET 0 assume_abort_if_not(main$tmp_guard0) [L834] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L835] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L836] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L837] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L838] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t748={3:0}, t749={7:0}, t750={11:0}, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L841] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L842] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L843] 0 x$flush_delayed = weak$$choice2 [L844] 0 x$mem_tmp = x [L845] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L846] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L847] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L848] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L849] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L850] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L851] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L852] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 2 && __unbuffered_p2_EBX == 0) [L853] 0 x = x$flush_delayed ? x$mem_tmp : x [L854] 0 x$flush_delayed = (_Bool)0 [L856] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 821]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 826]: 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: 824]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 828]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 155 locations, 13 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.2s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 2.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 7.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 398 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 325 mSDsluCounter, 168 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 119 mSDsCounter, 125 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1203 IncrementalHoareTripleChecker+Invalid, 1328 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 125 mSolverCounterUnsat, 49 mSDtfsCounter, 1203 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 150 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=146occurred in iteration=7, InterpolantAutomatonStates: 45, 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, 0.9s InterpolantComputationTime, 177 NumberOfCodeBlocks, 177 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 145 ConstructedInterpolants, 17 QuantifiedInterpolants, 1601 SizeOfPredicates, 13 NumberOfNonLiveVariables, 1307 ConjunctsInSsa, 87 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-12-13 16:36:03,017 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0af340b9-813b-4879-82e3-1ae81d317d05/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample