./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/mix036.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00bd5136-fabb-4b46-a8e8-3f3a1eb5b223/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00bd5136-fabb-4b46-a8e8-3f3a1eb5b223/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_00bd5136-fabb-4b46-a8e8-3f3a1eb5b223/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00bd5136-fabb-4b46-a8e8-3f3a1eb5b223/bin/uautomizer-uyxdKDjOR8/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix036.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00bd5136-fabb-4b46-a8e8-3f3a1eb5b223/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_00bd5136-fabb-4b46-a8e8-3f3a1eb5b223/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 e3d3e405a2d3cb3ab8b02ed87788ef59412b7b81517118cc37c044f334087868 --- 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 20:52:41,815 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 20:52:41,817 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 20:52:41,829 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 20:52:41,829 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 20:52:41,830 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 20:52:41,831 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 20:52:41,832 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 20:52:41,833 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 20:52:41,833 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 20:52:41,834 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 20:52:41,835 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 20:52:41,835 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 20:52:41,835 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 20:52:41,836 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 20:52:41,837 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 20:52:41,837 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 20:52:41,838 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 20:52:41,839 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 20:52:41,840 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 20:52:41,841 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 20:52:41,842 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 20:52:41,842 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 20:52:41,843 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 20:52:41,845 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 20:52:41,845 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 20:52:41,845 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 20:52:41,846 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 20:52:41,846 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 20:52:41,847 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 20:52:41,847 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 20:52:41,848 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 20:52:41,848 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 20:52:41,848 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 20:52:41,849 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 20:52:41,849 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 20:52:41,850 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 20:52:41,850 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 20:52:41,850 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 20:52:41,851 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 20:52:41,851 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 20:52:41,852 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00bd5136-fabb-4b46-a8e8-3f3a1eb5b223/bin/uautomizer-uyxdKDjOR8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-12-13 20:52:41,880 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 20:52:41,880 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 20:52:41,881 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 20:52:41,881 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 20:52:41,882 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 20:52:41,882 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 20:52:41,883 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 20:52:41,883 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 20:52:41,883 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 20:52:41,888 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 20:52:41,888 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 20:52:41,889 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-13 20:52:41,889 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 20:52:41,889 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 20:52:41,889 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 20:52:41,889 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-12-13 20:52:41,889 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-12-13 20:52:41,890 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-12-13 20:52:41,890 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 20:52:41,890 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-12-13 20:52:41,890 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 20:52:41,890 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 20:52:41,890 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 20:52:41,890 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 20:52:41,890 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 20:52:41,890 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 20:52:41,891 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 20:52:41,891 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 20:52:41,891 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 20:52:41,891 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 20:52:41,891 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 20:52:41,891 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 20:52:41,891 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 20:52:41,892 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 20:52:41,892 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_00bd5136-fabb-4b46-a8e8-3f3a1eb5b223/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_00bd5136-fabb-4b46-a8e8-3f3a1eb5b223/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 -> e3d3e405a2d3cb3ab8b02ed87788ef59412b7b81517118cc37c044f334087868 [2022-12-13 20:52:42,070 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 20:52:42,087 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 20:52:42,090 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 20:52:42,091 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 20:52:42,091 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 20:52:42,092 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00bd5136-fabb-4b46-a8e8-3f3a1eb5b223/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/pthread-wmm/mix036.oepc.i [2022-12-13 20:52:44,680 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 20:52:44,897 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 20:52:44,898 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00bd5136-fabb-4b46-a8e8-3f3a1eb5b223/sv-benchmarks/c/pthread-wmm/mix036.oepc.i [2022-12-13 20:52:44,909 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00bd5136-fabb-4b46-a8e8-3f3a1eb5b223/bin/uautomizer-uyxdKDjOR8/data/16104fc76/3334bb66e49d40bd9d02439ad7b5bf60/FLAGe55e965e1 [2022-12-13 20:52:44,920 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00bd5136-fabb-4b46-a8e8-3f3a1eb5b223/bin/uautomizer-uyxdKDjOR8/data/16104fc76/3334bb66e49d40bd9d02439ad7b5bf60 [2022-12-13 20:52:44,922 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 20:52:44,923 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 20:52:44,924 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 20:52:44,924 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 20:52:44,926 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 20:52:44,927 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 08:52:44" (1/1) ... [2022-12-13 20:52:44,927 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1635067e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:52:44, skipping insertion in model container [2022-12-13 20:52:44,927 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 08:52:44" (1/1) ... [2022-12-13 20:52:44,932 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 20:52:44,957 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 20:52:45,067 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_00bd5136-fabb-4b46-a8e8-3f3a1eb5b223/sv-benchmarks/c/pthread-wmm/mix036.oepc.i[945,958] [2022-12-13 20:52:45,157 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 20:52:45,159 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 20:52:45,159 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 20:52:45,159 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 20:52:45,160 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 20:52:45,162 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 20:52:45,162 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 20:52:45,162 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 20:52:45,163 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 20:52:45,163 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 20:52:45,164 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 20:52:45,164 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 20:52:45,164 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 20:52:45,166 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 20:52:45,166 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 20:52:45,167 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 20:52:45,167 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 20:52:45,167 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 20:52:45,168 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 20:52:45,168 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 20:52:45,168 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 20:52:45,170 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 20:52:45,170 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 20:52:45,171 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 20:52:45,171 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 20:52:45,171 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 20:52:45,172 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 20:52:45,172 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 20:52:45,172 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 20:52:45,173 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 20:52:45,173 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 20:52:45,179 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 20:52:45,179 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 20:52:45,181 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 20:52:45,182 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 20:52:45,182 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 20:52:45,187 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 20:52:45,188 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 20:52:45,188 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 20:52:45,190 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 20:52:45,190 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 20:52:45,191 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 20:52:45,191 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 20:52:45,200 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 20:52:45,208 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_00bd5136-fabb-4b46-a8e8-3f3a1eb5b223/sv-benchmarks/c/pthread-wmm/mix036.oepc.i[945,958] [2022-12-13 20:52:45,226 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 20:52:45,227 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 20:52:45,227 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 20:52:45,227 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 20:52:45,228 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 20:52:45,229 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 20:52:45,229 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 20:52:45,230 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 20:52:45,230 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 20:52:45,230 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 20:52:45,231 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 20:52:45,231 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 20:52:45,231 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 20:52:45,233 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 20:52:45,233 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 20:52:45,233 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 20:52:45,234 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 20:52:45,234 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 20:52:45,234 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 20:52:45,234 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 20:52:45,234 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 20:52:45,237 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 20:52:45,237 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 20:52:45,237 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 20:52:45,238 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 20:52:45,238 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 20:52:45,238 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 20:52:45,239 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 20:52:45,239 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 20:52:45,239 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 20:52:45,239 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 20:52:45,244 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 20:52:45,244 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 20:52:45,246 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 20:52:45,246 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 20:52:45,246 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 20:52:45,249 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 20:52:45,250 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 20:52:45,250 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 20:52:45,251 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 20:52:45,251 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 20:52:45,252 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 20:52:45,253 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 20:52:45,273 INFO L208 MainTranslator]: Completed translation [2022-12-13 20:52:45,273 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:52:45 WrapperNode [2022-12-13 20:52:45,273 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 20:52:45,274 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 20:52:45,274 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 20:52:45,274 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 20:52:45,279 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:52:45" (1/1) ... [2022-12-13 20:52:45,291 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:52:45" (1/1) ... [2022-12-13 20:52:45,307 INFO L138 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 147 [2022-12-13 20:52:45,307 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 20:52:45,308 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 20:52:45,308 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 20:52:45,308 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 20:52:45,314 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:52:45" (1/1) ... [2022-12-13 20:52:45,315 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:52:45" (1/1) ... [2022-12-13 20:52:45,317 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:52:45" (1/1) ... [2022-12-13 20:52:45,318 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:52:45" (1/1) ... [2022-12-13 20:52:45,324 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:52:45" (1/1) ... [2022-12-13 20:52:45,325 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:52:45" (1/1) ... [2022-12-13 20:52:45,326 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:52:45" (1/1) ... [2022-12-13 20:52:45,327 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:52:45" (1/1) ... [2022-12-13 20:52:45,330 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 20:52:45,330 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 20:52:45,330 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 20:52:45,330 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 20:52:45,331 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:52:45" (1/1) ... [2022-12-13 20:52:45,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 20:52:45,343 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00bd5136-fabb-4b46-a8e8-3f3a1eb5b223/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 20:52:45,352 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00bd5136-fabb-4b46-a8e8-3f3a1eb5b223/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 20:52:45,354 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00bd5136-fabb-4b46-a8e8-3f3a1eb5b223/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 20:52:45,388 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 20:52:45,388 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 20:52:45,388 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 20:52:45,388 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 20:52:45,388 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 20:52:45,388 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 20:52:45,388 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 20:52:45,389 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 20:52:45,389 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 20:52:45,389 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-13 20:52:45,389 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-13 20:52:45,389 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-12-13 20:52:45,389 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-12-13 20:52:45,389 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 20:52:45,389 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 20:52:45,389 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 20:52:45,390 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 20:52:45,391 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 20:52:45,503 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 20:52:45,505 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 20:52:45,792 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 20:52:45,921 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 20:52:45,922 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 20:52:45,924 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 08:52:45 BoogieIcfgContainer [2022-12-13 20:52:45,924 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 20:52:45,927 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 20:52:45,927 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 20:52:45,930 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 20:52:45,931 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 08:52:44" (1/3) ... [2022-12-13 20:52:45,931 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13ef96d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 08:52:45, skipping insertion in model container [2022-12-13 20:52:45,932 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:52:45" (2/3) ... [2022-12-13 20:52:45,932 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13ef96d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 08:52:45, skipping insertion in model container [2022-12-13 20:52:45,932 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 08:52:45" (3/3) ... [2022-12-13 20:52:45,934 INFO L112 eAbstractionObserver]: Analyzing ICFG mix036.oepc.i [2022-12-13 20:52:45,953 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 20:52:45,953 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2022-12-13 20:52:45,953 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 20:52:46,018 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 20:52:46,058 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 164 places, 153 transitions, 326 flow [2022-12-13 20:52:46,119 INFO L130 PetriNetUnfolder]: 2/149 cut-off events. [2022-12-13 20:52:46,119 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 20:52:46,123 INFO L83 FinitePrefix]: Finished finitePrefix Result has 162 conditions, 149 events. 2/149 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 109 event pairs, 0 based on Foata normal form. 0/136 useless extension candidates. Maximal degree in co-relation 102. Up to 2 conditions per place. [2022-12-13 20:52:46,124 INFO L82 GeneralOperation]: Start removeDead. Operand has 164 places, 153 transitions, 326 flow [2022-12-13 20:52:46,127 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 160 places, 149 transitions, 310 flow [2022-12-13 20:52:46,130 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-12-13 20:52:46,138 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 160 places, 149 transitions, 310 flow [2022-12-13 20:52:46,140 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 160 places, 149 transitions, 310 flow [2022-12-13 20:52:46,140 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 160 places, 149 transitions, 310 flow [2022-12-13 20:52:46,164 INFO L130 PetriNetUnfolder]: 2/149 cut-off events. [2022-12-13 20:52:46,164 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 20:52:46,165 INFO L83 FinitePrefix]: Finished finitePrefix Result has 162 conditions, 149 events. 2/149 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 109 event pairs, 0 based on Foata normal form. 0/136 useless extension candidates. Maximal degree in co-relation 102. Up to 2 conditions per place. [2022-12-13 20:52:46,167 INFO L119 LiptonReduction]: Number of co-enabled transitions 3884 [2022-12-13 20:52:50,010 INFO L134 LiptonReduction]: Checked pairs total: 10943 [2022-12-13 20:52:50,011 INFO L136 LiptonReduction]: Total number of compositions: 148 [2022-12-13 20:52:50,021 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 20:52:50,026 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;@4f27216e, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 20:52:50,026 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2022-12-13 20:52:50,027 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2022-12-13 20:52:50,027 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 20:52:50,027 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 20:52:50,027 INFO L209 CegarLoopForPetriNet]: trace histogram [1] [2022-12-13 20:52:50,028 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-12-13 20:52:50,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:52:50,031 INFO L85 PathProgramCache]: Analyzing trace with hash 641, now seen corresponding path program 1 times [2022-12-13 20:52:50,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:52:50,037 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486035719] [2022-12-13 20:52:50,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:52:50,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:52:50,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:52:50,114 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 20:52:50,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:52:50,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486035719] [2022-12-13 20:52:50,115 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486035719] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:52:50,116 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:52:50,116 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-12-13 20:52:50,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451246816] [2022-12-13 20:52:50,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:52:50,123 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-13 20:52:50,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:52:50,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-13 20:52:50,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-13 20:52:50,140 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 301 [2022-12-13 20:52:50,141 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 42 transitions, 96 flow. Second operand has 2 states, 2 states have (on average 138.5) internal successors, (277), 2 states have internal predecessors, (277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:52:50,142 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 20:52:50,142 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 301 [2022-12-13 20:52:50,142 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 20:52:51,829 INFO L130 PetriNetUnfolder]: 11991/16062 cut-off events. [2022-12-13 20:52:51,829 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 20:52:51,858 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32322 conditions, 16062 events. 11991/16062 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 700. Compared 83593 event pairs, 11991 based on Foata normal form. 480/14266 useless extension candidates. Maximal degree in co-relation 32310. Up to 16043 conditions per place. [2022-12-13 20:52:51,904 INFO L137 encePairwiseOnDemand]: 292/301 looper letters, 30 selfloop transitions, 0 changer transitions 0/33 dead transitions. [2022-12-13 20:52:51,904 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 33 transitions, 138 flow [2022-12-13 20:52:51,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 20:52:51,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-12-13 20:52:51,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 315 transitions. [2022-12-13 20:52:51,913 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5232558139534884 [2022-12-13 20:52:51,914 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 315 transitions. [2022-12-13 20:52:51,914 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 315 transitions. [2022-12-13 20:52:51,915 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 20:52:51,917 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 315 transitions. [2022-12-13 20:52:51,919 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 157.5) internal successors, (315), 2 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:52:51,922 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 301.0) internal successors, (903), 3 states have internal predecessors, (903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:52:51,922 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 301.0) internal successors, (903), 3 states have internal predecessors, (903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:52:51,924 INFO L175 Difference]: Start difference. First operand has 54 places, 42 transitions, 96 flow. Second operand 2 states and 315 transitions. [2022-12-13 20:52:51,924 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 33 transitions, 138 flow [2022-12-13 20:52:51,929 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 33 transitions, 134 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-13 20:52:51,930 INFO L231 Difference]: Finished difference. Result has 43 places, 33 transitions, 74 flow [2022-12-13 20:52:51,932 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=301, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=74, PETRI_PLACES=43, PETRI_TRANSITIONS=33} [2022-12-13 20:52:51,935 INFO L288 CegarLoopForPetriNet]: 54 programPoint places, -11 predicate places. [2022-12-13 20:52:51,935 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 33 transitions, 74 flow [2022-12-13 20:52:51,935 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 138.5) internal successors, (277), 2 states have internal predecessors, (277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:52:51,935 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 20:52:51,935 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-12-13 20:52:51,935 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 20:52:51,936 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-12-13 20:52:51,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:52:51,936 INFO L85 PathProgramCache]: Analyzing trace with hash 631762, now seen corresponding path program 1 times [2022-12-13 20:52:51,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:52:51,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612856677] [2022-12-13 20:52:51,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:52:51,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:52:51,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:52:52,110 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 20:52:52,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:52:52,111 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612856677] [2022-12-13 20:52:52,111 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612856677] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:52:52,111 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:52:52,111 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 20:52:52,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296015059] [2022-12-13 20:52:52,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:52:52,113 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 20:52:52,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:52:52,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 20:52:52,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 20:52:52,116 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 301 [2022-12-13 20:52:52,117 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 33 transitions, 74 flow. Second operand has 3 states, 3 states have (on average 138.0) internal successors, (414), 3 states have internal predecessors, (414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:52:52,118 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 20:52:52,118 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 301 [2022-12-13 20:52:52,118 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 20:52:53,263 INFO L130 PetriNetUnfolder]: 9431/12882 cut-off events. [2022-12-13 20:52:53,263 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 20:52:53,279 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25727 conditions, 12882 events. 9431/12882 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 562. Compared 67840 event pairs, 3559 based on Foata normal form. 0/11725 useless extension candidates. Maximal degree in co-relation 25724. Up to 10111 conditions per place. [2022-12-13 20:52:53,310 INFO L137 encePairwiseOnDemand]: 298/301 looper letters, 47 selfloop transitions, 2 changer transitions 4/56 dead transitions. [2022-12-13 20:52:53,310 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 56 transitions, 232 flow [2022-12-13 20:52:53,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 20:52:53,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 20:52:53,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 465 transitions. [2022-12-13 20:52:53,313 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5149501661129569 [2022-12-13 20:52:53,313 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 465 transitions. [2022-12-13 20:52:53,313 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 465 transitions. [2022-12-13 20:52:53,314 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 20:52:53,314 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 465 transitions. [2022-12-13 20:52:53,315 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 155.0) internal successors, (465), 3 states have internal predecessors, (465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:52:53,317 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 301.0) internal successors, (1204), 4 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:52:53,317 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 301.0) internal successors, (1204), 4 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:52:53,318 INFO L175 Difference]: Start difference. First operand has 43 places, 33 transitions, 74 flow. Second operand 3 states and 465 transitions. [2022-12-13 20:52:53,318 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 56 transitions, 232 flow [2022-12-13 20:52:53,318 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 56 transitions, 232 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-13 20:52:53,319 INFO L231 Difference]: Finished difference. Result has 44 places, 30 transitions, 72 flow [2022-12-13 20:52:53,319 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=301, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=72, PETRI_PLACES=44, PETRI_TRANSITIONS=30} [2022-12-13 20:52:53,320 INFO L288 CegarLoopForPetriNet]: 54 programPoint places, -10 predicate places. [2022-12-13 20:52:53,320 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 30 transitions, 72 flow [2022-12-13 20:52:53,320 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 138.0) internal successors, (414), 3 states have internal predecessors, (414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:52:53,320 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 20:52:53,320 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:52:53,320 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 20:52:53,321 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-12-13 20:52:53,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:52:53,321 INFO L85 PathProgramCache]: Analyzing trace with hash 1993057283, now seen corresponding path program 1 times [2022-12-13 20:52:53,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:52:53,321 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579346936] [2022-12-13 20:52:53,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:52:53,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:52:53,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:52:53,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 20:52:53,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:52:53,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579346936] [2022-12-13 20:52:53,515 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579346936] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:52:53,515 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:52:53,516 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 20:52:53,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35422821] [2022-12-13 20:52:53,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:52:53,516 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 20:52:53,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:52:53,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 20:52:53,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 20:52:53,537 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 301 [2022-12-13 20:52:53,538 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 30 transitions, 72 flow. Second operand has 4 states, 4 states have (on average 131.0) internal successors, (524), 4 states have internal predecessors, (524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:52:53,538 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 20:52:53,538 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 301 [2022-12-13 20:52:53,538 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 20:52:55,469 INFO L130 PetriNetUnfolder]: 18413/24676 cut-off events. [2022-12-13 20:52:55,470 INFO L131 PetriNetUnfolder]: For 1237/1237 co-relation queries the response was YES. [2022-12-13 20:52:55,488 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50907 conditions, 24676 events. 18413/24676 cut-off events. For 1237/1237 co-relation queries the response was YES. Maximal size of possible extension queue 730. Compared 123081 event pairs, 9643 based on Foata normal form. 0/23942 useless extension candidates. Maximal degree in co-relation 50903. Up to 18869 conditions per place. [2022-12-13 20:52:55,537 INFO L137 encePairwiseOnDemand]: 294/301 looper letters, 64 selfloop transitions, 10 changer transitions 0/74 dead transitions. [2022-12-13 20:52:55,538 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 74 transitions, 320 flow [2022-12-13 20:52:55,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 20:52:55,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 20:52:55,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 716 transitions. [2022-12-13 20:52:55,541 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4757475083056478 [2022-12-13 20:52:55,541 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 716 transitions. [2022-12-13 20:52:55,542 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 716 transitions. [2022-12-13 20:52:55,542 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 20:52:55,542 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 716 transitions. [2022-12-13 20:52:55,543 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 143.2) internal successors, (716), 5 states have internal predecessors, (716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:52:55,545 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 301.0) internal successors, (1806), 6 states have internal predecessors, (1806), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:52:55,546 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 301.0) internal successors, (1806), 6 states have internal predecessors, (1806), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:52:55,546 INFO L175 Difference]: Start difference. First operand has 44 places, 30 transitions, 72 flow. Second operand 5 states and 716 transitions. [2022-12-13 20:52:55,546 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 74 transitions, 320 flow [2022-12-13 20:52:55,547 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 74 transitions, 310 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 20:52:55,548 INFO L231 Difference]: Finished difference. Result has 47 places, 39 transitions, 143 flow [2022-12-13 20:52:55,548 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=301, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=143, PETRI_PLACES=47, PETRI_TRANSITIONS=39} [2022-12-13 20:52:55,548 INFO L288 CegarLoopForPetriNet]: 54 programPoint places, -7 predicate places. [2022-12-13 20:52:55,549 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 39 transitions, 143 flow [2022-12-13 20:52:55,549 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 131.0) internal successors, (524), 4 states have internal predecessors, (524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:52:55,549 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 20:52:55,549 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:52:55,549 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 20:52:55,549 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-12-13 20:52:55,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:52:55,550 INFO L85 PathProgramCache]: Analyzing trace with hash 1993057327, now seen corresponding path program 1 times [2022-12-13 20:52:55,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:52:55,550 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522123180] [2022-12-13 20:52:55,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:52:55,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:52:55,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:52:55,962 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 20:52:55,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:52:55,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522123180] [2022-12-13 20:52:55,963 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1522123180] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:52:55,963 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:52:55,963 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 20:52:55,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38311624] [2022-12-13 20:52:55,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:52:55,963 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 20:52:55,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:52:55,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 20:52:55,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-13 20:52:56,170 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 301 [2022-12-13 20:52:56,171 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 39 transitions, 143 flow. Second operand has 7 states, 7 states have (on average 121.71428571428571) internal successors, (852), 7 states have internal predecessors, (852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:52:56,171 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 20:52:56,171 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 301 [2022-12-13 20:52:56,171 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 20:52:57,476 INFO L130 PetriNetUnfolder]: 10425/14555 cut-off events. [2022-12-13 20:52:57,476 INFO L131 PetriNetUnfolder]: For 4200/4570 co-relation queries the response was YES. [2022-12-13 20:52:57,491 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33896 conditions, 14555 events. 10425/14555 cut-off events. For 4200/4570 co-relation queries the response was YES. Maximal size of possible extension queue 622. Compared 80724 event pairs, 1900 based on Foata normal form. 1268/15392 useless extension candidates. Maximal degree in co-relation 33889. Up to 9481 conditions per place. [2022-12-13 20:52:57,518 INFO L137 encePairwiseOnDemand]: 295/301 looper letters, 52 selfloop transitions, 6 changer transitions 5/69 dead transitions. [2022-12-13 20:52:57,518 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 69 transitions, 329 flow [2022-12-13 20:52:57,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 20:52:57,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 20:52:57,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 899 transitions. [2022-12-13 20:52:57,521 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4266729947793071 [2022-12-13 20:52:57,521 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 899 transitions. [2022-12-13 20:52:57,521 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 899 transitions. [2022-12-13 20:52:57,521 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 20:52:57,521 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 899 transitions. [2022-12-13 20:52:57,523 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 128.42857142857142) internal successors, (899), 7 states have internal predecessors, (899), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:52:57,524 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 301.0) internal successors, (2408), 8 states have internal predecessors, (2408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:52:57,525 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 301.0) internal successors, (2408), 8 states have internal predecessors, (2408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:52:57,525 INFO L175 Difference]: Start difference. First operand has 47 places, 39 transitions, 143 flow. Second operand 7 states and 899 transitions. [2022-12-13 20:52:57,525 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 69 transitions, 329 flow [2022-12-13 20:52:57,532 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 69 transitions, 324 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 20:52:57,533 INFO L231 Difference]: Finished difference. Result has 51 places, 33 transitions, 118 flow [2022-12-13 20:52:57,533 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=301, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=118, PETRI_PLACES=51, PETRI_TRANSITIONS=33} [2022-12-13 20:52:57,533 INFO L288 CegarLoopForPetriNet]: 54 programPoint places, -3 predicate places. [2022-12-13 20:52:57,533 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 33 transitions, 118 flow [2022-12-13 20:52:57,534 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 121.71428571428571) internal successors, (852), 7 states have internal predecessors, (852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:52:57,534 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 20:52:57,534 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:52:57,534 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 20:52:57,534 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-12-13 20:52:57,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:52:57,535 INFO L85 PathProgramCache]: Analyzing trace with hash -1489505099, now seen corresponding path program 1 times [2022-12-13 20:52:57,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:52:57,535 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489738553] [2022-12-13 20:52:57,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:52:57,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:52:57,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:52:57,642 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 20:52:57,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:52:57,643 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489738553] [2022-12-13 20:52:57,643 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1489738553] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:52:57,643 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:52:57,643 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 20:52:57,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401571237] [2022-12-13 20:52:57,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:52:57,644 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 20:52:57,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:52:57,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 20:52:57,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 20:52:57,661 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 301 [2022-12-13 20:52:57,662 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 33 transitions, 118 flow. Second operand has 5 states, 5 states have (on average 130.8) internal successors, (654), 5 states have internal predecessors, (654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:52:57,662 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 20:52:57,662 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 301 [2022-12-13 20:52:57,662 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 20:52:59,229 INFO L130 PetriNetUnfolder]: 12137/16400 cut-off events. [2022-12-13 20:52:59,229 INFO L131 PetriNetUnfolder]: For 9640/9640 co-relation queries the response was YES. [2022-12-13 20:52:59,254 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41356 conditions, 16400 events. 12137/16400 cut-off events. For 9640/9640 co-relation queries the response was YES. Maximal size of possible extension queue 484. Compared 77681 event pairs, 3142 based on Foata normal form. 702/17102 useless extension candidates. Maximal degree in co-relation 41349. Up to 10251 conditions per place. [2022-12-13 20:52:59,296 INFO L137 encePairwiseOnDemand]: 297/301 looper letters, 44 selfloop transitions, 3 changer transitions 30/77 dead transitions. [2022-12-13 20:52:59,296 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 77 transitions, 404 flow [2022-12-13 20:52:59,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 20:52:59,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 20:52:59,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 715 transitions. [2022-12-13 20:52:59,298 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4750830564784053 [2022-12-13 20:52:59,298 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 715 transitions. [2022-12-13 20:52:59,298 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 715 transitions. [2022-12-13 20:52:59,299 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 20:52:59,299 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 715 transitions. [2022-12-13 20:52:59,300 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 143.0) internal successors, (715), 5 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 20:52:59,302 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 301.0) internal successors, (1806), 6 states have internal predecessors, (1806), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:52:59,303 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 301.0) internal successors, (1806), 6 states have internal predecessors, (1806), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:52:59,303 INFO L175 Difference]: Start difference. First operand has 51 places, 33 transitions, 118 flow. Second operand 5 states and 715 transitions. [2022-12-13 20:52:59,303 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 77 transitions, 404 flow [2022-12-13 20:52:59,384 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 77 transitions, 391 flow, removed 1 selfloop flow, removed 6 redundant places. [2022-12-13 20:52:59,385 INFO L231 Difference]: Finished difference. Result has 50 places, 33 transitions, 121 flow [2022-12-13 20:52:59,385 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=301, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=121, PETRI_PLACES=50, PETRI_TRANSITIONS=33} [2022-12-13 20:52:59,386 INFO L288 CegarLoopForPetriNet]: 54 programPoint places, -4 predicate places. [2022-12-13 20:52:59,386 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 33 transitions, 121 flow [2022-12-13 20:52:59,386 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 130.8) internal successors, (654), 5 states have internal predecessors, (654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:52:59,387 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 20:52:59,387 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:52:59,387 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 20:52:59,387 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-12-13 20:52:59,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:52:59,388 INFO L85 PathProgramCache]: Analyzing trace with hash -316545973, now seen corresponding path program 1 times [2022-12-13 20:52:59,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:52:59,388 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945709068] [2022-12-13 20:52:59,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:52:59,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:52:59,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:52:59,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 20:52:59,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:52:59,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945709068] [2022-12-13 20:52:59,549 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945709068] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:52:59,550 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:52:59,550 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 20:52:59,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711128741] [2022-12-13 20:52:59,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:52:59,550 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 20:52:59,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:52:59,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 20:52:59,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 20:52:59,560 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 301 [2022-12-13 20:52:59,561 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 33 transitions, 121 flow. Second operand has 4 states, 4 states have (on average 134.5) internal successors, (538), 4 states have internal predecessors, (538), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:52:59,561 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 20:52:59,561 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 301 [2022-12-13 20:52:59,561 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 20:53:00,377 INFO L130 PetriNetUnfolder]: 6459/9353 cut-off events. [2022-12-13 20:53:00,377 INFO L131 PetriNetUnfolder]: For 3732/3971 co-relation queries the response was YES. [2022-12-13 20:53:00,389 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22844 conditions, 9353 events. 6459/9353 cut-off events. For 3732/3971 co-relation queries the response was YES. Maximal size of possible extension queue 410. Compared 52281 event pairs, 1357 based on Foata normal form. 612/9715 useless extension candidates. Maximal degree in co-relation 22835. Up to 4542 conditions per place. [2022-12-13 20:53:00,404 INFO L137 encePairwiseOnDemand]: 294/301 looper letters, 56 selfloop transitions, 6 changer transitions 0/68 dead transitions. [2022-12-13 20:53:00,405 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 68 transitions, 337 flow [2022-12-13 20:53:00,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 20:53:00,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 20:53:00,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 587 transitions. [2022-12-13 20:53:00,406 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.48754152823920266 [2022-12-13 20:53:00,407 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 587 transitions. [2022-12-13 20:53:00,407 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 587 transitions. [2022-12-13 20:53:00,407 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 20:53:00,407 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 587 transitions. [2022-12-13 20:53:00,408 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 146.75) internal successors, (587), 4 states have internal predecessors, (587), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:53:00,409 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 301.0) internal successors, (1505), 5 states have internal predecessors, (1505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:53:00,409 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 301.0) internal successors, (1505), 5 states have internal predecessors, (1505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:53:00,409 INFO L175 Difference]: Start difference. First operand has 50 places, 33 transitions, 121 flow. Second operand 4 states and 587 transitions. [2022-12-13 20:53:00,409 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 68 transitions, 337 flow [2022-12-13 20:53:00,437 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 68 transitions, 323 flow, removed 2 selfloop flow, removed 4 redundant places. [2022-12-13 20:53:00,438 INFO L231 Difference]: Finished difference. Result has 49 places, 38 transitions, 157 flow [2022-12-13 20:53:00,438 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=301, PETRI_DIFFERENCE_MINUEND_FLOW=111, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=157, PETRI_PLACES=49, PETRI_TRANSITIONS=38} [2022-12-13 20:53:00,438 INFO L288 CegarLoopForPetriNet]: 54 programPoint places, -5 predicate places. [2022-12-13 20:53:00,438 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 38 transitions, 157 flow [2022-12-13 20:53:00,439 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 134.5) internal successors, (538), 4 states have internal predecessors, (538), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:53:00,439 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 20:53:00,439 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 20:53:00,439 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 20:53:00,439 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-12-13 20:53:00,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:53:00,439 INFO L85 PathProgramCache]: Analyzing trace with hash -956103200, now seen corresponding path program 1 times [2022-12-13 20:53:00,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:53:00,440 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176012696] [2022-12-13 20:53:00,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:53:00,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:53:00,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:53:00,576 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 20:53:00,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:53:00,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176012696] [2022-12-13 20:53:00,577 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1176012696] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:53:00,577 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:53:00,577 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 20:53:00,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722668931] [2022-12-13 20:53:00,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:53:00,577 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 20:53:00,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:53:00,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 20:53:00,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 20:53:00,586 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 301 [2022-12-13 20:53:00,587 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 38 transitions, 157 flow. Second operand has 5 states, 5 states have (on average 134.4) internal successors, (672), 5 states have internal predecessors, (672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:53:00,587 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 20:53:00,587 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 301 [2022-12-13 20:53:00,587 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 20:53:01,298 INFO L130 PetriNetUnfolder]: 4592/6919 cut-off events. [2022-12-13 20:53:01,298 INFO L131 PetriNetUnfolder]: For 3301/3516 co-relation queries the response was YES. [2022-12-13 20:53:01,308 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19379 conditions, 6919 events. 4592/6919 cut-off events. For 3301/3516 co-relation queries the response was YES. Maximal size of possible extension queue 313. Compared 39687 event pairs, 1201 based on Foata normal form. 390/7122 useless extension candidates. Maximal degree in co-relation 19370. Up to 2603 conditions per place. [2022-12-13 20:53:01,318 INFO L137 encePairwiseOnDemand]: 294/301 looper letters, 71 selfloop transitions, 10 changer transitions 0/87 dead transitions. [2022-12-13 20:53:01,319 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 87 transitions, 464 flow [2022-12-13 20:53:01,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 20:53:01,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 20:53:01,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 737 transitions. [2022-12-13 20:53:01,320 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.48970099667774086 [2022-12-13 20:53:01,320 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 737 transitions. [2022-12-13 20:53:01,320 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 737 transitions. [2022-12-13 20:53:01,321 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 20:53:01,321 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 737 transitions. [2022-12-13 20:53:01,322 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 147.4) internal successors, (737), 5 states have internal predecessors, (737), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:53:01,323 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 301.0) internal successors, (1806), 6 states have internal predecessors, (1806), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:53:01,323 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 301.0) internal successors, (1806), 6 states have internal predecessors, (1806), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:53:01,323 INFO L175 Difference]: Start difference. First operand has 49 places, 38 transitions, 157 flow. Second operand 5 states and 737 transitions. [2022-12-13 20:53:01,323 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 87 transitions, 464 flow [2022-12-13 20:53:01,325 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 87 transitions, 461 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 20:53:01,326 INFO L231 Difference]: Finished difference. Result has 54 places, 43 transitions, 222 flow [2022-12-13 20:53:01,326 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=301, PETRI_DIFFERENCE_MINUEND_FLOW=155, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=222, PETRI_PLACES=54, PETRI_TRANSITIONS=43} [2022-12-13 20:53:01,326 INFO L288 CegarLoopForPetriNet]: 54 programPoint places, 0 predicate places. [2022-12-13 20:53:01,326 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 43 transitions, 222 flow [2022-12-13 20:53:01,327 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 134.4) internal successors, (672), 5 states have internal predecessors, (672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:53:01,327 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 20:53:01,327 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:53:01,327 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 20:53:01,327 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-12-13 20:53:01,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:53:01,327 INFO L85 PathProgramCache]: Analyzing trace with hash 656370165, now seen corresponding path program 1 times [2022-12-13 20:53:01,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:53:01,327 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029965457] [2022-12-13 20:53:01,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:53:01,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:53:01,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:53:01,612 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 20:53:01,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:53:01,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029965457] [2022-12-13 20:53:01,613 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029965457] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:53:01,613 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:53:01,613 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 20:53:01,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720088780] [2022-12-13 20:53:01,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:53:01,614 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 20:53:01,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:53:01,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 20:53:01,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 20:53:01,657 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 301 [2022-12-13 20:53:01,658 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 43 transitions, 222 flow. Second operand has 6 states, 6 states have (on average 127.5) internal successors, (765), 6 states have internal predecessors, (765), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:53:01,658 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 20:53:01,659 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 301 [2022-12-13 20:53:01,659 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 20:53:03,266 INFO L130 PetriNetUnfolder]: 11285/16434 cut-off events. [2022-12-13 20:53:03,266 INFO L131 PetriNetUnfolder]: For 28542/28542 co-relation queries the response was YES. [2022-12-13 20:53:03,299 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55872 conditions, 16434 events. 11285/16434 cut-off events. For 28542/28542 co-relation queries the response was YES. Maximal size of possible extension queue 573. Compared 95993 event pairs, 1350 based on Foata normal form. 92/16526 useless extension candidates. Maximal degree in co-relation 55861. Up to 8431 conditions per place. [2022-12-13 20:53:03,325 INFO L137 encePairwiseOnDemand]: 287/301 looper letters, 132 selfloop transitions, 29 changer transitions 39/200 dead transitions. [2022-12-13 20:53:03,325 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 200 transitions, 1406 flow [2022-12-13 20:53:03,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 20:53:03,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-13 20:53:03,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1395 transitions. [2022-12-13 20:53:03,327 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4634551495016611 [2022-12-13 20:53:03,327 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1395 transitions. [2022-12-13 20:53:03,328 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1395 transitions. [2022-12-13 20:53:03,328 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 20:53:03,328 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1395 transitions. [2022-12-13 20:53:03,330 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 139.5) internal successors, (1395), 10 states have internal predecessors, (1395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:53:03,332 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 301.0) internal successors, (3311), 11 states have internal predecessors, (3311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:53:03,332 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 301.0) internal successors, (3311), 11 states have internal predecessors, (3311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:53:03,332 INFO L175 Difference]: Start difference. First operand has 54 places, 43 transitions, 222 flow. Second operand 10 states and 1395 transitions. [2022-12-13 20:53:03,332 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 200 transitions, 1406 flow [2022-12-13 20:53:03,346 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 200 transitions, 1345 flow, removed 18 selfloop flow, removed 2 redundant places. [2022-12-13 20:53:03,348 INFO L231 Difference]: Finished difference. Result has 67 places, 68 transitions, 436 flow [2022-12-13 20:53:03,348 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=301, PETRI_DIFFERENCE_MINUEND_FLOW=207, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=436, PETRI_PLACES=67, PETRI_TRANSITIONS=68} [2022-12-13 20:53:03,348 INFO L288 CegarLoopForPetriNet]: 54 programPoint places, 13 predicate places. [2022-12-13 20:53:03,348 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 68 transitions, 436 flow [2022-12-13 20:53:03,349 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 127.5) internal successors, (765), 6 states have internal predecessors, (765), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:53:03,349 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 20:53:03,349 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:53:03,349 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 20:53:03,349 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-12-13 20:53:03,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:53:03,349 INFO L85 PathProgramCache]: Analyzing trace with hash 2009318563, now seen corresponding path program 2 times [2022-12-13 20:53:03,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:53:03,349 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090175910] [2022-12-13 20:53:03,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:53:03,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:53:03,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:53:03,523 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 20:53:03,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:53:03,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090175910] [2022-12-13 20:53:03,523 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1090175910] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:53:03,523 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:53:03,523 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 20:53:03,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968463798] [2022-12-13 20:53:03,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:53:03,524 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 20:53:03,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:53:03,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 20:53:03,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-13 20:53:03,531 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 301 [2022-12-13 20:53:03,532 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 68 transitions, 436 flow. Second operand has 6 states, 6 states have (on average 134.33333333333334) internal successors, (806), 6 states have internal predecessors, (806), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:53:03,532 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 20:53:03,532 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 301 [2022-12-13 20:53:03,532 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 20:53:04,257 INFO L130 PetriNetUnfolder]: 3455/5469 cut-off events. [2022-12-13 20:53:04,257 INFO L131 PetriNetUnfolder]: For 9696/10018 co-relation queries the response was YES. [2022-12-13 20:53:04,267 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19900 conditions, 5469 events. 3455/5469 cut-off events. For 9696/10018 co-relation queries the response was YES. Maximal size of possible extension queue 243. Compared 32503 event pairs, 565 based on Foata normal form. 340/5654 useless extension candidates. Maximal degree in co-relation 19883. Up to 1903 conditions per place. [2022-12-13 20:53:04,278 INFO L137 encePairwiseOnDemand]: 294/301 looper letters, 138 selfloop transitions, 14 changer transitions 13/177 dead transitions. [2022-12-13 20:53:04,278 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 177 transitions, 1236 flow [2022-12-13 20:53:04,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 20:53:04,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 20:53:04,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 883 transitions. [2022-12-13 20:53:04,280 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.48892580287929127 [2022-12-13 20:53:04,280 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 883 transitions. [2022-12-13 20:53:04,280 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 883 transitions. [2022-12-13 20:53:04,280 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 20:53:04,280 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 883 transitions. [2022-12-13 20:53:04,281 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 147.16666666666666) internal successors, (883), 6 states have internal predecessors, (883), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:53:04,283 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 301.0) internal successors, (2107), 7 states have internal predecessors, (2107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:53:04,283 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 301.0) internal successors, (2107), 7 states have internal predecessors, (2107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:53:04,283 INFO L175 Difference]: Start difference. First operand has 67 places, 68 transitions, 436 flow. Second operand 6 states and 883 transitions. [2022-12-13 20:53:04,283 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 177 transitions, 1236 flow [2022-12-13 20:53:04,359 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 177 transitions, 1176 flow, removed 21 selfloop flow, removed 6 redundant places. [2022-12-13 20:53:04,360 INFO L231 Difference]: Finished difference. Result has 65 places, 72 transitions, 463 flow [2022-12-13 20:53:04,360 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=301, PETRI_DIFFERENCE_MINUEND_FLOW=379, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=463, PETRI_PLACES=65, PETRI_TRANSITIONS=72} [2022-12-13 20:53:04,360 INFO L288 CegarLoopForPetriNet]: 54 programPoint places, 11 predicate places. [2022-12-13 20:53:04,361 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 72 transitions, 463 flow [2022-12-13 20:53:04,361 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 134.33333333333334) internal successors, (806), 6 states have internal predecessors, (806), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:53:04,361 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 20:53:04,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, 1, 1] [2022-12-13 20:53:04,361 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 20:53:04,361 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-12-13 20:53:04,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:53:04,362 INFO L85 PathProgramCache]: Analyzing trace with hash -423737385, now seen corresponding path program 1 times [2022-12-13 20:53:04,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:53:04,362 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11701865] [2022-12-13 20:53:04,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:53:04,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:53:04,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:53:04,909 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 20:53:04,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:53:04,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11701865] [2022-12-13 20:53:04,910 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [11701865] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:53:04,910 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:53:04,910 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 20:53:04,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13189161] [2022-12-13 20:53:04,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:53:04,911 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 20:53:04,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:53:04,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 20:53:04,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-12-13 20:53:04,977 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 301 [2022-12-13 20:53:04,979 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 72 transitions, 463 flow. Second operand has 8 states, 8 states have (on average 134.875) internal successors, (1079), 8 states have internal predecessors, (1079), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:53:04,979 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 20:53:04,979 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 301 [2022-12-13 20:53:04,979 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 20:53:05,953 INFO L130 PetriNetUnfolder]: 4184/6925 cut-off events. [2022-12-13 20:53:05,954 INFO L131 PetriNetUnfolder]: For 13204/13507 co-relation queries the response was YES. [2022-12-13 20:53:05,965 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26469 conditions, 6925 events. 4184/6925 cut-off events. For 13204/13507 co-relation queries the response was YES. Maximal size of possible extension queue 300. Compared 43978 event pairs, 622 based on Foata normal form. 127/6971 useless extension candidates. Maximal degree in co-relation 26454. Up to 2308 conditions per place. [2022-12-13 20:53:05,978 INFO L137 encePairwiseOnDemand]: 292/301 looper letters, 151 selfloop transitions, 15 changer transitions 19/197 dead transitions. [2022-12-13 20:53:05,978 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 197 transitions, 1617 flow [2022-12-13 20:53:05,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 20:53:05,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 20:53:05,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1034 transitions. [2022-12-13 20:53:05,980 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4907451352634077 [2022-12-13 20:53:05,980 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1034 transitions. [2022-12-13 20:53:05,980 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1034 transitions. [2022-12-13 20:53:05,981 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 20:53:05,981 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1034 transitions. [2022-12-13 20:53:05,982 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 147.71428571428572) internal successors, (1034), 7 states have internal predecessors, (1034), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:53:05,984 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 301.0) internal successors, (2408), 8 states have internal predecessors, (2408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:53:05,984 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 301.0) internal successors, (2408), 8 states have internal predecessors, (2408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:53:05,984 INFO L175 Difference]: Start difference. First operand has 65 places, 72 transitions, 463 flow. Second operand 7 states and 1034 transitions. [2022-12-13 20:53:05,984 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 197 transitions, 1617 flow [2022-12-13 20:53:06,047 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 197 transitions, 1484 flow, removed 36 selfloop flow, removed 3 redundant places. [2022-12-13 20:53:06,048 INFO L231 Difference]: Finished difference. Result has 72 places, 72 transitions, 492 flow [2022-12-13 20:53:06,048 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=301, PETRI_DIFFERENCE_MINUEND_FLOW=432, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=492, PETRI_PLACES=72, PETRI_TRANSITIONS=72} [2022-12-13 20:53:06,049 INFO L288 CegarLoopForPetriNet]: 54 programPoint places, 18 predicate places. [2022-12-13 20:53:06,049 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 72 transitions, 492 flow [2022-12-13 20:53:06,049 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 134.875) internal successors, (1079), 8 states have internal predecessors, (1079), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:53:06,049 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 20:53:06,049 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:53:06,049 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 20:53:06,050 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-12-13 20:53:06,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:53:06,050 INFO L85 PathProgramCache]: Analyzing trace with hash 446883567, now seen corresponding path program 2 times [2022-12-13 20:53:06,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:53:06,050 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138246647] [2022-12-13 20:53:06,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:53:06,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:53:06,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:53:06,247 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 20:53:06,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:53:06,247 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138246647] [2022-12-13 20:53:06,247 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138246647] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:53:06,247 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:53:06,247 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 20:53:06,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972681947] [2022-12-13 20:53:06,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:53:06,248 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 20:53:06,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:53:06,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 20:53:06,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 20:53:06,269 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 301 [2022-12-13 20:53:06,270 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 72 transitions, 492 flow. Second operand has 6 states, 6 states have (on average 130.16666666666666) internal successors, (781), 6 states have internal predecessors, (781), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:53:06,270 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 20:53:06,270 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 301 [2022-12-13 20:53:06,270 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 20:53:07,586 INFO L130 PetriNetUnfolder]: 8131/12514 cut-off events. [2022-12-13 20:53:07,586 INFO L131 PetriNetUnfolder]: For 31003/31003 co-relation queries the response was YES. [2022-12-13 20:53:07,604 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52024 conditions, 12514 events. 8131/12514 cut-off events. For 31003/31003 co-relation queries the response was YES. Maximal size of possible extension queue 443. Compared 77149 event pairs, 1483 based on Foata normal form. 31/12545 useless extension candidates. Maximal degree in co-relation 52005. Up to 5917 conditions per place. [2022-12-13 20:53:07,620 INFO L137 encePairwiseOnDemand]: 293/301 looper letters, 108 selfloop transitions, 15 changer transitions 81/204 dead transitions. [2022-12-13 20:53:07,620 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 204 transitions, 1742 flow [2022-12-13 20:53:07,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 20:53:07,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 20:53:07,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 991 transitions. [2022-12-13 20:53:07,621 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4703369719981016 [2022-12-13 20:53:07,622 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 991 transitions. [2022-12-13 20:53:07,622 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 991 transitions. [2022-12-13 20:53:07,622 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 20:53:07,622 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 991 transitions. [2022-12-13 20:53:07,623 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 141.57142857142858) internal successors, (991), 7 states have internal predecessors, (991), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:53:07,625 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 301.0) internal successors, (2408), 8 states have internal predecessors, (2408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:53:07,625 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 301.0) internal successors, (2408), 8 states have internal predecessors, (2408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:53:07,625 INFO L175 Difference]: Start difference. First operand has 72 places, 72 transitions, 492 flow. Second operand 7 states and 991 transitions. [2022-12-13 20:53:07,625 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 204 transitions, 1742 flow [2022-12-13 20:53:07,775 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 204 transitions, 1703 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-13 20:53:07,776 INFO L231 Difference]: Finished difference. Result has 77 places, 71 transitions, 517 flow [2022-12-13 20:53:07,776 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=301, PETRI_DIFFERENCE_MINUEND_FLOW=476, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=517, PETRI_PLACES=77, PETRI_TRANSITIONS=71} [2022-12-13 20:53:07,777 INFO L288 CegarLoopForPetriNet]: 54 programPoint places, 23 predicate places. [2022-12-13 20:53:07,777 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 71 transitions, 517 flow [2022-12-13 20:53:07,777 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 130.16666666666666) internal successors, (781), 6 states have internal predecessors, (781), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:53:07,777 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 20:53:07,777 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:53:07,777 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 20:53:07,777 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-12-13 20:53:07,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:53:07,778 INFO L85 PathProgramCache]: Analyzing trace with hash -2143797285, now seen corresponding path program 3 times [2022-12-13 20:53:07,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:53:07,778 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419819093] [2022-12-13 20:53:07,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:53:07,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:53:07,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:53:07,935 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 20:53:07,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:53:07,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419819093] [2022-12-13 20:53:07,935 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419819093] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:53:07,935 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:53:07,936 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 20:53:07,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674168445] [2022-12-13 20:53:07,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:53:07,936 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 20:53:07,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:53:07,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 20:53:07,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-13 20:53:07,943 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 301 [2022-12-13 20:53:07,944 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 71 transitions, 517 flow. Second operand has 7 states, 7 states have (on average 134.28571428571428) internal successors, (940), 7 states have internal predecessors, (940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:53:07,944 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 20:53:07,944 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 301 [2022-12-13 20:53:07,944 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 20:53:08,759 INFO L130 PetriNetUnfolder]: 4586/7246 cut-off events. [2022-12-13 20:53:08,759 INFO L131 PetriNetUnfolder]: For 15102/15540 co-relation queries the response was YES. [2022-12-13 20:53:08,776 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28954 conditions, 7246 events. 4586/7246 cut-off events. For 15102/15540 co-relation queries the response was YES. Maximal size of possible extension queue 392. Compared 46503 event pairs, 733 based on Foata normal form. 133/7151 useless extension candidates. Maximal degree in co-relation 28933. Up to 2912 conditions per place. [2022-12-13 20:53:08,784 INFO L137 encePairwiseOnDemand]: 294/301 looper letters, 96 selfloop transitions, 18 changer transitions 24/144 dead transitions. [2022-12-13 20:53:08,784 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 144 transitions, 1150 flow [2022-12-13 20:53:08,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 20:53:08,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 20:53:08,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1000 transitions. [2022-12-13 20:53:08,786 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.47460844803037494 [2022-12-13 20:53:08,786 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1000 transitions. [2022-12-13 20:53:08,786 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1000 transitions. [2022-12-13 20:53:08,787 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 20:53:08,787 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1000 transitions. [2022-12-13 20:53:08,788 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 142.85714285714286) internal successors, (1000), 7 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 20:53:08,789 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 301.0) internal successors, (2408), 8 states have internal predecessors, (2408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:53:08,790 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 301.0) internal successors, (2408), 8 states have internal predecessors, (2408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:53:08,790 INFO L175 Difference]: Start difference. First operand has 77 places, 71 transitions, 517 flow. Second operand 7 states and 1000 transitions. [2022-12-13 20:53:08,790 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 144 transitions, 1150 flow [2022-12-13 20:53:09,027 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 144 transitions, 1086 flow, removed 12 selfloop flow, removed 7 redundant places. [2022-12-13 20:53:09,029 INFO L231 Difference]: Finished difference. Result has 76 places, 60 transitions, 402 flow [2022-12-13 20:53:09,029 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=301, PETRI_DIFFERENCE_MINUEND_FLOW=429, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=402, PETRI_PLACES=76, PETRI_TRANSITIONS=60} [2022-12-13 20:53:09,029 INFO L288 CegarLoopForPetriNet]: 54 programPoint places, 22 predicate places. [2022-12-13 20:53:09,029 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 60 transitions, 402 flow [2022-12-13 20:53:09,029 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 134.28571428571428) internal successors, (940), 7 states have internal predecessors, (940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:53:09,030 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 20:53:09,030 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:53:09,030 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 20:53:09,030 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-12-13 20:53:09,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:53:09,030 INFO L85 PathProgramCache]: Analyzing trace with hash -604818978, now seen corresponding path program 1 times [2022-12-13 20:53:09,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:53:09,030 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958695937] [2022-12-13 20:53:09,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:53:09,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:53:09,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:53:09,176 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 20:53:09,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:53:09,177 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958695937] [2022-12-13 20:53:09,177 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [958695937] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:53:09,177 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:53:09,177 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 20:53:09,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635862511] [2022-12-13 20:53:09,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:53:09,178 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 20:53:09,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:53:09,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 20:53:09,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 20:53:09,199 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 301 [2022-12-13 20:53:09,200 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 60 transitions, 402 flow. Second operand has 6 states, 6 states have (on average 130.83333333333334) internal successors, (785), 6 states have internal predecessors, (785), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:53:09,200 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 20:53:09,201 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 301 [2022-12-13 20:53:09,201 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 20:53:09,920 INFO L130 PetriNetUnfolder]: 4289/6664 cut-off events. [2022-12-13 20:53:09,920 INFO L131 PetriNetUnfolder]: For 16627/16627 co-relation queries the response was YES. [2022-12-13 20:53:09,932 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27302 conditions, 6664 events. 4289/6664 cut-off events. For 16627/16627 co-relation queries the response was YES. Maximal size of possible extension queue 300. Compared 38570 event pairs, 440 based on Foata normal form. 2/6666 useless extension candidates. Maximal degree in co-relation 27283. Up to 3463 conditions per place. [2022-12-13 20:53:09,938 INFO L137 encePairwiseOnDemand]: 293/301 looper letters, 85 selfloop transitions, 5 changer transitions 59/149 dead transitions. [2022-12-13 20:53:09,938 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 149 transitions, 1263 flow [2022-12-13 20:53:09,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 20:53:09,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 20:53:09,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 964 transitions. [2022-12-13 20:53:09,940 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.45752254390128144 [2022-12-13 20:53:09,940 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 964 transitions. [2022-12-13 20:53:09,940 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 964 transitions. [2022-12-13 20:53:09,940 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 20:53:09,941 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 964 transitions. [2022-12-13 20:53:09,942 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 137.71428571428572) internal successors, (964), 7 states have internal predecessors, (964), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:53:09,943 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 301.0) internal successors, (2408), 8 states have internal predecessors, (2408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:53:09,943 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 301.0) internal successors, (2408), 8 states have internal predecessors, (2408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:53:09,944 INFO L175 Difference]: Start difference. First operand has 76 places, 60 transitions, 402 flow. Second operand 7 states and 964 transitions. [2022-12-13 20:53:09,944 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 149 transitions, 1263 flow [2022-12-13 20:53:10,040 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 149 transitions, 1121 flow, removed 37 selfloop flow, removed 8 redundant places. [2022-12-13 20:53:10,041 INFO L231 Difference]: Finished difference. Result has 74 places, 57 transitions, 336 flow [2022-12-13 20:53:10,041 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=301, PETRI_DIFFERENCE_MINUEND_FLOW=337, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=336, PETRI_PLACES=74, PETRI_TRANSITIONS=57} [2022-12-13 20:53:10,042 INFO L288 CegarLoopForPetriNet]: 54 programPoint places, 20 predicate places. [2022-12-13 20:53:10,042 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 57 transitions, 336 flow [2022-12-13 20:53:10,042 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 130.83333333333334) internal successors, (785), 6 states have internal predecessors, (785), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:53:10,042 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 20:53:10,042 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:53:10,042 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-13 20:53:10,043 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-12-13 20:53:10,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:53:10,043 INFO L85 PathProgramCache]: Analyzing trace with hash -1123991984, now seen corresponding path program 2 times [2022-12-13 20:53:10,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:53:10,043 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372018455] [2022-12-13 20:53:10,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:53:10,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:53:10,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:53:10,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:53:10,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:53:10,194 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372018455] [2022-12-13 20:53:10,194 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372018455] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:53:10,194 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:53:10,194 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 20:53:10,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418944828] [2022-12-13 20:53:10,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:53:10,194 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 20:53:10,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:53:10,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 20:53:10,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 20:53:10,206 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 301 [2022-12-13 20:53:10,207 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 57 transitions, 336 flow. Second operand has 5 states, 5 states have (on average 138.4) internal successors, (692), 5 states have internal predecessors, (692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:53:10,207 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 20:53:10,207 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 301 [2022-12-13 20:53:10,207 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 20:53:10,726 INFO L130 PetriNetUnfolder]: 2659/4237 cut-off events. [2022-12-13 20:53:10,726 INFO L131 PetriNetUnfolder]: For 7725/7734 co-relation queries the response was YES. [2022-12-13 20:53:10,734 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15821 conditions, 4237 events. 2659/4237 cut-off events. For 7725/7734 co-relation queries the response was YES. Maximal size of possible extension queue 229. Compared 24059 event pairs, 726 based on Foata normal form. 8/4193 useless extension candidates. Maximal degree in co-relation 15802. Up to 1741 conditions per place. [2022-12-13 20:53:10,737 INFO L137 encePairwiseOnDemand]: 297/301 looper letters, 57 selfloop transitions, 1 changer transitions 59/119 dead transitions. [2022-12-13 20:53:10,737 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 119 transitions, 945 flow [2022-12-13 20:53:10,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 20:53:10,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 20:53:10,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 718 transitions. [2022-12-13 20:53:10,738 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4770764119601329 [2022-12-13 20:53:10,739 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 718 transitions. [2022-12-13 20:53:10,739 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 718 transitions. [2022-12-13 20:53:10,739 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 20:53:10,739 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 718 transitions. [2022-12-13 20:53:10,740 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 143.6) internal successors, (718), 5 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 20:53:10,741 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 301.0) internal successors, (1806), 6 states have internal predecessors, (1806), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:53:10,741 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 301.0) internal successors, (1806), 6 states have internal predecessors, (1806), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:53:10,741 INFO L175 Difference]: Start difference. First operand has 74 places, 57 transitions, 336 flow. Second operand 5 states and 718 transitions. [2022-12-13 20:53:10,741 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 119 transitions, 945 flow [2022-12-13 20:53:10,789 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 119 transitions, 806 flow, removed 17 selfloop flow, removed 10 redundant places. [2022-12-13 20:53:10,790 INFO L231 Difference]: Finished difference. Result has 68 places, 46 transitions, 210 flow [2022-12-13 20:53:10,790 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=301, PETRI_DIFFERENCE_MINUEND_FLOW=273, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=210, PETRI_PLACES=68, PETRI_TRANSITIONS=46} [2022-12-13 20:53:10,790 INFO L288 CegarLoopForPetriNet]: 54 programPoint places, 14 predicate places. [2022-12-13 20:53:10,790 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 46 transitions, 210 flow [2022-12-13 20:53:10,791 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 138.4) internal successors, (692), 5 states have internal predecessors, (692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:53:10,791 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 20:53:10,791 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:53:10,791 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-13 20:53:10,791 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-12-13 20:53:10,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:53:10,791 INFO L85 PathProgramCache]: Analyzing trace with hash 339859124, now seen corresponding path program 3 times [2022-12-13 20:53:10,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:53:10,791 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137530858] [2022-12-13 20:53:10,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:53:10,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:53:10,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:53:11,706 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 20:53:11,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:53:11,706 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137530858] [2022-12-13 20:53:11,706 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137530858] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:53:11,706 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:53:11,707 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 20:53:11,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101053248] [2022-12-13 20:53:11,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:53:11,707 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 20:53:11,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:53:11,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 20:53:11,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-12-13 20:53:11,769 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 301 [2022-12-13 20:53:11,770 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 46 transitions, 210 flow. Second operand has 9 states, 9 states have (on average 129.88888888888889) internal successors, (1169), 9 states have internal predecessors, (1169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:53:11,770 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 20:53:11,770 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 301 [2022-12-13 20:53:11,770 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 20:53:12,438 INFO L130 PetriNetUnfolder]: 1038/1759 cut-off events. [2022-12-13 20:53:12,438 INFO L131 PetriNetUnfolder]: For 1838/1844 co-relation queries the response was YES. [2022-12-13 20:53:12,441 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5676 conditions, 1759 events. 1038/1759 cut-off events. For 1838/1844 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 8716 event pairs, 137 based on Foata normal form. 1/1758 useless extension candidates. Maximal degree in co-relation 5660. Up to 591 conditions per place. [2022-12-13 20:53:12,442 INFO L137 encePairwiseOnDemand]: 291/301 looper letters, 82 selfloop transitions, 7 changer transitions 39/131 dead transitions. [2022-12-13 20:53:12,442 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 131 transitions, 818 flow [2022-12-13 20:53:12,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 20:53:12,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 20:53:12,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1092 transitions. [2022-12-13 20:53:12,444 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.45348837209302323 [2022-12-13 20:53:12,445 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1092 transitions. [2022-12-13 20:53:12,445 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1092 transitions. [2022-12-13 20:53:12,445 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 20:53:12,445 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1092 transitions. [2022-12-13 20:53:12,446 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 136.5) internal successors, (1092), 8 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:53:12,448 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 301.0) internal successors, (2709), 9 states have internal predecessors, (2709), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:53:12,448 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 301.0) internal successors, (2709), 9 states have internal predecessors, (2709), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:53:12,448 INFO L175 Difference]: Start difference. First operand has 68 places, 46 transitions, 210 flow. Second operand 8 states and 1092 transitions. [2022-12-13 20:53:12,448 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 131 transitions, 818 flow [2022-12-13 20:53:12,451 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 131 transitions, 790 flow, removed 6 selfloop flow, removed 8 redundant places. [2022-12-13 20:53:12,452 INFO L231 Difference]: Finished difference. Result has 67 places, 50 transitions, 249 flow [2022-12-13 20:53:12,452 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=301, PETRI_DIFFERENCE_MINUEND_FLOW=194, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=249, PETRI_PLACES=67, PETRI_TRANSITIONS=50} [2022-12-13 20:53:12,452 INFO L288 CegarLoopForPetriNet]: 54 programPoint places, 13 predicate places. [2022-12-13 20:53:12,452 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 50 transitions, 249 flow [2022-12-13 20:53:12,453 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 129.88888888888889) internal successors, (1169), 9 states have internal predecessors, (1169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:53:12,453 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 20:53:12,453 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:53:12,453 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-13 20:53:12,453 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-12-13 20:53:12,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:53:12,453 INFO L85 PathProgramCache]: Analyzing trace with hash -1698292354, now seen corresponding path program 4 times [2022-12-13 20:53:12,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:53:12,453 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051682709] [2022-12-13 20:53:12,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:53:12,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:53:12,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 20:53:12,484 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 20:53:12,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 20:53:12,534 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 20:53:12,534 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 20:53:12,535 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (15 of 16 remaining) [2022-12-13 20:53:12,536 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (14 of 16 remaining) [2022-12-13 20:53:12,536 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2022-12-13 20:53:12,536 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining) [2022-12-13 20:53:12,537 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2022-12-13 20:53:12,537 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2022-12-13 20:53:12,537 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2022-12-13 20:53:12,537 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2022-12-13 20:53:12,537 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2022-12-13 20:53:12,537 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2022-12-13 20:53:12,537 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (5 of 16 remaining) [2022-12-13 20:53:12,537 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 16 remaining) [2022-12-13 20:53:12,537 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 16 remaining) [2022-12-13 20:53:12,537 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 16 remaining) [2022-12-13 20:53:12,538 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 16 remaining) [2022-12-13 20:53:12,538 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2022-12-13 20:53:12,538 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-13 20:53:12,538 INFO L445 BasicCegarLoop]: Path program histogram: [4, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:53:12,542 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 20:53:12,542 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 20:53:12,590 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 08:53:12 BasicIcfg [2022-12-13 20:53:12,590 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 20:53:12,590 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-13 20:53:12,591 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-13 20:53:12,591 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-13 20:53:12,591 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 08:52:45" (3/4) ... [2022-12-13 20:53:12,593 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-12-13 20:53:12,593 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-13 20:53:12,593 INFO L158 Benchmark]: Toolchain (without parser) took 27670.41ms. Allocated memory was 136.3MB in the beginning and 1.8GB in the end (delta: 1.6GB). Free memory was 102.7MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 595.8MB. Max. memory is 16.1GB. [2022-12-13 20:53:12,593 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 136.3MB. Free memory is still 103.4MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 20:53:12,594 INFO L158 Benchmark]: CACSL2BoogieTranslator took 349.97ms. Allocated memory is still 136.3MB. Free memory was 102.7MB in the beginning and 74.3MB in the end (delta: 28.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2022-12-13 20:53:12,594 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.35ms. Allocated memory is still 136.3MB. Free memory was 74.3MB in the beginning and 71.8MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 20:53:12,594 INFO L158 Benchmark]: Boogie Preprocessor took 21.93ms. Allocated memory is still 136.3MB. Free memory was 71.8MB in the beginning and 69.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 20:53:12,594 INFO L158 Benchmark]: RCFGBuilder took 594.09ms. Allocated memory was 136.3MB in the beginning and 176.2MB in the end (delta: 39.8MB). Free memory was 69.7MB in the beginning and 133.1MB in the end (delta: -63.4MB). Peak memory consumption was 37.6MB. Max. memory is 16.1GB. [2022-12-13 20:53:12,594 INFO L158 Benchmark]: TraceAbstraction took 26663.18ms. Allocated memory was 176.2MB in the beginning and 1.8GB in the end (delta: 1.6GB). Free memory was 133.1MB in the beginning and 1.2GB in the end (delta: -1.0GB). Peak memory consumption was 583.4MB. Max. memory is 16.1GB. [2022-12-13 20:53:12,595 INFO L158 Benchmark]: Witness Printer took 2.54ms. Allocated memory is still 1.8GB. Free memory was 1.2GB in the beginning and 1.2GB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 20:53:12,596 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.20ms. Allocated memory is still 136.3MB. Free memory is still 103.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 349.97ms. Allocated memory is still 136.3MB. Free memory was 102.7MB in the beginning and 74.3MB in the end (delta: 28.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.35ms. Allocated memory is still 136.3MB. Free memory was 74.3MB in the beginning and 71.8MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 21.93ms. Allocated memory is still 136.3MB. Free memory was 71.8MB in the beginning and 69.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 594.09ms. Allocated memory was 136.3MB in the beginning and 176.2MB in the end (delta: 39.8MB). Free memory was 69.7MB in the beginning and 133.1MB in the end (delta: -63.4MB). Peak memory consumption was 37.6MB. Max. memory is 16.1GB. * TraceAbstraction took 26663.18ms. Allocated memory was 176.2MB in the beginning and 1.8GB in the end (delta: 1.6GB). Free memory was 133.1MB in the beginning and 1.2GB in the end (delta: -1.0GB). Peak memory consumption was 583.4MB. Max. memory is 16.1GB. * Witness Printer took 2.54ms. Allocated memory is still 1.8GB. Free memory was 1.2GB in the beginning and 1.2GB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.9s, 160 PlacesBefore, 54 PlacesAfterwards, 149 TransitionsBefore, 42 TransitionsAfterwards, 3884 CoEnabledTransitionPairs, 7 FixpointIterations, 59 TrivialSequentialCompositions, 80 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 1 ChoiceCompositions, 148 TotalNumberOfCompositions, 10943 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4283, independent: 4032, independent conditional: 0, independent unconditional: 4032, dependent: 251, dependent conditional: 0, dependent unconditional: 251, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1986, independent: 1939, independent conditional: 0, independent unconditional: 1939, dependent: 47, dependent conditional: 0, dependent unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 4283, independent: 2093, independent conditional: 0, independent unconditional: 2093, dependent: 204, dependent conditional: 0, dependent unconditional: 204, unknown: 1986, unknown conditional: 0, unknown unconditional: 1986] , Statistics on independence cache: Total cache size (in pairs): 166, Positive cache size: 144, Positive conditional cache size: 0, Positive unconditional cache size: 144, Negative cache size: 22, Negative conditional cache size: 0, Negative unconditional cache size: 22, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p1_EAX = 0; [L716] 0 int __unbuffered_p2_EAX = 0; [L718] 0 int __unbuffered_p3_EAX = 0; [L720] 0 int __unbuffered_p3_EBX = 0; [L722] 0 int a = 0; [L724] 0 int b = 0; [L725] 0 _Bool b$flush_delayed; [L726] 0 int b$mem_tmp; [L727] 0 _Bool b$r_buff0_thd0; [L728] 0 _Bool b$r_buff0_thd1; [L729] 0 _Bool b$r_buff0_thd2; [L730] 0 _Bool b$r_buff0_thd3; [L731] 0 _Bool b$r_buff0_thd4; [L732] 0 _Bool b$r_buff1_thd0; [L733] 0 _Bool b$r_buff1_thd1; [L734] 0 _Bool b$r_buff1_thd2; [L735] 0 _Bool b$r_buff1_thd3; [L736] 0 _Bool b$r_buff1_thd4; [L737] 0 _Bool b$read_delayed; [L738] 0 int *b$read_delayed_var; [L739] 0 int b$w_buff0; [L740] 0 _Bool b$w_buff0_used; [L741] 0 int b$w_buff1; [L742] 0 _Bool b$w_buff1_used; [L743] 0 _Bool main$tmp_guard0; [L744] 0 _Bool main$tmp_guard1; [L746] 0 int x = 0; [L748] 0 int y = 0; [L750] 0 int z = 0; [L751] 0 _Bool weak$$choice0; [L752] 0 _Bool weak$$choice2; [L873] 0 pthread_t t937; [L874] FCALL, FORK 0 pthread_create(&t937, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t937, ((void *)0), P0, ((void *)0))=-4, t937={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L875] 0 pthread_t t938; [L876] FCALL, FORK 0 pthread_create(&t938, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t938, ((void *)0), P1, ((void *)0))=-3, t937={5:0}, t938={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L877] 0 pthread_t t939; [L878] FCALL, FORK 0 pthread_create(&t939, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t939, ((void *)0), P2, ((void *)0))=-2, t937={5:0}, t938={6:0}, t939={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L879] 0 pthread_t t940; [L880] FCALL, FORK 0 pthread_create(&t940, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t940, ((void *)0), P3, ((void *)0))=-1, t937={5:0}, t938={6:0}, t939={7:0}, t940={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L756] 1 b$w_buff1 = b$w_buff0 [L757] 1 b$w_buff0 = 1 [L758] 1 b$w_buff1_used = b$w_buff0_used [L759] 1 b$w_buff0_used = (_Bool)1 [L760] CALL 1 __VERIFIER_assert(!(b$w_buff1_used && b$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L760] RET 1 __VERIFIER_assert(!(b$w_buff1_used && b$w_buff0_used)) [L761] 1 b$r_buff1_thd0 = b$r_buff0_thd0 [L762] 1 b$r_buff1_thd1 = b$r_buff0_thd1 [L763] 1 b$r_buff1_thd2 = b$r_buff0_thd2 [L764] 1 b$r_buff1_thd3 = b$r_buff0_thd3 [L765] 1 b$r_buff1_thd4 = b$r_buff0_thd4 [L766] 1 b$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L769] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L786] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L789] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L806] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L809] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L826] 4 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L792] 2 b = b$w_buff0_used && b$r_buff0_thd2 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd2 ? b$w_buff1 : b) [L793] 2 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$w_buff0_used [L794] 2 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$w_buff1_used [L795] 2 b$r_buff0_thd2 = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$r_buff0_thd2 [L796] 2 b$r_buff1_thd2 = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L799] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L801] 2 return 0; [L829] 4 a = 1 [L832] 4 __unbuffered_p3_EAX = a VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L812] 3 b = b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd3 ? b$w_buff1 : b) [L813] 3 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used [L814] 3 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$w_buff1_used [L815] 3 b$r_buff0_thd3 = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$r_buff0_thd3 [L816] 3 b$r_buff1_thd3 = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L835] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L836] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L837] 4 b$flush_delayed = weak$$choice2 [L838] 4 b$mem_tmp = b [L839] 4 b = !b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff1) [L840] 4 b$w_buff0 = weak$$choice2 ? b$w_buff0 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff0)) [L841] 4 b$w_buff1 = weak$$choice2 ? b$w_buff1 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff1 : b$w_buff1)) [L842] 4 b$w_buff0_used = weak$$choice2 ? b$w_buff0_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used)) [L843] 4 b$w_buff1_used = weak$$choice2 ? b$w_buff1_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L844] 4 b$r_buff0_thd4 = weak$$choice2 ? b$r_buff0_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff0_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4)) [L845] 4 b$r_buff1_thd4 = weak$$choice2 ? b$r_buff1_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff1_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L846] 4 __unbuffered_p3_EBX = b [L847] 4 b = b$flush_delayed ? b$mem_tmp : b [L848] 4 b$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=1, z=1] [L851] 4 b = b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd4 ? b$w_buff1 : b) [L852] 4 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used [L853] 4 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$w_buff1_used [L854] 4 b$r_buff0_thd4 = b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4 [L855] 4 b$r_buff1_thd4 = b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$r_buff1_thd4 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=1, z=1] [L772] 1 b = b$w_buff0_used && b$r_buff0_thd1 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd1 ? b$w_buff1 : b) [L773] 1 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$w_buff0_used [L774] 1 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$w_buff1_used [L775] 1 b$r_buff0_thd1 = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$r_buff0_thd1 [L776] 1 b$r_buff1_thd1 = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$r_buff1_thd1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=1, z=1] [L779] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L781] 1 return 0; [L819] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L821] 3 return 0; [L858] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L860] 4 return 0; [L882] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L884] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L884] RET 0 assume_abort_if_not(main$tmp_guard0) [L886] 0 b = b$w_buff0_used && b$r_buff0_thd0 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd0 ? b$w_buff1 : b) [L887] 0 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$w_buff0_used [L888] 0 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$w_buff1_used [L889] 0 b$r_buff0_thd0 = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$r_buff0_thd0 [L890] 0 b$r_buff1_thd0 = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=1, main$tmp_guard1=0, t937={5:0}, t938={6:0}, t939={7:0}, t940={3:0}, weak$$choice0=49, weak$$choice2=255, x=1, y=1, z=1] [L893] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L895] 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}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=1, z=1] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -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: 871]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 876]: 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: 880]: 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: 874]: 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: 878]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 191 locations, 16 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 26.5s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 18.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1395 SdHoareTripleChecker+Valid, 3.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1248 mSDsluCounter, 617 SdHoareTripleChecker+Invalid, 2.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 525 mSDsCounter, 142 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3319 IncrementalHoareTripleChecker+Invalid, 3461 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 142 mSolverCounterUnsat, 92 mSDtfsCounter, 3319 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 95 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=517occurred in iteration=11, InterpolantAutomatonStates: 88, 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, 3.3s InterpolantComputationTime, 306 NumberOfCodeBlocks, 306 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 262 ConstructedInterpolants, 0 QuantifiedInterpolants, 3582 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 20:53:12,614 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00bd5136-fabb-4b46-a8e8-3f3a1eb5b223/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00bd5136-fabb-4b46-a8e8-3f3a1eb5b223/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00bd5136-fabb-4b46-a8e8-3f3a1eb5b223/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_00bd5136-fabb-4b46-a8e8-3f3a1eb5b223/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00bd5136-fabb-4b46-a8e8-3f3a1eb5b223/bin/uautomizer-uyxdKDjOR8/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix036.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00bd5136-fabb-4b46-a8e8-3f3a1eb5b223/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_00bd5136-fabb-4b46-a8e8-3f3a1eb5b223/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 e3d3e405a2d3cb3ab8b02ed87788ef59412b7b81517118cc37c044f334087868 --- 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 20:53:14,240 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 20:53:14,241 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 20:53:14,260 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 20:53:14,260 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 20:53:14,261 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 20:53:14,262 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 20:53:14,264 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 20:53:14,265 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 20:53:14,266 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 20:53:14,267 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 20:53:14,268 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 20:53:14,269 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 20:53:14,270 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 20:53:14,271 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 20:53:14,272 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 20:53:14,272 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 20:53:14,273 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 20:53:14,275 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 20:53:14,276 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 20:53:14,278 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 20:53:14,279 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 20:53:14,280 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 20:53:14,281 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 20:53:14,284 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 20:53:14,284 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 20:53:14,285 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 20:53:14,286 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 20:53:14,286 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 20:53:14,287 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 20:53:14,287 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 20:53:14,288 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 20:53:14,288 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 20:53:14,289 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 20:53:14,295 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 20:53:14,295 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 20:53:14,296 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 20:53:14,296 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 20:53:14,296 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 20:53:14,297 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 20:53:14,298 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 20:53:14,299 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00bd5136-fabb-4b46-a8e8-3f3a1eb5b223/bin/uautomizer-uyxdKDjOR8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-12-13 20:53:14,319 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 20:53:14,319 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 20:53:14,319 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 20:53:14,319 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 20:53:14,320 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 20:53:14,320 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 20:53:14,320 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 20:53:14,321 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 20:53:14,321 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 20:53:14,321 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 20:53:14,321 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 20:53:14,321 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-13 20:53:14,321 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 20:53:14,321 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 20:53:14,321 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 20:53:14,322 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-12-13 20:53:14,322 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-12-13 20:53:14,322 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-12-13 20:53:14,322 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 20:53:14,322 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-12-13 20:53:14,322 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-12-13 20:53:14,322 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-12-13 20:53:14,322 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 20:53:14,323 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 20:53:14,323 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 20:53:14,323 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 20:53:14,323 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 20:53:14,323 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 20:53:14,323 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 20:53:14,323 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 20:53:14,323 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-12-13 20:53:14,324 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-12-13 20:53:14,324 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 20:53:14,324 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 20:53:14,324 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 20:53:14,324 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2022-12-13 20:53:14,324 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 20:53:14,324 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_00bd5136-fabb-4b46-a8e8-3f3a1eb5b223/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_00bd5136-fabb-4b46-a8e8-3f3a1eb5b223/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 -> e3d3e405a2d3cb3ab8b02ed87788ef59412b7b81517118cc37c044f334087868 [2022-12-13 20:53:14,556 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 20:53:14,573 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 20:53:14,575 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 20:53:14,575 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 20:53:14,576 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 20:53:14,577 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00bd5136-fabb-4b46-a8e8-3f3a1eb5b223/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/pthread-wmm/mix036.oepc.i [2022-12-13 20:53:17,172 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 20:53:17,342 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 20:53:17,343 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00bd5136-fabb-4b46-a8e8-3f3a1eb5b223/sv-benchmarks/c/pthread-wmm/mix036.oepc.i [2022-12-13 20:53:17,352 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00bd5136-fabb-4b46-a8e8-3f3a1eb5b223/bin/uautomizer-uyxdKDjOR8/data/3050730d0/86ae2dde93664aa5998c91aaf897036d/FLAG3671d6271 [2022-12-13 20:53:17,363 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00bd5136-fabb-4b46-a8e8-3f3a1eb5b223/bin/uautomizer-uyxdKDjOR8/data/3050730d0/86ae2dde93664aa5998c91aaf897036d [2022-12-13 20:53:17,365 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 20:53:17,366 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 20:53:17,367 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 20:53:17,367 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 20:53:17,370 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 20:53:17,371 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 08:53:17" (1/1) ... [2022-12-13 20:53:17,371 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1cc3f2b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:53:17, skipping insertion in model container [2022-12-13 20:53:17,372 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 08:53:17" (1/1) ... [2022-12-13 20:53:17,377 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 20:53:17,404 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 20:53:17,518 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_00bd5136-fabb-4b46-a8e8-3f3a1eb5b223/sv-benchmarks/c/pthread-wmm/mix036.oepc.i[945,958] [2022-12-13 20:53:17,640 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 20:53:17,642 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 20:53:17,642 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 20:53:17,642 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 20:53:17,642 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 20:53:17,644 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 20:53:17,644 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 20:53:17,645 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 20:53:17,646 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 20:53:17,646 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 20:53:17,646 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 20:53:17,646 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 20:53:17,647 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 20:53:17,648 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 20:53:17,649 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 20:53:17,649 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 20:53:17,650 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 20:53:17,650 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 20:53:17,650 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 20:53:17,650 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 20:53:17,650 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 20:53:17,652 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 20:53:17,652 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 20:53:17,653 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 20:53:17,653 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 20:53:17,654 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 20:53:17,654 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 20:53:17,654 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 20:53:17,654 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 20:53:17,655 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 20:53:17,655 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 20:53:17,662 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 20:53:17,662 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 20:53:17,663 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 20:53:17,664 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 20:53:17,664 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 20:53:17,669 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 20:53:17,669 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 20:53:17,670 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 20:53:17,671 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 20:53:17,672 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 20:53:17,672 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 20:53:17,673 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 20:53:17,684 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 20:53:17,693 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_00bd5136-fabb-4b46-a8e8-3f3a1eb5b223/sv-benchmarks/c/pthread-wmm/mix036.oepc.i[945,958] [2022-12-13 20:53:17,708 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 20:53:17,709 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 20:53:17,709 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 20:53:17,710 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 20:53:17,716 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 20:53:17,717 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 20:53:17,718 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 20:53:17,718 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 20:53:17,718 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 20:53:17,718 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 20:53:17,719 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 20:53:17,719 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 20:53:17,719 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 20:53:17,720 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 20:53:17,720 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 20:53:17,720 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 20:53:17,721 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 20:53:17,721 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 20:53:17,721 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 20:53:17,721 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 20:53:17,721 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 20:53:17,722 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 20:53:17,723 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 20:53:17,723 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 20:53:17,723 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 20:53:17,723 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 20:53:17,724 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 20:53:17,724 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 20:53:17,724 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 20:53:17,724 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 20:53:17,724 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 20:53:17,727 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 20:53:17,727 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 20:53:17,728 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 20:53:17,728 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 20:53:17,728 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 20:53:17,731 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 20:53:17,731 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 20:53:17,731 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 20:53:17,732 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 20:53:17,733 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 20:53:17,733 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 20:53:17,734 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 20:53:17,756 INFO L208 MainTranslator]: Completed translation [2022-12-13 20:53:17,757 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:53:17 WrapperNode [2022-12-13 20:53:17,757 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 20:53:17,757 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 20:53:17,757 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 20:53:17,758 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 20:53:17,763 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:53:17" (1/1) ... [2022-12-13 20:53:17,776 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:53:17" (1/1) ... [2022-12-13 20:53:17,792 INFO L138 Inliner]: procedures = 180, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 148 [2022-12-13 20:53:17,792 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 20:53:17,793 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 20:53:17,793 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 20:53:17,793 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 20:53:17,800 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:53:17" (1/1) ... [2022-12-13 20:53:17,800 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:53:17" (1/1) ... [2022-12-13 20:53:17,802 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:53:17" (1/1) ... [2022-12-13 20:53:17,802 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:53:17" (1/1) ... [2022-12-13 20:53:17,808 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:53:17" (1/1) ... [2022-12-13 20:53:17,809 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:53:17" (1/1) ... [2022-12-13 20:53:17,811 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:53:17" (1/1) ... [2022-12-13 20:53:17,812 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:53:17" (1/1) ... [2022-12-13 20:53:17,815 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 20:53:17,815 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 20:53:17,815 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 20:53:17,815 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 20:53:17,816 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:53:17" (1/1) ... [2022-12-13 20:53:17,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 20:53:17,829 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00bd5136-fabb-4b46-a8e8-3f3a1eb5b223/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 20:53:17,838 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00bd5136-fabb-4b46-a8e8-3f3a1eb5b223/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 20:53:17,841 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00bd5136-fabb-4b46-a8e8-3f3a1eb5b223/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 20:53:17,869 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 20:53:17,869 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 20:53:17,869 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 20:53:17,869 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 20:53:17,869 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-12-13 20:53:17,869 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-12-13 20:53:17,869 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 20:53:17,870 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 20:53:17,870 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 20:53:17,870 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 20:53:17,870 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-13 20:53:17,870 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-13 20:53:17,870 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-12-13 20:53:17,870 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-12-13 20:53:17,870 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 20:53:17,870 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 20:53:17,870 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 20:53:17,872 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 20:53:17,990 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 20:53:17,992 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 20:53:18,301 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 20:53:18,395 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 20:53:18,396 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 20:53:18,398 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 08:53:18 BoogieIcfgContainer [2022-12-13 20:53:18,398 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 20:53:18,400 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 20:53:18,400 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 20:53:18,404 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 20:53:18,404 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 08:53:17" (1/3) ... [2022-12-13 20:53:18,405 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17405cc1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 08:53:18, skipping insertion in model container [2022-12-13 20:53:18,405 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:53:17" (2/3) ... [2022-12-13 20:53:18,405 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17405cc1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 08:53:18, skipping insertion in model container [2022-12-13 20:53:18,405 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 08:53:18" (3/3) ... [2022-12-13 20:53:18,407 INFO L112 eAbstractionObserver]: Analyzing ICFG mix036.oepc.i [2022-12-13 20:53:18,424 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 20:53:18,425 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2022-12-13 20:53:18,425 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 20:53:18,490 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 20:53:18,526 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 165 places, 154 transitions, 328 flow [2022-12-13 20:53:18,582 INFO L130 PetriNetUnfolder]: 2/150 cut-off events. [2022-12-13 20:53:18,582 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 20:53:18,588 INFO L83 FinitePrefix]: Finished finitePrefix Result has 163 conditions, 150 events. 2/150 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 109 event pairs, 0 based on Foata normal form. 0/137 useless extension candidates. Maximal degree in co-relation 102. Up to 2 conditions per place. [2022-12-13 20:53:18,588 INFO L82 GeneralOperation]: Start removeDead. Operand has 165 places, 154 transitions, 328 flow [2022-12-13 20:53:18,593 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 161 places, 150 transitions, 312 flow [2022-12-13 20:53:18,596 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-12-13 20:53:18,607 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 161 places, 150 transitions, 312 flow [2022-12-13 20:53:18,610 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 161 places, 150 transitions, 312 flow [2022-12-13 20:53:18,610 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 161 places, 150 transitions, 312 flow [2022-12-13 20:53:18,644 INFO L130 PetriNetUnfolder]: 2/150 cut-off events. [2022-12-13 20:53:18,644 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 20:53:18,645 INFO L83 FinitePrefix]: Finished finitePrefix Result has 163 conditions, 150 events. 2/150 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 109 event pairs, 0 based on Foata normal form. 0/137 useless extension candidates. Maximal degree in co-relation 102. Up to 2 conditions per place. [2022-12-13 20:53:18,648 INFO L119 LiptonReduction]: Number of co-enabled transitions 3884 [2022-12-13 20:53:26,090 INFO L134 LiptonReduction]: Checked pairs total: 11700 [2022-12-13 20:53:26,090 INFO L136 LiptonReduction]: Total number of compositions: 149 [2022-12-13 20:53:26,104 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 20:53:26,109 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;@23408335, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 20:53:26,110 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2022-12-13 20:53:26,111 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2022-12-13 20:53:26,111 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 20:53:26,111 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 20:53:26,112 INFO L209 CegarLoopForPetriNet]: trace histogram [1] [2022-12-13 20:53:26,112 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-12-13 20:53:26,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:53:26,116 INFO L85 PathProgramCache]: Analyzing trace with hash 644, now seen corresponding path program 1 times [2022-12-13 20:53:26,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 20:53:26,126 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [364617506] [2022-12-13 20:53:26,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:53:26,126 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 20:53:26,126 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00bd5136-fabb-4b46-a8e8-3f3a1eb5b223/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 20:53:26,127 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00bd5136-fabb-4b46-a8e8-3f3a1eb5b223/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 20:53:26,128 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00bd5136-fabb-4b46-a8e8-3f3a1eb5b223/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 20:53:26,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:53:26,180 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2022-12-13 20:53:26,182 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 20:53:26,185 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 20:53:26,186 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 20:53:26,186 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 20:53:26,186 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [364617506] [2022-12-13 20:53:26,186 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [364617506] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:53:26,187 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:53:26,187 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-12-13 20:53:26,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268537092] [2022-12-13 20:53:26,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:53:26,193 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-13 20:53:26,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 20:53:26,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-13 20:53:26,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-13 20:53:26,210 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 139 out of 303 [2022-12-13 20:53:26,212 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 41 transitions, 94 flow. Second operand has 2 states, 2 states have (on average 139.5) internal successors, (279), 2 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:53:26,212 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 20:53:26,212 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 139 of 303 [2022-12-13 20:53:26,213 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 20:53:27,823 INFO L130 PetriNetUnfolder]: 10487/14078 cut-off events. [2022-12-13 20:53:27,823 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 20:53:27,851 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28354 conditions, 14078 events. 10487/14078 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 614. Compared 72073 event pairs, 10487 based on Foata normal form. 0/12378 useless extension candidates. Maximal degree in co-relation 28342. Up to 14059 conditions per place. [2022-12-13 20:53:27,896 INFO L137 encePairwiseOnDemand]: 294/303 looper letters, 29 selfloop transitions, 0 changer transitions 0/32 dead transitions. [2022-12-13 20:53:27,896 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 32 transitions, 134 flow [2022-12-13 20:53:27,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 20:53:27,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-12-13 20:53:27,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 316 transitions. [2022-12-13 20:53:27,907 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5214521452145214 [2022-12-13 20:53:27,907 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 316 transitions. [2022-12-13 20:53:27,908 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 316 transitions. [2022-12-13 20:53:27,909 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 20:53:27,911 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 316 transitions. [2022-12-13 20:53:27,914 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 158.0) internal successors, (316), 2 states have internal predecessors, (316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:53:27,918 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 303.0) internal successors, (909), 3 states have internal predecessors, (909), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:53:27,919 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 303.0) internal successors, (909), 3 states have internal predecessors, (909), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:53:27,920 INFO L175 Difference]: Start difference. First operand has 53 places, 41 transitions, 94 flow. Second operand 2 states and 316 transitions. [2022-12-13 20:53:27,921 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 32 transitions, 134 flow [2022-12-13 20:53:27,926 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 32 transitions, 130 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-13 20:53:27,927 INFO L231 Difference]: Finished difference. Result has 42 places, 32 transitions, 72 flow [2022-12-13 20:53:27,929 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=72, PETRI_PLACES=42, PETRI_TRANSITIONS=32} [2022-12-13 20:53:27,932 INFO L288 CegarLoopForPetriNet]: 53 programPoint places, -11 predicate places. [2022-12-13 20:53:27,932 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 32 transitions, 72 flow [2022-12-13 20:53:27,933 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 139.5) internal successors, (279), 2 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:53:27,933 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 20:53:27,933 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-12-13 20:53:27,945 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00bd5136-fabb-4b46-a8e8-3f3a1eb5b223/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 20:53:28,134 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00bd5136-fabb-4b46-a8e8-3f3a1eb5b223/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 20:53:28,135 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-12-13 20:53:28,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:53:28,137 INFO L85 PathProgramCache]: Analyzing trace with hash 632788, now seen corresponding path program 1 times [2022-12-13 20:53:28,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 20:53:28,139 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1802130082] [2022-12-13 20:53:28,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:53:28,140 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 20:53:28,141 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00bd5136-fabb-4b46-a8e8-3f3a1eb5b223/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 20:53:28,143 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00bd5136-fabb-4b46-a8e8-3f3a1eb5b223/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 20:53:28,146 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00bd5136-fabb-4b46-a8e8-3f3a1eb5b223/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 20:53:28,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:53:28,333 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-13 20:53:28,334 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 20:53:28,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 20:53:28,357 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 20:53:28,358 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 20:53:28,358 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1802130082] [2022-12-13 20:53:28,358 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1802130082] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:53:28,358 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:53:28,358 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 20:53:28,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832813186] [2022-12-13 20:53:28,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:53:28,360 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 20:53:28,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 20:53:28,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 20:53:28,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 20:53:28,366 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 303 [2022-12-13 20:53:28,367 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 32 transitions, 72 flow. Second operand has 3 states, 3 states have (on average 139.0) internal successors, (417), 3 states have internal predecessors, (417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:53:28,367 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 20:53:28,367 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 303 [2022-12-13 20:53:28,367 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 20:53:29,448 INFO L130 PetriNetUnfolder]: 8247/11290 cut-off events. [2022-12-13 20:53:29,448 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 20:53:29,459 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22567 conditions, 11290 events. 8247/11290 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 499. Compared 58677 event pairs, 3119 based on Foata normal form. 0/10517 useless extension candidates. Maximal degree in co-relation 22564. Up to 8863 conditions per place. [2022-12-13 20:53:29,484 INFO L137 encePairwiseOnDemand]: 300/303 looper letters, 47 selfloop transitions, 2 changer transitions 2/54 dead transitions. [2022-12-13 20:53:29,484 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 54 transitions, 224 flow [2022-12-13 20:53:29,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 20:53:29,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 20:53:29,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 466 transitions. [2022-12-13 20:53:29,487 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5126512651265126 [2022-12-13 20:53:29,487 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 466 transitions. [2022-12-13 20:53:29,487 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 466 transitions. [2022-12-13 20:53:29,487 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 20:53:29,487 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 466 transitions. [2022-12-13 20:53:29,488 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 155.33333333333334) internal successors, (466), 3 states have internal predecessors, (466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:53:29,490 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 303.0) internal successors, (1212), 4 states have internal predecessors, (1212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:53:29,490 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 303.0) internal successors, (1212), 4 states have internal predecessors, (1212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:53:29,490 INFO L175 Difference]: Start difference. First operand has 42 places, 32 transitions, 72 flow. Second operand 3 states and 466 transitions. [2022-12-13 20:53:29,490 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 54 transitions, 224 flow [2022-12-13 20:53:29,491 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 54 transitions, 224 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-13 20:53:29,491 INFO L231 Difference]: Finished difference. Result has 43 places, 30 transitions, 72 flow [2022-12-13 20:53:29,491 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=72, PETRI_PLACES=43, PETRI_TRANSITIONS=30} [2022-12-13 20:53:29,492 INFO L288 CegarLoopForPetriNet]: 53 programPoint places, -10 predicate places. [2022-12-13 20:53:29,492 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 30 transitions, 72 flow [2022-12-13 20:53:29,492 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 139.0) internal successors, (417), 3 states have internal predecessors, (417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:53:29,492 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 20:53:29,492 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:53:29,499 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00bd5136-fabb-4b46-a8e8-3f3a1eb5b223/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 20:53:29,693 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00bd5136-fabb-4b46-a8e8-3f3a1eb5b223/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 20:53:29,694 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-12-13 20:53:29,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:53:29,696 INFO L85 PathProgramCache]: Analyzing trace with hash -888171236, now seen corresponding path program 1 times [2022-12-13 20:53:29,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 20:53:29,698 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [304112783] [2022-12-13 20:53:29,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:53:29,698 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 20:53:29,699 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00bd5136-fabb-4b46-a8e8-3f3a1eb5b223/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 20:53:29,700 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00bd5136-fabb-4b46-a8e8-3f3a1eb5b223/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 20:53:29,701 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00bd5136-fabb-4b46-a8e8-3f3a1eb5b223/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 20:53:29,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:53:29,785 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-13 20:53:29,785 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 20:53:29,823 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 20:53:29,823 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 20:53:29,823 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 20:53:29,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [304112783] [2022-12-13 20:53:29,823 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [304112783] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:53:29,823 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:53:29,823 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 20:53:29,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971502401] [2022-12-13 20:53:29,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:53:29,824 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 20:53:29,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 20:53:29,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 20:53:29,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 20:53:29,842 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 303 [2022-12-13 20:53:29,843 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 30 transitions, 72 flow. Second operand has 4 states, 4 states have (on average 134.75) internal successors, (539), 4 states have internal predecessors, (539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:53:29,843 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 20:53:29,843 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 303 [2022-12-13 20:53:29,843 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 20:53:30,542 INFO L130 PetriNetUnfolder]: 5298/7493 cut-off events. [2022-12-13 20:53:30,542 INFO L131 PetriNetUnfolder]: For 488/488 co-relation queries the response was YES. [2022-12-13 20:53:30,551 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15637 conditions, 7493 events. 5298/7493 cut-off events. For 488/488 co-relation queries the response was YES. Maximal size of possible extension queue 376. Compared 40775 event pairs, 792 based on Foata normal form. 384/7614 useless extension candidates. Maximal degree in co-relation 15633. Up to 4466 conditions per place. [2022-12-13 20:53:30,571 INFO L137 encePairwiseOnDemand]: 296/303 looper letters, 55 selfloop transitions, 6 changer transitions 1/65 dead transitions. [2022-12-13 20:53:30,571 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 65 transitions, 276 flow [2022-12-13 20:53:30,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 20:53:30,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 20:53:30,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 592 transitions. [2022-12-13 20:53:30,573 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4884488448844885 [2022-12-13 20:53:30,574 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 592 transitions. [2022-12-13 20:53:30,574 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 592 transitions. [2022-12-13 20:53:30,574 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 20:53:30,574 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 592 transitions. [2022-12-13 20:53:30,576 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 148.0) internal successors, (592), 4 states have internal predecessors, (592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:53:30,579 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 303.0) internal successors, (1515), 5 states have internal predecessors, (1515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:53:30,580 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 303.0) internal successors, (1515), 5 states have internal predecessors, (1515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:53:30,580 INFO L175 Difference]: Start difference. First operand has 43 places, 30 transitions, 72 flow. Second operand 4 states and 592 transitions. [2022-12-13 20:53:30,580 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 65 transitions, 276 flow [2022-12-13 20:53:30,581 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 65 transitions, 268 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 20:53:30,581 INFO L231 Difference]: Finished difference. Result has 45 places, 34 transitions, 110 flow [2022-12-13 20:53:30,582 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=110, PETRI_PLACES=45, PETRI_TRANSITIONS=34} [2022-12-13 20:53:30,582 INFO L288 CegarLoopForPetriNet]: 53 programPoint places, -8 predicate places. [2022-12-13 20:53:30,582 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 34 transitions, 110 flow [2022-12-13 20:53:30,583 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 134.75) internal successors, (539), 4 states have internal predecessors, (539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:53:30,583 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 20:53:30,583 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:53:30,590 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00bd5136-fabb-4b46-a8e8-3f3a1eb5b223/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 20:53:30,784 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00bd5136-fabb-4b46-a8e8-3f3a1eb5b223/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 20:53:30,784 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-12-13 20:53:30,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:53:30,785 INFO L85 PathProgramCache]: Analyzing trace with hash -1170081346, now seen corresponding path program 1 times [2022-12-13 20:53:30,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 20:53:30,785 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [25706505] [2022-12-13 20:53:30,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:53:30,785 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 20:53:30,785 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00bd5136-fabb-4b46-a8e8-3f3a1eb5b223/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 20:53:30,786 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00bd5136-fabb-4b46-a8e8-3f3a1eb5b223/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 20:53:30,787 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00bd5136-fabb-4b46-a8e8-3f3a1eb5b223/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 20:53:30,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:53:30,899 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 20:53:30,900 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 20:53:30,940 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 20:53:30,940 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 20:53:30,940 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 20:53:30,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [25706505] [2022-12-13 20:53:30,940 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [25706505] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:53:30,940 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:53:30,941 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 20:53:30,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717352601] [2022-12-13 20:53:30,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:53:30,941 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 20:53:30,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 20:53:30,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 20:53:30,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 20:53:30,957 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 303 [2022-12-13 20:53:30,958 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 34 transitions, 110 flow. Second operand has 5 states, 5 states have (on average 134.8) internal successors, (674), 5 states have internal predecessors, (674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:53:30,958 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 20:53:30,958 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 303 [2022-12-13 20:53:30,958 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 20:53:31,415 INFO L130 PetriNetUnfolder]: 2490/3740 cut-off events. [2022-12-13 20:53:31,415 INFO L131 PetriNetUnfolder]: For 1112/1112 co-relation queries the response was YES. [2022-12-13 20:53:31,419 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9432 conditions, 3740 events. 2490/3740 cut-off events. For 1112/1112 co-relation queries the response was YES. Maximal size of possible extension queue 159. Compared 19607 event pairs, 382 based on Foata normal form. 249/3888 useless extension candidates. Maximal degree in co-relation 9426. Up to 1226 conditions per place. [2022-12-13 20:53:31,425 INFO L137 encePairwiseOnDemand]: 296/303 looper letters, 69 selfloop transitions, 10 changer transitions 1/83 dead transitions. [2022-12-13 20:53:31,425 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 83 transitions, 397 flow [2022-12-13 20:53:31,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 20:53:31,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 20:53:31,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 742 transitions. [2022-12-13 20:53:31,427 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4897689768976898 [2022-12-13 20:53:31,427 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 742 transitions. [2022-12-13 20:53:31,427 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 742 transitions. [2022-12-13 20:53:31,427 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 20:53:31,427 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 742 transitions. [2022-12-13 20:53:31,428 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 148.4) internal successors, (742), 5 states have internal predecessors, (742), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:53:31,430 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 303.0) internal successors, (1818), 6 states have internal predecessors, (1818), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:53:31,431 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 303.0) internal successors, (1818), 6 states have internal predecessors, (1818), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:53:31,431 INFO L175 Difference]: Start difference. First operand has 45 places, 34 transitions, 110 flow. Second operand 5 states and 742 transitions. [2022-12-13 20:53:31,431 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 83 transitions, 397 flow [2022-12-13 20:53:31,433 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 83 transitions, 386 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-12-13 20:53:31,434 INFO L231 Difference]: Finished difference. Result has 49 places, 38 transitions, 162 flow [2022-12-13 20:53:31,434 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=101, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=162, PETRI_PLACES=49, PETRI_TRANSITIONS=38} [2022-12-13 20:53:31,435 INFO L288 CegarLoopForPetriNet]: 53 programPoint places, -4 predicate places. [2022-12-13 20:53:31,435 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 38 transitions, 162 flow [2022-12-13 20:53:31,436 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 134.8) internal successors, (674), 5 states have internal predecessors, (674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:53:31,436 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 20:53:31,436 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 20:53:31,444 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00bd5136-fabb-4b46-a8e8-3f3a1eb5b223/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)] Forceful destruction successful, exit code 0 [2022-12-13 20:53:31,636 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00bd5136-fabb-4b46-a8e8-3f3a1eb5b223/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 20:53:31,637 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-12-13 20:53:31,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:53:31,637 INFO L85 PathProgramCache]: Analyzing trace with hash -1130068913, now seen corresponding path program 1 times [2022-12-13 20:53:31,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 20:53:31,638 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1498880523] [2022-12-13 20:53:31,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:53:31,638 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 20:53:31,638 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00bd5136-fabb-4b46-a8e8-3f3a1eb5b223/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 20:53:31,639 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00bd5136-fabb-4b46-a8e8-3f3a1eb5b223/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 20:53:31,640 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00bd5136-fabb-4b46-a8e8-3f3a1eb5b223/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 20:53:31,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:53:31,715 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-13 20:53:31,717 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 20:53:31,756 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 20:53:31,756 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 20:53:31,756 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 20:53:31,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1498880523] [2022-12-13 20:53:31,756 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1498880523] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:53:31,756 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:53:31,756 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 20:53:31,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643586287] [2022-12-13 20:53:31,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:53:31,757 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 20:53:31,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 20:53:31,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 20:53:31,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 20:53:31,768 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 303 [2022-12-13 20:53:31,769 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 38 transitions, 162 flow. Second operand has 6 states, 6 states have (on average 134.83333333333334) internal successors, (809), 6 states have internal predecessors, (809), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:53:31,769 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 20:53:31,769 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 303 [2022-12-13 20:53:31,769 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 20:53:32,158 INFO L130 PetriNetUnfolder]: 1356/2084 cut-off events. [2022-12-13 20:53:32,159 INFO L131 PetriNetUnfolder]: For 1837/1837 co-relation queries the response was YES. [2022-12-13 20:53:32,161 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6031 conditions, 2084 events. 1356/2084 cut-off events. For 1837/1837 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 10116 event pairs, 380 based on Foata normal form. 87/2142 useless extension candidates. Maximal degree in co-relation 6024. Up to 720 conditions per place. [2022-12-13 20:53:32,165 INFO L137 encePairwiseOnDemand]: 296/303 looper letters, 81 selfloop transitions, 14 changer transitions 1/99 dead transitions. [2022-12-13 20:53:32,165 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 99 transitions, 524 flow [2022-12-13 20:53:32,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 20:53:32,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 20:53:32,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 890 transitions. [2022-12-13 20:53:32,167 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.48954895489548955 [2022-12-13 20:53:32,167 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 890 transitions. [2022-12-13 20:53:32,167 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 890 transitions. [2022-12-13 20:53:32,168 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 20:53:32,168 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 890 transitions. [2022-12-13 20:53:32,169 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 148.33333333333334) internal successors, (890), 6 states have internal predecessors, (890), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:53:32,171 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 303.0) internal successors, (2121), 7 states have internal predecessors, (2121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:53:32,172 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 303.0) internal successors, (2121), 7 states have internal predecessors, (2121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:53:32,172 INFO L175 Difference]: Start difference. First operand has 49 places, 38 transitions, 162 flow. Second operand 6 states and 890 transitions. [2022-12-13 20:53:32,172 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 99 transitions, 524 flow [2022-12-13 20:53:32,182 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 99 transitions, 494 flow, removed 5 selfloop flow, removed 4 redundant places. [2022-12-13 20:53:32,183 INFO L231 Difference]: Finished difference. Result has 52 places, 42 transitions, 212 flow [2022-12-13 20:53:32,183 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=135, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=212, PETRI_PLACES=52, PETRI_TRANSITIONS=42} [2022-12-13 20:53:32,183 INFO L288 CegarLoopForPetriNet]: 53 programPoint places, -1 predicate places. [2022-12-13 20:53:32,183 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 42 transitions, 212 flow [2022-12-13 20:53:32,184 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 134.83333333333334) internal successors, (809), 6 states have internal predecessors, (809), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:53:32,184 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 20:53:32,184 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 20:53:32,196 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00bd5136-fabb-4b46-a8e8-3f3a1eb5b223/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 20:53:32,384 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00bd5136-fabb-4b46-a8e8-3f3a1eb5b223/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 20:53:32,385 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-12-13 20:53:32,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:53:32,385 INFO L85 PathProgramCache]: Analyzing trace with hash 11895373, now seen corresponding path program 1 times [2022-12-13 20:53:32,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 20:53:32,385 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [657047798] [2022-12-13 20:53:32,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:53:32,385 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 20:53:32,386 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00bd5136-fabb-4b46-a8e8-3f3a1eb5b223/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 20:53:32,386 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00bd5136-fabb-4b46-a8e8-3f3a1eb5b223/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 20:53:32,387 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00bd5136-fabb-4b46-a8e8-3f3a1eb5b223/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 20:53:32,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:53:32,470 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-13 20:53:32,471 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 20:53:32,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 20:53:32,514 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 20:53:32,514 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 20:53:32,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [657047798] [2022-12-13 20:53:32,514 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [657047798] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:53:32,514 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:53:32,514 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 20:53:32,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428056918] [2022-12-13 20:53:32,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:53:32,515 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 20:53:32,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 20:53:32,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 20:53:32,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 20:53:32,530 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 303 [2022-12-13 20:53:32,530 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 42 transitions, 212 flow. Second operand has 7 states, 7 states have (on average 134.85714285714286) internal successors, (944), 7 states have internal predecessors, (944), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:53:32,530 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 20:53:32,530 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 303 [2022-12-13 20:53:32,530 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 20:53:32,956 INFO L130 PetriNetUnfolder]: 1156/1742 cut-off events. [2022-12-13 20:53:32,956 INFO L131 PetriNetUnfolder]: For 1675/1675 co-relation queries the response was YES. [2022-12-13 20:53:32,958 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5143 conditions, 1742 events. 1156/1742 cut-off events. For 1675/1675 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 8239 event pairs, 380 based on Foata normal form. 15/1742 useless extension candidates. Maximal degree in co-relation 5135. Up to 720 conditions per place. [2022-12-13 20:53:32,962 INFO L137 encePairwiseOnDemand]: 296/303 looper letters, 63 selfloop transitions, 18 changer transitions 1/85 dead transitions. [2022-12-13 20:53:32,962 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 85 transitions, 478 flow [2022-12-13 20:53:32,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 20:53:32,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 20:53:32,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1008 transitions. [2022-12-13 20:53:32,966 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4752475247524752 [2022-12-13 20:53:32,966 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1008 transitions. [2022-12-13 20:53:32,966 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1008 transitions. [2022-12-13 20:53:32,967 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 20:53:32,967 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1008 transitions. [2022-12-13 20:53:32,970 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 144.0) internal successors, (1008), 7 states have internal predecessors, (1008), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:53:32,973 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 303.0) internal successors, (2424), 8 states have internal predecessors, (2424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:53:32,974 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 303.0) internal successors, (2424), 8 states have internal predecessors, (2424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:53:32,974 INFO L175 Difference]: Start difference. First operand has 52 places, 42 transitions, 212 flow. Second operand 7 states and 1008 transitions. [2022-12-13 20:53:32,974 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 85 transitions, 478 flow [2022-12-13 20:53:32,989 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 85 transitions, 432 flow, removed 9 selfloop flow, removed 5 redundant places. [2022-12-13 20:53:32,990 INFO L231 Difference]: Finished difference. Result has 55 places, 42 transitions, 222 flow [2022-12-13 20:53:32,991 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=169, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=222, PETRI_PLACES=55, PETRI_TRANSITIONS=42} [2022-12-13 20:53:32,991 INFO L288 CegarLoopForPetriNet]: 53 programPoint places, 2 predicate places. [2022-12-13 20:53:32,991 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 42 transitions, 222 flow [2022-12-13 20:53:32,992 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 134.85714285714286) internal successors, (944), 7 states have internal predecessors, (944), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:53:32,992 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 20:53:32,992 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:53:33,000 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00bd5136-fabb-4b46-a8e8-3f3a1eb5b223/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)] Forceful destruction successful, exit code 0 [2022-12-13 20:53:33,193 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00bd5136-fabb-4b46-a8e8-3f3a1eb5b223/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 20:53:33,194 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-12-13 20:53:33,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:53:33,195 INFO L85 PathProgramCache]: Analyzing trace with hash -1531967176, now seen corresponding path program 1 times [2022-12-13 20:53:33,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 20:53:33,197 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1118908184] [2022-12-13 20:53:33,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:53:33,198 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 20:53:33,199 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00bd5136-fabb-4b46-a8e8-3f3a1eb5b223/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 20:53:33,201 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00bd5136-fabb-4b46-a8e8-3f3a1eb5b223/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 20:53:33,205 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00bd5136-fabb-4b46-a8e8-3f3a1eb5b223/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 20:53:33,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:53:33,410 INFO L263 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 17 conjunts are in the unsatisfiable core [2022-12-13 20:53:33,413 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 20:53:33,751 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 20:53:33,752 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 20:53:33,752 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 20:53:33,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1118908184] [2022-12-13 20:53:33,752 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1118908184] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:53:33,752 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:53:33,752 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 20:53:33,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632146605] [2022-12-13 20:53:33,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:53:33,753 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 20:53:33,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 20:53:33,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 20:53:33,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-12-13 20:53:33,822 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 303 [2022-12-13 20:53:33,823 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 42 transitions, 222 flow. Second operand has 8 states, 8 states have (on average 136.125) internal successors, (1089), 8 states have internal predecessors, (1089), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:53:33,823 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 20:53:33,823 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 303 [2022-12-13 20:53:33,823 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 20:53:34,372 INFO L130 PetriNetUnfolder]: 1303/2103 cut-off events. [2022-12-13 20:53:34,372 INFO L131 PetriNetUnfolder]: For 2365/2365 co-relation queries the response was YES. [2022-12-13 20:53:34,376 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6057 conditions, 2103 events. 1303/2103 cut-off events. For 2365/2365 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 11436 event pairs, 168 based on Foata normal form. 0/2097 useless extension candidates. Maximal degree in co-relation 6048. Up to 885 conditions per place. [2022-12-13 20:53:34,384 INFO L137 encePairwiseOnDemand]: 297/303 looper letters, 104 selfloop transitions, 6 changer transitions 0/113 dead transitions. [2022-12-13 20:53:34,384 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 113 transitions, 830 flow [2022-12-13 20:53:34,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 20:53:34,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 20:53:34,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1006 transitions. [2022-12-13 20:53:34,388 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4743045733144743 [2022-12-13 20:53:34,388 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1006 transitions. [2022-12-13 20:53:34,388 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1006 transitions. [2022-12-13 20:53:34,389 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 20:53:34,389 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1006 transitions. [2022-12-13 20:53:34,391 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 143.71428571428572) internal successors, (1006), 7 states have internal predecessors, (1006), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:53:34,395 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 303.0) internal successors, (2424), 8 states have internal predecessors, (2424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:53:34,395 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 303.0) internal successors, (2424), 8 states have internal predecessors, (2424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:53:34,395 INFO L175 Difference]: Start difference. First operand has 55 places, 42 transitions, 222 flow. Second operand 7 states and 1006 transitions. [2022-12-13 20:53:34,396 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 113 transitions, 830 flow [2022-12-13 20:53:34,409 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 113 transitions, 564 flow, removed 34 selfloop flow, removed 11 redundant places. [2022-12-13 20:53:34,410 INFO L231 Difference]: Finished difference. Result has 52 places, 44 transitions, 148 flow [2022-12-13 20:53:34,411 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=148, PETRI_PLACES=52, PETRI_TRANSITIONS=44} [2022-12-13 20:53:34,411 INFO L288 CegarLoopForPetriNet]: 53 programPoint places, -1 predicate places. [2022-12-13 20:53:34,412 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 44 transitions, 148 flow [2022-12-13 20:53:34,412 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 136.125) internal successors, (1089), 8 states have internal predecessors, (1089), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:53:34,412 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 20:53:34,412 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:53:34,420 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00bd5136-fabb-4b46-a8e8-3f3a1eb5b223/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 20:53:34,613 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00bd5136-fabb-4b46-a8e8-3f3a1eb5b223/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 20:53:34,614 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-12-13 20:53:34,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:53:34,614 INFO L85 PathProgramCache]: Analyzing trace with hash -1605166274, now seen corresponding path program 2 times [2022-12-13 20:53:34,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 20:53:34,615 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [811894497] [2022-12-13 20:53:34,616 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 20:53:34,616 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 20:53:34,616 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00bd5136-fabb-4b46-a8e8-3f3a1eb5b223/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 20:53:34,618 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00bd5136-fabb-4b46-a8e8-3f3a1eb5b223/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 20:53:34,619 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00bd5136-fabb-4b46-a8e8-3f3a1eb5b223/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 20:53:34,723 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-12-13 20:53:34,723 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 20:53:34,728 INFO L263 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 20:53:34,730 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 20:53:34,762 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 20:53:34,762 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 20:53:34,762 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 20:53:34,762 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [811894497] [2022-12-13 20:53:34,762 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [811894497] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:53:34,762 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:53:34,763 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 20:53:34,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584684511] [2022-12-13 20:53:34,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:53:34,763 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 20:53:34,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 20:53:34,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 20:53:34,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 20:53:34,770 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 303 [2022-12-13 20:53:34,770 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 44 transitions, 148 flow. Second operand has 4 states, 4 states have (on average 141.5) internal successors, (566), 4 states have internal predecessors, (566), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:53:34,770 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 20:53:34,771 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 303 [2022-12-13 20:53:34,771 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 20:53:35,199 INFO L130 PetriNetUnfolder]: 2325/3704 cut-off events. [2022-12-13 20:53:35,199 INFO L131 PetriNetUnfolder]: For 1222/1222 co-relation queries the response was YES. [2022-12-13 20:53:35,203 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9052 conditions, 3704 events. 2325/3704 cut-off events. For 1222/1222 co-relation queries the response was YES. Maximal size of possible extension queue 181. Compared 21623 event pairs, 269 based on Foata normal form. 1/3700 useless extension candidates. Maximal degree in co-relation 9046. Up to 1845 conditions per place. [2022-12-13 20:53:35,209 INFO L137 encePairwiseOnDemand]: 300/303 looper letters, 97 selfloop transitions, 2 changer transitions 0/101 dead transitions. [2022-12-13 20:53:35,209 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 101 transitions, 540 flow [2022-12-13 20:53:35,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 20:53:35,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 20:53:35,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 605 transitions. [2022-12-13 20:53:35,211 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4991749174917492 [2022-12-13 20:53:35,211 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 605 transitions. [2022-12-13 20:53:35,211 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 605 transitions. [2022-12-13 20:53:35,212 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 20:53:35,212 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 605 transitions. [2022-12-13 20:53:35,213 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 151.25) internal successors, (605), 4 states have internal predecessors, (605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:53:35,215 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 303.0) internal successors, (1515), 5 states have internal predecessors, (1515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:53:35,215 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 303.0) internal successors, (1515), 5 states have internal predecessors, (1515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:53:35,215 INFO L175 Difference]: Start difference. First operand has 52 places, 44 transitions, 148 flow. Second operand 4 states and 605 transitions. [2022-12-13 20:53:35,215 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 101 transitions, 540 flow [2022-12-13 20:53:35,221 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 101 transitions, 529 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-13 20:53:35,222 INFO L231 Difference]: Finished difference. Result has 54 places, 45 transitions, 155 flow [2022-12-13 20:53:35,222 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=155, PETRI_PLACES=54, PETRI_TRANSITIONS=45} [2022-12-13 20:53:35,222 INFO L288 CegarLoopForPetriNet]: 53 programPoint places, 1 predicate places. [2022-12-13 20:53:35,222 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 45 transitions, 155 flow [2022-12-13 20:53:35,223 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 141.5) internal successors, (566), 4 states have internal predecessors, (566), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:53:35,223 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 20:53:35,223 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:53:35,231 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00bd5136-fabb-4b46-a8e8-3f3a1eb5b223/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 20:53:35,423 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00bd5136-fabb-4b46-a8e8-3f3a1eb5b223/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 20:53:35,424 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-12-13 20:53:35,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:53:35,426 INFO L85 PathProgramCache]: Analyzing trace with hash 82322, now seen corresponding path program 3 times [2022-12-13 20:53:35,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 20:53:35,427 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1129012230] [2022-12-13 20:53:35,428 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 20:53:35,428 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 20:53:35,428 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00bd5136-fabb-4b46-a8e8-3f3a1eb5b223/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 20:53:35,431 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00bd5136-fabb-4b46-a8e8-3f3a1eb5b223/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 20:53:35,434 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00bd5136-fabb-4b46-a8e8-3f3a1eb5b223/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 20:53:35,538 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-12-13 20:53:35,538 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 20:53:35,544 INFO L263 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 20:53:35,545 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 20:53:35,566 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 20:53:35,566 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 20:53:35,566 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 20:53:35,566 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1129012230] [2022-12-13 20:53:35,566 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1129012230] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:53:35,566 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:53:35,566 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 20:53:35,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065991197] [2022-12-13 20:53:35,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:53:35,567 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 20:53:35,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 20:53:35,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 20:53:35,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 20:53:35,574 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 303 [2022-12-13 20:53:35,574 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 45 transitions, 155 flow. Second operand has 4 states, 4 states have (on average 141.5) internal successors, (566), 4 states have internal predecessors, (566), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:53:35,574 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 20:53:35,574 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 303 [2022-12-13 20:53:35,574 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 20:53:36,131 INFO L130 PetriNetUnfolder]: 3810/6080 cut-off events. [2022-12-13 20:53:36,131 INFO L131 PetriNetUnfolder]: For 2083/2083 co-relation queries the response was YES. [2022-12-13 20:53:36,137 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14997 conditions, 6080 events. 3810/6080 cut-off events. For 2083/2083 co-relation queries the response was YES. Maximal size of possible extension queue 285. Compared 37972 event pairs, 465 based on Foata normal form. 1/6044 useless extension candidates. Maximal degree in co-relation 14989. Up to 2906 conditions per place. [2022-12-13 20:53:36,147 INFO L137 encePairwiseOnDemand]: 300/303 looper letters, 93 selfloop transitions, 2 changer transitions 0/98 dead transitions. [2022-12-13 20:53:36,147 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 98 transitions, 525 flow [2022-12-13 20:53:36,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 20:53:36,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 20:53:36,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 601 transitions. [2022-12-13 20:53:36,149 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.49587458745874585 [2022-12-13 20:53:36,149 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 601 transitions. [2022-12-13 20:53:36,149 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 601 transitions. [2022-12-13 20:53:36,150 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 20:53:36,150 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 601 transitions. [2022-12-13 20:53:36,150 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 150.25) internal successors, (601), 4 states have internal predecessors, (601), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:53:36,151 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 303.0) internal successors, (1515), 5 states have internal predecessors, (1515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:53:36,151 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 303.0) internal successors, (1515), 5 states have internal predecessors, (1515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:53:36,152 INFO L175 Difference]: Start difference. First operand has 54 places, 45 transitions, 155 flow. Second operand 4 states and 601 transitions. [2022-12-13 20:53:36,152 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 98 transitions, 525 flow [2022-12-13 20:53:36,153 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 98 transitions, 523 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 20:53:36,154 INFO L231 Difference]: Finished difference. Result has 58 places, 46 transitions, 167 flow [2022-12-13 20:53:36,154 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=167, PETRI_PLACES=58, PETRI_TRANSITIONS=46} [2022-12-13 20:53:36,154 INFO L288 CegarLoopForPetriNet]: 53 programPoint places, 5 predicate places. [2022-12-13 20:53:36,154 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 46 transitions, 167 flow [2022-12-13 20:53:36,154 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 141.5) internal successors, (566), 4 states have internal predecessors, (566), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:53:36,155 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 20:53:36,155 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:53:36,163 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00bd5136-fabb-4b46-a8e8-3f3a1eb5b223/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-12-13 20:53:36,355 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00bd5136-fabb-4b46-a8e8-3f3a1eb5b223/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 20:53:36,356 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-12-13 20:53:36,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:53:36,358 INFO L85 PathProgramCache]: Analyzing trace with hash -425497156, now seen corresponding path program 4 times [2022-12-13 20:53:36,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 20:53:36,359 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [663303854] [2022-12-13 20:53:36,359 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-13 20:53:36,360 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 20:53:36,360 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00bd5136-fabb-4b46-a8e8-3f3a1eb5b223/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 20:53:36,363 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00bd5136-fabb-4b46-a8e8-3f3a1eb5b223/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 20:53:36,366 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00bd5136-fabb-4b46-a8e8-3f3a1eb5b223/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 20:53:36,467 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-13 20:53:36,467 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 20:53:36,473 INFO L263 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 20:53:36,474 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 20:53:36,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:53:36,492 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 20:53:36,492 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 20:53:36,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [663303854] [2022-12-13 20:53:36,492 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [663303854] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:53:36,493 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:53:36,493 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 20:53:36,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718283957] [2022-12-13 20:53:36,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:53:36,493 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 20:53:36,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 20:53:36,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 20:53:36,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 20:53:36,499 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 303 [2022-12-13 20:53:36,499 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 46 transitions, 167 flow. Second operand has 4 states, 4 states have (on average 141.5) internal successors, (566), 4 states have internal predecessors, (566), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:53:36,500 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 20:53:36,500 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 303 [2022-12-13 20:53:36,500 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 20:53:37,272 INFO L130 PetriNetUnfolder]: 5902/8989 cut-off events. [2022-12-13 20:53:37,272 INFO L131 PetriNetUnfolder]: For 3608/3608 co-relation queries the response was YES. [2022-12-13 20:53:37,281 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23336 conditions, 8989 events. 5902/8989 cut-off events. For 3608/3608 co-relation queries the response was YES. Maximal size of possible extension queue 450. Compared 55258 event pairs, 1335 based on Foata normal form. 1/8844 useless extension candidates. Maximal degree in co-relation 23326. Up to 4072 conditions per place. [2022-12-13 20:53:37,296 INFO L137 encePairwiseOnDemand]: 300/303 looper letters, 86 selfloop transitions, 2 changer transitions 0/92 dead transitions. [2022-12-13 20:53:37,296 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 92 transitions, 506 flow [2022-12-13 20:53:37,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 20:53:37,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 20:53:37,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 595 transitions. [2022-12-13 20:53:37,298 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4909240924092409 [2022-12-13 20:53:37,298 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 595 transitions. [2022-12-13 20:53:37,298 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 595 transitions. [2022-12-13 20:53:37,299 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 20:53:37,299 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 595 transitions. [2022-12-13 20:53:37,299 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 148.75) internal successors, (595), 4 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 20:53:37,300 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 303.0) internal successors, (1515), 5 states have internal predecessors, (1515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:53:37,301 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 303.0) internal successors, (1515), 5 states have internal predecessors, (1515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:53:37,301 INFO L175 Difference]: Start difference. First operand has 58 places, 46 transitions, 167 flow. Second operand 4 states and 595 transitions. [2022-12-13 20:53:37,301 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 92 transitions, 506 flow [2022-12-13 20:53:37,303 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 92 transitions, 504 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 20:53:37,304 INFO L231 Difference]: Finished difference. Result has 62 places, 47 transitions, 179 flow [2022-12-13 20:53:37,304 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=179, PETRI_PLACES=62, PETRI_TRANSITIONS=47} [2022-12-13 20:53:37,304 INFO L288 CegarLoopForPetriNet]: 53 programPoint places, 9 predicate places. [2022-12-13 20:53:37,304 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 47 transitions, 179 flow [2022-12-13 20:53:37,305 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 141.5) internal successors, (566), 4 states have internal predecessors, (566), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:53:37,305 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 20:53:37,305 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:53:37,313 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00bd5136-fabb-4b46-a8e8-3f3a1eb5b223/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 20:53:37,506 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00bd5136-fabb-4b46-a8e8-3f3a1eb5b223/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 20:53:37,507 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-12-13 20:53:37,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:53:37,508 INFO L85 PathProgramCache]: Analyzing trace with hash 1182513214, now seen corresponding path program 5 times [2022-12-13 20:53:37,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 20:53:37,509 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1703632737] [2022-12-13 20:53:37,510 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-13 20:53:37,510 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 20:53:37,510 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00bd5136-fabb-4b46-a8e8-3f3a1eb5b223/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 20:53:37,513 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00bd5136-fabb-4b46-a8e8-3f3a1eb5b223/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 20:53:37,516 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00bd5136-fabb-4b46-a8e8-3f3a1eb5b223/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 20:53:37,647 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-12-13 20:53:37,648 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-12-13 20:53:37,648 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 20:53:37,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 20:53:37,769 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-12-13 20:53:37,769 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 20:53:37,770 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (15 of 16 remaining) [2022-12-13 20:53:37,771 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (14 of 16 remaining) [2022-12-13 20:53:37,771 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2022-12-13 20:53:37,772 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining) [2022-12-13 20:53:37,772 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2022-12-13 20:53:37,772 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2022-12-13 20:53:37,772 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2022-12-13 20:53:37,772 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2022-12-13 20:53:37,772 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2022-12-13 20:53:37,772 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2022-12-13 20:53:37,772 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (5 of 16 remaining) [2022-12-13 20:53:37,772 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 16 remaining) [2022-12-13 20:53:37,773 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 16 remaining) [2022-12-13 20:53:37,773 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 16 remaining) [2022-12-13 20:53:37,773 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 16 remaining) [2022-12-13 20:53:37,773 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2022-12-13 20:53:37,782 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00bd5136-fabb-4b46-a8e8-3f3a1eb5b223/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2022-12-13 20:53:37,974 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00bd5136-fabb-4b46-a8e8-3f3a1eb5b223/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 20:53:37,975 INFO L445 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1, 1, 1] [2022-12-13 20:53:37,985 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 20:53:37,985 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 20:53:38,038 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 08:53:38 BasicIcfg [2022-12-13 20:53:38,038 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 20:53:38,038 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-13 20:53:38,038 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-13 20:53:38,038 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-13 20:53:38,039 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 08:53:18" (3/4) ... [2022-12-13 20:53:38,041 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-12-13 20:53:38,041 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-13 20:53:38,041 INFO L158 Benchmark]: Toolchain (without parser) took 20675.01ms. Allocated memory was 90.2MB in the beginning and 1.0GB in the end (delta: 954.2MB). Free memory was 69.6MB in the beginning and 624.5MB in the end (delta: -554.9MB). Peak memory consumption was 399.0MB. Max. memory is 16.1GB. [2022-12-13 20:53:38,041 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 58.7MB. Free memory is still 37.3MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 20:53:38,042 INFO L158 Benchmark]: CACSL2BoogieTranslator took 389.52ms. Allocated memory is still 90.2MB. Free memory was 69.4MB in the beginning and 60.4MB in the end (delta: 9.0MB). Peak memory consumption was 23.8MB. Max. memory is 16.1GB. [2022-12-13 20:53:38,042 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.21ms. Allocated memory is still 90.2MB. Free memory was 60.4MB in the beginning and 57.9MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 20:53:38,042 INFO L158 Benchmark]: Boogie Preprocessor took 21.84ms. Allocated memory is still 90.2MB. Free memory was 57.9MB in the beginning and 55.4MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 20:53:38,042 INFO L158 Benchmark]: RCFGBuilder took 582.88ms. Allocated memory is still 90.2MB. Free memory was 55.4MB in the beginning and 39.3MB in the end (delta: 16.1MB). Peak memory consumption was 19.9MB. Max. memory is 16.1GB. [2022-12-13 20:53:38,043 INFO L158 Benchmark]: TraceAbstraction took 19637.50ms. Allocated memory was 90.2MB in the beginning and 1.0GB in the end (delta: 954.2MB). Free memory was 38.7MB in the beginning and 625.6MB in the end (delta: -586.9MB). Peak memory consumption was 365.8MB. Max. memory is 16.1GB. [2022-12-13 20:53:38,043 INFO L158 Benchmark]: Witness Printer took 2.77ms. Allocated memory is still 1.0GB. Free memory was 625.6MB in the beginning and 624.5MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 20:53:38,044 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.12ms. Allocated memory is still 58.7MB. Free memory is still 37.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 389.52ms. Allocated memory is still 90.2MB. Free memory was 69.4MB in the beginning and 60.4MB in the end (delta: 9.0MB). Peak memory consumption was 23.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.21ms. Allocated memory is still 90.2MB. Free memory was 60.4MB in the beginning and 57.9MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 21.84ms. Allocated memory is still 90.2MB. Free memory was 57.9MB in the beginning and 55.4MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 582.88ms. Allocated memory is still 90.2MB. Free memory was 55.4MB in the beginning and 39.3MB in the end (delta: 16.1MB). Peak memory consumption was 19.9MB. Max. memory is 16.1GB. * TraceAbstraction took 19637.50ms. Allocated memory was 90.2MB in the beginning and 1.0GB in the end (delta: 954.2MB). Free memory was 38.7MB in the beginning and 625.6MB in the end (delta: -586.9MB). Peak memory consumption was 365.8MB. Max. memory is 16.1GB. * Witness Printer took 2.77ms. Allocated memory is still 1.0GB. Free memory was 625.6MB in the beginning and 624.5MB 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: 7.5s, 161 PlacesBefore, 53 PlacesAfterwards, 150 TransitionsBefore, 41 TransitionsAfterwards, 3884 CoEnabledTransitionPairs, 8 FixpointIterations, 58 TrivialSequentialCompositions, 82 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 1 ChoiceCompositions, 149 TotalNumberOfCompositions, 11700 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 5097, independent: 4813, independent conditional: 0, independent unconditional: 4813, dependent: 284, dependent conditional: 0, dependent unconditional: 284, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 2093, independent: 2036, independent conditional: 0, independent unconditional: 2036, dependent: 57, dependent conditional: 0, dependent unconditional: 57, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 5097, independent: 2777, independent conditional: 0, independent unconditional: 2777, dependent: 227, dependent conditional: 0, dependent unconditional: 227, unknown: 2093, unknown conditional: 0, unknown unconditional: 2093] , Statistics on independence cache: Total cache size (in pairs): 202, Positive cache size: 181, Positive conditional cache size: 0, Positive unconditional cache size: 181, Negative cache size: 21, Negative conditional cache size: 0, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p1_EAX = 0; [L716] 0 int __unbuffered_p2_EAX = 0; [L718] 0 int __unbuffered_p3_EAX = 0; [L720] 0 int __unbuffered_p3_EBX = 0; [L722] 0 int a = 0; [L724] 0 int b = 0; [L725] 0 _Bool b$flush_delayed; [L726] 0 int b$mem_tmp; [L727] 0 _Bool b$r_buff0_thd0; [L728] 0 _Bool b$r_buff0_thd1; [L729] 0 _Bool b$r_buff0_thd2; [L730] 0 _Bool b$r_buff0_thd3; [L731] 0 _Bool b$r_buff0_thd4; [L732] 0 _Bool b$r_buff1_thd0; [L733] 0 _Bool b$r_buff1_thd1; [L734] 0 _Bool b$r_buff1_thd2; [L735] 0 _Bool b$r_buff1_thd3; [L736] 0 _Bool b$r_buff1_thd4; [L737] 0 _Bool b$read_delayed; [L738] 0 int *b$read_delayed_var; [L739] 0 int b$w_buff0; [L740] 0 _Bool b$w_buff0_used; [L741] 0 int b$w_buff1; [L742] 0 _Bool b$w_buff1_used; [L743] 0 _Bool main$tmp_guard0; [L744] 0 _Bool main$tmp_guard1; [L746] 0 int x = 0; [L748] 0 int y = 0; [L750] 0 int z = 0; [L751] 0 _Bool weak$$choice0; [L752] 0 _Bool weak$$choice2; [L873] 0 pthread_t t937; [L874] FCALL, FORK 0 pthread_create(&t937, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t937, ((void *)0), P0, ((void *)0))=0, t937={11:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L756] 1 b$w_buff1 = b$w_buff0 [L757] 1 b$w_buff0 = 1 [L758] 1 b$w_buff1_used = b$w_buff0_used [L759] 1 b$w_buff0_used = (_Bool)1 [L760] CALL 1 __VERIFIER_assert(!(b$w_buff1_used && b$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L760] RET 1 __VERIFIER_assert(!(b$w_buff1_used && b$w_buff0_used)) [L761] 1 b$r_buff1_thd0 = b$r_buff0_thd0 [L762] 1 b$r_buff1_thd1 = b$r_buff0_thd1 [L763] 1 b$r_buff1_thd2 = b$r_buff0_thd2 [L764] 1 b$r_buff1_thd3 = b$r_buff0_thd3 [L765] 1 b$r_buff1_thd4 = b$r_buff0_thd4 [L766] 1 b$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L875] 0 pthread_t t938; [L876] FCALL, FORK 0 pthread_create(&t938, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t938, ((void *)0), P1, ((void *)0))=1, t937={11:0}, t938={15:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L769] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L786] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L789] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L792] 2 b = b$w_buff0_used && b$r_buff0_thd2 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd2 ? b$w_buff1 : b) [L793] 2 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$w_buff0_used [L794] 2 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$w_buff1_used [L795] 2 b$r_buff0_thd2 = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$r_buff0_thd2 [L796] 2 b$r_buff1_thd2 = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L877] 0 pthread_t t939; [L878] FCALL, FORK 0 pthread_create(&t939, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t939, ((void *)0), P2, ((void *)0))=2, t937={11:0}, t938={15:0}, t939={9:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L806] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L879] 0 pthread_t t940; [L799] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L801] 2 return 0; [L809] 3 __unbuffered_p2_EAX = z VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L880] FCALL, FORK 0 pthread_create(&t940, ((void *)0), P3, ((void *)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t940, ((void *)0), P3, ((void *)0))=3, t937={11:0}, t938={15:0}, t939={9:0}, t940={-2147483637:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L812] 3 b = b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd3 ? b$w_buff1 : b) [L813] 3 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used [L814] 3 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$w_buff1_used [L815] 3 b$r_buff0_thd3 = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$r_buff0_thd3 [L816] 3 b$r_buff1_thd3 = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L819] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L821] 3 return 0; [L826] 4 z = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L829] 4 a = 1 [L832] 4 __unbuffered_p3_EAX = a VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L835] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L836] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L837] 4 b$flush_delayed = weak$$choice2 [L838] 4 b$mem_tmp = b [L839] 4 b = !b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff1) [L840] 4 b$w_buff0 = weak$$choice2 ? b$w_buff0 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff0)) [L841] 4 b$w_buff1 = weak$$choice2 ? b$w_buff1 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff1 : b$w_buff1)) [L842] 4 b$w_buff0_used = weak$$choice2 ? b$w_buff0_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used)) [L843] 4 b$w_buff1_used = weak$$choice2 ? b$w_buff1_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L844] 4 b$r_buff0_thd4 = weak$$choice2 ? b$r_buff0_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff0_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4)) [L845] 4 b$r_buff1_thd4 = weak$$choice2 ? b$r_buff1_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff1_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L846] 4 __unbuffered_p3_EBX = b [L847] 4 b = b$flush_delayed ? b$mem_tmp : b [L848] 4 b$flush_delayed = (_Bool)0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=0, x=1, y=1, z=1] [L772] 1 b = b$w_buff0_used && b$r_buff0_thd1 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd1 ? b$w_buff1 : b) [L773] 1 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$w_buff0_used [L774] 1 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$w_buff1_used [L775] 1 b$r_buff0_thd1 = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$r_buff0_thd1 [L776] 1 b$r_buff1_thd1 = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$r_buff1_thd1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=0, x=1, y=1, z=1] [L851] 4 b = b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd4 ? b$w_buff1 : b) [L852] 4 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used [L853] 4 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$w_buff1_used [L854] 4 b$r_buff0_thd4 = b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4 [L855] 4 b$r_buff1_thd4 = b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$r_buff1_thd4 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=0, x=1, y=1, z=1] [L858] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L860] 4 return 0; [L779] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L781] 1 return 0; [L882] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L884] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L884] RET 0 assume_abort_if_not(main$tmp_guard0) [L886] 0 b = b$w_buff0_used && b$r_buff0_thd0 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd0 ? b$w_buff1 : b) [L887] 0 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$w_buff0_used [L888] 0 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$w_buff1_used [L889] 0 b$r_buff0_thd0 = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$r_buff0_thd0 [L890] 0 b$r_buff1_thd0 = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=1, main$tmp_guard1=0, t937={11:0}, t938={15:0}, t939={9:0}, t940={-2147483637:0}, weak$$choice0=2, weak$$choice2=0, x=1, y=1, z=1] [L893] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L895] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=0, x=1, y=1, z=1] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -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: 871]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 878]: 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: 876]: 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: 880]: 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: 874]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 192 locations, 16 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 19.5s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 7.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 7.6s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 642 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 592 mSDsluCounter, 167 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 138 mSDsCounter, 80 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1608 IncrementalHoareTripleChecker+Invalid, 1688 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 80 mSolverCounterUnsat, 29 mSDtfsCounter, 1608 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 191 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=222occurred in iteration=6, InterpolantAutomatonStates: 46, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 212 NumberOfCodeBlocks, 212 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 174 ConstructedInterpolants, 0 QuantifiedInterpolants, 768 SizeOfPredicates, 19 NumberOfNonLiveVariables, 1532 ConjunctsInSsa, 67 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 20:53:38,061 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00bd5136-fabb-4b46-a8e8-3f3a1eb5b223/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample