./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/safe018_rmo.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 38b53e6a Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_186bbf52-c27b-468d-a54e-5164df668682/bin/uautomizer-ZsLfNo2U6R/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_186bbf52-c27b-468d-a54e-5164df668682/bin/uautomizer-ZsLfNo2U6R/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_186bbf52-c27b-468d-a54e-5164df668682/bin/uautomizer-ZsLfNo2U6R/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_186bbf52-c27b-468d-a54e-5164df668682/bin/uautomizer-ZsLfNo2U6R/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe018_rmo.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_186bbf52-c27b-468d-a54e-5164df668682/bin/uautomizer-ZsLfNo2U6R/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_186bbf52-c27b-468d-a54e-5164df668682/bin/uautomizer-ZsLfNo2U6R --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6f413b41672ef8cb3f594e0d22a82a07ab4d735f8bfa69fff7e94198d51bd0eb --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-38b53e6 [2022-11-25 17:31:06,057 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 17:31:06,059 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 17:31:06,088 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 17:31:06,088 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 17:31:06,092 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 17:31:06,097 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 17:31:06,100 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 17:31:06,102 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 17:31:06,108 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 17:31:06,110 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 17:31:06,111 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 17:31:06,112 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 17:31:06,116 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 17:31:06,120 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 17:31:06,122 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 17:31:06,124 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 17:31:06,125 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 17:31:06,126 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 17:31:06,132 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 17:31:06,135 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 17:31:06,137 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 17:31:06,139 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 17:31:06,140 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 17:31:06,148 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 17:31:06,151 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 17:31:06,151 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 17:31:06,152 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 17:31:06,154 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 17:31:06,155 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 17:31:06,156 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 17:31:06,157 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 17:31:06,159 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 17:31:06,161 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 17:31:06,162 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 17:31:06,162 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 17:31:06,163 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 17:31:06,163 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 17:31:06,163 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 17:31:06,165 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 17:31:06,166 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 17:31:06,167 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_186bbf52-c27b-468d-a54e-5164df668682/bin/uautomizer-ZsLfNo2U6R/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-11-25 17:31:06,229 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 17:31:06,230 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 17:31:06,230 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 17:31:06,231 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 17:31:06,240 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 17:31:06,240 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 17:31:06,241 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 17:31:06,241 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 17:31:06,241 INFO L138 SettingsManager]: * Use SBE=true [2022-11-25 17:31:06,242 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 17:31:06,243 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 17:31:06,243 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-25 17:31:06,243 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 17:31:06,243 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 17:31:06,243 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 17:31:06,244 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-25 17:31:06,244 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-25 17:31:06,244 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-25 17:31:06,244 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 17:31:06,244 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-25 17:31:06,244 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 17:31:06,245 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 17:31:06,245 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 17:31:06,245 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-25 17:31:06,245 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 17:31:06,245 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 17:31:06,246 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 17:31:06,246 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 17:31:06,246 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-25 17:31:06,247 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-25 17:31:06,247 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-25 17:31:06,247 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-25 17:31:06,247 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-25 17:31:06,248 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_186bbf52-c27b-468d-a54e-5164df668682/bin/uautomizer-ZsLfNo2U6R/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_186bbf52-c27b-468d-a54e-5164df668682/bin/uautomizer-ZsLfNo2U6R Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6f413b41672ef8cb3f594e0d22a82a07ab4d735f8bfa69fff7e94198d51bd0eb [2022-11-25 17:31:06,565 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 17:31:06,600 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 17:31:06,603 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 17:31:06,604 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 17:31:06,605 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 17:31:06,606 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_186bbf52-c27b-468d-a54e-5164df668682/bin/uautomizer-ZsLfNo2U6R/../../sv-benchmarks/c/pthread-wmm/safe018_rmo.oepc.i [2022-11-25 17:31:09,724 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 17:31:10,033 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 17:31:10,034 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_186bbf52-c27b-468d-a54e-5164df668682/sv-benchmarks/c/pthread-wmm/safe018_rmo.oepc.i [2022-11-25 17:31:10,047 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_186bbf52-c27b-468d-a54e-5164df668682/bin/uautomizer-ZsLfNo2U6R/data/0503d9bac/ec3147b0a2b3476fa7f368760fc9079f/FLAG511b7220e [2022-11-25 17:31:10,062 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_186bbf52-c27b-468d-a54e-5164df668682/bin/uautomizer-ZsLfNo2U6R/data/0503d9bac/ec3147b0a2b3476fa7f368760fc9079f [2022-11-25 17:31:10,065 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 17:31:10,066 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 17:31:10,068 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 17:31:10,068 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 17:31:10,072 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 17:31:10,073 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 05:31:10" (1/1) ... [2022-11-25 17:31:10,074 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d50ac6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:31:10, skipping insertion in model container [2022-11-25 17:31:10,075 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 05:31:10" (1/1) ... [2022-11-25 17:31:10,082 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 17:31:10,150 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 17:31:10,357 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_186bbf52-c27b-468d-a54e-5164df668682/sv-benchmarks/c/pthread-wmm/safe018_rmo.oepc.i[993,1006] [2022-11-25 17:31:10,605 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:31:10,631 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:31:10,632 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:31:10,633 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:31:10,633 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:31:10,634 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:31:10,634 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:31:10,634 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:31:10,640 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:31:10,641 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:31:10,641 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:31:10,642 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:31:10,642 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:31:10,642 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:31:10,643 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:31:10,643 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:31:10,644 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:31:10,645 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:31:10,646 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:31:10,656 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:31:10,657 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:31:10,657 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:31:10,666 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:31:10,669 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:31:10,670 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:31:10,678 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:31:10,679 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:31:10,682 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:31:10,685 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 17:31:10,697 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 17:31:10,709 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_186bbf52-c27b-468d-a54e-5164df668682/sv-benchmarks/c/pthread-wmm/safe018_rmo.oepc.i[993,1006] [2022-11-25 17:31:10,756 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:31:10,766 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:31:10,767 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:31:10,768 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:31:10,768 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:31:10,769 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:31:10,769 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:31:10,770 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:31:10,771 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:31:10,773 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:31:10,773 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:31:10,774 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:31:10,774 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:31:10,774 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:31:10,776 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:31:10,777 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:31:10,777 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:31:10,777 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:31:10,778 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:31:10,783 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:31:10,784 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:31:10,785 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:31:10,793 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:31:10,795 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:31:10,796 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:31:10,800 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:31:10,809 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:31:10,810 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:31:10,811 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 17:31:10,864 INFO L208 MainTranslator]: Completed translation [2022-11-25 17:31:10,865 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:31:10 WrapperNode [2022-11-25 17:31:10,865 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 17:31:10,867 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 17:31:10,867 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 17:31:10,867 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 17:31:10,875 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:31:10" (1/1) ... [2022-11-25 17:31:10,914 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:31:10" (1/1) ... [2022-11-25 17:31:10,955 INFO L138 Inliner]: procedures = 176, calls = 65, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 136 [2022-11-25 17:31:10,955 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 17:31:10,956 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 17:31:10,956 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 17:31:10,956 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 17:31:10,966 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:31:10" (1/1) ... [2022-11-25 17:31:10,966 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:31:10" (1/1) ... [2022-11-25 17:31:10,978 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:31:10" (1/1) ... [2022-11-25 17:31:10,978 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:31:10" (1/1) ... [2022-11-25 17:31:10,985 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:31:10" (1/1) ... [2022-11-25 17:31:10,987 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:31:10" (1/1) ... [2022-11-25 17:31:10,989 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:31:10" (1/1) ... [2022-11-25 17:31:11,007 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:31:10" (1/1) ... [2022-11-25 17:31:11,022 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 17:31:11,023 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 17:31:11,023 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 17:31:11,023 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 17:31:11,024 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:31:10" (1/1) ... [2022-11-25 17:31:11,031 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 17:31:11,043 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_186bbf52-c27b-468d-a54e-5164df668682/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:31:11,064 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_186bbf52-c27b-468d-a54e-5164df668682/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 17:31:11,090 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_186bbf52-c27b-468d-a54e-5164df668682/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 17:31:11,113 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-25 17:31:11,114 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-25 17:31:11,114 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-25 17:31:11,114 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 17:31:11,114 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-25 17:31:11,115 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-25 17:31:11,115 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-25 17:31:11,115 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-25 17:31:11,116 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-25 17:31:11,116 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-25 17:31:11,116 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-25 17:31:11,116 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-25 17:31:11,116 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-25 17:31:11,117 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-25 17:31:11,117 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 17:31:11,117 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 17:31:11,119 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-25 17:31:11,384 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 17:31:11,386 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 17:31:11,856 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 17:31:12,210 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 17:31:12,211 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-25 17:31:12,213 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:31:12 BoogieIcfgContainer [2022-11-25 17:31:12,214 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 17:31:12,218 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 17:31:12,219 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 17:31:12,222 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 17:31:12,222 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 05:31:10" (1/3) ... [2022-11-25 17:31:12,223 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2518ab9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 05:31:12, skipping insertion in model container [2022-11-25 17:31:12,223 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:31:10" (2/3) ... [2022-11-25 17:31:12,225 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2518ab9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 05:31:12, skipping insertion in model container [2022-11-25 17:31:12,226 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:31:12" (3/3) ... [2022-11-25 17:31:12,229 INFO L112 eAbstractionObserver]: Analyzing ICFG safe018_rmo.oepc.i [2022-11-25 17:31:12,250 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 17:31:12,250 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 32 error locations. [2022-11-25 17:31:12,250 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-25 17:31:12,359 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-25 17:31:12,412 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 172 places, 164 transitions, 343 flow [2022-11-25 17:31:12,485 INFO L130 PetriNetUnfolder]: 2/161 cut-off events. [2022-11-25 17:31:12,485 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 17:31:12,491 INFO L83 FinitePrefix]: Finished finitePrefix Result has 171 conditions, 161 events. 2/161 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 180 event pairs, 0 based on Foata normal form. 0/127 useless extension candidates. Maximal degree in co-relation 100. Up to 2 conditions per place. [2022-11-25 17:31:12,491 INFO L82 GeneralOperation]: Start removeDead. Operand has 172 places, 164 transitions, 343 flow [2022-11-25 17:31:12,497 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 169 places, 161 transitions, 331 flow [2022-11-25 17:31:12,501 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-25 17:31:12,515 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 169 places, 161 transitions, 331 flow [2022-11-25 17:31:12,518 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 169 places, 161 transitions, 331 flow [2022-11-25 17:31:12,518 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 169 places, 161 transitions, 331 flow [2022-11-25 17:31:12,599 INFO L130 PetriNetUnfolder]: 2/161 cut-off events. [2022-11-25 17:31:12,599 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 17:31:12,600 INFO L83 FinitePrefix]: Finished finitePrefix Result has 171 conditions, 161 events. 2/161 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 180 event pairs, 0 based on Foata normal form. 0/127 useless extension candidates. Maximal degree in co-relation 100. Up to 2 conditions per place. [2022-11-25 17:31:12,603 INFO L119 LiptonReduction]: Number of co-enabled transitions 4540 [2022-11-25 17:31:29,154 INFO L134 LiptonReduction]: Checked pairs total: 15347 [2022-11-25 17:31:29,155 INFO L136 LiptonReduction]: Total number of compositions: 170 [2022-11-25 17:31:29,175 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 17:31:29,184 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;@756ab657, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 17:31:29,184 INFO L358 AbstractCegarLoop]: Starting to check reachability of 53 error locations. [2022-11-25 17:31:29,190 INFO L130 PetriNetUnfolder]: 0/1 cut-off events. [2022-11-25 17:31:29,190 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 17:31:29,191 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:31:29,195 INFO L209 CegarLoopForPetriNet]: trace histogram [1] [2022-11-25 17:31:29,196 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2022-11-25 17:31:29,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:31:29,201 INFO L85 PathProgramCache]: Analyzing trace with hash 819, now seen corresponding path program 1 times [2022-11-25 17:31:29,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:31:29,211 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591287258] [2022-11-25 17:31:29,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:31:29,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:31:29,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:31:29,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:31:29,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:31:29,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591287258] [2022-11-25 17:31:29,367 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591287258] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:31:29,367 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:31:29,368 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-25 17:31:29,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775081932] [2022-11-25 17:31:29,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:31:29,379 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-25 17:31:29,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:31:29,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-25 17:31:29,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-25 17:31:29,413 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 334 [2022-11-25 17:31:29,419 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 56 transitions, 121 flow. Second operand has 2 states, 2 states have (on average 132.5) internal successors, (265), 2 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:31:29,419 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:31:29,420 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 334 [2022-11-25 17:31:29,421 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:31:30,710 INFO L130 PetriNetUnfolder]: 3634/5452 cut-off events. [2022-11-25 17:31:30,711 INFO L131 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2022-11-25 17:31:30,725 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10769 conditions, 5452 events. 3634/5452 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 406. Compared 31632 event pairs, 3634 based on Foata normal form. 0/3147 useless extension candidates. Maximal degree in co-relation 10758. Up to 5271 conditions per place. [2022-11-25 17:31:30,756 INFO L137 encePairwiseOnDemand]: 315/334 looper letters, 34 selfloop transitions, 0 changer transitions 0/37 dead transitions. [2022-11-25 17:31:30,756 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 37 transitions, 151 flow [2022-11-25 17:31:30,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 17:31:30,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-11-25 17:31:30,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 317 transitions. [2022-11-25 17:31:30,777 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4745508982035928 [2022-11-25 17:31:30,778 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 317 transitions. [2022-11-25 17:31:30,778 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 317 transitions. [2022-11-25 17:31:30,782 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:31:30,785 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 317 transitions. [2022-11-25 17:31:30,792 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 158.5) internal successors, (317), 2 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:31:30,798 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 334.0) internal successors, (1002), 3 states have internal predecessors, (1002), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:31:30,799 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 334.0) internal successors, (1002), 3 states have internal predecessors, (1002), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:31:30,801 INFO L175 Difference]: Start difference. First operand has 65 places, 56 transitions, 121 flow. Second operand 2 states and 317 transitions. [2022-11-25 17:31:30,802 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 37 transitions, 151 flow [2022-11-25 17:31:30,808 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 37 transitions, 148 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-25 17:31:30,810 INFO L231 Difference]: Finished difference. Result has 45 places, 37 transitions, 80 flow [2022-11-25 17:31:30,812 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=334, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=80, PETRI_PLACES=45, PETRI_TRANSITIONS=37} [2022-11-25 17:31:30,816 INFO L288 CegarLoopForPetriNet]: 65 programPoint places, -20 predicate places. [2022-11-25 17:31:30,816 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 37 transitions, 80 flow [2022-11-25 17:31:30,817 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 132.5) internal successors, (265), 2 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:31:30,817 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:31:30,817 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-11-25 17:31:30,818 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-25 17:31:30,818 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2022-11-25 17:31:30,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:31:30,829 INFO L85 PathProgramCache]: Analyzing trace with hash 807882, now seen corresponding path program 1 times [2022-11-25 17:31:30,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:31:30,830 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018441103] [2022-11-25 17:31:30,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:31:30,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:31:30,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:31:31,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:31:31,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:31:31,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018441103] [2022-11-25 17:31:31,062 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1018441103] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:31:31,062 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:31:31,062 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-25 17:31:31,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891463529] [2022-11-25 17:31:31,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:31:31,064 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 17:31:31,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:31:31,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 17:31:31,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:31:31,119 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 334 [2022-11-25 17:31:31,120 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 37 transitions, 80 flow. Second operand has 3 states, 3 states have (on average 127.0) internal successors, (381), 3 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:31:31,120 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:31:31,121 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 334 [2022-11-25 17:31:31,121 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:31:31,948 INFO L130 PetriNetUnfolder]: 3163/4798 cut-off events. [2022-11-25 17:31:31,948 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 17:31:31,957 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9559 conditions, 4798 events. 3163/4798 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 256. Compared 26112 event pairs, 2044 based on Foata normal form. 0/3423 useless extension candidates. Maximal degree in co-relation 9556. Up to 2960 conditions per place. [2022-11-25 17:31:31,980 INFO L137 encePairwiseOnDemand]: 320/334 looper letters, 39 selfloop transitions, 8 changer transitions 0/48 dead transitions. [2022-11-25 17:31:31,980 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 48 transitions, 196 flow [2022-11-25 17:31:31,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 17:31:31,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 17:31:31,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 431 transitions. [2022-11-25 17:31:31,983 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4301397205588822 [2022-11-25 17:31:31,983 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 431 transitions. [2022-11-25 17:31:31,983 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 431 transitions. [2022-11-25 17:31:31,983 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:31:31,984 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 431 transitions. [2022-11-25 17:31:32,021 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 143.66666666666666) internal successors, (431), 3 states have internal predecessors, (431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:31:32,024 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 334.0) internal successors, (1336), 4 states have internal predecessors, (1336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:31:32,025 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 334.0) internal successors, (1336), 4 states have internal predecessors, (1336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:31:32,025 INFO L175 Difference]: Start difference. First operand has 45 places, 37 transitions, 80 flow. Second operand 3 states and 431 transitions. [2022-11-25 17:31:32,025 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 48 transitions, 196 flow [2022-11-25 17:31:32,026 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 48 transitions, 196 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-25 17:31:32,027 INFO L231 Difference]: Finished difference. Result has 47 places, 41 transitions, 140 flow [2022-11-25 17:31:32,029 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=334, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=140, PETRI_PLACES=47, PETRI_TRANSITIONS=41} [2022-11-25 17:31:32,030 INFO L288 CegarLoopForPetriNet]: 65 programPoint places, -18 predicate places. [2022-11-25 17:31:32,030 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 41 transitions, 140 flow [2022-11-25 17:31:32,031 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 127.0) internal successors, (381), 3 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:31:32,031 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:31:32,032 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-11-25 17:31:32,032 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-25 17:31:32,032 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2022-11-25 17:31:32,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:31:32,036 INFO L85 PathProgramCache]: Analyzing trace with hash 807883, now seen corresponding path program 1 times [2022-11-25 17:31:32,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:31:32,037 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836766533] [2022-11-25 17:31:32,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:31:32,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:31:32,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:31:32,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:31:32,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:31:32,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836766533] [2022-11-25 17:31:32,276 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1836766533] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:31:32,276 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:31:32,276 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-25 17:31:32,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232114976] [2022-11-25 17:31:32,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:31:32,282 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 17:31:32,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:31:32,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 17:31:32,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:31:32,328 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 334 [2022-11-25 17:31:32,329 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 41 transitions, 140 flow. Second operand has 3 states, 3 states have (on average 131.0) internal successors, (393), 3 states have internal predecessors, (393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:31:32,330 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:31:32,330 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 334 [2022-11-25 17:31:32,330 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:31:32,909 INFO L130 PetriNetUnfolder]: 1743/2799 cut-off events. [2022-11-25 17:31:32,910 INFO L131 PetriNetUnfolder]: For 650/668 co-relation queries the response was YES. [2022-11-25 17:31:32,916 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7168 conditions, 2799 events. 1743/2799 cut-off events. For 650/668 co-relation queries the response was YES. Maximal size of possible extension queue 193. Compared 15564 event pairs, 1449 based on Foata normal form. 210/2633 useless extension candidates. Maximal degree in co-relation 7163. Up to 2602 conditions per place. [2022-11-25 17:31:32,935 INFO L137 encePairwiseOnDemand]: 329/334 looper letters, 32 selfloop transitions, 1 changer transitions 0/37 dead transitions. [2022-11-25 17:31:32,936 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 37 transitions, 198 flow [2022-11-25 17:31:32,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 17:31:32,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 17:31:32,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 422 transitions. [2022-11-25 17:31:32,940 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.42115768463073855 [2022-11-25 17:31:32,940 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 422 transitions. [2022-11-25 17:31:32,940 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 422 transitions. [2022-11-25 17:31:32,941 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:31:32,941 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 422 transitions. [2022-11-25 17:31:32,942 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 140.66666666666666) internal successors, (422), 3 states have internal predecessors, (422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:31:32,944 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 334.0) internal successors, (1336), 4 states have internal predecessors, (1336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:31:32,945 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 334.0) internal successors, (1336), 4 states have internal predecessors, (1336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:31:32,945 INFO L175 Difference]: Start difference. First operand has 47 places, 41 transitions, 140 flow. Second operand 3 states and 422 transitions. [2022-11-25 17:31:32,946 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 37 transitions, 198 flow [2022-11-25 17:31:32,952 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 37 transitions, 182 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-25 17:31:32,952 INFO L231 Difference]: Finished difference. Result has 43 places, 37 transitions, 118 flow [2022-11-25 17:31:32,953 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=334, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=118, PETRI_PLACES=43, PETRI_TRANSITIONS=37} [2022-11-25 17:31:32,953 INFO L288 CegarLoopForPetriNet]: 65 programPoint places, -22 predicate places. [2022-11-25 17:31:32,953 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 37 transitions, 118 flow [2022-11-25 17:31:32,954 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 131.0) internal successors, (393), 3 states have internal predecessors, (393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:31:32,954 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:31:32,954 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:31:32,954 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-25 17:31:32,955 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2022-11-25 17:31:32,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:31:32,955 INFO L85 PathProgramCache]: Analyzing trace with hash -223038666, now seen corresponding path program 1 times [2022-11-25 17:31:32,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:31:32,955 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555758540] [2022-11-25 17:31:32,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:31:32,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:31:32,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:31:33,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-11-25 17:31:33,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:31:33,114 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555758540] [2022-11-25 17:31:33,114 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555758540] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:31:33,115 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:31:33,115 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-25 17:31:33,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147935714] [2022-11-25 17:31:33,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:31:33,116 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 17:31:33,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:31:33,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 17:31:33,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:31:33,119 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 334 [2022-11-25 17:31:33,119 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 37 transitions, 118 flow. Second operand has 3 states, 3 states have (on average 134.33333333333334) internal successors, (403), 3 states have internal predecessors, (403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:31:33,120 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:31:33,120 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 334 [2022-11-25 17:31:33,120 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:31:33,718 INFO L130 PetriNetUnfolder]: 1654/2756 cut-off events. [2022-11-25 17:31:33,719 INFO L131 PetriNetUnfolder]: For 278/311 co-relation queries the response was YES. [2022-11-25 17:31:33,727 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6472 conditions, 2756 events. 1654/2756 cut-off events. For 278/311 co-relation queries the response was YES. Maximal size of possible extension queue 197. Compared 16167 event pairs, 598 based on Foata normal form. 0/2252 useless extension candidates. Maximal degree in co-relation 6467. Up to 1678 conditions per place. [2022-11-25 17:31:33,743 INFO L137 encePairwiseOnDemand]: 330/334 looper letters, 55 selfloop transitions, 3 changer transitions 0/62 dead transitions. [2022-11-25 17:31:33,743 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 62 transitions, 310 flow [2022-11-25 17:31:33,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 17:31:33,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 17:31:33,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 444 transitions. [2022-11-25 17:31:33,746 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4431137724550898 [2022-11-25 17:31:33,746 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 444 transitions. [2022-11-25 17:31:33,746 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 444 transitions. [2022-11-25 17:31:33,746 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:31:33,747 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 444 transitions. [2022-11-25 17:31:33,748 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 148.0) internal successors, (444), 3 states have internal predecessors, (444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:31:33,751 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 334.0) internal successors, (1336), 4 states have internal predecessors, (1336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:31:33,752 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 334.0) internal successors, (1336), 4 states have internal predecessors, (1336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:31:33,752 INFO L175 Difference]: Start difference. First operand has 43 places, 37 transitions, 118 flow. Second operand 3 states and 444 transitions. [2022-11-25 17:31:33,752 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 62 transitions, 310 flow [2022-11-25 17:31:33,753 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 62 transitions, 309 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-25 17:31:33,755 INFO L231 Difference]: Finished difference. Result has 45 places, 37 transitions, 130 flow [2022-11-25 17:31:33,755 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=334, PETRI_DIFFERENCE_MINUEND_FLOW=117, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=130, PETRI_PLACES=45, PETRI_TRANSITIONS=37} [2022-11-25 17:31:33,756 INFO L288 CegarLoopForPetriNet]: 65 programPoint places, -20 predicate places. [2022-11-25 17:31:33,756 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 37 transitions, 130 flow [2022-11-25 17:31:33,757 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 134.33333333333334) internal successors, (403), 3 states have internal predecessors, (403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:31:33,757 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:31:33,757 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:31:33,757 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-25 17:31:33,758 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2022-11-25 17:31:33,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:31:33,758 INFO L85 PathProgramCache]: Analyzing trace with hash 1675734387, now seen corresponding path program 1 times [2022-11-25 17:31:33,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:31:33,759 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360737350] [2022-11-25 17:31:33,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:31:33,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:31:33,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:31:34,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:31:34,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:31:34,134 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360737350] [2022-11-25 17:31:34,135 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360737350] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:31:34,135 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:31:34,135 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 17:31:34,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282833758] [2022-11-25 17:31:34,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:31:34,136 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:31:34,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:31:34,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:31:34,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 17:31:34,203 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 334 [2022-11-25 17:31:34,205 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 37 transitions, 130 flow. Second operand has 4 states, 4 states have (on average 128.75) internal successors, (515), 4 states have internal predecessors, (515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:31:34,205 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:31:34,205 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 334 [2022-11-25 17:31:34,205 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:31:35,097 INFO L130 PetriNetUnfolder]: 2375/3919 cut-off events. [2022-11-25 17:31:35,097 INFO L131 PetriNetUnfolder]: For 715/766 co-relation queries the response was YES. [2022-11-25 17:31:35,110 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9686 conditions, 3919 events. 2375/3919 cut-off events. For 715/766 co-relation queries the response was YES. Maximal size of possible extension queue 283. Compared 24477 event pairs, 1273 based on Foata normal form. 0/3361 useless extension candidates. Maximal degree in co-relation 9680. Up to 1963 conditions per place. [2022-11-25 17:31:35,134 INFO L137 encePairwiseOnDemand]: 329/334 looper letters, 55 selfloop transitions, 5 changer transitions 0/64 dead transitions. [2022-11-25 17:31:35,134 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 64 transitions, 332 flow [2022-11-25 17:31:35,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 17:31:35,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-25 17:31:35,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 556 transitions. [2022-11-25 17:31:35,138 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4161676646706587 [2022-11-25 17:31:35,138 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 556 transitions. [2022-11-25 17:31:35,138 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 556 transitions. [2022-11-25 17:31:35,139 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:31:35,139 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 556 transitions. [2022-11-25 17:31:35,141 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 139.0) internal successors, (556), 4 states have internal predecessors, (556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:31:35,145 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 334.0) internal successors, (1670), 5 states have internal predecessors, (1670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:31:35,146 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 334.0) internal successors, (1670), 5 states have internal predecessors, (1670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:31:35,147 INFO L175 Difference]: Start difference. First operand has 45 places, 37 transitions, 130 flow. Second operand 4 states and 556 transitions. [2022-11-25 17:31:35,147 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 64 transitions, 332 flow [2022-11-25 17:31:35,148 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 64 transitions, 326 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-25 17:31:35,150 INFO L231 Difference]: Finished difference. Result has 47 places, 39 transitions, 148 flow [2022-11-25 17:31:35,150 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=334, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=148, PETRI_PLACES=47, PETRI_TRANSITIONS=39} [2022-11-25 17:31:35,151 INFO L288 CegarLoopForPetriNet]: 65 programPoint places, -18 predicate places. [2022-11-25 17:31:35,152 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 39 transitions, 148 flow [2022-11-25 17:31:35,152 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 128.75) internal successors, (515), 4 states have internal predecessors, (515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:31:35,152 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:31:35,153 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:31:35,153 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-25 17:31:35,153 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2022-11-25 17:31:35,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:31:35,154 INFO L85 PathProgramCache]: Analyzing trace with hash 1675734381, now seen corresponding path program 1 times [2022-11-25 17:31:35,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:31:35,154 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452095599] [2022-11-25 17:31:35,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:31:35,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:31:35,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:31:35,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:31:35,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:31:35,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452095599] [2022-11-25 17:31:35,268 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452095599] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:31:35,268 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:31:35,268 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 17:31:35,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231633701] [2022-11-25 17:31:35,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:31:35,269 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 17:31:35,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:31:35,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 17:31:35,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:31:35,325 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 334 [2022-11-25 17:31:35,326 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 39 transitions, 148 flow. Second operand has 3 states, 3 states have (on average 127.66666666666667) internal successors, (383), 3 states have internal predecessors, (383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:31:35,326 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:31:35,327 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 334 [2022-11-25 17:31:35,327 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:31:36,069 INFO L130 PetriNetUnfolder]: 2415/4007 cut-off events. [2022-11-25 17:31:36,069 INFO L131 PetriNetUnfolder]: For 1351/1396 co-relation queries the response was YES. [2022-11-25 17:31:36,085 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9961 conditions, 4007 events. 2415/4007 cut-off events. For 1351/1396 co-relation queries the response was YES. Maximal size of possible extension queue 295. Compared 25383 event pairs, 1170 based on Foata normal form. 24/3479 useless extension candidates. Maximal degree in co-relation 9954. Up to 2770 conditions per place. [2022-11-25 17:31:36,104 INFO L137 encePairwiseOnDemand]: 326/334 looper letters, 45 selfloop transitions, 8 changer transitions 0/57 dead transitions. [2022-11-25 17:31:36,105 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 57 transitions, 304 flow [2022-11-25 17:31:36,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 17:31:36,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 17:31:36,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 421 transitions. [2022-11-25 17:31:36,107 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.42015968063872255 [2022-11-25 17:31:36,107 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 421 transitions. [2022-11-25 17:31:36,108 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 421 transitions. [2022-11-25 17:31:36,108 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:31:36,108 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 421 transitions. [2022-11-25 17:31:36,110 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 140.33333333333334) internal successors, (421), 3 states have internal predecessors, (421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:31:36,112 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 334.0) internal successors, (1336), 4 states have internal predecessors, (1336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:31:36,113 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 334.0) internal successors, (1336), 4 states have internal predecessors, (1336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:31:36,113 INFO L175 Difference]: Start difference. First operand has 47 places, 39 transitions, 148 flow. Second operand 3 states and 421 transitions. [2022-11-25 17:31:36,113 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 57 transitions, 304 flow [2022-11-25 17:31:36,115 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 57 transitions, 298 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-25 17:31:36,118 INFO L231 Difference]: Finished difference. Result has 48 places, 43 transitions, 192 flow [2022-11-25 17:31:36,118 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=334, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=192, PETRI_PLACES=48, PETRI_TRANSITIONS=43} [2022-11-25 17:31:36,122 INFO L288 CegarLoopForPetriNet]: 65 programPoint places, -17 predicate places. [2022-11-25 17:31:36,122 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 43 transitions, 192 flow [2022-11-25 17:31:36,123 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 127.66666666666667) internal successors, (383), 3 states have internal predecessors, (383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:31:36,123 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:31:36,123 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:31:36,123 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-25 17:31:36,123 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2022-11-25 17:31:36,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:31:36,124 INFO L85 PathProgramCache]: Analyzing trace with hash 112594107, now seen corresponding path program 2 times [2022-11-25 17:31:36,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:31:36,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550109757] [2022-11-25 17:31:36,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:31:36,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:31:36,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:31:36,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:31:36,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:31:36,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550109757] [2022-11-25 17:31:36,428 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550109757] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:31:36,429 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:31:36,429 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 17:31:36,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820814344] [2022-11-25 17:31:36,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:31:36,429 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 17:31:36,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:31:36,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 17:31:36,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:31:36,482 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 334 [2022-11-25 17:31:36,484 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 43 transitions, 192 flow. Second operand has 5 states, 5 states have (on average 129.2) internal successors, (646), 5 states have internal predecessors, (646), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:31:36,484 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:31:36,484 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 334 [2022-11-25 17:31:36,484 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:31:37,160 INFO L130 PetriNetUnfolder]: 2323/3867 cut-off events. [2022-11-25 17:31:37,160 INFO L131 PetriNetUnfolder]: For 2468/2507 co-relation queries the response was YES. [2022-11-25 17:31:37,177 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10379 conditions, 3867 events. 2323/3867 cut-off events. For 2468/2507 co-relation queries the response was YES. Maximal size of possible extension queue 293. Compared 24411 event pairs, 961 based on Foata normal form. 48/3368 useless extension candidates. Maximal degree in co-relation 10371. Up to 2728 conditions per place. [2022-11-25 17:31:37,196 INFO L137 encePairwiseOnDemand]: 330/334 looper letters, 58 selfloop transitions, 3 changer transitions 0/65 dead transitions. [2022-11-25 17:31:37,196 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 65 transitions, 386 flow [2022-11-25 17:31:37,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 17:31:37,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-25 17:31:37,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 557 transitions. [2022-11-25 17:31:37,200 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.41691616766467066 [2022-11-25 17:31:37,200 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 557 transitions. [2022-11-25 17:31:37,200 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 557 transitions. [2022-11-25 17:31:37,201 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:31:37,201 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 557 transitions. [2022-11-25 17:31:37,203 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 139.25) internal successors, (557), 4 states have internal predecessors, (557), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:31:37,206 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 334.0) internal successors, (1670), 5 states have internal predecessors, (1670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:31:37,207 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 334.0) internal successors, (1670), 5 states have internal predecessors, (1670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:31:37,207 INFO L175 Difference]: Start difference. First operand has 48 places, 43 transitions, 192 flow. Second operand 4 states and 557 transitions. [2022-11-25 17:31:37,208 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 65 transitions, 386 flow [2022-11-25 17:31:37,215 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 65 transitions, 371 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-25 17:31:37,218 INFO L231 Difference]: Finished difference. Result has 46 places, 41 transitions, 171 flow [2022-11-25 17:31:37,219 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=334, PETRI_DIFFERENCE_MINUEND_FLOW=165, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=171, PETRI_PLACES=46, PETRI_TRANSITIONS=41} [2022-11-25 17:31:37,219 INFO L288 CegarLoopForPetriNet]: 65 programPoint places, -19 predicate places. [2022-11-25 17:31:37,219 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 41 transitions, 171 flow [2022-11-25 17:31:37,220 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 129.2) internal successors, (646), 5 states have internal predecessors, (646), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:31:37,220 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:31:37,220 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:31:37,221 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-25 17:31:37,221 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2022-11-25 17:31:37,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:31:37,222 INFO L85 PathProgramCache]: Analyzing trace with hash 1675736869, now seen corresponding path program 1 times [2022-11-25 17:31:37,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:31:37,222 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074456318] [2022-11-25 17:31:37,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:31:37,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:31:37,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:31:37,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:31:37,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:31:37,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074456318] [2022-11-25 17:31:37,598 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074456318] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:31:37,598 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:31:37,598 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 17:31:37,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792676258] [2022-11-25 17:31:37,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:31:37,599 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:31:37,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:31:37,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:31:37,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 17:31:37,694 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 334 [2022-11-25 17:31:37,695 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 41 transitions, 171 flow. Second operand has 4 states, 4 states have (on average 129.75) internal successors, (519), 4 states have internal predecessors, (519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:31:37,695 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:31:37,696 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 334 [2022-11-25 17:31:37,696 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:31:38,338 INFO L130 PetriNetUnfolder]: 2298/3779 cut-off events. [2022-11-25 17:31:38,338 INFO L131 PetriNetUnfolder]: For 2421/2460 co-relation queries the response was YES. [2022-11-25 17:31:38,347 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9868 conditions, 3779 events. 2298/3779 cut-off events. For 2421/2460 co-relation queries the response was YES. Maximal size of possible extension queue 285. Compared 23364 event pairs, 819 based on Foata normal form. 0/3244 useless extension candidates. Maximal degree in co-relation 9861. Up to 3391 conditions per place. [2022-11-25 17:31:38,364 INFO L137 encePairwiseOnDemand]: 330/334 looper letters, 51 selfloop transitions, 4 changer transitions 0/59 dead transitions. [2022-11-25 17:31:38,364 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 59 transitions, 349 flow [2022-11-25 17:31:38,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 17:31:38,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 17:31:38,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 426 transitions. [2022-11-25 17:31:38,367 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4251497005988024 [2022-11-25 17:31:38,368 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 426 transitions. [2022-11-25 17:31:38,368 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 426 transitions. [2022-11-25 17:31:38,368 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:31:38,368 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 426 transitions. [2022-11-25 17:31:38,370 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 142.0) internal successors, (426), 3 states have internal predecessors, (426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:31:38,372 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 334.0) internal successors, (1336), 4 states have internal predecessors, (1336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:31:38,373 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 334.0) internal successors, (1336), 4 states have internal predecessors, (1336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:31:38,373 INFO L175 Difference]: Start difference. First operand has 46 places, 41 transitions, 171 flow. Second operand 3 states and 426 transitions. [2022-11-25 17:31:38,373 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 59 transitions, 349 flow [2022-11-25 17:31:38,378 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 59 transitions, 343 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-25 17:31:38,379 INFO L231 Difference]: Finished difference. Result has 47 places, 44 transitions, 205 flow [2022-11-25 17:31:38,379 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=334, PETRI_DIFFERENCE_MINUEND_FLOW=167, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=205, PETRI_PLACES=47, PETRI_TRANSITIONS=44} [2022-11-25 17:31:38,382 INFO L288 CegarLoopForPetriNet]: 65 programPoint places, -18 predicate places. [2022-11-25 17:31:38,383 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 44 transitions, 205 flow [2022-11-25 17:31:38,383 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 129.75) internal successors, (519), 4 states have internal predecessors, (519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:31:38,384 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:31:38,384 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:31:38,384 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-25 17:31:38,384 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2022-11-25 17:31:38,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:31:38,385 INFO L85 PathProgramCache]: Analyzing trace with hash 408233582, now seen corresponding path program 1 times [2022-11-25 17:31:38,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:31:38,385 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960528990] [2022-11-25 17:31:38,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:31:38,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:31:38,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:31:38,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:31:38,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:31:38,793 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960528990] [2022-11-25 17:31:38,797 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1960528990] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:31:38,798 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:31:38,798 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-25 17:31:38,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150306379] [2022-11-25 17:31:38,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:31:38,799 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 17:31:38,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:31:38,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 17:31:38,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:31:38,804 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 334 [2022-11-25 17:31:38,807 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 44 transitions, 205 flow. Second operand has 3 states, 3 states have (on average 134.0) internal successors, (402), 3 states have internal predecessors, (402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:31:38,807 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:31:38,807 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 334 [2022-11-25 17:31:38,808 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:31:39,488 INFO L130 PetriNetUnfolder]: 2264/3749 cut-off events. [2022-11-25 17:31:39,488 INFO L131 PetriNetUnfolder]: For 2443/2458 co-relation queries the response was YES. [2022-11-25 17:31:39,498 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10306 conditions, 3749 events. 2264/3749 cut-off events. For 2443/2458 co-relation queries the response was YES. Maximal size of possible extension queue 286. Compared 23408 event pairs, 491 based on Foata normal form. 12/3294 useless extension candidates. Maximal degree in co-relation 10298. Up to 2974 conditions per place. [2022-11-25 17:31:39,515 INFO L137 encePairwiseOnDemand]: 331/334 looper letters, 52 selfloop transitions, 3 changer transitions 0/59 dead transitions. [2022-11-25 17:31:39,515 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 59 transitions, 373 flow [2022-11-25 17:31:39,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 17:31:39,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 17:31:39,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 429 transitions. [2022-11-25 17:31:39,518 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4281437125748503 [2022-11-25 17:31:39,518 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 429 transitions. [2022-11-25 17:31:39,519 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 429 transitions. [2022-11-25 17:31:39,519 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:31:39,519 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 429 transitions. [2022-11-25 17:31:39,521 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 143.0) internal successors, (429), 3 states have internal predecessors, (429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:31:39,523 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 334.0) internal successors, (1336), 4 states have internal predecessors, (1336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:31:39,523 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 334.0) internal successors, (1336), 4 states have internal predecessors, (1336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:31:39,524 INFO L175 Difference]: Start difference. First operand has 47 places, 44 transitions, 205 flow. Second operand 3 states and 429 transitions. [2022-11-25 17:31:39,524 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 59 transitions, 373 flow [2022-11-25 17:31:39,531 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 59 transitions, 369 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-25 17:31:39,532 INFO L231 Difference]: Finished difference. Result has 49 places, 44 transitions, 212 flow [2022-11-25 17:31:39,533 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=334, PETRI_DIFFERENCE_MINUEND_FLOW=201, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=212, PETRI_PLACES=49, PETRI_TRANSITIONS=44} [2022-11-25 17:31:39,534 INFO L288 CegarLoopForPetriNet]: 65 programPoint places, -16 predicate places. [2022-11-25 17:31:39,535 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 44 transitions, 212 flow [2022-11-25 17:31:39,538 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 134.0) internal successors, (402), 3 states have internal predecessors, (402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:31:39,538 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:31:39,538 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:31:39,538 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-25 17:31:39,540 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2022-11-25 17:31:39,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:31:39,541 INFO L85 PathProgramCache]: Analyzing trace with hash 408235101, now seen corresponding path program 1 times [2022-11-25 17:31:39,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:31:39,544 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049323624] [2022-11-25 17:31:39,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:31:39,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:31:39,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:31:39,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:31:39,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:31:39,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049323624] [2022-11-25 17:31:39,922 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049323624] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:31:39,923 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:31:39,923 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 17:31:39,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567907886] [2022-11-25 17:31:39,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:31:39,924 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 17:31:39,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:31:39,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 17:31:39,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:31:40,025 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 334 [2022-11-25 17:31:40,026 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 44 transitions, 212 flow. Second operand has 5 states, 5 states have (on average 126.4) internal successors, (632), 5 states have internal predecessors, (632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:31:40,026 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:31:40,026 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 334 [2022-11-25 17:31:40,026 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:31:40,704 INFO L130 PetriNetUnfolder]: 2701/4370 cut-off events. [2022-11-25 17:31:40,704 INFO L131 PetriNetUnfolder]: For 4315/4368 co-relation queries the response was YES. [2022-11-25 17:31:40,719 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12769 conditions, 4370 events. 2701/4370 cut-off events. For 4315/4368 co-relation queries the response was YES. Maximal size of possible extension queue 338. Compared 27469 event pairs, 1302 based on Foata normal form. 17/3810 useless extension candidates. Maximal degree in co-relation 12760. Up to 3327 conditions per place. [2022-11-25 17:31:40,740 INFO L137 encePairwiseOnDemand]: 328/334 looper letters, 80 selfloop transitions, 12 changer transitions 0/96 dead transitions. [2022-11-25 17:31:40,740 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 96 transitions, 648 flow [2022-11-25 17:31:40,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 17:31:40,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-25 17:31:40,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 563 transitions. [2022-11-25 17:31:40,744 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4214071856287425 [2022-11-25 17:31:40,744 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 563 transitions. [2022-11-25 17:31:40,744 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 563 transitions. [2022-11-25 17:31:40,745 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:31:40,745 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 563 transitions. [2022-11-25 17:31:40,747 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 140.75) internal successors, (563), 4 states have internal predecessors, (563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:31:40,750 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 334.0) internal successors, (1670), 5 states have internal predecessors, (1670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:31:40,751 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 334.0) internal successors, (1670), 5 states have internal predecessors, (1670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:31:40,751 INFO L175 Difference]: Start difference. First operand has 49 places, 44 transitions, 212 flow. Second operand 4 states and 563 transitions. [2022-11-25 17:31:40,751 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 96 transitions, 648 flow [2022-11-25 17:31:40,761 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 96 transitions, 638 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-25 17:31:40,762 INFO L231 Difference]: Finished difference. Result has 52 places, 55 transitions, 352 flow [2022-11-25 17:31:40,763 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=334, PETRI_DIFFERENCE_MINUEND_FLOW=206, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=352, PETRI_PLACES=52, PETRI_TRANSITIONS=55} [2022-11-25 17:31:40,764 INFO L288 CegarLoopForPetriNet]: 65 programPoint places, -13 predicate places. [2022-11-25 17:31:40,764 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 55 transitions, 352 flow [2022-11-25 17:31:40,764 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 126.4) internal successors, (632), 5 states have internal predecessors, (632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:31:40,765 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:31:40,765 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:31:40,765 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-25 17:31:40,765 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2022-11-25 17:31:40,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:31:40,766 INFO L85 PathProgramCache]: Analyzing trace with hash -229661132, now seen corresponding path program 1 times [2022-11-25 17:31:40,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:31:40,767 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882249339] [2022-11-25 17:31:40,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:31:40,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:31:40,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:31:41,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:31:41,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:31:41,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882249339] [2022-11-25 17:31:41,023 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882249339] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:31:41,023 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:31:41,024 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 17:31:41,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25014149] [2022-11-25 17:31:41,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:31:41,024 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:31:41,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:31:41,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:31:41,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 17:31:41,034 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 334 [2022-11-25 17:31:41,035 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 55 transitions, 352 flow. Second operand has 4 states, 4 states have (on average 131.25) internal successors, (525), 4 states have internal predecessors, (525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:31:41,035 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:31:41,035 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 334 [2022-11-25 17:31:41,035 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:31:41,875 INFO L130 PetriNetUnfolder]: 3419/5626 cut-off events. [2022-11-25 17:31:41,875 INFO L131 PetriNetUnfolder]: For 7118/7216 co-relation queries the response was YES. [2022-11-25 17:31:41,887 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16978 conditions, 5626 events. 3419/5626 cut-off events. For 7118/7216 co-relation queries the response was YES. Maximal size of possible extension queue 468. Compared 39506 event pairs, 558 based on Foata normal form. 82/4939 useless extension candidates. Maximal degree in co-relation 16967. Up to 2503 conditions per place. [2022-11-25 17:31:41,908 INFO L137 encePairwiseOnDemand]: 330/334 looper letters, 94 selfloop transitions, 6 changer transitions 0/104 dead transitions. [2022-11-25 17:31:41,909 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 104 transitions, 763 flow [2022-11-25 17:31:41,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 17:31:41,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-25 17:31:41,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 573 transitions. [2022-11-25 17:31:41,912 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.42889221556886226 [2022-11-25 17:31:41,912 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 573 transitions. [2022-11-25 17:31:41,912 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 573 transitions. [2022-11-25 17:31:41,913 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:31:41,913 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 573 transitions. [2022-11-25 17:31:41,915 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 143.25) internal successors, (573), 4 states have internal predecessors, (573), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:31:41,918 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 334.0) internal successors, (1670), 5 states have internal predecessors, (1670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:31:41,919 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 334.0) internal successors, (1670), 5 states have internal predecessors, (1670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:31:41,919 INFO L175 Difference]: Start difference. First operand has 52 places, 55 transitions, 352 flow. Second operand 4 states and 573 transitions. [2022-11-25 17:31:41,919 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 104 transitions, 763 flow [2022-11-25 17:31:41,944 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 104 transitions, 761 flow, removed 1 selfloop flow, removed 0 redundant places. [2022-11-25 17:31:41,947 INFO L231 Difference]: Finished difference. Result has 57 places, 57 transitions, 390 flow [2022-11-25 17:31:41,947 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=334, PETRI_DIFFERENCE_MINUEND_FLOW=350, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=390, PETRI_PLACES=57, PETRI_TRANSITIONS=57} [2022-11-25 17:31:41,948 INFO L288 CegarLoopForPetriNet]: 65 programPoint places, -8 predicate places. [2022-11-25 17:31:41,948 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 57 transitions, 390 flow [2022-11-25 17:31:41,948 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 131.25) internal successors, (525), 4 states have internal predecessors, (525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:31:41,949 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:31:41,949 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:31:41,949 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-25 17:31:41,949 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2022-11-25 17:31:41,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:31:41,950 INFO L85 PathProgramCache]: Analyzing trace with hash -229676508, now seen corresponding path program 1 times [2022-11-25 17:31:41,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:31:41,950 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226300525] [2022-11-25 17:31:41,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:31:41,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:31:41,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:31:42,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:31:42,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:31:42,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226300525] [2022-11-25 17:31:42,305 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226300525] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:31:42,306 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:31:42,306 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 17:31:42,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164311815] [2022-11-25 17:31:42,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:31:42,307 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:31:42,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:31:42,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:31:42,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 17:31:42,403 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 334 [2022-11-25 17:31:42,403 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 57 transitions, 390 flow. Second operand has 4 states, 4 states have (on average 131.25) internal successors, (525), 4 states have internal predecessors, (525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:31:42,404 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:31:42,404 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 334 [2022-11-25 17:31:42,404 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:31:43,242 INFO L130 PetriNetUnfolder]: 3421/5672 cut-off events. [2022-11-25 17:31:43,243 INFO L131 PetriNetUnfolder]: For 8816/8886 co-relation queries the response was YES. [2022-11-25 17:31:43,253 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18084 conditions, 5672 events. 3421/5672 cut-off events. For 8816/8886 co-relation queries the response was YES. Maximal size of possible extension queue 476. Compared 38603 event pairs, 2157 based on Foata normal form. 6/4861 useless extension candidates. Maximal degree in co-relation 18070. Up to 4000 conditions per place. [2022-11-25 17:31:43,271 INFO L137 encePairwiseOnDemand]: 331/334 looper letters, 61 selfloop transitions, 13 changer transitions 0/78 dead transitions. [2022-11-25 17:31:43,271 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 78 transitions, 618 flow [2022-11-25 17:31:43,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 17:31:43,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 17:31:43,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 431 transitions. [2022-11-25 17:31:43,273 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4301397205588822 [2022-11-25 17:31:43,274 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 431 transitions. [2022-11-25 17:31:43,274 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 431 transitions. [2022-11-25 17:31:43,274 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:31:43,274 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 431 transitions. [2022-11-25 17:31:43,275 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 143.66666666666666) internal successors, (431), 3 states have internal predecessors, (431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:31:43,277 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 334.0) internal successors, (1336), 4 states have internal predecessors, (1336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:31:43,278 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 334.0) internal successors, (1336), 4 states have internal predecessors, (1336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:31:43,278 INFO L175 Difference]: Start difference. First operand has 57 places, 57 transitions, 390 flow. Second operand 3 states and 431 transitions. [2022-11-25 17:31:43,278 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 78 transitions, 618 flow [2022-11-25 17:31:43,294 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 78 transitions, 609 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-11-25 17:31:43,297 INFO L231 Difference]: Finished difference. Result has 58 places, 57 transitions, 422 flow [2022-11-25 17:31:43,297 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=334, PETRI_DIFFERENCE_MINUEND_FLOW=381, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=422, PETRI_PLACES=58, PETRI_TRANSITIONS=57} [2022-11-25 17:31:43,298 INFO L288 CegarLoopForPetriNet]: 65 programPoint places, -7 predicate places. [2022-11-25 17:31:43,298 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 57 transitions, 422 flow [2022-11-25 17:31:43,298 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 131.25) internal successors, (525), 4 states have internal predecessors, (525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:31:43,299 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:31:43,299 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:31:43,299 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-25 17:31:43,299 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2022-11-25 17:31:43,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:31:43,300 INFO L85 PathProgramCache]: Analyzing trace with hash -229595724, now seen corresponding path program 1 times [2022-11-25 17:31:43,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:31:43,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029570131] [2022-11-25 17:31:43,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:31:43,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:31:43,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:31:43,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:31:43,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:31:43,527 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029570131] [2022-11-25 17:31:43,527 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029570131] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:31:43,527 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:31:43,528 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 17:31:43,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882735069] [2022-11-25 17:31:43,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:31:43,528 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 17:31:43,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:31:43,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 17:31:43,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:31:43,602 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 334 [2022-11-25 17:31:43,603 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 57 transitions, 422 flow. Second operand has 5 states, 5 states have (on average 124.6) internal successors, (623), 5 states have internal predecessors, (623), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:31:43,603 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:31:43,603 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 334 [2022-11-25 17:31:43,603 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:31:44,460 INFO L130 PetriNetUnfolder]: 3458/5593 cut-off events. [2022-11-25 17:31:44,460 INFO L131 PetriNetUnfolder]: For 8578/8578 co-relation queries the response was YES. [2022-11-25 17:31:44,473 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18465 conditions, 5593 events. 3458/5593 cut-off events. For 8578/8578 co-relation queries the response was YES. Maximal size of possible extension queue 458. Compared 36065 event pairs, 1102 based on Foata normal form. 25/4949 useless extension candidates. Maximal degree in co-relation 18450. Up to 3366 conditions per place. [2022-11-25 17:31:44,490 INFO L137 encePairwiseOnDemand]: 327/334 looper letters, 88 selfloop transitions, 6 changer transitions 0/95 dead transitions. [2022-11-25 17:31:44,490 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 95 transitions, 950 flow [2022-11-25 17:31:44,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 17:31:44,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-25 17:31:44,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 536 transitions. [2022-11-25 17:31:44,493 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.40119760479041916 [2022-11-25 17:31:44,493 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 536 transitions. [2022-11-25 17:31:44,493 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 536 transitions. [2022-11-25 17:31:44,494 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:31:44,494 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 536 transitions. [2022-11-25 17:31:44,496 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 134.0) internal successors, (536), 4 states have internal predecessors, (536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:31:44,499 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 334.0) internal successors, (1670), 5 states have internal predecessors, (1670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:31:44,499 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 334.0) internal successors, (1670), 5 states have internal predecessors, (1670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:31:44,500 INFO L175 Difference]: Start difference. First operand has 58 places, 57 transitions, 422 flow. Second operand 4 states and 536 transitions. [2022-11-25 17:31:44,500 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 95 transitions, 950 flow [2022-11-25 17:31:44,513 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 95 transitions, 900 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-25 17:31:44,515 INFO L231 Difference]: Finished difference. Result has 60 places, 57 transitions, 421 flow [2022-11-25 17:31:44,515 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=334, PETRI_DIFFERENCE_MINUEND_FLOW=396, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=421, PETRI_PLACES=60, PETRI_TRANSITIONS=57} [2022-11-25 17:31:44,516 INFO L288 CegarLoopForPetriNet]: 65 programPoint places, -5 predicate places. [2022-11-25 17:31:44,516 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 57 transitions, 421 flow [2022-11-25 17:31:44,516 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 124.6) internal successors, (623), 5 states have internal predecessors, (623), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:31:44,517 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:31:44,517 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:31:44,517 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-25 17:31:44,517 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2022-11-25 17:31:44,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:31:44,518 INFO L85 PathProgramCache]: Analyzing trace with hash -2023233107, now seen corresponding path program 1 times [2022-11-25 17:31:44,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:31:44,518 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7168068] [2022-11-25 17:31:44,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:31:44,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:31:44,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:31:44,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:31:44,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:31:44,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7168068] [2022-11-25 17:31:44,777 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7168068] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:31:44,777 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:31:44,777 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 17:31:44,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180009537] [2022-11-25 17:31:44,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:31:44,779 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:31:44,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:31:44,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:31:44,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 17:31:44,794 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 334 [2022-11-25 17:31:44,795 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 57 transitions, 421 flow. Second operand has 4 states, 4 states have (on average 127.5) internal successors, (510), 4 states have internal predecessors, (510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:31:44,795 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:31:44,796 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 334 [2022-11-25 17:31:44,796 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:31:45,301 INFO L130 PetriNetUnfolder]: 1759/3199 cut-off events. [2022-11-25 17:31:45,301 INFO L131 PetriNetUnfolder]: For 5221/5318 co-relation queries the response was YES. [2022-11-25 17:31:45,339 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10972 conditions, 3199 events. 1759/3199 cut-off events. For 5221/5318 co-relation queries the response was YES. Maximal size of possible extension queue 276. Compared 21734 event pairs, 508 based on Foata normal form. 103/2974 useless extension candidates. Maximal degree in co-relation 10956. Up to 2677 conditions per place. [2022-11-25 17:31:45,345 INFO L137 encePairwiseOnDemand]: 328/334 looper letters, 71 selfloop transitions, 4 changer transitions 33/112 dead transitions. [2022-11-25 17:31:45,345 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 112 transitions, 1062 flow [2022-11-25 17:31:45,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 17:31:45,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-25 17:31:45,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 676 transitions. [2022-11-25 17:31:45,348 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.40479041916167663 [2022-11-25 17:31:45,349 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 676 transitions. [2022-11-25 17:31:45,349 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 676 transitions. [2022-11-25 17:31:45,349 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:31:45,349 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 676 transitions. [2022-11-25 17:31:45,351 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 135.2) internal successors, (676), 5 states have internal predecessors, (676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:31:45,354 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 334.0) internal successors, (2004), 6 states have internal predecessors, (2004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:31:45,355 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 334.0) internal successors, (2004), 6 states have internal predecessors, (2004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:31:45,355 INFO L175 Difference]: Start difference. First operand has 60 places, 57 transitions, 421 flow. Second operand 5 states and 676 transitions. [2022-11-25 17:31:45,355 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 112 transitions, 1062 flow [2022-11-25 17:31:45,366 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 112 transitions, 1050 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-25 17:31:45,368 INFO L231 Difference]: Finished difference. Result has 64 places, 59 transitions, 431 flow [2022-11-25 17:31:45,368 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=334, PETRI_DIFFERENCE_MINUEND_FLOW=395, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=431, PETRI_PLACES=64, PETRI_TRANSITIONS=59} [2022-11-25 17:31:45,368 INFO L288 CegarLoopForPetriNet]: 65 programPoint places, -1 predicate places. [2022-11-25 17:31:45,369 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 59 transitions, 431 flow [2022-11-25 17:31:45,369 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 127.5) internal successors, (510), 4 states have internal predecessors, (510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:31:45,369 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:31:45,369 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:31:45,370 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-25 17:31:45,370 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2022-11-25 17:31:45,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:31:45,370 INFO L85 PathProgramCache]: Analyzing trace with hash 1684670749, now seen corresponding path program 1 times [2022-11-25 17:31:45,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:31:45,371 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261602062] [2022-11-25 17:31:45,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:31:45,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:31:45,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:31:46,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:31:46,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:31:46,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261602062] [2022-11-25 17:31:46,561 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1261602062] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:31:46,561 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:31:46,562 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-25 17:31:46,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73575125] [2022-11-25 17:31:46,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:31:46,562 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-25 17:31:46,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:31:46,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-25 17:31:46,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-11-25 17:31:46,890 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 334 [2022-11-25 17:31:46,891 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 59 transitions, 431 flow. Second operand has 9 states, 9 states have (on average 115.66666666666667) internal successors, (1041), 9 states have internal predecessors, (1041), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:31:46,891 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:31:46,892 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 334 [2022-11-25 17:31:46,892 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:31:47,992 INFO L130 PetriNetUnfolder]: 1784/3225 cut-off events. [2022-11-25 17:31:47,992 INFO L131 PetriNetUnfolder]: For 6466/6466 co-relation queries the response was YES. [2022-11-25 17:31:47,998 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12924 conditions, 3225 events. 1784/3225 cut-off events. For 6466/6466 co-relation queries the response was YES. Maximal size of possible extension queue 299. Compared 21726 event pairs, 282 based on Foata normal form. 6/2937 useless extension candidates. Maximal degree in co-relation 12905. Up to 2379 conditions per place. [2022-11-25 17:31:48,005 INFO L137 encePairwiseOnDemand]: 324/334 looper letters, 100 selfloop transitions, 37 changer transitions 0/138 dead transitions. [2022-11-25 17:31:48,005 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 138 transitions, 1236 flow [2022-11-25 17:31:48,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-25 17:31:48,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-11-25 17:31:48,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1576 transitions. [2022-11-25 17:31:48,011 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.36296637494242284 [2022-11-25 17:31:48,011 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1576 transitions. [2022-11-25 17:31:48,011 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1576 transitions. [2022-11-25 17:31:48,012 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:31:48,012 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1576 transitions. [2022-11-25 17:31:48,016 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 121.23076923076923) internal successors, (1576), 13 states have internal predecessors, (1576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:31:48,023 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 334.0) internal successors, (4676), 14 states have internal predecessors, (4676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:31:48,025 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 334.0) internal successors, (4676), 14 states have internal predecessors, (4676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:31:48,025 INFO L175 Difference]: Start difference. First operand has 64 places, 59 transitions, 431 flow. Second operand 13 states and 1576 transitions. [2022-11-25 17:31:48,025 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 138 transitions, 1236 flow [2022-11-25 17:31:48,036 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 138 transitions, 1219 flow, removed 3 selfloop flow, removed 2 redundant places. [2022-11-25 17:31:48,039 INFO L231 Difference]: Finished difference. Result has 76 places, 87 transitions, 797 flow [2022-11-25 17:31:48,039 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=334, PETRI_DIFFERENCE_MINUEND_FLOW=425, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=797, PETRI_PLACES=76, PETRI_TRANSITIONS=87} [2022-11-25 17:31:48,040 INFO L288 CegarLoopForPetriNet]: 65 programPoint places, 11 predicate places. [2022-11-25 17:31:48,040 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 87 transitions, 797 flow [2022-11-25 17:31:48,040 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 115.66666666666667) internal successors, (1041), 9 states have internal predecessors, (1041), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:31:48,041 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:31:48,041 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:31:48,041 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-25 17:31:48,041 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2022-11-25 17:31:48,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:31:48,042 INFO L85 PathProgramCache]: Analyzing trace with hash -1033166250, now seen corresponding path program 1 times [2022-11-25 17:31:48,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:31:48,042 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118717644] [2022-11-25 17:31:48,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:31:48,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:31:48,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:31:48,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:31:48,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:31:48,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118717644] [2022-11-25 17:31:48,272 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1118717644] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:31:48,272 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:31:48,272 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 17:31:48,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672015371] [2022-11-25 17:31:48,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:31:48,273 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 17:31:48,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:31:48,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 17:31:48,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:31:48,291 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 334 [2022-11-25 17:31:48,292 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 87 transitions, 797 flow. Second operand has 5 states, 5 states have (on average 127.0) internal successors, (635), 5 states have internal predecessors, (635), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:31:48,293 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:31:48,293 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 334 [2022-11-25 17:31:48,293 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:31:48,632 INFO L130 PetriNetUnfolder]: 484/1060 cut-off events. [2022-11-25 17:31:48,632 INFO L131 PetriNetUnfolder]: For 2945/2991 co-relation queries the response was YES. [2022-11-25 17:31:48,636 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4483 conditions, 1060 events. 484/1060 cut-off events. For 2945/2991 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 6424 event pairs, 72 based on Foata normal form. 72/1058 useless extension candidates. Maximal degree in co-relation 4461. Up to 616 conditions per place. [2022-11-25 17:31:48,640 INFO L137 encePairwiseOnDemand]: 328/334 looper letters, 93 selfloop transitions, 10 changer transitions 21/130 dead transitions. [2022-11-25 17:31:48,640 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 130 transitions, 1424 flow [2022-11-25 17:31:48,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 17:31:48,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-25 17:31:48,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 810 transitions. [2022-11-25 17:31:48,643 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4041916167664671 [2022-11-25 17:31:48,643 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 810 transitions. [2022-11-25 17:31:48,643 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 810 transitions. [2022-11-25 17:31:48,644 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:31:48,644 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 810 transitions. [2022-11-25 17:31:48,646 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 135.0) internal successors, (810), 6 states have internal predecessors, (810), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:31:48,650 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 334.0) internal successors, (2338), 7 states have internal predecessors, (2338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:31:48,651 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 334.0) internal successors, (2338), 7 states have internal predecessors, (2338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:31:48,651 INFO L175 Difference]: Start difference. First operand has 76 places, 87 transitions, 797 flow. Second operand 6 states and 810 transitions. [2022-11-25 17:31:48,651 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 130 transitions, 1424 flow [2022-11-25 17:31:48,659 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 130 transitions, 1364 flow, removed 30 selfloop flow, removed 2 redundant places. [2022-11-25 17:31:48,661 INFO L231 Difference]: Finished difference. Result has 79 places, 74 transitions, 633 flow [2022-11-25 17:31:48,661 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=334, PETRI_DIFFERENCE_MINUEND_FLOW=559, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=633, PETRI_PLACES=79, PETRI_TRANSITIONS=74} [2022-11-25 17:31:48,662 INFO L288 CegarLoopForPetriNet]: 65 programPoint places, 14 predicate places. [2022-11-25 17:31:48,662 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 74 transitions, 633 flow [2022-11-25 17:31:48,663 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 127.0) internal successors, (635), 5 states have internal predecessors, (635), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:31:48,663 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:31:48,663 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:31:48,663 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-25 17:31:48,663 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2022-11-25 17:31:48,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:31:48,664 INFO L85 PathProgramCache]: Analyzing trace with hash 1190262219, now seen corresponding path program 1 times [2022-11-25 17:31:48,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:31:48,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738853709] [2022-11-25 17:31:48,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:31:48,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:31:48,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:31:48,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:31:48,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:31:48,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738853709] [2022-11-25 17:31:48,858 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738853709] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:31:48,858 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:31:48,858 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 17:31:48,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277590158] [2022-11-25 17:31:48,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:31:48,859 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:31:48,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:31:48,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:31:48,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 17:31:48,869 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 334 [2022-11-25 17:31:48,870 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 74 transitions, 633 flow. Second operand has 4 states, 4 states have (on average 132.25) internal successors, (529), 4 states have internal predecessors, (529), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:31:48,870 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:31:48,870 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 334 [2022-11-25 17:31:48,870 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:31:49,304 INFO L130 PetriNetUnfolder]: 879/1953 cut-off events. [2022-11-25 17:31:49,304 INFO L131 PetriNetUnfolder]: For 6047/6049 co-relation queries the response was YES. [2022-11-25 17:31:49,309 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8731 conditions, 1953 events. 879/1953 cut-off events. For 6047/6049 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 13480 event pairs, 223 based on Foata normal form. 12/1831 useless extension candidates. Maximal degree in co-relation 8707. Up to 966 conditions per place. [2022-11-25 17:31:49,315 INFO L137 encePairwiseOnDemand]: 331/334 looper letters, 118 selfloop transitions, 3 changer transitions 6/132 dead transitions. [2022-11-25 17:31:49,315 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 132 transitions, 1280 flow [2022-11-25 17:31:49,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 17:31:49,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-25 17:31:49,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 573 transitions. [2022-11-25 17:31:49,318 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.42889221556886226 [2022-11-25 17:31:49,318 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 573 transitions. [2022-11-25 17:31:49,318 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 573 transitions. [2022-11-25 17:31:49,319 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:31:49,319 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 573 transitions. [2022-11-25 17:31:49,320 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 143.25) internal successors, (573), 4 states have internal predecessors, (573), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:31:49,322 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 334.0) internal successors, (1670), 5 states have internal predecessors, (1670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:31:49,323 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 334.0) internal successors, (1670), 5 states have internal predecessors, (1670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:31:49,323 INFO L175 Difference]: Start difference. First operand has 79 places, 74 transitions, 633 flow. Second operand 4 states and 573 transitions. [2022-11-25 17:31:49,323 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 132 transitions, 1280 flow [2022-11-25 17:31:49,347 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 132 transitions, 1211 flow, removed 30 selfloop flow, removed 1 redundant places. [2022-11-25 17:31:49,349 INFO L231 Difference]: Finished difference. Result has 83 places, 74 transitions, 615 flow [2022-11-25 17:31:49,349 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=334, PETRI_DIFFERENCE_MINUEND_FLOW=605, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=615, PETRI_PLACES=83, PETRI_TRANSITIONS=74} [2022-11-25 17:31:49,350 INFO L288 CegarLoopForPetriNet]: 65 programPoint places, 18 predicate places. [2022-11-25 17:31:49,350 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 74 transitions, 615 flow [2022-11-25 17:31:49,350 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 132.25) internal successors, (529), 4 states have internal predecessors, (529), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:31:49,350 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:31:49,351 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:31:49,351 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-25 17:31:49,351 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2022-11-25 17:31:49,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:31:49,352 INFO L85 PathProgramCache]: Analyzing trace with hash 1070299269, now seen corresponding path program 2 times [2022-11-25 17:31:49,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:31:49,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744956191] [2022-11-25 17:31:49,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:31:49,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:31:49,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:31:49,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:31:49,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:31:49,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744956191] [2022-11-25 17:31:49,571 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744956191] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:31:49,571 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:31:49,571 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 17:31:49,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927806773] [2022-11-25 17:31:49,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:31:49,572 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 17:31:49,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:31:49,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 17:31:49,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-25 17:31:49,587 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 334 [2022-11-25 17:31:49,588 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 74 transitions, 615 flow. Second operand has 6 states, 6 states have (on average 126.66666666666667) internal successors, (760), 6 states have internal predecessors, (760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:31:49,588 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:31:49,588 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 334 [2022-11-25 17:31:49,589 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:31:49,907 INFO L130 PetriNetUnfolder]: 346/825 cut-off events. [2022-11-25 17:31:49,908 INFO L131 PetriNetUnfolder]: For 2923/2946 co-relation queries the response was YES. [2022-11-25 17:31:49,911 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3761 conditions, 825 events. 346/825 cut-off events. For 2923/2946 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 5217 event pairs, 21 based on Foata normal form. 70/866 useless extension candidates. Maximal degree in co-relation 3734. Up to 250 conditions per place. [2022-11-25 17:31:49,913 INFO L137 encePairwiseOnDemand]: 328/334 looper letters, 72 selfloop transitions, 13 changer transitions 22/111 dead transitions. [2022-11-25 17:31:49,913 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 111 transitions, 1247 flow [2022-11-25 17:31:49,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 17:31:49,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-11-25 17:31:49,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1054 transitions. [2022-11-25 17:31:49,917 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.3944610778443114 [2022-11-25 17:31:49,917 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1054 transitions. [2022-11-25 17:31:49,917 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1054 transitions. [2022-11-25 17:31:49,918 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:31:49,918 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1054 transitions. [2022-11-25 17:31:49,920 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 131.75) internal successors, (1054), 8 states have internal predecessors, (1054), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:31:49,924 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 334.0) internal successors, (3006), 9 states have internal predecessors, (3006), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:31:49,925 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 334.0) internal successors, (3006), 9 states have internal predecessors, (3006), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:31:49,925 INFO L175 Difference]: Start difference. First operand has 83 places, 74 transitions, 615 flow. Second operand 8 states and 1054 transitions. [2022-11-25 17:31:49,925 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 111 transitions, 1247 flow [2022-11-25 17:31:49,936 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 111 transitions, 1116 flow, removed 18 selfloop flow, removed 8 redundant places. [2022-11-25 17:31:49,938 INFO L231 Difference]: Finished difference. Result has 79 places, 56 transitions, 457 flow [2022-11-25 17:31:49,938 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=334, PETRI_DIFFERENCE_MINUEND_FLOW=412, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=457, PETRI_PLACES=79, PETRI_TRANSITIONS=56} [2022-11-25 17:31:49,939 INFO L288 CegarLoopForPetriNet]: 65 programPoint places, 14 predicate places. [2022-11-25 17:31:49,939 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 56 transitions, 457 flow [2022-11-25 17:31:49,940 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 126.66666666666667) internal successors, (760), 6 states have internal predecessors, (760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:31:49,940 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:31:49,940 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] [2022-11-25 17:31:49,940 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-25 17:31:49,940 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2022-11-25 17:31:49,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:31:49,941 INFO L85 PathProgramCache]: Analyzing trace with hash -1362897877, now seen corresponding path program 1 times [2022-11-25 17:31:49,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:31:49,941 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202641297] [2022-11-25 17:31:49,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:31:49,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:31:50,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 17:31:50,010 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 17:31:50,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 17:31:50,094 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 17:31:50,098 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-11-25 17:31:50,100 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK (52 of 53 remaining) [2022-11-25 17:31:50,102 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 53 remaining) [2022-11-25 17:31:50,104 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 53 remaining) [2022-11-25 17:31:50,104 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 53 remaining) [2022-11-25 17:31:50,107 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 53 remaining) [2022-11-25 17:31:50,108 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 53 remaining) [2022-11-25 17:31:50,108 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 53 remaining) [2022-11-25 17:31:50,108 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 53 remaining) [2022-11-25 17:31:50,108 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 53 remaining) [2022-11-25 17:31:50,109 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 53 remaining) [2022-11-25 17:31:50,109 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 53 remaining) [2022-11-25 17:31:50,109 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 53 remaining) [2022-11-25 17:31:50,109 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 53 remaining) [2022-11-25 17:31:50,109 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 53 remaining) [2022-11-25 17:31:50,110 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 53 remaining) [2022-11-25 17:31:50,110 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 53 remaining) [2022-11-25 17:31:50,110 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 53 remaining) [2022-11-25 17:31:50,110 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 53 remaining) [2022-11-25 17:31:50,110 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 53 remaining) [2022-11-25 17:31:50,111 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 53 remaining) [2022-11-25 17:31:50,111 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 53 remaining) [2022-11-25 17:31:50,111 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 53 remaining) [2022-11-25 17:31:50,111 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 53 remaining) [2022-11-25 17:31:50,111 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 53 remaining) [2022-11-25 17:31:50,112 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 53 remaining) [2022-11-25 17:31:50,112 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 53 remaining) [2022-11-25 17:31:50,112 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 53 remaining) [2022-11-25 17:31:50,112 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 53 remaining) [2022-11-25 17:31:50,113 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 53 remaining) [2022-11-25 17:31:50,113 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 53 remaining) [2022-11-25 17:31:50,113 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 53 remaining) [2022-11-25 17:31:50,113 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK (21 of 53 remaining) [2022-11-25 17:31:50,114 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (20 of 53 remaining) [2022-11-25 17:31:50,114 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (19 of 53 remaining) [2022-11-25 17:31:50,114 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (18 of 53 remaining) [2022-11-25 17:31:50,114 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 53 remaining) [2022-11-25 17:31:50,114 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 53 remaining) [2022-11-25 17:31:50,115 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 53 remaining) [2022-11-25 17:31:50,115 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 53 remaining) [2022-11-25 17:31:50,115 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 53 remaining) [2022-11-25 17:31:50,115 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 53 remaining) [2022-11-25 17:31:50,115 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 53 remaining) [2022-11-25 17:31:50,116 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 53 remaining) [2022-11-25 17:31:50,116 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 53 remaining) [2022-11-25 17:31:50,116 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 53 remaining) [2022-11-25 17:31:50,116 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 53 remaining) [2022-11-25 17:31:50,116 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 53 remaining) [2022-11-25 17:31:50,116 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 53 remaining) [2022-11-25 17:31:50,117 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 53 remaining) [2022-11-25 17:31:50,117 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 53 remaining) [2022-11-25 17:31:50,117 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 53 remaining) [2022-11-25 17:31:50,117 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 53 remaining) [2022-11-25 17:31:50,117 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 53 remaining) [2022-11-25 17:31:50,118 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-25 17:31:50,118 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:31:50,125 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-25 17:31:50,126 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-25 17:31:50,243 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 05:31:50 BasicIcfg [2022-11-25 17:31:50,244 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-25 17:31:50,244 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-25 17:31:50,244 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-25 17:31:50,244 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-25 17:31:50,245 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:31:12" (3/4) ... [2022-11-25 17:31:50,248 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-25 17:31:50,248 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-25 17:31:50,249 INFO L158 Benchmark]: Toolchain (without parser) took 40182.57ms. Allocated memory was 148.9MB in the beginning and 998.2MB in the end (delta: 849.3MB). Free memory was 103.9MB in the beginning and 779.1MB in the end (delta: -675.3MB). Peak memory consumption was 176.3MB. Max. memory is 16.1GB. [2022-11-25 17:31:50,249 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 148.9MB. Free memory is still 115.1MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 17:31:50,249 INFO L158 Benchmark]: CACSL2BoogieTranslator took 798.01ms. Allocated memory is still 148.9MB. Free memory was 103.9MB in the beginning and 77.7MB in the end (delta: 26.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2022-11-25 17:31:50,250 INFO L158 Benchmark]: Boogie Procedure Inliner took 88.54ms. Allocated memory is still 148.9MB. Free memory was 77.7MB in the beginning and 75.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 17:31:50,250 INFO L158 Benchmark]: Boogie Preprocessor took 66.41ms. Allocated memory is still 148.9MB. Free memory was 75.6MB in the beginning and 73.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 17:31:50,250 INFO L158 Benchmark]: RCFGBuilder took 1191.11ms. Allocated memory is still 148.9MB. Free memory was 73.5MB in the beginning and 79.0MB in the end (delta: -5.4MB). Peak memory consumption was 38.6MB. Max. memory is 16.1GB. [2022-11-25 17:31:50,251 INFO L158 Benchmark]: TraceAbstraction took 38025.30ms. Allocated memory was 148.9MB in the beginning and 998.2MB in the end (delta: 849.3MB). Free memory was 78.2MB in the beginning and 779.1MB in the end (delta: -700.9MB). Peak memory consumption was 148.1MB. Max. memory is 16.1GB. [2022-11-25 17:31:50,251 INFO L158 Benchmark]: Witness Printer took 3.99ms. Allocated memory is still 998.2MB. Free memory is still 779.1MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 17:31:50,252 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.23ms. Allocated memory is still 148.9MB. Free memory is still 115.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 798.01ms. Allocated memory is still 148.9MB. Free memory was 103.9MB in the beginning and 77.7MB in the end (delta: 26.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 88.54ms. Allocated memory is still 148.9MB. Free memory was 77.7MB in the beginning and 75.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 66.41ms. Allocated memory is still 148.9MB. Free memory was 75.6MB in the beginning and 73.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1191.11ms. Allocated memory is still 148.9MB. Free memory was 73.5MB in the beginning and 79.0MB in the end (delta: -5.4MB). Peak memory consumption was 38.6MB. Max. memory is 16.1GB. * TraceAbstraction took 38025.30ms. Allocated memory was 148.9MB in the beginning and 998.2MB in the end (delta: 849.3MB). Free memory was 78.2MB in the beginning and 779.1MB in the end (delta: -700.9MB). Peak memory consumption was 148.1MB. Max. memory is 16.1GB. * Witness Printer took 3.99ms. Allocated memory is still 998.2MB. Free memory is still 779.1MB. 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: 16.6s, 169 PlacesBefore, 65 PlacesAfterwards, 161 TransitionsBefore, 56 TransitionsAfterwards, 4540 CoEnabledTransitionPairs, 8 FixpointIterations, 71 TrivialSequentialCompositions, 92 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 1 ChoiceCompositions, 170 TotalNumberOfCompositions, 15347 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 6718, independent: 6378, independent conditional: 0, independent unconditional: 6378, dependent: 339, dependent conditional: 0, dependent unconditional: 339, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3005, independent: 2915, independent conditional: 0, independent unconditional: 2915, dependent: 89, dependent conditional: 0, dependent unconditional: 89, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3005, independent: 2730, independent conditional: 0, independent unconditional: 2730, dependent: 275, dependent conditional: 0, dependent unconditional: 275, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 275, independent: 185, independent conditional: 0, independent unconditional: 185, dependent: 89, dependent conditional: 0, dependent unconditional: 89, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1398, independent: 747, independent conditional: 0, independent unconditional: 747, dependent: 629, dependent conditional: 0, dependent unconditional: 629, unknown: 22, unknown conditional: 0, unknown unconditional: 22] ], Cache Queries: [ total: 6718, independent: 3463, independent conditional: 0, independent unconditional: 3463, dependent: 250, dependent conditional: 0, dependent unconditional: 250, unknown: 3005, unknown conditional: 0, unknown unconditional: 3005] , Statistics on independence cache: Total cache size (in pairs): 436, Positive cache size: 393, Positive conditional cache size: 0, Positive unconditional cache size: 393, Negative cache size: 43, Negative conditional cache size: 0, Negative unconditional cache size: 43, Unknown cache size: 1, Unknown conditional cache size: 0, Unknown unconditional cache size: 1 - UnprovableResult [Line: 19]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 19. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L713] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L714] 0 int __unbuffered_p0_EAX$mem_tmp; [L715] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd3; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L720] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L721] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L722] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd3; [L723] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L724] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L725] 0 int __unbuffered_p0_EAX$w_buff0; [L726] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L727] 0 int __unbuffered_p0_EAX$w_buff1; [L728] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L730] 0 int __unbuffered_p0_EBX = 0; [L732] 0 int __unbuffered_p2_EAX = 0; [L733] 0 _Bool main$tmp_guard0; [L734] 0 _Bool main$tmp_guard1; [L736] 0 int x = 0; [L738] 0 int y = 0; [L739] 0 _Bool y$flush_delayed; [L740] 0 int y$mem_tmp; [L741] 0 _Bool y$r_buff0_thd0; [L742] 0 _Bool y$r_buff0_thd1; [L743] 0 _Bool y$r_buff0_thd2; [L744] 0 _Bool y$r_buff0_thd3; [L745] 0 _Bool y$r_buff1_thd0; [L746] 0 _Bool y$r_buff1_thd1; [L747] 0 _Bool y$r_buff1_thd2; [L748] 0 _Bool y$r_buff1_thd3; [L749] 0 _Bool y$read_delayed; [L750] 0 int *y$read_delayed_var; [L751] 0 int y$w_buff0; [L752] 0 _Bool y$w_buff0_used; [L753] 0 int y$w_buff1; [L754] 0 _Bool y$w_buff1_used; [L755] 0 _Bool weak$$choice0; [L756] 0 _Bool weak$$choice1; [L757] 0 _Bool weak$$choice2; [L831] 0 pthread_t t2213; [L832] FCALL, FORK 0 pthread_create(&t2213, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2213, ((void *)0), P0, ((void *)0))=-1, t2213={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L833] 0 pthread_t t2214; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2213={7:0}, t2214={5:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L761] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L762] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L763] 1 y$flush_delayed = weak$$choice2 [L764] EXPR 1 \read(y) [L764] 1 y$mem_tmp = y [L765] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L765] EXPR 1 \read(y) [L765] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L765] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L766] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L767] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L768] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L769] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L770] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L771] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L772] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L773] 1 __unbuffered_p0_EAX$read_delayed_var = &y [L774] EXPR 1 \read(y) [L774] 1 __unbuffered_p0_EAX = y [L775] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L775] 1 y = y$flush_delayed ? y$mem_tmp : y [L776] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=6, x=0, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L834] FCALL, FORK 0 pthread_create(&t2214, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2214, ((void *)0), P1, ((void *)0))=0, t2213={7:0}, t2214={5:0}, weak$$choice0=2, weak$$choice1=0, weak$$choice2=6, x=0, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L835] 0 pthread_t t2215; [L779] 1 __unbuffered_p0_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=6, x=0, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L791] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=6, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L836] FCALL, FORK 0 pthread_create(&t2215, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2215, ((void *)0), P2, ((void *)0))=1, t2213={7:0}, t2214={5:0}, t2215={8:0}, weak$$choice0=2, weak$$choice1=0, weak$$choice2=6, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L803] 3 __unbuffered_p2_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=6, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L806] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=6, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L809] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L809] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L809] EXPR 3 \read(y) [L809] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L809] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L809] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L810] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L811] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L812] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L813] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=6, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L784] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L786] 1 return 0; [L796] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L798] 2 return 0; [L816] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L818] 3 return 0; [L838] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L840] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L840] RET 0 assume_abort_if_not(main$tmp_guard0) [L842] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L842] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L842] EXPR 0 \read(y) [L842] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L842] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L842] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L843] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L844] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L845] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L846] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2213={7:0}, t2214={5:0}, t2215={8:0}, weak$$choice0=2, weak$$choice1=0, weak$$choice2=6, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L849] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L850] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L850] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L850] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L850] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L850] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L850] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L851] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 1) [L853] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=1, weak$$choice2=6, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 829]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 834]: 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: 832]: 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: 836]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 205 locations, 53 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: 37.7s, OverallIterations: 19, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 14.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 16.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1454 SdHoareTripleChecker+Valid, 3.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1024 mSDsluCounter, 304 SdHoareTripleChecker+Invalid, 2.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 181 mSDsCounter, 215 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2370 IncrementalHoareTripleChecker+Invalid, 2585 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 215 mSolverCounterUnsat, 123 mSDtfsCounter, 2370 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 64 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=797occurred in iteration=15, InterpolantAutomatonStates: 79, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 4.7s InterpolantComputationTime, 225 NumberOfCodeBlocks, 225 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 187 ConstructedInterpolants, 0 QuantifiedInterpolants, 1310 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-11-25 17:31:50,284 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_186bbf52-c27b-468d-a54e-5164df668682/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_186bbf52-c27b-468d-a54e-5164df668682/bin/uautomizer-ZsLfNo2U6R/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_186bbf52-c27b-468d-a54e-5164df668682/bin/uautomizer-ZsLfNo2U6R/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_186bbf52-c27b-468d-a54e-5164df668682/bin/uautomizer-ZsLfNo2U6R/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_186bbf52-c27b-468d-a54e-5164df668682/bin/uautomizer-ZsLfNo2U6R/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe018_rmo.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_186bbf52-c27b-468d-a54e-5164df668682/bin/uautomizer-ZsLfNo2U6R/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_186bbf52-c27b-468d-a54e-5164df668682/bin/uautomizer-ZsLfNo2U6R --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6f413b41672ef8cb3f594e0d22a82a07ab4d735f8bfa69fff7e94198d51bd0eb --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-38b53e6 [2022-11-25 17:31:52,743 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 17:31:52,746 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 17:31:52,785 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 17:31:52,786 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 17:31:52,790 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 17:31:52,792 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 17:31:52,796 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 17:31:52,798 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 17:31:52,806 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 17:31:52,807 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 17:31:52,809 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 17:31:52,809 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 17:31:52,809 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 17:31:52,810 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 17:31:52,812 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 17:31:52,812 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 17:31:52,813 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 17:31:52,815 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 17:31:52,817 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 17:31:52,818 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 17:31:52,820 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 17:31:52,821 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 17:31:52,822 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 17:31:52,825 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 17:31:52,826 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 17:31:52,826 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 17:31:52,827 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 17:31:52,828 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 17:31:52,829 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 17:31:52,829 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 17:31:52,830 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 17:31:52,831 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 17:31:52,832 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 17:31:52,833 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 17:31:52,833 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 17:31:52,834 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 17:31:52,834 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 17:31:52,835 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 17:31:52,836 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 17:31:52,836 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 17:31:52,837 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_186bbf52-c27b-468d-a54e-5164df668682/bin/uautomizer-ZsLfNo2U6R/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-11-25 17:31:52,883 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 17:31:52,886 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 17:31:52,888 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 17:31:52,888 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 17:31:52,889 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 17:31:52,890 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 17:31:52,891 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 17:31:52,891 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 17:31:52,891 INFO L138 SettingsManager]: * Use SBE=true [2022-11-25 17:31:52,891 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 17:31:52,892 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 17:31:52,893 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-25 17:31:52,893 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 17:31:52,893 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 17:31:52,893 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 17:31:52,894 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-25 17:31:52,894 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-25 17:31:52,894 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-25 17:31:52,895 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 17:31:52,895 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-25 17:31:52,895 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-25 17:31:52,895 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-25 17:31:52,896 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 17:31:52,896 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 17:31:52,896 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 17:31:52,896 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-25 17:31:52,896 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 17:31:52,897 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 17:31:52,897 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 17:31:52,897 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 17:31:52,897 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-11-25 17:31:52,898 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-25 17:31:52,898 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-25 17:31:52,898 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-25 17:31:52,899 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-25 17:31:52,899 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2022-11-25 17:31:52,899 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_186bbf52-c27b-468d-a54e-5164df668682/bin/uautomizer-ZsLfNo2U6R/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_186bbf52-c27b-468d-a54e-5164df668682/bin/uautomizer-ZsLfNo2U6R Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6f413b41672ef8cb3f594e0d22a82a07ab4d735f8bfa69fff7e94198d51bd0eb [2022-11-25 17:31:53,271 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 17:31:53,299 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 17:31:53,303 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 17:31:53,304 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 17:31:53,305 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 17:31:53,307 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_186bbf52-c27b-468d-a54e-5164df668682/bin/uautomizer-ZsLfNo2U6R/../../sv-benchmarks/c/pthread-wmm/safe018_rmo.oepc.i [2022-11-25 17:31:56,349 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 17:31:56,721 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 17:31:56,721 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_186bbf52-c27b-468d-a54e-5164df668682/sv-benchmarks/c/pthread-wmm/safe018_rmo.oepc.i [2022-11-25 17:31:56,736 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_186bbf52-c27b-468d-a54e-5164df668682/bin/uautomizer-ZsLfNo2U6R/data/590d682b8/da37c325ffaf49f5b8ea68e92c154536/FLAG245fb3284 [2022-11-25 17:31:56,754 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_186bbf52-c27b-468d-a54e-5164df668682/bin/uautomizer-ZsLfNo2U6R/data/590d682b8/da37c325ffaf49f5b8ea68e92c154536 [2022-11-25 17:31:56,757 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 17:31:56,759 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 17:31:56,762 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 17:31:56,762 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 17:31:56,766 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 17:31:56,767 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 05:31:56" (1/1) ... [2022-11-25 17:31:56,768 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2023d051 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:31:56, skipping insertion in model container [2022-11-25 17:31:56,769 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 05:31:56" (1/1) ... [2022-11-25 17:31:56,777 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 17:31:56,844 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 17:31:57,050 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_186bbf52-c27b-468d-a54e-5164df668682/sv-benchmarks/c/pthread-wmm/safe018_rmo.oepc.i[993,1006] [2022-11-25 17:31:57,314 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:31:57,339 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:31:57,339 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:31:57,340 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:31:57,340 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:31:57,340 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:31:57,341 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:31:57,342 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:31:57,349 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:31:57,350 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:31:57,350 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:31:57,350 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:31:57,370 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:31:57,370 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:31:57,371 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:31:57,371 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:31:57,372 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:31:57,372 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:31:57,372 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:31:57,374 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:31:57,375 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:31:57,375 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:31:57,381 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:31:57,381 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:31:57,382 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:31:57,398 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:31:57,399 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:31:57,401 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:31:57,402 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 17:31:57,422 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 17:31:57,447 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_186bbf52-c27b-468d-a54e-5164df668682/sv-benchmarks/c/pthread-wmm/safe018_rmo.oepc.i[993,1006] [2022-11-25 17:31:57,496 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:31:57,508 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:31:57,513 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:31:57,514 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:31:57,514 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:31:57,514 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:31:57,515 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:31:57,515 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:31:57,516 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:31:57,522 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:31:57,523 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:31:57,523 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:31:57,523 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:31:57,524 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:31:57,525 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:31:57,526 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:31:57,527 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:31:57,527 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:31:57,527 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:31:57,529 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:31:57,532 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:31:57,533 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:31:57,537 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:31:57,540 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:31:57,542 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:31:57,544 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:31:57,547 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:31:57,548 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:31:57,552 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 17:31:57,605 INFO L208 MainTranslator]: Completed translation [2022-11-25 17:31:57,606 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:31:57 WrapperNode [2022-11-25 17:31:57,606 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 17:31:57,608 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 17:31:57,608 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 17:31:57,608 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 17:31:57,616 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:31:57" (1/1) ... [2022-11-25 17:31:57,650 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:31:57" (1/1) ... [2022-11-25 17:31:57,696 INFO L138 Inliner]: procedures = 180, calls = 65, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 137 [2022-11-25 17:31:57,696 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 17:31:57,698 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 17:31:57,699 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 17:31:57,699 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 17:31:57,710 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:31:57" (1/1) ... [2022-11-25 17:31:57,711 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:31:57" (1/1) ... [2022-11-25 17:31:57,716 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:31:57" (1/1) ... [2022-11-25 17:31:57,716 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:31:57" (1/1) ... [2022-11-25 17:31:57,726 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:31:57" (1/1) ... [2022-11-25 17:31:57,728 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:31:57" (1/1) ... [2022-11-25 17:31:57,731 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:31:57" (1/1) ... [2022-11-25 17:31:57,733 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:31:57" (1/1) ... [2022-11-25 17:31:57,737 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 17:31:57,738 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 17:31:57,738 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 17:31:57,738 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 17:31:57,739 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:31:57" (1/1) ... [2022-11-25 17:31:57,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 17:31:57,773 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_186bbf52-c27b-468d-a54e-5164df668682/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:31:57,787 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_186bbf52-c27b-468d-a54e-5164df668682/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 17:31:57,811 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_186bbf52-c27b-468d-a54e-5164df668682/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 17:31:57,834 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-11-25 17:31:57,835 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-25 17:31:57,835 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 17:31:57,836 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-25 17:31:57,837 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-25 17:31:57,837 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-11-25 17:31:57,837 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-25 17:31:57,837 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2022-11-25 17:31:57,837 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-25 17:31:57,837 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-25 17:31:57,838 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-25 17:31:57,838 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-25 17:31:57,838 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-25 17:31:57,838 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-25 17:31:57,838 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-25 17:31:57,838 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 17:31:57,839 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 17:31:57,840 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-25 17:31:58,009 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 17:31:58,011 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 17:31:58,736 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 17:31:59,132 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 17:31:59,133 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-25 17:31:59,135 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:31:59 BoogieIcfgContainer [2022-11-25 17:31:59,135 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 17:31:59,139 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 17:31:59,139 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 17:31:59,142 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 17:31:59,143 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 05:31:56" (1/3) ... [2022-11-25 17:31:59,145 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5dfca2ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 05:31:59, skipping insertion in model container [2022-11-25 17:31:59,145 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:31:57" (2/3) ... [2022-11-25 17:31:59,146 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5dfca2ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 05:31:59, skipping insertion in model container [2022-11-25 17:31:59,146 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:31:59" (3/3) ... [2022-11-25 17:31:59,147 INFO L112 eAbstractionObserver]: Analyzing ICFG safe018_rmo.oepc.i [2022-11-25 17:31:59,166 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 17:31:59,167 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 32 error locations. [2022-11-25 17:31:59,167 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-25 17:31:59,317 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-25 17:31:59,371 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 173 places, 165 transitions, 345 flow [2022-11-25 17:31:59,446 INFO L130 PetriNetUnfolder]: 2/162 cut-off events. [2022-11-25 17:31:59,447 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 17:31:59,453 INFO L83 FinitePrefix]: Finished finitePrefix Result has 172 conditions, 162 events. 2/162 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 180 event pairs, 0 based on Foata normal form. 0/128 useless extension candidates. Maximal degree in co-relation 100. Up to 2 conditions per place. [2022-11-25 17:31:59,454 INFO L82 GeneralOperation]: Start removeDead. Operand has 173 places, 165 transitions, 345 flow [2022-11-25 17:31:59,459 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 170 places, 162 transitions, 333 flow [2022-11-25 17:31:59,463 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-25 17:31:59,478 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 170 places, 162 transitions, 333 flow [2022-11-25 17:31:59,481 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 170 places, 162 transitions, 333 flow [2022-11-25 17:31:59,481 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 170 places, 162 transitions, 333 flow [2022-11-25 17:31:59,537 INFO L130 PetriNetUnfolder]: 2/162 cut-off events. [2022-11-25 17:31:59,537 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 17:31:59,538 INFO L83 FinitePrefix]: Finished finitePrefix Result has 172 conditions, 162 events. 2/162 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 180 event pairs, 0 based on Foata normal form. 0/128 useless extension candidates. Maximal degree in co-relation 100. Up to 2 conditions per place. [2022-11-25 17:31:59,546 INFO L119 LiptonReduction]: Number of co-enabled transitions 4540 [2022-11-25 17:32:24,525 INFO L134 LiptonReduction]: Checked pairs total: 14899 [2022-11-25 17:32:24,526 INFO L136 LiptonReduction]: Total number of compositions: 166 [2022-11-25 17:32:24,542 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 17:32:24,549 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;@7c1cc1f7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 17:32:24,549 INFO L358 AbstractCegarLoop]: Starting to check reachability of 53 error locations. [2022-11-25 17:32:24,552 INFO L130 PetriNetUnfolder]: 0/1 cut-off events. [2022-11-25 17:32:24,552 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 17:32:24,552 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:32:24,553 INFO L209 CegarLoopForPetriNet]: trace histogram [1] [2022-11-25 17:32:24,553 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2022-11-25 17:32:24,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:32:24,559 INFO L85 PathProgramCache]: Analyzing trace with hash 818, now seen corresponding path program 1 times [2022-11-25 17:32:24,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 17:32:24,572 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1535156750] [2022-11-25 17:32:24,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:32:24,573 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 17:32:24,573 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_186bbf52-c27b-468d-a54e-5164df668682/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 17:32:24,583 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_186bbf52-c27b-468d-a54e-5164df668682/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 17:32:24,602 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_186bbf52-c27b-468d-a54e-5164df668682/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-11-25 17:32:24,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:24,736 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2022-11-25 17:32:24,740 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:32:24,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:32:24,745 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 17:32:24,746 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 17:32:24,746 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1535156750] [2022-11-25 17:32:24,747 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1535156750] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:32:24,747 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:32:24,747 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-25 17:32:24,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979884785] [2022-11-25 17:32:24,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:32:24,760 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-25 17:32:24,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 17:32:24,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-25 17:32:24,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-25 17:32:24,794 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 331 [2022-11-25 17:32:24,800 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 56 transitions, 121 flow. Second operand has 2 states, 2 states have (on average 133.5) internal successors, (267), 2 states have internal predecessors, (267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:32:24,801 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:32:24,801 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 331 [2022-11-25 17:32:24,802 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:32:25,939 INFO L130 PetriNetUnfolder]: 3634/5452 cut-off events. [2022-11-25 17:32:25,939 INFO L131 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2022-11-25 17:32:25,951 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10769 conditions, 5452 events. 3634/5452 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 397. Compared 31442 event pairs, 3634 based on Foata normal form. 0/3147 useless extension candidates. Maximal degree in co-relation 10758. Up to 5271 conditions per place. [2022-11-25 17:32:25,982 INFO L137 encePairwiseOnDemand]: 312/331 looper letters, 34 selfloop transitions, 0 changer transitions 0/37 dead transitions. [2022-11-25 17:32:25,983 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 37 transitions, 151 flow [2022-11-25 17:32:26,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 17:32:26,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-11-25 17:32:26,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 319 transitions. [2022-11-25 17:32:26,020 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4818731117824773 [2022-11-25 17:32:26,021 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 319 transitions. [2022-11-25 17:32:26,021 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 319 transitions. [2022-11-25 17:32:26,023 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:32:26,025 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 319 transitions. [2022-11-25 17:32:26,029 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 159.5) internal successors, (319), 2 states have internal predecessors, (319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:32:26,035 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 331.0) internal successors, (993), 3 states have internal predecessors, (993), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:32:26,036 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 331.0) internal successors, (993), 3 states have internal predecessors, (993), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:32:26,038 INFO L175 Difference]: Start difference. First operand has 65 places, 56 transitions, 121 flow. Second operand 2 states and 319 transitions. [2022-11-25 17:32:26,039 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 37 transitions, 151 flow [2022-11-25 17:32:26,042 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 37 transitions, 148 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-25 17:32:26,044 INFO L231 Difference]: Finished difference. Result has 45 places, 37 transitions, 80 flow [2022-11-25 17:32:26,046 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=331, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=80, PETRI_PLACES=45, PETRI_TRANSITIONS=37} [2022-11-25 17:32:26,050 INFO L288 CegarLoopForPetriNet]: 65 programPoint places, -20 predicate places. [2022-11-25 17:32:26,050 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 37 transitions, 80 flow [2022-11-25 17:32:26,051 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 133.5) internal successors, (267), 2 states have internal predecessors, (267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:32:26,051 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:32:26,051 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-11-25 17:32:26,063 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_186bbf52-c27b-468d-a54e-5164df668682/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2022-11-25 17:32:26,262 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_186bbf52-c27b-468d-a54e-5164df668682/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 17:32:26,263 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2022-11-25 17:32:26,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:32:26,263 INFO L85 PathProgramCache]: Analyzing trace with hash 807948, now seen corresponding path program 1 times [2022-11-25 17:32:26,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 17:32:26,264 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1196947732] [2022-11-25 17:32:26,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:32:26,265 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 17:32:26,265 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_186bbf52-c27b-468d-a54e-5164df668682/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 17:32:26,266 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_186bbf52-c27b-468d-a54e-5164df668682/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 17:32:26,274 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_186bbf52-c27b-468d-a54e-5164df668682/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-11-25 17:32:26,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:26,395 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-25 17:32:26,397 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:32:26,476 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:32:26,486 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-25 17:32:26,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:32:26,515 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 17:32:26,516 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 17:32:26,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1196947732] [2022-11-25 17:32:26,516 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1196947732] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:32:26,517 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:32:26,517 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-25 17:32:26,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155765806] [2022-11-25 17:32:26,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:32:26,519 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 17:32:26,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 17:32:26,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 17:32:26,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:32:26,609 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 331 [2022-11-25 17:32:26,610 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 37 transitions, 80 flow. Second operand has 3 states, 3 states have (on average 133.0) internal successors, (399), 3 states have internal predecessors, (399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:32:26,610 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:32:26,610 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 331 [2022-11-25 17:32:26,610 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:32:27,283 INFO L130 PetriNetUnfolder]: 2095/3178 cut-off events. [2022-11-25 17:32:27,284 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 17:32:27,289 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6295 conditions, 3178 events. 2095/3178 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 244. Compared 17242 event pairs, 2095 based on Foata normal form. 0/2103 useless extension candidates. Maximal degree in co-relation 6292. Up to 3080 conditions per place. [2022-11-25 17:32:27,304 INFO L137 encePairwiseOnDemand]: 326/331 looper letters, 29 selfloop transitions, 1 changer transitions 0/33 dead transitions. [2022-11-25 17:32:27,304 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 33 transitions, 132 flow [2022-11-25 17:32:27,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 17:32:27,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 17:32:27,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 430 transitions. [2022-11-25 17:32:27,312 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.43303121852970794 [2022-11-25 17:32:27,312 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 430 transitions. [2022-11-25 17:32:27,312 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 430 transitions. [2022-11-25 17:32:27,313 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:32:27,313 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 430 transitions. [2022-11-25 17:32:27,316 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 143.33333333333334) internal successors, (430), 3 states have internal predecessors, (430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:32:27,320 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 331.0) internal successors, (1324), 4 states have internal predecessors, (1324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:32:27,321 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 331.0) internal successors, (1324), 4 states have internal predecessors, (1324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:32:27,322 INFO L175 Difference]: Start difference. First operand has 45 places, 37 transitions, 80 flow. Second operand 3 states and 430 transitions. [2022-11-25 17:32:27,322 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 33 transitions, 132 flow [2022-11-25 17:32:27,322 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 33 transitions, 132 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-25 17:32:27,323 INFO L231 Difference]: Finished difference. Result has 43 places, 33 transitions, 74 flow [2022-11-25 17:32:27,324 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=331, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=74, PETRI_PLACES=43, PETRI_TRANSITIONS=33} [2022-11-25 17:32:27,325 INFO L288 CegarLoopForPetriNet]: 65 programPoint places, -22 predicate places. [2022-11-25 17:32:27,325 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 33 transitions, 74 flow [2022-11-25 17:32:27,325 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 133.0) internal successors, (399), 3 states have internal predecessors, (399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:32:27,326 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:32:27,326 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-11-25 17:32:27,343 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_186bbf52-c27b-468d-a54e-5164df668682/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2022-11-25 17:32:27,537 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_186bbf52-c27b-468d-a54e-5164df668682/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 17:32:27,537 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2022-11-25 17:32:27,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:32:27,538 INFO L85 PathProgramCache]: Analyzing trace with hash 807947, now seen corresponding path program 1 times [2022-11-25 17:32:27,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 17:32:27,539 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [304741664] [2022-11-25 17:32:27,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:32:27,539 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 17:32:27,539 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_186bbf52-c27b-468d-a54e-5164df668682/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 17:32:27,541 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_186bbf52-c27b-468d-a54e-5164df668682/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 17:32:27,553 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_186bbf52-c27b-468d-a54e-5164df668682/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-11-25 17:32:27,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:27,682 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-25 17:32:27,683 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:32:27,714 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-25 17:32:27,715 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2022-11-25 17:32:27,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:32:27,738 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 17:32:27,738 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 17:32:27,738 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [304741664] [2022-11-25 17:32:27,739 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [304741664] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:32:27,739 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:32:27,739 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-25 17:32:27,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117201720] [2022-11-25 17:32:27,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:32:27,740 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 17:32:27,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 17:32:27,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 17:32:27,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:32:27,835 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 331 [2022-11-25 17:32:27,836 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 33 transitions, 74 flow. Second operand has 3 states, 3 states have (on average 130.0) internal successors, (390), 3 states have internal predecessors, (390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:32:27,836 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:32:27,836 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 331 [2022-11-25 17:32:27,837 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:32:28,260 INFO L130 PetriNetUnfolder]: 1248/1893 cut-off events. [2022-11-25 17:32:28,261 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 17:32:28,264 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3797 conditions, 1893 events. 1248/1893 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 9148 event pairs, 712 based on Foata normal form. 63/1556 useless extension candidates. Maximal degree in co-relation 3793. Up to 1053 conditions per place. [2022-11-25 17:32:28,273 INFO L137 encePairwiseOnDemand]: 323/331 looper letters, 34 selfloop transitions, 2 changer transitions 0/38 dead transitions. [2022-11-25 17:32:28,273 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 38 transitions, 156 flow [2022-11-25 17:32:28,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 17:32:28,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 17:32:28,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 429 transitions. [2022-11-25 17:32:28,275 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.43202416918429004 [2022-11-25 17:32:28,275 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 429 transitions. [2022-11-25 17:32:28,276 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 429 transitions. [2022-11-25 17:32:28,276 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:32:28,276 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 429 transitions. [2022-11-25 17:32:28,277 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 143.0) internal successors, (429), 3 states have internal predecessors, (429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:32:28,279 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 331.0) internal successors, (1324), 4 states have internal predecessors, (1324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:32:28,280 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 331.0) internal successors, (1324), 4 states have internal predecessors, (1324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:32:28,280 INFO L175 Difference]: Start difference. First operand has 43 places, 33 transitions, 74 flow. Second operand 3 states and 429 transitions. [2022-11-25 17:32:28,281 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 38 transitions, 156 flow [2022-11-25 17:32:28,281 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 38 transitions, 155 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-25 17:32:28,282 INFO L231 Difference]: Finished difference. Result has 43 places, 31 transitions, 83 flow [2022-11-25 17:32:28,283 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=331, PETRI_DIFFERENCE_MINUEND_FLOW=69, PETRI_DIFFERENCE_MINUEND_PLACES=40, 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=83, PETRI_PLACES=43, PETRI_TRANSITIONS=31} [2022-11-25 17:32:28,284 INFO L288 CegarLoopForPetriNet]: 65 programPoint places, -22 predicate places. [2022-11-25 17:32:28,284 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 31 transitions, 83 flow [2022-11-25 17:32:28,285 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 130.0) internal successors, (390), 3 states have internal predecessors, (390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:32:28,285 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:32:28,285 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:32:28,303 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_186bbf52-c27b-468d-a54e-5164df668682/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2022-11-25 17:32:28,499 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_186bbf52-c27b-468d-a54e-5164df668682/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 17:32:28,499 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2022-11-25 17:32:28,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:32:28,499 INFO L85 PathProgramCache]: Analyzing trace with hash -214145151, now seen corresponding path program 1 times [2022-11-25 17:32:28,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 17:32:28,500 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [693457041] [2022-11-25 17:32:28,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:32:28,500 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 17:32:28,500 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_186bbf52-c27b-468d-a54e-5164df668682/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 17:32:28,519 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_186bbf52-c27b-468d-a54e-5164df668682/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 17:32:28,520 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_186bbf52-c27b-468d-a54e-5164df668682/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-11-25 17:32:28,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:28,686 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-25 17:32:28,687 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:32:28,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:32:28,740 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 17:32:28,740 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 17:32:28,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [693457041] [2022-11-25 17:32:28,741 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [693457041] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:32:28,741 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:32:28,741 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 17:32:28,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010744654] [2022-11-25 17:32:28,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:32:28,742 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 17:32:28,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 17:32:28,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 17:32:28,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:32:28,756 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 331 [2022-11-25 17:32:28,757 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 31 transitions, 83 flow. Second operand has 3 states, 3 states have (on average 132.33333333333334) internal successors, (397), 3 states have internal predecessors, (397), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:32:28,758 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:32:28,758 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 331 [2022-11-25 17:32:28,758 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:32:29,108 INFO L130 PetriNetUnfolder]: 589/989 cut-off events. [2022-11-25 17:32:29,109 INFO L131 PetriNetUnfolder]: For 49/61 co-relation queries the response was YES. [2022-11-25 17:32:29,111 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2137 conditions, 989 events. 589/989 cut-off events. For 49/61 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 4774 event pairs, 192 based on Foata normal form. 12/858 useless extension candidates. Maximal degree in co-relation 2132. Up to 923 conditions per place. [2022-11-25 17:32:29,116 INFO L137 encePairwiseOnDemand]: 326/331 looper letters, 37 selfloop transitions, 4 changer transitions 0/44 dead transitions. [2022-11-25 17:32:29,116 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 44 transitions, 195 flow [2022-11-25 17:32:29,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 17:32:29,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 17:32:29,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 429 transitions. [2022-11-25 17:32:29,118 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.43202416918429004 [2022-11-25 17:32:29,118 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 429 transitions. [2022-11-25 17:32:29,119 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 429 transitions. [2022-11-25 17:32:29,119 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:32:29,119 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 429 transitions. [2022-11-25 17:32:29,120 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 143.0) internal successors, (429), 3 states have internal predecessors, (429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:32:29,122 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 331.0) internal successors, (1324), 4 states have internal predecessors, (1324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:32:29,123 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 331.0) internal successors, (1324), 4 states have internal predecessors, (1324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:32:29,123 INFO L175 Difference]: Start difference. First operand has 43 places, 31 transitions, 83 flow. Second operand 3 states and 429 transitions. [2022-11-25 17:32:29,124 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 44 transitions, 195 flow [2022-11-25 17:32:29,126 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 44 transitions, 191 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-25 17:32:29,128 INFO L231 Difference]: Finished difference. Result has 44 places, 34 transitions, 105 flow [2022-11-25 17:32:29,129 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=331, PETRI_DIFFERENCE_MINUEND_FLOW=79, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=105, PETRI_PLACES=44, PETRI_TRANSITIONS=34} [2022-11-25 17:32:29,130 INFO L288 CegarLoopForPetriNet]: 65 programPoint places, -21 predicate places. [2022-11-25 17:32:29,131 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 34 transitions, 105 flow [2022-11-25 17:32:29,131 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 132.33333333333334) internal successors, (397), 3 states have internal predecessors, (397), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:32:29,131 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:32:29,131 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:32:29,148 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_186bbf52-c27b-468d-a54e-5164df668682/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-11-25 17:32:29,343 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_186bbf52-c27b-468d-a54e-5164df668682/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 17:32:29,343 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2022-11-25 17:32:29,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:32:29,344 INFO L85 PathProgramCache]: Analyzing trace with hash 1291419697, now seen corresponding path program 1 times [2022-11-25 17:32:29,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 17:32:29,345 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [625960447] [2022-11-25 17:32:29,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:32:29,345 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 17:32:29,345 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_186bbf52-c27b-468d-a54e-5164df668682/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 17:32:29,346 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_186bbf52-c27b-468d-a54e-5164df668682/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 17:32:29,389 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_186bbf52-c27b-468d-a54e-5164df668682/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-11-25 17:32:29,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:29,515 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-25 17:32:29,516 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:32:29,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:32:29,571 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 17:32:29,571 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 17:32:29,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [625960447] [2022-11-25 17:32:29,571 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [625960447] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:32:29,572 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:32:29,572 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 17:32:29,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793453181] [2022-11-25 17:32:29,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:32:29,572 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:32:29,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 17:32:29,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:32:29,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 17:32:29,589 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 331 [2022-11-25 17:32:29,590 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 34 transitions, 105 flow. Second operand has 4 states, 4 states have (on average 132.0) internal successors, (528), 4 states have internal predecessors, (528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:32:29,590 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:32:29,590 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 331 [2022-11-25 17:32:29,591 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:32:29,860 INFO L130 PetriNetUnfolder]: 161/333 cut-off events. [2022-11-25 17:32:29,861 INFO L131 PetriNetUnfolder]: For 56/58 co-relation queries the response was YES. [2022-11-25 17:32:29,861 INFO L83 FinitePrefix]: Finished finitePrefix Result has 837 conditions, 333 events. 161/333 cut-off events. For 56/58 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1302 event pairs, 43 based on Foata normal form. 16/309 useless extension candidates. Maximal degree in co-relation 831. Up to 202 conditions per place. [2022-11-25 17:32:29,863 INFO L137 encePairwiseOnDemand]: 326/331 looper letters, 44 selfloop transitions, 7 changer transitions 0/54 dead transitions. [2022-11-25 17:32:29,863 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 54 transitions, 259 flow [2022-11-25 17:32:29,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 17:32:29,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-25 17:32:29,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 568 transitions. [2022-11-25 17:32:29,866 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.42900302114803623 [2022-11-25 17:32:29,866 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 568 transitions. [2022-11-25 17:32:29,867 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 568 transitions. [2022-11-25 17:32:29,867 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:32:29,867 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 568 transitions. [2022-11-25 17:32:29,869 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 142.0) internal successors, (568), 4 states have internal predecessors, (568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:32:29,872 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 331.0) internal successors, (1655), 5 states have internal predecessors, (1655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:32:29,873 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 331.0) internal successors, (1655), 5 states have internal predecessors, (1655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:32:29,873 INFO L175 Difference]: Start difference. First operand has 44 places, 34 transitions, 105 flow. Second operand 4 states and 568 transitions. [2022-11-25 17:32:29,873 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 54 transitions, 259 flow [2022-11-25 17:32:29,874 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 54 transitions, 255 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-25 17:32:29,875 INFO L231 Difference]: Finished difference. Result has 47 places, 37 transitions, 141 flow [2022-11-25 17:32:29,876 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=331, PETRI_DIFFERENCE_MINUEND_FLOW=101, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=141, PETRI_PLACES=47, PETRI_TRANSITIONS=37} [2022-11-25 17:32:29,876 INFO L288 CegarLoopForPetriNet]: 65 programPoint places, -18 predicate places. [2022-11-25 17:32:29,877 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 37 transitions, 141 flow [2022-11-25 17:32:29,877 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 132.0) internal successors, (528), 4 states have internal predecessors, (528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:32:29,877 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:32:29,877 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:32:29,894 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_186bbf52-c27b-468d-a54e-5164df668682/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-11-25 17:32:30,089 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_186bbf52-c27b-468d-a54e-5164df668682/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 17:32:30,090 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2022-11-25 17:32:30,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:32:30,090 INFO L85 PathProgramCache]: Analyzing trace with hash -1579759933, now seen corresponding path program 1 times [2022-11-25 17:32:30,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 17:32:30,091 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [46088508] [2022-11-25 17:32:30,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:32:30,091 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 17:32:30,091 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_186bbf52-c27b-468d-a54e-5164df668682/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 17:32:30,092 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_186bbf52-c27b-468d-a54e-5164df668682/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 17:32:30,093 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_186bbf52-c27b-468d-a54e-5164df668682/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-11-25 17:32:30,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:30,276 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-25 17:32:30,277 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:32:30,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:32:30,330 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 17:32:30,331 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 17:32:30,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [46088508] [2022-11-25 17:32:30,331 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [46088508] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:32:30,331 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:32:30,331 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 17:32:30,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590373008] [2022-11-25 17:32:30,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:32:30,333 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 17:32:30,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 17:32:30,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 17:32:30,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:32:30,353 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 331 [2022-11-25 17:32:30,354 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 37 transitions, 141 flow. Second operand has 5 states, 5 states have (on average 131.8) internal successors, (659), 5 states have internal predecessors, (659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:32:30,354 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:32:30,354 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 331 [2022-11-25 17:32:30,355 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:32:30,666 INFO L130 PetriNetUnfolder]: 82/171 cut-off events. [2022-11-25 17:32:30,666 INFO L131 PetriNetUnfolder]: For 162/162 co-relation queries the response was YES. [2022-11-25 17:32:30,667 INFO L83 FinitePrefix]: Finished finitePrefix Result has 503 conditions, 171 events. 82/171 cut-off events. For 162/162 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 505 event pairs, 24 based on Foata normal form. 7/173 useless extension candidates. Maximal degree in co-relation 496. Up to 70 conditions per place. [2022-11-25 17:32:30,668 INFO L137 encePairwiseOnDemand]: 326/331 looper letters, 37 selfloop transitions, 10 changer transitions 1/50 dead transitions. [2022-11-25 17:32:30,668 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 50 transitions, 261 flow [2022-11-25 17:32:30,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 17:32:30,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-25 17:32:30,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 694 transitions. [2022-11-25 17:32:30,671 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.41933534743202416 [2022-11-25 17:32:30,671 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 694 transitions. [2022-11-25 17:32:30,671 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 694 transitions. [2022-11-25 17:32:30,671 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:32:30,671 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 694 transitions. [2022-11-25 17:32:30,673 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 138.8) internal successors, (694), 5 states have internal predecessors, (694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:32:30,677 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 331.0) internal successors, (1986), 6 states have internal predecessors, (1986), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:32:30,678 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 331.0) internal successors, (1986), 6 states have internal predecessors, (1986), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:32:30,678 INFO L175 Difference]: Start difference. First operand has 47 places, 37 transitions, 141 flow. Second operand 5 states and 694 transitions. [2022-11-25 17:32:30,678 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 50 transitions, 261 flow [2022-11-25 17:32:30,679 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 50 transitions, 245 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-11-25 17:32:30,680 INFO L231 Difference]: Finished difference. Result has 45 places, 32 transitions, 135 flow [2022-11-25 17:32:30,681 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=331, PETRI_DIFFERENCE_MINUEND_FLOW=109, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=135, PETRI_PLACES=45, PETRI_TRANSITIONS=32} [2022-11-25 17:32:30,681 INFO L288 CegarLoopForPetriNet]: 65 programPoint places, -20 predicate places. [2022-11-25 17:32:30,681 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 32 transitions, 135 flow [2022-11-25 17:32:30,682 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 131.8) internal successors, (659), 5 states have internal predecessors, (659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:32:30,682 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:32:30,682 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:32:30,703 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_186bbf52-c27b-468d-a54e-5164df668682/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-11-25 17:32:30,894 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_186bbf52-c27b-468d-a54e-5164df668682/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 17:32:30,895 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2022-11-25 17:32:30,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:32:30,895 INFO L85 PathProgramCache]: Analyzing trace with hash 1601721701, now seen corresponding path program 1 times [2022-11-25 17:32:30,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 17:32:30,896 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1580878156] [2022-11-25 17:32:30,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:32:30,896 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 17:32:30,896 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_186bbf52-c27b-468d-a54e-5164df668682/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 17:32:30,897 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_186bbf52-c27b-468d-a54e-5164df668682/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 17:32:30,900 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_186bbf52-c27b-468d-a54e-5164df668682/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-11-25 17:32:31,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:31,103 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-25 17:32:31,105 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:32:31,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:32:31,276 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 17:32:31,276 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 17:32:31,277 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1580878156] [2022-11-25 17:32:31,277 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1580878156] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:32:31,277 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:32:31,277 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 17:32:31,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150898859] [2022-11-25 17:32:31,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:32:31,278 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 17:32:31,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 17:32:31,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 17:32:31,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:32:31,399 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 331 [2022-11-25 17:32:31,400 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 32 transitions, 135 flow. Second operand has 5 states, 5 states have (on average 133.6) internal successors, (668), 5 states have internal predecessors, (668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:32:31,400 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:32:31,400 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 331 [2022-11-25 17:32:31,400 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:32:31,664 INFO L130 PetriNetUnfolder]: 94/210 cut-off events. [2022-11-25 17:32:31,664 INFO L131 PetriNetUnfolder]: For 285/285 co-relation queries the response was YES. [2022-11-25 17:32:31,664 INFO L83 FinitePrefix]: Finished finitePrefix Result has 593 conditions, 210 events. 94/210 cut-off events. For 285/285 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 729 event pairs, 13 based on Foata normal form. 0/209 useless extension candidates. Maximal degree in co-relation 586. Up to 141 conditions per place. [2022-11-25 17:32:31,665 INFO L137 encePairwiseOnDemand]: 327/331 looper letters, 41 selfloop transitions, 2 changer transitions 0/44 dead transitions. [2022-11-25 17:32:31,666 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 44 transitions, 271 flow [2022-11-25 17:32:31,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 17:32:31,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-25 17:32:31,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 557 transitions. [2022-11-25 17:32:31,668 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4206948640483384 [2022-11-25 17:32:31,668 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 557 transitions. [2022-11-25 17:32:31,668 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 557 transitions. [2022-11-25 17:32:31,669 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:32:31,669 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 557 transitions. [2022-11-25 17:32:31,670 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 139.25) internal successors, (557), 4 states have internal predecessors, (557), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:32:31,672 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 331.0) internal successors, (1655), 5 states have internal predecessors, (1655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:32:31,673 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 331.0) internal successors, (1655), 5 states have internal predecessors, (1655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:32:31,673 INFO L175 Difference]: Start difference. First operand has 45 places, 32 transitions, 135 flow. Second operand 4 states and 557 transitions. [2022-11-25 17:32:31,673 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 44 transitions, 271 flow [2022-11-25 17:32:31,675 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 44 transitions, 239 flow, removed 6 selfloop flow, removed 3 redundant places. [2022-11-25 17:32:31,676 INFO L231 Difference]: Finished difference. Result has 42 places, 30 transitions, 109 flow [2022-11-25 17:32:31,676 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=331, PETRI_DIFFERENCE_MINUEND_FLOW=105, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=109, PETRI_PLACES=42, PETRI_TRANSITIONS=30} [2022-11-25 17:32:31,677 INFO L288 CegarLoopForPetriNet]: 65 programPoint places, -23 predicate places. [2022-11-25 17:32:31,677 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 30 transitions, 109 flow [2022-11-25 17:32:31,678 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 133.6) internal successors, (668), 5 states have internal predecessors, (668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:32:31,678 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:32:31,678 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] [2022-11-25 17:32:31,691 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_186bbf52-c27b-468d-a54e-5164df668682/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-11-25 17:32:31,890 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_186bbf52-c27b-468d-a54e-5164df668682/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 17:32:31,891 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2022-11-25 17:32:31,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:32:31,891 INFO L85 PathProgramCache]: Analyzing trace with hash -533866542, now seen corresponding path program 1 times [2022-11-25 17:32:31,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 17:32:31,894 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1310953070] [2022-11-25 17:32:31,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:32:31,895 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 17:32:31,895 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_186bbf52-c27b-468d-a54e-5164df668682/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 17:32:31,896 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_186bbf52-c27b-468d-a54e-5164df668682/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 17:32:31,990 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_186bbf52-c27b-468d-a54e-5164df668682/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-11-25 17:32:32,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:32,107 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-25 17:32:32,109 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:32:32,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:32:32,180 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 17:32:32,180 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 17:32:32,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1310953070] [2022-11-25 17:32:32,182 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1310953070] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:32:32,182 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:32:32,182 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 17:32:32,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659658576] [2022-11-25 17:32:32,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:32:32,183 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 17:32:32,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 17:32:32,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 17:32:32,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:32:32,201 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 331 [2022-11-25 17:32:32,202 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 30 transitions, 109 flow. Second operand has 5 states, 5 states have (on average 131.8) internal successors, (659), 5 states have internal predecessors, (659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:32:32,202 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:32:32,202 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 331 [2022-11-25 17:32:32,202 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:32:32,521 INFO L130 PetriNetUnfolder]: 160/316 cut-off events. [2022-11-25 17:32:32,521 INFO L131 PetriNetUnfolder]: For 198/198 co-relation queries the response was YES. [2022-11-25 17:32:32,522 INFO L83 FinitePrefix]: Finished finitePrefix Result has 918 conditions, 316 events. 160/316 cut-off events. For 198/198 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1175 event pairs, 26 based on Foata normal form. 0/315 useless extension candidates. Maximal degree in co-relation 911. Up to 139 conditions per place. [2022-11-25 17:32:32,523 INFO L137 encePairwiseOnDemand]: 327/331 looper letters, 67 selfloop transitions, 3 changer transitions 0/71 dead transitions. [2022-11-25 17:32:32,523 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 71 transitions, 407 flow [2022-11-25 17:32:32,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 17:32:32,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-25 17:32:32,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 695 transitions. [2022-11-25 17:32:32,526 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4199395770392749 [2022-11-25 17:32:32,526 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 695 transitions. [2022-11-25 17:32:32,526 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 695 transitions. [2022-11-25 17:32:32,527 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:32:32,527 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 695 transitions. [2022-11-25 17:32:32,528 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 139.0) internal successors, (695), 5 states have internal predecessors, (695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:32:32,533 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 331.0) internal successors, (1986), 6 states have internal predecessors, (1986), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:32:32,534 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 331.0) internal successors, (1986), 6 states have internal predecessors, (1986), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:32:32,534 INFO L175 Difference]: Start difference. First operand has 42 places, 30 transitions, 109 flow. Second operand 5 states and 695 transitions. [2022-11-25 17:32:32,534 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 71 transitions, 407 flow [2022-11-25 17:32:32,536 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 71 transitions, 403 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-25 17:32:32,538 INFO L231 Difference]: Finished difference. Result has 47 places, 32 transitions, 128 flow [2022-11-25 17:32:32,538 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=331, PETRI_DIFFERENCE_MINUEND_FLOW=106, 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=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=128, PETRI_PLACES=47, PETRI_TRANSITIONS=32} [2022-11-25 17:32:32,541 INFO L288 CegarLoopForPetriNet]: 65 programPoint places, -18 predicate places. [2022-11-25 17:32:32,541 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 32 transitions, 128 flow [2022-11-25 17:32:32,542 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 131.8) internal successors, (659), 5 states have internal predecessors, (659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:32:32,542 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:32:32,542 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] [2022-11-25 17:32:32,570 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_186bbf52-c27b-468d-a54e-5164df668682/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-11-25 17:32:32,754 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_186bbf52-c27b-468d-a54e-5164df668682/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 17:32:32,754 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2022-11-25 17:32:32,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:32:32,755 INFO L85 PathProgramCache]: Analyzing trace with hash 1895507400, now seen corresponding path program 2 times [2022-11-25 17:32:32,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 17:32:32,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1711058985] [2022-11-25 17:32:32,756 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-25 17:32:32,756 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 17:32:32,756 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_186bbf52-c27b-468d-a54e-5164df668682/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 17:32:32,761 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_186bbf52-c27b-468d-a54e-5164df668682/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 17:32:32,765 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_186bbf52-c27b-468d-a54e-5164df668682/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-11-25 17:32:32,955 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-25 17:32:32,956 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 17:32:32,960 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-25 17:32:32,962 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:32:33,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:32:33,062 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 17:32:33,063 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 17:32:33,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1711058985] [2022-11-25 17:32:33,063 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1711058985] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:32:33,063 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:32:33,063 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 17:32:33,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160303518] [2022-11-25 17:32:33,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:32:33,064 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 17:32:33,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 17:32:33,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 17:32:33,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:32:33,081 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 331 [2022-11-25 17:32:33,082 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 32 transitions, 128 flow. Second operand has 5 states, 5 states have (on average 131.6) internal successors, (658), 5 states have internal predecessors, (658), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:32:33,082 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:32:33,083 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 331 [2022-11-25 17:32:33,083 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:32:33,384 INFO L130 PetriNetUnfolder]: 121/280 cut-off events. [2022-11-25 17:32:33,384 INFO L131 PetriNetUnfolder]: For 307/307 co-relation queries the response was YES. [2022-11-25 17:32:33,385 INFO L83 FinitePrefix]: Finished finitePrefix Result has 917 conditions, 280 events. 121/280 cut-off events. For 307/307 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1200 event pairs, 16 based on Foata normal form. 1/281 useless extension candidates. Maximal degree in co-relation 907. Up to 172 conditions per place. [2022-11-25 17:32:33,386 INFO L137 encePairwiseOnDemand]: 326/331 looper letters, 64 selfloop transitions, 6 changer transitions 0/73 dead transitions. [2022-11-25 17:32:33,387 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 73 transitions, 434 flow [2022-11-25 17:32:33,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 17:32:33,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-25 17:32:33,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 823 transitions. [2022-11-25 17:32:33,390 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.41440080563947634 [2022-11-25 17:32:33,390 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 823 transitions. [2022-11-25 17:32:33,390 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 823 transitions. [2022-11-25 17:32:33,391 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:32:33,391 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 823 transitions. [2022-11-25 17:32:33,393 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 137.16666666666666) internal successors, (823), 6 states have internal predecessors, (823), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:32:33,396 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 331.0) internal successors, (2317), 7 states have internal predecessors, (2317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:32:33,397 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 331.0) internal successors, (2317), 7 states have internal predecessors, (2317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:32:33,397 INFO L175 Difference]: Start difference. First operand has 47 places, 32 transitions, 128 flow. Second operand 6 states and 823 transitions. [2022-11-25 17:32:33,397 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 73 transitions, 434 flow [2022-11-25 17:32:33,399 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 73 transitions, 431 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-25 17:32:33,400 INFO L231 Difference]: Finished difference. Result has 53 places, 35 transitions, 157 flow [2022-11-25 17:32:33,401 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=331, PETRI_DIFFERENCE_MINUEND_FLOW=127, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=157, PETRI_PLACES=53, PETRI_TRANSITIONS=35} [2022-11-25 17:32:33,401 INFO L288 CegarLoopForPetriNet]: 65 programPoint places, -12 predicate places. [2022-11-25 17:32:33,402 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 35 transitions, 157 flow [2022-11-25 17:32:33,402 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 131.6) internal successors, (658), 5 states have internal predecessors, (658), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:32:33,402 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:32:33,402 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] [2022-11-25 17:32:33,415 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_186bbf52-c27b-468d-a54e-5164df668682/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-11-25 17:32:33,614 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_186bbf52-c27b-468d-a54e-5164df668682/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 17:32:33,615 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2022-11-25 17:32:33,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:32:33,615 INFO L85 PathProgramCache]: Analyzing trace with hash 723210238, now seen corresponding path program 3 times [2022-11-25 17:32:33,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 17:32:33,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [573907351] [2022-11-25 17:32:33,616 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-25 17:32:33,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-11-25 17:32:33,616 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_186bbf52-c27b-468d-a54e-5164df668682/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 17:32:33,617 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_186bbf52-c27b-468d-a54e-5164df668682/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 17:32:33,618 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_186bbf52-c27b-468d-a54e-5164df668682/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-11-25 17:32:33,798 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-11-25 17:32:33,798 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 17:32:33,805 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-25 17:32:33,807 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:32:33,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:32:33,903 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 17:32:33,903 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 17:32:33,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [573907351] [2022-11-25 17:32:33,908 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [573907351] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:32:33,908 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:32:33,909 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 17:32:33,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798255355] [2022-11-25 17:32:33,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:32:33,910 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 17:32:33,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 17:32:33,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 17:32:33,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:32:33,926 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 331 [2022-11-25 17:32:33,927 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 35 transitions, 157 flow. Second operand has 5 states, 5 states have (on average 131.6) internal successors, (658), 5 states have internal predecessors, (658), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:32:33,927 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:32:33,928 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 331 [2022-11-25 17:32:33,928 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:32:34,223 INFO L130 PetriNetUnfolder]: 144/359 cut-off events. [2022-11-25 17:32:34,224 INFO L131 PetriNetUnfolder]: For 464/464 co-relation queries the response was YES. [2022-11-25 17:32:34,225 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1231 conditions, 359 events. 144/359 cut-off events. For 464/464 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1770 event pairs, 3 based on Foata normal form. 1/360 useless extension candidates. Maximal degree in co-relation 1219. Up to 168 conditions per place. [2022-11-25 17:32:34,227 INFO L137 encePairwiseOnDemand]: 326/331 looper letters, 67 selfloop transitions, 8 changer transitions 0/78 dead transitions. [2022-11-25 17:32:34,227 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 78 transitions, 482 flow [2022-11-25 17:32:34,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 17:32:34,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-25 17:32:34,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 827 transitions. [2022-11-25 17:32:34,230 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4164149043303122 [2022-11-25 17:32:34,230 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 827 transitions. [2022-11-25 17:32:34,230 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 827 transitions. [2022-11-25 17:32:34,231 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:32:34,231 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 827 transitions. [2022-11-25 17:32:34,233 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 137.83333333333334) internal successors, (827), 6 states have internal predecessors, (827), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:32:34,236 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 331.0) internal successors, (2317), 7 states have internal predecessors, (2317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:32:34,237 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 331.0) internal successors, (2317), 7 states have internal predecessors, (2317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:32:34,237 INFO L175 Difference]: Start difference. First operand has 53 places, 35 transitions, 157 flow. Second operand 6 states and 827 transitions. [2022-11-25 17:32:34,237 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 78 transitions, 482 flow [2022-11-25 17:32:34,240 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 78 transitions, 472 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-11-25 17:32:34,241 INFO L231 Difference]: Finished difference. Result has 58 places, 38 transitions, 191 flow [2022-11-25 17:32:34,241 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=331, PETRI_DIFFERENCE_MINUEND_FLOW=148, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=191, PETRI_PLACES=58, PETRI_TRANSITIONS=38} [2022-11-25 17:32:34,242 INFO L288 CegarLoopForPetriNet]: 65 programPoint places, -7 predicate places. [2022-11-25 17:32:34,242 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 38 transitions, 191 flow [2022-11-25 17:32:34,242 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 131.6) internal successors, (658), 5 states have internal predecessors, (658), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:32:34,243 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:32:34,243 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] [2022-11-25 17:32:34,255 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_186bbf52-c27b-468d-a54e-5164df668682/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-11-25 17:32:34,455 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_186bbf52-c27b-468d-a54e-5164df668682/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 17:32:34,455 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2022-11-25 17:32:34,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:32:34,455 INFO L85 PathProgramCache]: Analyzing trace with hash -1710504076, now seen corresponding path program 4 times [2022-11-25 17:32:34,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 17:32:34,456 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2119908652] [2022-11-25 17:32:34,456 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-25 17:32:34,456 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 17:32:34,456 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_186bbf52-c27b-468d-a54e-5164df668682/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 17:32:34,457 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_186bbf52-c27b-468d-a54e-5164df668682/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 17:32:34,458 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_186bbf52-c27b-468d-a54e-5164df668682/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-11-25 17:32:34,717 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-25 17:32:34,717 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-11-25 17:32:34,717 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 17:32:34,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 17:32:34,906 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-11-25 17:32:34,906 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-11-25 17:32:34,907 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK (52 of 53 remaining) [2022-11-25 17:32:34,909 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 53 remaining) [2022-11-25 17:32:34,909 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 53 remaining) [2022-11-25 17:32:34,910 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 53 remaining) [2022-11-25 17:32:34,910 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 53 remaining) [2022-11-25 17:32:34,910 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 53 remaining) [2022-11-25 17:32:34,910 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 53 remaining) [2022-11-25 17:32:34,910 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 53 remaining) [2022-11-25 17:32:34,910 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 53 remaining) [2022-11-25 17:32:34,911 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 53 remaining) [2022-11-25 17:32:34,911 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 53 remaining) [2022-11-25 17:32:34,911 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 53 remaining) [2022-11-25 17:32:34,911 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 53 remaining) [2022-11-25 17:32:34,911 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 53 remaining) [2022-11-25 17:32:34,911 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 53 remaining) [2022-11-25 17:32:34,912 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 53 remaining) [2022-11-25 17:32:34,912 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 53 remaining) [2022-11-25 17:32:34,912 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 53 remaining) [2022-11-25 17:32:34,912 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 53 remaining) [2022-11-25 17:32:34,912 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 53 remaining) [2022-11-25 17:32:34,912 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 53 remaining) [2022-11-25 17:32:34,913 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 53 remaining) [2022-11-25 17:32:34,913 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 53 remaining) [2022-11-25 17:32:34,913 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 53 remaining) [2022-11-25 17:32:34,913 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 53 remaining) [2022-11-25 17:32:34,913 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 53 remaining) [2022-11-25 17:32:34,913 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 53 remaining) [2022-11-25 17:32:34,914 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 53 remaining) [2022-11-25 17:32:34,914 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 53 remaining) [2022-11-25 17:32:34,914 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 53 remaining) [2022-11-25 17:32:34,914 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 53 remaining) [2022-11-25 17:32:34,914 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK (21 of 53 remaining) [2022-11-25 17:32:34,914 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (20 of 53 remaining) [2022-11-25 17:32:34,915 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (19 of 53 remaining) [2022-11-25 17:32:34,915 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (18 of 53 remaining) [2022-11-25 17:32:34,915 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 53 remaining) [2022-11-25 17:32:34,915 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 53 remaining) [2022-11-25 17:32:34,915 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 53 remaining) [2022-11-25 17:32:34,916 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 53 remaining) [2022-11-25 17:32:34,916 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 53 remaining) [2022-11-25 17:32:34,916 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 53 remaining) [2022-11-25 17:32:34,916 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 53 remaining) [2022-11-25 17:32:34,916 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 53 remaining) [2022-11-25 17:32:34,916 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 53 remaining) [2022-11-25 17:32:34,917 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 53 remaining) [2022-11-25 17:32:34,917 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 53 remaining) [2022-11-25 17:32:34,917 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 53 remaining) [2022-11-25 17:32:34,917 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 53 remaining) [2022-11-25 17:32:34,917 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 53 remaining) [2022-11-25 17:32:34,918 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 53 remaining) [2022-11-25 17:32:34,918 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 53 remaining) [2022-11-25 17:32:34,918 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 53 remaining) [2022-11-25 17:32:34,918 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 53 remaining) [2022-11-25 17:32:34,936 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_186bbf52-c27b-468d-a54e-5164df668682/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2022-11-25 17:32:35,131 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_186bbf52-c27b-468d-a54e-5164df668682/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 17:32:35,131 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:32:35,136 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-25 17:32:35,137 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-25 17:32:35,217 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 05:32:35 BasicIcfg [2022-11-25 17:32:35,217 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-25 17:32:35,218 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-25 17:32:35,218 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-25 17:32:35,218 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-25 17:32:35,219 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:31:59" (3/4) ... [2022-11-25 17:32:35,222 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-25 17:32:35,222 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-25 17:32:35,222 INFO L158 Benchmark]: Toolchain (without parser) took 38463.77ms. Allocated memory was 75.5MB in the beginning and 243.3MB in the end (delta: 167.8MB). Free memory was 51.1MB in the beginning and 96.9MB in the end (delta: -45.8MB). Peak memory consumption was 124.1MB. Max. memory is 16.1GB. [2022-11-25 17:32:35,223 INFO L158 Benchmark]: CDTParser took 0.58ms. Allocated memory is still 75.5MB. Free memory is still 52.9MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 17:32:35,223 INFO L158 Benchmark]: CACSL2BoogieTranslator took 844.99ms. Allocated memory was 75.5MB in the beginning and 94.4MB in the end (delta: 18.9MB). Free memory was 51.0MB in the beginning and 60.2MB in the end (delta: -9.3MB). Peak memory consumption was 16.3MB. Max. memory is 16.1GB. [2022-11-25 17:32:35,223 INFO L158 Benchmark]: Boogie Procedure Inliner took 88.92ms. Allocated memory is still 94.4MB. Free memory was 60.2MB in the beginning and 58.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 17:32:35,224 INFO L158 Benchmark]: Boogie Preprocessor took 39.13ms. Allocated memory is still 94.4MB. Free memory was 57.7MB in the beginning and 55.6MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 17:32:35,224 INFO L158 Benchmark]: RCFGBuilder took 1397.73ms. Allocated memory is still 94.4MB. Free memory was 55.6MB in the beginning and 51.6MB in the end (delta: 4.0MB). Peak memory consumption was 25.1MB. Max. memory is 16.1GB. [2022-11-25 17:32:35,224 INFO L158 Benchmark]: TraceAbstraction took 36078.64ms. Allocated memory was 94.4MB in the beginning and 243.3MB in the end (delta: 148.9MB). Free memory was 51.0MB in the beginning and 97.9MB in the end (delta: -46.9MB). Peak memory consumption was 103.7MB. Max. memory is 16.1GB. [2022-11-25 17:32:35,225 INFO L158 Benchmark]: Witness Printer took 3.91ms. Allocated memory is still 243.3MB. Free memory was 97.9MB in the beginning and 96.9MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 17:32:35,227 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.58ms. Allocated memory is still 75.5MB. Free memory is still 52.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 844.99ms. Allocated memory was 75.5MB in the beginning and 94.4MB in the end (delta: 18.9MB). Free memory was 51.0MB in the beginning and 60.2MB in the end (delta: -9.3MB). Peak memory consumption was 16.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 88.92ms. Allocated memory is still 94.4MB. Free memory was 60.2MB in the beginning and 58.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 39.13ms. Allocated memory is still 94.4MB. Free memory was 57.7MB in the beginning and 55.6MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1397.73ms. Allocated memory is still 94.4MB. Free memory was 55.6MB in the beginning and 51.6MB in the end (delta: 4.0MB). Peak memory consumption was 25.1MB. Max. memory is 16.1GB. * TraceAbstraction took 36078.64ms. Allocated memory was 94.4MB in the beginning and 243.3MB in the end (delta: 148.9MB). Free memory was 51.0MB in the beginning and 97.9MB in the end (delta: -46.9MB). Peak memory consumption was 103.7MB. Max. memory is 16.1GB. * Witness Printer took 3.91ms. Allocated memory is still 243.3MB. Free memory was 97.9MB in the beginning and 96.9MB 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: 25.0s, 170 PlacesBefore, 65 PlacesAfterwards, 162 TransitionsBefore, 56 TransitionsAfterwards, 4540 CoEnabledTransitionPairs, 8 FixpointIterations, 72 TrivialSequentialCompositions, 87 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 1 ChoiceCompositions, 166 TotalNumberOfCompositions, 14899 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 7190, independent: 6865, independent conditional: 0, independent unconditional: 6865, dependent: 316, dependent conditional: 0, dependent unconditional: 316, unknown: 9, unknown conditional: 0, unknown unconditional: 9] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2990, independent: 2917, independent conditional: 0, independent unconditional: 2917, dependent: 72, dependent conditional: 0, dependent unconditional: 72, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2990, independent: 2721, independent conditional: 0, independent unconditional: 2721, dependent: 269, dependent conditional: 0, dependent unconditional: 269, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 269, independent: 196, independent conditional: 0, independent unconditional: 196, dependent: 72, dependent conditional: 0, dependent unconditional: 72, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2019, independent: 898, independent conditional: 0, independent unconditional: 898, dependent: 1088, dependent conditional: 0, dependent unconditional: 1088, unknown: 33, unknown conditional: 0, unknown unconditional: 33] ], Cache Queries: [ total: 7190, independent: 3948, independent conditional: 0, independent unconditional: 3948, dependent: 244, dependent conditional: 0, dependent unconditional: 244, unknown: 2998, unknown conditional: 0, unknown unconditional: 2998] , Statistics on independence cache: Total cache size (in pairs): 453, Positive cache size: 423, Positive conditional cache size: 0, Positive unconditional cache size: 423, Negative cache size: 30, Negative conditional cache size: 0, Negative unconditional cache size: 30, Unknown cache size: 1, Unknown conditional cache size: 0, Unknown unconditional cache size: 1 - UnprovableResult [Line: 19]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 19. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L713] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L714] 0 int __unbuffered_p0_EAX$mem_tmp; [L715] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd3; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L720] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L721] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L722] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd3; [L723] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L724] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L725] 0 int __unbuffered_p0_EAX$w_buff0; [L726] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L727] 0 int __unbuffered_p0_EAX$w_buff1; [L728] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L730] 0 int __unbuffered_p0_EBX = 0; [L732] 0 int __unbuffered_p2_EAX = 0; [L733] 0 _Bool main$tmp_guard0; [L734] 0 _Bool main$tmp_guard1; [L736] 0 int x = 0; [L738] 0 int y = 0; [L739] 0 _Bool y$flush_delayed; [L740] 0 int y$mem_tmp; [L741] 0 _Bool y$r_buff0_thd0; [L742] 0 _Bool y$r_buff0_thd1; [L743] 0 _Bool y$r_buff0_thd2; [L744] 0 _Bool y$r_buff0_thd3; [L745] 0 _Bool y$r_buff1_thd0; [L746] 0 _Bool y$r_buff1_thd1; [L747] 0 _Bool y$r_buff1_thd2; [L748] 0 _Bool y$r_buff1_thd3; [L749] 0 _Bool y$read_delayed; [L750] 0 int *y$read_delayed_var; [L751] 0 int y$w_buff0; [L752] 0 _Bool y$w_buff0_used; [L753] 0 int y$w_buff1; [L754] 0 _Bool y$w_buff1_used; [L755] 0 _Bool weak$$choice0; [L756] 0 _Bool weak$$choice1; [L757] 0 _Bool weak$$choice2; [L831] 0 pthread_t t2213; [L832] FCALL, FORK 0 pthread_create(&t2213, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2213, ((void *)0), P0, ((void *)0))=-1, t2213={15:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L833] 0 pthread_t t2214; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2213={15:0}, t2214={5:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L834] FCALL, FORK 0 pthread_create(&t2214, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2214, ((void *)0), P1, ((void *)0))=0, t2213={15:0}, t2214={5:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L835] 0 pthread_t t2215; [L836] FCALL, FORK 0 pthread_create(&t2215, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2215, ((void *)0), P2, ((void *)0))=1, t2213={15:0}, t2214={5:0}, t2215={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L761] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L762] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L763] 1 y$flush_delayed = weak$$choice2 [L764] EXPR 1 \read(y) [L764] 1 y$mem_tmp = y [L765] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L765] EXPR 1 \read(y) [L765] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L765] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L766] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L767] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L768] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L769] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L770] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L771] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L772] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L773] 1 __unbuffered_p0_EAX$read_delayed_var = &y [L774] EXPR 1 \read(y) [L774] 1 __unbuffered_p0_EAX = y [L775] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L775] EXPR 1 \read(y) [L775] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L775] 1 y = y$flush_delayed ? y$mem_tmp : y [L776] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x=0, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L779] 1 __unbuffered_p0_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x=0, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L784] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L786] 1 return 0; [L791] 2 x = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L796] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L798] 2 return 0; [L803] 3 __unbuffered_p2_EAX = x VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L806] 3 y = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L809] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L809] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L809] EXPR 3 \read(y) [L809] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L809] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L809] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L810] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L811] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L812] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L813] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L816] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L818] 3 return 0; [L838] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L840] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L840] RET 0 assume_abort_if_not(main$tmp_guard0) [L842] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L842] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L842] EXPR 0 \read(y) [L842] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L842] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L842] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L843] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L844] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L845] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L846] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2213={15:0}, t2214={5:0}, t2215={7:0}, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L849] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L850] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L850] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L850] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L850] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L850] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L850] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L851] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 1) [L853] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=128, weak$$choice2=0, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 829]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 834]: 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: 832]: 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: 836]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 206 locations, 53 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: 35.8s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 5.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 25.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 450 SdHoareTripleChecker+Valid, 2.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 310 mSDsluCounter, 82 SdHoareTripleChecker+Invalid, 1.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 50 mSDsCounter, 49 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1044 IncrementalHoareTripleChecker+Invalid, 1093 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 49 mSolverCounterUnsat, 32 mSDtfsCounter, 1044 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 119 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=191occurred in iteration=10, InterpolantAutomatonStates: 41, 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.7s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 143 NumberOfCodeBlocks, 143 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 113 ConstructedInterpolants, 0 QuantifiedInterpolants, 599 SizeOfPredicates, 19 NumberOfNonLiveVariables, 1367 ConjunctsInSsa, 57 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-11-25 17:32:35,265 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_186bbf52-c27b-468d-a54e-5164df668682/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample